Abelian groups from random hypergraphs
Abstract
For a k-uniform hypergraph H on vertex set \1, ..., n\ we associate a particular signed incidence matrix M(H) over the integers. For H Hk(n, p) an Erdos--R\'enyi random k-uniform hypergraph, coker(M(H)) is then a model for random abelian groups. Motivated by conjectures from the study of random simplicial complexes we show that for p = ω(1/nk - 1), coker(M(H)) is torsion-free.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.