Subquadratic minimal generation conjecture for random hypertree fundamental groups
Let be the random hypertree in the paper, let be its fundamental group, and let denote the minimal number of generators of that group.
Subquadratic generation conjecture. The normalized minimal number of generators converges to zero in probability:
in probability.
The conjecture asks for subquadratic growth of the minimal number of generators of the fundamental group of a random hypertree; the source gives no resolution.
References
Primary source
András Mészáros, “Using dense graph limit theory to count cocycles of random simplicial complexes”, arXiv:2509.06559 (2025).
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.