Seven open problems in applied combinatorics

Anthony V. Petyuk; Bill Kay; Carlos Ortiz Marrero; Ignacio Segovia-Dominguez; Jos\'e Fr\'ias; Nate Veldt; Ryan Bennink; Sandip Roy; Sinan G. Aksoy; Stephen J. Young

arxiv: 2303.11464 · v1 · pith:UO6VCTSJ · submitted 2023-03-20 · math.CO · cs.DM· cs.LG· cs.NA· math.NA· quant-ph

Seven open problems in applied combinatorics

Sinan G. Aksoy , Ryan Bennink , Yuzhou Chen , Jos\'e Fr\'ias , Yulia R. Gel , Bill Kay , Uwe Naumann , Carlos Ortiz Marrero

show 5 more authors

Anthony V. Petyuk Sandip Roy Ignacio Segovia-Dominguez Nate Veldt Stephen J. Young

This is my paper

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 reserved pith:UO6VCTSJ record.json open to challenge →

classification math.CO cs.DMcs.LGcs.NAmath.NAquant-ph

keywords appliedcombinatoricsopenproblemssevenalgorithmicalgorithmsanalysis

0 comments

read the original 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.

This paper has not been read by Pith yet.

Seven open problems in applied combinatorics

discussion (0)