12 problems
Let be an irreducible hypertree, and identify it with its graph , whose edges are the pairs occurring in the triples of . Irreducible hypertree copiousness conjecture. Ev…
Let be a graph. A graph is copious when it satisfies the copiousness condition defined in the paper, and topologically copious when the associated map from the moduli space…
Let be a copious graph with vertices. For , let be the number of partitions of the vertex set into independent subsets of . ML-degree…
Let , and call a graph on a minimal kinematics graph when its edge set is inclusion-maximal among the graphs realizing minimal kinematics. Minimal kinema…
Let be a graph, and let conditions 1, 2, 3, and 4 be the four conditions in Theorem 1. The graph is matroidally copious when it satisfies the relevant matroidal condition d…
Let be the relevant linear space arrangement, let be the linear space determined by the kinematic data , and let be a type (ii) flat, with associat…
Component-count conjecture. The lifted scattering correspondence decomposes into five irreducible components, with exactly one component whose map onto…
Twistor-string map diffeomorphism conjecture. The twistor-string map provides a diffeomorphism from to the interior of the momentum amplituhedron. If true, this would es…
Smallest-number-of-solutions conjecture. The number is the smallest possible number of saddle points among all stringy canonical forms reproducing the ABHY associahedron.
Minimal saddle-point conjecture. Among all stringy canonical forms for the ABHY associahedron, has the smallest number of saddle points, namely
Minimal saddle-point conjecture. The same pushforward phenomenon holds for generalized associahedra.
Let and let or , where . Consider the soft limit , and suppose that singular solutions are those for which some minors involving…