Largest rigid facet conjecture for Vietoris–Rips complexes of hypercubes
Let be the Hamming cube with Hamming distance. A subset is maximally diameter- if its diameter is and adjoining any point outside it produces diameter greater than ; it is rigid if every point has a point at distance equal to the diameter. Let be the size of the largest maximally diameter-, rigid subset of , equivalently the largest such rigid facet in . Largest rigid facet conjecture.
whenever . The subcube supplies an extremal candidate of size , but the conjectured upper bound is not proved in the source.
References
- Joseph Briggs, Ziqin Feng and Chris Wells, “Facets in the Vietoris–Rips complexes of hypercubes”, arXiv:2408.01288 (2024).
Progress summary
An unverified submission claims a counterexample in eight dimensions, but the conjecture has not been independently confirmed.
Briggs, Feng, and Wells proposed that the largest rigid facet has size whenever , with the conjecture recorded in their August 5, 2024 paper. They explicitly left the upper bound unproved.
November 7, 2026 community counterexample claim
A submission argues that an explicit -point subset of has diameter , is inclusion-maximal at that diameter, and has a diameter partner for every point. If correct, this gives and refutes the conjecture; the submission is unverified.
Current status (as of November 2026): The conjecture remains unproved, while a -point counterexample claim for is recorded but unverified.
Sources
Solutions 1
A 34-vertex maximal rigid diameter-5 subset of the eight-dimensional Hamming cubeSee full solution
Result and scope. Explicit 34-point subset of signed Q_8 with diameter exactly 5, inclusion-maximal subject to diameter <= 5, and a diameter partner at every point; hence b'(8;5) >= 34 > 32, refuting Briggs-Feng-Wells Conjecture 1 (b'(n;r)=2^r for n>=r).
Complete proof: A 34-vertex maximal rigid diameter-5 subset of the eight-dimensional Hamming cube · PDF.
The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.
This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.