Pith. sign in

REVIEW 1 cited by

Collapsibility and vanishing of top homology in random simplicial complexes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1010.1400 v2 pith:M5JBZ7ZJ submitted 2010-10-07 math.CO

classification math.CO
keywords dimensionalgammarandomconstantsimplexsimplicialsubcomplexadding
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Let Y be a random d-dimensional subcomplex of the (n-1)-dimensional simplex S obtained by starting with the full (d-1)-dimensional skeleton of S and then adding each d-simplex independently with probability p=c/n. We compute an explicit constant gamma_d=Theta(log d) so that for c < gamma_d such a random simplicial complex either collapses to a (d-1)-dimensional subcomplex or it contains the boundary of a (d+1)-simplex. We conjecture this bound to be sharp. In addition we show that there exists a constant gamma_d< c_d <d+1 such that for any c>c_d and a fixed field F, asymptotically almost surely H_d(Y;F) \neq 0.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Transversal non-Clifford gates on qLDPC codes breaking the $\sqrt{N}$ distance barrier and quantum-inspired geometry with $\mathbb{Z}_2$ systolic freedom

    quant-ph 2025-07 conditional novelty 6.0 of 10

    A triple homological product of good quantum LDPC codes achieves distance N^(2/3) with transversal CCZ gates and prepares N^(1/3) magic states in a single round.

Pith tools