Subquadratic minimal generation conjecture for random hypertree fundamental groups

From papers

Let TnT_n be the random hypertree in the paper, let π1(Tn)\pi_1(T_n) be its fundamental group, and let mg(π1(Tn))\operatorname{mg}(\pi_1(T_n)) denote the minimal number of generators of that group.

Subquadratic generation conjecture. The normalized minimal number of generators converges to zero in probability:

mg(π1(Tn))n20\frac{\operatorname{mg}(\pi_1(T_n))}{n^2}\longrightarrow 0

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.

Progress summary

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

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).

Solutions 0

No solutions have been posted yet.