Low-dimensional framework conjecture for the partition graph
Low-dimensional framework conjecture for the partition graph
Let denote the boundary framework, let be the vertices of local simplex dimension , and let and be the two antenna vertices. Low-dimensional framework conjecture. For every ,
Equivalently, every non-antennal framework vertex has local simplex dimension exactly . Computation establishes this confinement for and motivates the expectation that higher simplex layers migrate into the interior rather than the boundary framework; the all- assertion remains open.
Progress summary
Computations up to size 30 support the conjecture, but no proof for all sizes has been reported.
The conjecture asserts that, for every , framework vertices lie only in the first two local simplex layers, with exactly the two antenna vertices in . It is formulated as Conjecture 5.5 in a 2026 arXiv paper on simplex stratification of the partition graph.
August 2026 computational evidence
The paper reports exhaustive computation for , verifying and . It explicitly states that computation does not establish the all- claim, which remains an open conjecture; no proof, counterexample, or verification was found in the retrieved sources.
Current status (as of August 2026): The conjecture is verified computationally through , while the assertion for all remains open.
Sources
Sources & referencesView supporting material
Primary source
Fedor B. Lyudogovskiy, “Simplex Stratification and Phase Boundaries in the Partition Graph”, arXiv:2603.23228 (2026).
Solutions 1
Sign in to submit a solution.
Proof of the complete low-dimensional framework conjecture
The previously established local corner formulas in arXiv:2603.18696, Corollary 3.4, Proposition 3.7, and Theorem 7.1, are used as known input.
Write
For removable corner and addable corner , the known corner-incidence matrix is
Hence the star capacities are
and every top capacity is at most . Consequently
The source's earlier definitions in arXiv:2603.21221, Definitions 2.4, 2.6, and 2.8, identify the framework as
where
Assume . The endpoints and have local dimension one.
Every other hook in has two distinct block sizes; its upper block has multiplicity one and its lower block has gap one. Therefore no block simultaneously has multiplicity and gap at least two. Since the only two-block staircase has size three, (1) shows that every non-antennal hook has dimension exactly two.
For a two-row partition with , both block multiplicities equal one. Again (1) gives local dimension two. If , there is one block with multiplicity two and gap , so (1) also gives dimension two.
Finally, conjugation is an automorphism of the partition graph and therefore preserves local simplex dimension. Every vertex of consequently has dimension two as well.
Thus
Equivalently, every non-antennal framework vertex has local simplex dimension exactly two, proving the full conjecture.