2000 character limit reached
The homology torsion growth of determinantal hypertrees (2506.14694v1)
Published 17 Jun 2025 in math.CO, math.AT, and math.PR
Abstract: Fix a dimension $d\ge 2$, and let $T_n$ be a random $d$-dimensional determinantal hypertree on $n$ vertices. We prove that [\frac{\log|H_{d-1}(T_n,\mathbb{Z})|}{{{n\choose {d}}}}] converges in probability to a constant $c_d$, which satisfies [\frac{1}2 \log\left(\frac{d+1}e\right)\le c_d\le \frac{1}2 \log\left(d+1\right) .]
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.