Collapsibility-number conjecture for Vietoris–Rips complexes of hypercube graphs

Let In\mathbb{I}_n denote the nn-dimensional hypercube graph, and let VR(In;r)\mathcal{VR}(\mathbb{I}_n;r) be its Vietoris–Rips complex at scale rr. Let the collapsibility number of a simplicial complex mean the parameter used in the paper to measure its collapsibility. Collapsibility-number conjecture. For nr+1n\geq r+1, the collapsibility number of VR(In;r)\mathcal{VR}(\mathbb{I}_n;r) is

2r.2^r.

The value is established in the paper for r{2,3}r\in\{2,3\}, and the boundary cases r=1r=1 and r=n1r=n-1 are described explicitly; the conjecture proposes the same formula throughout the stated range.

Sources & referencesView supporting material

Primary source

Samir Shukla, “On Vietoris–Rips complexes (with scale 3) of hypercube graphs”, arXiv:2202.02756 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.