The full text of this article is unavailable through your IP address: 3.145.43.200
Contents Online
Journal of Combinatorics
Volume 14 (2023)
Number 4
Seven open problems in applied combinatorics
Pages: 559 – 601
DOI: https://dx.doi.org/10.4310/JOC.2023.v14.n4.a8
Authors
Abstract
We present and discuss seven different open problems in applied combinatorics. The application areas relevant to this compilation include quantum computing, algorithmic differentiation, topological data analysis, iterative methods, hypergraph cut algorithms, and power systems.
Keywords
open problems, applied combinatorics, quantum computing, quantum circuit, hypergraphs, algorithmic differentiation, directed acyclic graphs, zero-forcing, topological data analysis, Dowker complex, asynchronous updates, iterative methods
2010 Mathematics Subject Classification
Primary 05C90. Secondary 05C65, 65D25, 65F10, 65Y04, 81P68.
Sinan G. Aksoy, Anthony V. Petyuk, and Stephen J. Young were supported by the Resilience through Data-driven Intelligently- Designed Control (RD2C) Initiative, under the Laboratory Directed Research and Development (LDRD) Program at Pacific Northwest National Laboratory (PNNL). PNNL is a multi-program national laboratory operated for the U.S. Department of Energy (DOE) by Battelle Memorial Institute under Contract No. DE-AC05-76RL01830. Sandip Roy conducted this research during an appointment at the U.S. National Science Foundation, supported by an Intergovermental Personnel Act agreement with Washington State University.
Received 9 March 2023
Published 14 April 2023