A Counterexample to a Corner-Peeling Conjecture for Subcomplexes of Z^3

Let G be a finite connected subgraph of the grid ℤ³, not necessarily induced, and let X(G) be the cube complex whose cells are the squares and 3-cubes of ℤ³ all of whose vertices and edges lie in G. A corner is a vertex that lies in exactly one maximal cell, and a corner peeling is an ordering v₁, …, vₙ of the vertices in which each vᵢ is a corner of the subgraph induced by v₁, …, vᵢ. In the problem session of the 2026 Oberwolfach workshop Median Geometry and Applications, V. Chepoi, from discussions with J. Chalopin and M. Kokkou, conjectured that G admits a corner peeling whenever X(G) is simply connected and every connected component of every section of X(G) by a coordinate plane is simply connected. We show that the conjecture is false. We give a subgraph G₆₂ of ℤ³ with 62 vertices in [0,3]³ and an induced subgraph H₇₃ with 73 vertices in [0,4]³ such that the cube complex and all its sections are collapsible, but there is no corner at all. Both examples are invariant under a cyclic group of order 6, and the disproof can be checked by hand; we also give explicit sequences of elementary collapses as machine-checkable certificates. A subdivision construction turns every finite subgraph into an induced subgraph whose pieces and corners are dilates of the original ones, so the conjecture for partial subgraphs and the conjecture for induced subgraphs are equivalent. Uncertified solver computations indicate that no counterexample fits into a 3 × 3 × 3 box of lattice points. We also record a smaller counterexample, with 49 vertices, found in an exploratory solver search during an independent verification of this note and checked by computer. This is an unrefereed note. Version 1.1 (30 September 2026) revises version 1.0 after an independent referee round. Main changes: a smaller counterexample, with 49 vertices, is added (Remark 6.3); Remark 3.2 is corrected (the 62-vertex graph returned by the vertex-minimising program is the mirror image of G₆₂, not a second example); the torsion step is added to Lemma 6.1; the abstract now says that both examples are invariant under a cyclic group of order 6 (the full symmetry group of H₇₃ has order 12); the description of the solver runs is corrected; a scope statement on isometric subgraphs is added; and the Verification paragraph now states that its referees are independent, AI-assisted verification runs, not peer reviews. Unrefereed preprint released for independent mathematical scrutiny. Publication on Zenodo does not constitute peer review. AI-assisted tools supported research, computation, proof development, and manuscript preparation. The author remains responsible for all claims and the final text. Corpus identifier: OWR-14299911-029 (Oberwolfach Reports, Report 8/2026, Problem 15, "Corners in subcomplexes of Z3").

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-30
DOI
https://doi.org/10.5281/zenodo.23049728
Primary Topic
Computational Geometry and Mesh Generation
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

A Counterexample to a Corner-Peeling Conjecture for Subcomplexes of Z^3

Alper Ferudun
Zenodo (CERN European Organization for Nuclear Research)
Computational Geometry and Mesh Generation
preprint

A Counterexample to a Corner-Peeling Conjecture for Subcomplexes of Z^3

Alper Ferudun
preprint en

Abstract

Let G be a finite connected subgraph of the grid ℤ³, not necessarily induced, and let X(G) be the cube complex whose cells are the squares and 3-cubes of ℤ³ all of whose vertices and edges lie in G. A corner is a vertex that lies in exactly one maximal cell, and a corner peeling is an ordering v₁, …, vₙ of the vertices in which each vᵢ is a corner of the subgraph induced by v₁, …, vᵢ. In the problem session of the 2026 Oberwolfach workshop Median Geometry and Applications, V. Chepoi, from discussions with J. Chalopin and M. Kokkou, conjectured that G admits a corner peeling whenever X(G) is simply connected and every connected component of every section of X(G) by a coordinate plane is simply connected. We show that the conjecture is false. We give a subgraph G₆₂ of ℤ³ with 62 vertices in [0,3]³ and an induced subgraph H₇₃ with 73 vertices in [0,4]³ such that the cube complex and all its sections are collapsible, but there is no corner at all. Both examples are invariant under a cyclic group of order 6, and the disproof can be checked by hand; we also give explicit sequences of elementary collapses as machine-checkable certificates. A subdivision construction turns every finite subgraph into an induced subgraph whose pieces and corners are dilates of the original ones, so the conjecture for partial subgraphs and the conjecture for induced subgraphs are equivalent. Uncertified solver computations indicate that no counterexample fits into a 3 × 3 × 3 box of lattice points. We also record a smaller counterexample, with 49 vertices, found in an exploratory solver search during an independent verification of this note and checked by computer. This is an unrefereed note. Version 1.1 (30 September 2026) revises version 1.0 after an independent referee round. Main changes: a smaller counterexample, with 49 vertices, is added (Remark 6.3); Remark 3.2 is corrected (the 62-vertex graph returned by the vertex-minimising program is the mirror image of G₆₂, not a second example); the torsion step is added to Lemma 6.1; the abstract now says that both examples are invariant under a cyclic group of order 6 (the full symmetry group of H₇₃ has order 12); the description of the solver runs is corrected; a scope statement on isometric subgraphs is added; and the Verification paragraph now states that its referees are independent, AI-assisted verification runs, not peer reviews. Unrefereed preprint released for independent mathematical scrutiny. Publication on Zenodo does not constitute peer review. AI-assisted tools supported research, computation, proof development, and manuscript preparation. The author remains responsible for all claims and the final text. Corpus identifier: OWR-14299911-029 (Oberwolfach Reports, Report 8/2026, Problem 15, "Corners in subcomplexes of Z3").

Zenodo (CERN European Organization for Nuclear Research)
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.