REVIEW 2 cited by
On the Connectivity of the Vietoris-Rips Complex of a Hypercube Graph
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
On the Connectivity of the Vietoris-Rips Complex of a Hypercube Graph
read the original abstract
We bring in the techniques of independence complexes and the notion of total dominating sets of a graph to bear on the question of the connectivity of the Vietoris-Rips complexes $VR(Q_n; r)$ of an $n$-hypercube graph. We obtain a lower bound for the connectivity of $VR(Q_n; r)$ for an arbitrary $n$-dimension hypercube and at all scale parameters $r$. The obtained bounds disprove the conjecture of Shukla that $\VR$ is $r$-connected.
Forward citations
Cited by 2 Pith papers
-
A $\mathbb{Z}_2$-Topological Framework for Sign-rank Lower Bounds
A Z2-equivariant topological reduction shows sign-rank(GHD_k^n) equals (1-o_k(1))2k with o_k(1) = O(sqrt(log k / k)), improving prior Omega(k/log(n/k)) bounds.
-
Homotopy connectivity of \v{C}ech complexes of spheres
Bounds on homotopy connectivity of Čech complexes of spheres are derived from coverings, proving the homotopy type changes infinitely many times with scale r in (0, π) for n ≥ 1.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.