Homological connectivity of random k-dimensional complexes
R. Meshulam, N. Wallach
Abstract
Let Deltan-1 denote the (n-1)-dimensional simplex. Let Y be a random k-dimensional subcomplex of Deltan-1 obtained by starting with the full (k-1)-dimensional skeleton of Deltan-1 and then adding each k-simplex independently with probability p. Let Hk-1(Y;R) denote the (k-1)-dimensional reduced homology group of Y with coefficients in a finite abelian group R. Let R and k ≥ 1 be fixed. It is shown that p=(k n)/n is a sharp threshold for the vanishing of Hk-1(Y;R).
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.