Tightness conjecture for the torsion of random hypertrees
Tightness conjecture for the torsion of random hypertrees
Let be a prime, and let be the random hypertree in the paper. Write for the -torsion subgroup of . A family of random variables is tight if, for every , there is a such that the probability of exceeding is less than for all sufficiently large .
Tightness conjecture. For every prime , is tight:
for every and some , for all sufficiently large . This would also imply that is tight.
The conjecture concerns bounded-order behavior of prime-power torsion in the first homology of random hypertrees; the source presents it as open.
Sources & referencesView supporting material
Primary source
András Mészáros, “Using dense graph limit theory to count cocycles of random simplicial complexes”, arXiv:2509.06559 (2025).
Additional references
4 papers in this index state this conjecture (2016–2025). The statement above is taken from the most recent of them; the others are arXiv:2405.00826, arXiv:2404.02308, arXiv:1609.02490.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.