English

Abelian groups from random hypergraphs

Combinatorics 2021-11-23 v1 Probability

Abstract

For a kk-uniform hypergraph H\mathcal{H} on vertex set {1,...,n}\{1, ..., n\} we associate a particular signed incidence matrix M(H)M(\mathcal{H}) over the integers. For HHk(n,p)\mathcal{H} \sim \mathcal{H}_k(n, p) an Erd\H{o}s--R\'{e}nyi random kk-uniform hypergraph, coker(M(H))\text{coker}(M(\mathcal{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/nk1)p = \omega(1/n^{k - 1}), coker(M(H))\text{coker}(M(\mathcal{H})) is torsion-free.

Keywords

Cite

@article{arxiv.2111.10641,
  title  = {Abelian groups from random hypergraphs},
  author = {Andrew Newman},
  journal= {arXiv preprint arXiv:2111.10641},
  year   = {2021}
}

Comments

10 pages