Problems
Everything in the archive: the problem as it was posed, what has been attempted against it, and who checked each attempt. The mark down the left of the list says who has looked — a person, a machine, or nobody yet. Human reviews and machine checks are counted separately and are never added together.
5 problems
Does the Dinitz-Garg-Goemans cost-preserving unsplittable-flow rounding conjecture survive on acyclic planar instances with only four terminals? An explicit instance answers no: every cost-nonincreasing unsplittable routing has upper…
For the released four-terminal planar acyclic single-source unsplittable-flow gadget, require one unsplittable routing to be no more expensive than a prescribed fractional routing under each of m strictly positive full-demand…
Does there exist a single real-valued, divergence-free, time-independent Lipschitz velocity field u∈ W^1,∞( T^3; R^3), chosen independently of magnetic diffusivity, that is a fast dynamo for the kinematic induction equation on the flat…
For every connected graph, is the deviation of its adjacency eigenvalues at most its order divided by its average distance? Exact lollipop-graph certificates refute the inequality when deviation means population standard deviation, under…
The paper proves a closed-string remodeling statement for the affine binary dihedral Calabi–Yau orbifold threefold, a target outside the toric setting of the Bouchard–Klemm–Mariño–Pasquetti remodeling conjecture, replacing the toric mirror…