1 citations · 1 across the 4 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2026
Persistence diagrams of random triangular matrices over finite fields
András Mészáros
Let us consider a random infinite lower triangular matrix, where the entries on and below the diagonal are i.i.d. uniform random elements of a fixed finite field. We investigate th…
math.CO2025
Using dense graph limit theory to count cocycles of random simplicial complexes
András Mészáros
We develop a limit theory for -cochains of complete graphs with coefficients from a finite abelian group. We prove an analogue of the large deviation principle of Chatterjee and…
math.CO2025
The homology torsion growth of determinantal hypertrees
András Mészáros
Fix a dimension , and let be a random -dimensional determinantal hypertree on vertices. We prove that \[\frac{\log|H_{d-1}(T_n,\mathbb{Z})|}{n\choose {d}}\] co…