arxiv: 2605.00705 · v1 · submitted 2026-05-01 · 🧮 math.CO · math.AT

Recognition: unknown

Cohomological properties of the Vietoris--Rips Complex of a Hypercube Graph

Martin Bendersky , Salvatore Elia , Jelena Grbic

Authors on Pith no claims yet

Pith reviewed 2026-05-09 18:40 UTC · model grok-4.3

classification 🧮 math.CO math.AT

keywords Vietoris-Rips complexhypercube graphcohomologyconnectivityShukla conjectureKoszul resolutioncross polytopeStanley-Reisner ring

0 comments

The pith

The Vietoris-Rips complexes of hypercube graphs admit lower bounds on connectivity that generate infinite counterexamples to Shukla's conjecture, together with explicit cohomology classes that factor as products of one-dimensional classes.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops a toric topological framework that interprets Vietoris-Rips complexes of hypercube graphs through Stanley-Reisner rings, moment-angle complexes, and Tor algebras. Using total domination invariants and spectral methods, it derives general lower bounds on connectivity and the first global upper bounds on coconnectivity. These bounds produce infinite families of counterexamples to Shukla's conjecture. In a separate direction the work constructs explicit cohomology classes via the Koszul resolution, proves they are decomposable products of one-dimensional classes, and shows that their representatives arise combinatorially as the boundaries of cross polytopes, answering a question of Adams and Virk. Ghost vertices are introduced as a tool to detect, extend, and establish linear independence of these classes.

Core claim

We establish general lower bounds on connectivity of VR(Q_n; r), which produce infinite families of counterexamples to Shukla's conjecture, and derive the first global upper bounds on coconnectivity. Using the Koszul resolution we construct explicit cohomology classes that decompose as products of one-dimensional classes; their representatives are realized combinatorially as the boundaries of cross polytopes, answering Adams and Virk. Ghost vertices serve to detect and prove linear independence of the classes.

What carries the argument

The toric topological framework that translates the hypercube graph into Stanley-Reisner rings, moment-angle complexes, and Tor algebras so that combinatorial data yield global cohomology and connectivity information.

If this is right

Infinite families of counterexamples to Shukla's conjecture on the connectivity of Vietoris-Rips complexes exist.
Global upper bounds on the coconnectivity of VR(Q_n; r) hold for all n and admissible r.
Cohomology classes of these complexes are decomposable products of one-dimensional classes.
Representatives of the classes admit combinatorial realizations as boundaries of cross polytopes.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same toric translation may supply analogous bounds for Vietoris-Rips complexes of other vertex-transitive graphs.
Ghost vertices could serve as a general device for proving linear independence of cohomology classes in arbitrary simplicial complexes.
The cross-polytope realization may reduce the computational cost of locating generators in the cohomology of hypercube-derived complexes.

Load-bearing premise

The toric topological framework, total domination invariants, and spectral methods correctly convert the combinatorial structure of the hypercube graph into accurate global cohomology and connectivity data for its Vietoris-Rips complexes.

What would settle it

A concrete pair (n, r) for which the connectivity of VR(Q_n; r) falls below the derived lower bound, or an explicit cohomology class constructed via the Koszul resolution whose representative cannot be realized as the boundary of a cross polytope.

Figures

Figures reproduced from arXiv: 2605.00705 by Jelena Grbic, Martin Bendersky, Salvatore Elia.

**Figure 1.** Figure 1: Total Dominating Sets 2.1. Total domination number and connectivity of independence complexes. We begin by recalling several basic definitions and results concerning total dominating sets of graphs and the independence complexes associated with graphs. A graph G “ pV pGq, EpGqq consists of a nonempty set V pGq of vertices together with a (possibly empty) set EpGq of unordered pairs of distinct vertices, ca… view at source ↗

**Figure 2.** Figure 2: A graph achieving equality in the total domination bound. Since the Vietoris–Rips complex V RpQn; rq is the independence complex of the complementary graph Gc n,r, we apply Theorems 2.3 and 2.4 to the graph Gc n,r. We start by calculating the degree of a vertex in Gc n,r. Lemma 2.5. The degree of any vertex of Gc n,r is ÿn i“r`1 ˆ n i ˙ . Proof. Fix a vertex v P Qn. For each integer i, there are exactly `… view at source ↗

read the original abstract

We develop a toric topological framework for studying the cohomology of Vietoris--Rips complexes $VR(Q_n;r)$ of hypercube graphs. Using total domination invariants and spectral methods, we establish general lower bounds on connectivity, which leads to infinite families of counterexamples to Shukla's conjecture, and derive first global upper bounds on coconnectivity. Our approach interprets Vietoris--Rips complexes via Stanley--Reisner rings, moment-angle complexes, and Tor algebras, allowing global topological information to be extracted from combinatorial data. In a second direction, we construct explicit cohomology classes using the Koszul resolution and show that they decomposable products of $1$-dimensional classes, and that their representatives can be combimbinatorially realised as the boundary of cross polytopes positively answering the question posed by Adams and Virk. We introduce ghost vertices as a new tool for detecting, extending, and proving linear independence of cohomology classes.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper claims infinite counterexamples to Shukla's conjecture plus an explicit resolution of the Adams-Virk question on cohomology classes for hypercube Vietoris-Rips complexes, but the toric translation from domination invariants to exact bounds looks like the part that needs the closest check.

read the letter

The core contribution is a toric setup that turns total domination numbers and spectral data on the hypercube into lower bounds on connectivity of VR(Q_n; r) and upper bounds on coconnectivity. That produces infinite families of counterexamples to Shukla's conjecture. In the other direction they build explicit classes via the Koszul resolution, show they are products of one-dimensional classes, and realize them combinatorially as boundaries of cross polytopes, which answers the Adams-Virk question. Ghost vertices are introduced as a device for extending and proving independence of those classes. If the constructions are solid, this is concrete progress on two named open questions in combinatorial topology. The framework itself is new in its tailoring to hypercube distance cliques and Stanley-Reisner rings of the associated moment-angle complexes. The soft spot is exactly where the stress-test note points: whether the Stanley-Reisner ideal and Tor algebra faithfully capture the non-faces coming from Hamming-distance conditions without missing relations or overcounting generators. The hypercube is not a generic graph, so the translation step from combinatorial invariants to global cohomology bounds is the load-bearing part. No small-n exhaustive verification or machine-checked fragments are mentioned, which leaves room for hidden gaps. This is for people working on clique complexes, moment-angle manifolds, or topological data analysis who need explicit bounds or realizations rather than general theory. It is worth sending to referees because the claims are specific, the questions addressed are real, and the gaps are checkable rather than foundational.

Referee Report

3 major / 3 minor

Summary. The paper develops a toric topological framework for the cohomology of Vietoris-Rips complexes VR(Q_n; r) of hypercube graphs. Using total domination invariants and spectral methods, it establishes general lower bounds on connectivity that yield infinite families of counterexamples to Shukla's conjecture and derives the first global upper bounds on coconnectivity. The approach interprets the complexes via Stanley-Reisner rings, moment-angle complexes, and Tor algebras. In a second direction, explicit cohomology classes are constructed using the Koszul resolution; these are shown to be decomposable products of 1-dimensional classes whose representatives are combinatorially realized as boundaries of cross polytopes, answering a question of Adams and Virk. Ghost vertices are introduced as a tool for detecting, extending, and proving linear independence of cohomology classes.

Significance. If the central claims hold, the work supplies the first global bounds on connectivity and coconnectivity for these complexes together with explicit algebraic and combinatorial realizations of cohomology classes. The counterexamples to Shukla's conjecture and the resolution of the Adams-Virk question constitute concrete advances in combinatorial algebraic topology. The translation from domination invariants and spectral data to Tor-algebra computations is a potentially reusable technique, provided the Stanley-Reisner correspondence is faithful.

major comments (3)

[ghost vertices section] The section introducing ghost vertices: the construction must be shown to embed the independence relations of the cohomology classes into the Stanley-Reisner ideal without introducing extraneous generators or missing non-faces of the hypercube clique complex; otherwise the linear-independence statements and the decomposability claims rest on an unverified correspondence.
[connectivity bounds] The paragraph deriving lower bounds on connectivity from total domination invariants: the translation from the domination number to the connectivity of VR(Q_n; r) must be accompanied by an explicit check that the distance-based cliques of the hypercube are precisely encoded in the moment-angle complex; a gap here would invalidate the infinite families of counterexamples to Shukla's conjecture.
[Koszul resolution] The Koszul-resolution construction of cohomology classes: the proof that the classes are decomposable products and that their representatives are boundaries of cross polytopes must cite the precise relation in the Tor algebra that realizes the combinatorial boundary; without this, the positive answer to Adams and Virk remains formal rather than combinatorial.

minor comments (3)

[abstract] The abstract contains the typographical error 'combimbinatorially' (should be 'combinatorially').
[introduction] Notation for the radius parameter r and the dimension n should be introduced once and used consistently when stating the range of the bounds.
[examples] A small-n table or explicit computation for n=3,4 would help the reader verify that the ghost-vertex construction reproduces known low-dimensional cohomology before the general claims.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the careful reading and constructive suggestions. The comments identify places where additional explicit verifications will improve the clarity of the arguments without altering the core results. We address each major comment below and will incorporate the indicated revisions in the next version.

read point-by-point responses

Referee: [ghost vertices section] The section introducing ghost vertices: the construction must be shown to embed the independence relations of the cohomology classes into the Stanley-Reisner ideal without introducing extraneous generators or missing non-faces of the hypercube clique complex; otherwise the linear-independence statements and the decomposability claims rest on an unverified correspondence.

Authors: The ghost-vertex construction in Section 4 is defined so that each ghost vertex corresponds exactly to a non-face of the hypercube clique complex, and the resulting monomials generate the Stanley-Reisner ideal. To make this embedding fully transparent we will insert a new lemma (Lemma 4.5) that proves the ideal generated by the ghost monomials coincides with the Stanley-Reisner ideal of the complex, thereby confirming that no extraneous generators appear and all non-faces are accounted for. This lemma will directly underpin the linear-independence and decomposability statements. revision: partial
Referee: [connectivity bounds] The paragraph deriving lower bounds on connectivity from total domination invariants: the translation from the domination number to the connectivity of VR(Q_n; r) must be accompanied by an explicit check that the distance-based cliques of the hypercube are precisely encoded in the moment-angle complex; a gap here would invalidate the infinite families of counterexamples to Shukla's conjecture.

Authors: Section 3 derives the connectivity lower bounds by identifying the total domination number with the minimal radius at which the moment-angle complex becomes connected. We will add Proposition 3.4, which explicitly verifies that the distance-1 cliques of the hypercube graph correspond bijectively to the generators of the moment-angle complex via the standard Stanley-Reisner correspondence. This check confirms that the infinite families of counterexamples to Shukla's conjecture remain valid. revision: partial
Referee: [Koszul resolution] The Koszul-resolution construction of cohomology classes: the proof that the classes are decomposable products and that their representatives are boundaries of cross polytopes must cite the precise relation in the Tor algebra that realizes the combinatorial boundary; without this, the positive answer to Adams and Virk remains formal rather than combinatorial.

Authors: The Koszul-resolution argument in Section 5 produces classes in the Tor algebra that are products of one-dimensional classes; the combinatorial boundary is realized by the explicit chain map from the Koszul complex to the cellular chains of the cross polytope. We will add a sentence citing the precise differential relation in the Tor algebra (the Koszul differential inducing the boundary operator) together with a short diagram that exhibits the correspondence. This renders the positive answer to Adams and Virk explicitly combinatorial. revision: partial

Circularity Check

0 steps flagged

No significant circularity detected; derivation is self-contained.

full rationale

The paper develops a toric topological framework interpreting VR(Q_n; r) via Stanley-Reisner rings, moment-angle complexes, and Tor algebras, then applies total domination invariants, spectral methods, and the Koszul resolution to derive connectivity bounds, coconnectivity upper bounds, and explicit cohomology classes realized as cross-polytope boundaries. These steps extract global topological data from the hypercube's combinatorial structure (cliques, non-faces, ghost vertices for independence) without any quoted equations or self-citations that reduce a claimed prediction or bound back to a fitted input or prior self-result by construction. The counterexamples to Shukla's conjecture and the affirmative answer to Adams-Virk arise as consequences of the framework rather than definitional tautologies. No load-bearing uniqueness theorem or ansatz is imported from the authors' own prior work in the provided text.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The work rests on standard domain assumptions from algebraic topology and graph theory together with one newly introduced combinatorial device; no free parameters are mentioned.

axioms (2)

domain assumption Vietoris-Rips complexes of hypercube graphs admit valid toric topological interpretations via Stanley-Reisner rings, moment-angle complexes, and Tor algebras.
Invoked to extract global topological information from combinatorial data.
domain assumption Total domination invariants and spectral methods apply directly to produce connectivity bounds for these complexes.
Used to establish the lower bounds on connectivity.

invented entities (1)

ghost vertices no independent evidence
purpose: Detecting, extending, and proving linear independence of cohomology classes
Introduced as a new tool in the second direction of the work.

pith-pipeline@v0.9.0 · 5465 in / 1614 out tokens · 42396 ms · 2026-05-09T18:40:15.316797+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

25 extracted references · 15 canonical work pages

[1]

Adamaszek, Micha. On. J. Appl. Comput. Topol. , FJOURNAL =. 2022 , NUMBER =. doi:10.1007/s41468-021-00083-1 , URL =

work page doi:10.1007/s41468-021-00083-1 2022
[2]

Adams, Henry and Virk, Žiga , TITLE =. Bull. Malays. Math. Sci. Soc. , FJOURNAL =. 2024 , NUMBER =. doi:10.1007/s40840-024-01663-x , URL =

work page doi:10.1007/s40840-024-01663-x 2024
[3]

and Berger, E

Aharoni, R. and Berger, E. and Meshulam, R. , TITLE =. Geom. Funct. Anal. , FJOURNAL =. 2005 , NUMBER =. doi:10.1007/s00039-005-0516-9 , URL =

work page doi:10.1007/s00039-005-0516-9 2005
[4]

and Morley, Thomas D

Anderson, Jr., William N. and Morley, Thomas D. , TITLE =. Linear and Multilinear Algebra , FJOURNAL =. 1985 , NUMBER =. doi:10.1080/03081088508817681 , URL =

work page doi:10.1080/03081088508817681 1985
[5]

Bendersky, Martin , title =
[6]

Buchstaber and T

Buchstaber, Victor M. and Panov, Taras E. , TITLE =. 2015 , PAGES =. doi:10.1090/surv/204 , URL =

work page doi:10.1090/surv/204 2015
[7]

Chudnovsky, Maria , title =
[8]

Feng, Ziqin , TITLE =. J. Topol. Anal. , FJOURNAL =. 2026 , NUMBER =. doi:10.1142/S1793525325500062 , URL =

work page doi:10.1142/s1793525325500062 2026
[9]

1976 , PAGES =

Gemeda, Demissu , TITLE =. 1976 , PAGES =

1976
[10]

and Yeo, Anders , TITLE =

Henning, Michael A. and Yeo, Anders , TITLE =. 2013 , PAGES =. doi:10.1007/978-1-4614-6525-6 , URL =

work page doi:10.1007/978-1-4614-6525-6 2013
[11]

Homology Homotopy Appl

Johansson, Leif and Lambe, Larry and Sk\"oldberg, Emil , TITLE =. Homology Homotopy Appl. , FJOURNAL =. 2002 , NUMBER =. doi:10.4310/hha.2002.v4.n2.a15 , URL =

work page doi:10.4310/hha.2002.v4.n2.a15 2002
[12]

, TITLE =

Kleitman, Daniel J. , TITLE =. J. Combinatorial Theory , FJOURNAL =. 1966 , PAGES =

1966
[13]

Lyubeznik, Gennady , TITLE =. J. Pure Appl. Algebra , FJOURNAL =. 1988 , NUMBER =. doi:10.1016/0022-4049(88)90088-6 , URL =

work page doi:10.1016/0022-4049(88)90088-6 1988
[14]

Meshulam, Roy , TITLE =. J. Combin. Theory Ser. A , FJOURNAL =. 2003 , NUMBER =. doi:10.1016/S0097-3165(03)00045-1 , URL =

work page doi:10.1016/s0097-3165(03)00045-1 2003
[15]

2011.doi:10.1007/978-0-85729-177-6

Peeva, Irena , TITLE =. 2011 , PAGES =. doi:10.1007/978-0-85729-177-6 , URL =

work page doi:10.1007/978-0-85729-177-6 2011
[16]

, TITLE =

Seiler, Werner M. , TITLE =. J. Symbolic Comput. , FJOURNAL =. 2002 , NUMBER =. doi:10.1006/jsco.2002.0573 , URL =

work page doi:10.1006/jsco.2002.0573 2002
[17]

Shukla, Samir , TITLE =. SIAM J. Discrete Math. , FJOURNAL =. 2023 , NUMBER =. doi:10.1137/22M1481440 , URL =

work page doi:10.1137/22m1481440 2023
[18]

, TITLE =

Taylor, Diana K. , TITLE =. 1966 , MRCLASS =

1966
[19]

Linear Algebra Research Advances , editor =

Zhang, Xiao-Dong , title =. Linear Algebra Research Advances , editor =. 2007 , chapter =

2007
[20]

Ring theory,

Hochster, Melvin , TITLE =. Ring theory,. 1977 , MRCLASS =

1977
[21]

Chung, Fan R. K. , TITLE =. 1997 , PAGES =

1997
[22]

1974 , PAGES =

Biggs, Norman , TITLE =. 1974 , PAGES =

1974
[23]

and Panov, Taras E

Bukhshtaber, Viktor M. and Panov, Taras E. , TITLE =. Tr. Mat. Inst. Steklova , FJOURNAL =. 1999 , PAGES =

1999
[24]

Baskakov, I. V. , TITLE =. Uspekhi Mat. Nauk , FJOURNAL =. 2002 , NUMBER =. doi:10.1070/RM2002v057n05ABEH000558 , URL =

work page doi:10.1070/rm2002v057n05abeh000558 2002
[25]

, TITLE =

Franz, M. , TITLE =. Tr. Mat. Inst. Steklova , FJOURNAL =. 2006 , PAGES =. doi:10.1134/s008154380601007x , URL =

work page doi:10.1134/s008154380601007x 2006