Tightness conjecture for the torsion of random hypertrees

Let pp be a prime, and let TnT_n be the random hypertree in the paper. Write Γn,p\Gamma_{n,p} for the pp^\infty-torsion subgroup of H1(Tn,Z)H_1(T_n,\mathbb{Z}). A family of random variables is tight if, for every ε>0\varepsilon>0, there is a KK such that the probability of exceeding KK is less than ε\varepsilon for all sufficiently large nn.

Tightness conjecture. For every prime pp, Γn,p\Gamma_{n,p} is tight:

P(Γn,p>K)<ε\mathbb{P}(|\Gamma_{n,p}|>K)<\varepsilon

for every ε>0\varepsilon>0 and some KK, for all sufficiently large nn. This would also imply that dimH1(Tn,Fp)\dim H_1(T_n,\mathbb{F}_p) 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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.