The homology torsion growth of determinantal hypertrees
András Mészáros
所有作者
András Mészáros
文献摘要
Fix a dimension d≥2, and let Tn be a random d-dimensional determinantal hypertree on n vertices. We prove that (dn)log∣Hd−1(Tn,Z)∣ converges in probability to a constant cd, which satisfies 21log(ed+1)≤cd≤21log(d+1).