Recurrence conjecture for Eulerian magnitude homology of path trees
Recurrence conjecture for Eulerian magnitude homology of path trees
For , let be the path tree on the vertices , and let denote its Eulerian magnitude homology groups.
Path-tree recurrence conjecture. For and all ,
This recurrence was observed while computing Eulerian magnitude homology for star trees. Its status is open, and it gives a proposed reduction of the ranks for arbitrary path trees to those for .
Progress summary
The proposed rank formula was recorded in 2025, but no verified proof or counterexample has been found.
The recurrence appears as Conjecture 8.2 in a 2025 paper on Eulerian magnitude homology of path trees. That source presents it as open, and no corroborated proof, disproof, or claimed resolution was found.
Current status (as of August 2026): The recurrence remains an open conjecture, with no publicly verified proof or counterexample recorded in the retrieved sources.
Sources
Sources & referencesView supporting material
Primary source
Patrick Martin and Radmila Sazdanovic, “Torsion in Magnitude homology theories”, arXiv:2503.11976 (2025).
Solutions 1
Sign in to submit a solution.
Complete proof, with an integral decomposition, torsion-freeness, and explicit initial ranks.
Martin–Sazdanović, arXiv:2503.11976, Conjecture 8.2, predicts
where has vertex set . We prove the stronger integral statement
for every , , and , and prove all these groups are free abelian.
An Eulerian magnitude -chain is an injective word of length
Its differential deletes an interior letter exactly when
equivalently, when lies strictly between its neighbors.
Define the turning frame to consist of the endpoints and all strict local extrema, in their original order. Every allowable deletion preserves both and its interval hull
Thus the entire Eulerian chain complex splits as a direct sum over turning frames.
Fix a frame
For each nonframe vertex
define the eligible-run set
Every , since the successive frame segments cover the entire interval hull.
A word with frame independently either omits each , or inserts it into exactly one of its eligible runs. Once the choices are made, monotonicity uniquely orders the letters in each run. Hence the frame subcomplex is the shifted augmented simplicial chain complex of
the join of discrete sets of cardinalities .
For completeness, order inserted vertices first by run, then by the monotone order within each run. If is the inserted-vertex set, orient its simplex with the additional factor
A vertex in run occurring after earlier inserted vertices has magnitude-boundary sign , while its simplicial-boundary sign is . Removing it changes by , so this orientation intertwines the differentials integrally.
Each discrete set has augmented complex
The integral Künneth theorem for joins therefore gives
Since , the corresponding frame homology is
If some , the frame complex is acyclic. If , the empty product is one with the usual augmented degree- convention.
Thus a frame contributes to homological degree if and only if its interval hull has span . There are exactly
such hulls in , and translation identifies each corresponding frame subcomplex with the full-hull subcomplex of . Summing these identical contributions proves the claimed integral decomposition and the source’s rank recurrence simultaneously for every .
The argument also gives an explicit initial-rank formula:
For , the unique singleton frame contributes at length zero, and , exactly as required.