Pith. sign in

REVIEW 3 major objections 3 minor 1 cited by

Cell structure of mediangle graphs

T0 review · 3 major / 3 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Every bipartite mediangle graph can be built as the tope graph of a finitary complex of oriented matroids, giving it a contractible cell complex.

desk verdict Solid finite-case result with a real infinite-case gap: Theorem 1 is false as stated for uncountable bipartite mediangle graphs, and the abstract overclaims. read the letter →

arxiv 2505.23293 v3 pith:R67QLGV4 submitted 2025-05-29 math.CO math.GRmath.MG

Victor Chepoi , Anthony Genevois , Kolja Knauer This is my paper · ORCID
classification math.COmath.GRmath.MG MSC 05C1205C7552C40
keywords medianglegraphspartialcubescomplexesoforientedmatroidssimplicialtopeapiculatecontractiblecellCoxeter
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper proves that every bipartite mediangle graph—a class that unifies median graphs and Coxeter graphs—can be encoded as the tope graph of a finitary Complex of Oriented Matroids. That encoding endows the graph with a contractible cell complex, settling the bipartite version of a question posed in geometric group theory. The paper also identifies exactly which cells occur: the tope graphs of simplicial oriented matroids. The route is graph-theoretic: bipartite mediangle graphs satisfy a unique-apex condition, and that condition forces the gated-antipodal structure characteristic of COM tope graphs.

What carries the argument

The central object is the tope graph of a COM: the induced subgraph of a hypercube on the maximal sign vectors of a system satisfying strong elimination and face symmetry. The load-bearing characterization, Theorem 12 of [25], says a partial cube is a COM tope graph exactly when all its antipodal subgraphs are gated. The paper feeds this with apiculation: a graph is apiculate when each basepoint order is a meet-semilattice, and Lemma 16 shows bipartite mediangle graphs have this property. Lemma 17 then proves apiculate partial cubes satisfy the gated-antipodal condition. The finitary COM axioms extend the framework to countable ground sets, and contractibility is inherited from finite COMs by a directed-union argument.

What would settle it

Construct a bipartite mediangle graph that has an antipodal subgraph which is not gated; the characterization the proof relies on says such a graph cannot be the tope graph of a finitary COM, so that graph would directly contradict Theorem 1.

Watch

Extended reading notes

Core claim

Theorem 1 states that any bipartite mediangle graph is the tope graph of a finitary COM and hence admits the structure of a contractible cell complex. Theorem 2 sharpens this: for a partial cube G, being mediangle and antipodal is equivalent to being apiculate and antipodal, and both are equivalent to being the tope graph of a simplicial oriented matroid. The proof proceeds by showing that bipartite mediangle graphs are apiculate, then that apiculate partial cubes satisfy the gated-antipodal characterization of COM tope graphs, and finally that the resulting cell complex is contractible even in the finitary, possibly infinite setting.

Load-bearing premise

The proof leans on a known test: a partial cube is a tope graph of a complex of oriented matroids exactly when every antipodal subgraph is gated, and that test is stated for finite ground sets while the graphs in play may be infinite; if the test fails to extend to the infinite case, the theorem for infinite graphs would not follow.

Editorial extensions

If this is right

  • Every bipartite mediangle graph admits a regular cell complex whose cells are oriented matroids, and that complex is contractible.
  • The cells of the complex are exactly the tope graphs of simplicial oriented matroids, so an antipodal apiculate partial cube is precisely the tope graph of a simplicial oriented matroid.
  • The construction covers median graphs and Coxeter graphs as special cases, placing their usual contractible complexes under one common cell structure.
  • The result handles infinite bipartite mediangle graphs through the finitary COM formalism, whose cell complexes are contractible by a directed-union argument.
  • The equivalence with simplicial oriented matroids links antipodal mediangle graphs to simplicial hyperplane arrangements and their non-realizable generalizations.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the finitary version of the gated-antipodal characterization is supplied, the proof of Theorem 1 for infinite bipartite mediangle graphs is secured; until then, the infinite case rests on an unproved extension of a finite characterization.
  • The simplicial-OM cell structure suggests a concrete route to CAT(0) geometry: realize each simplicial oriented matroid as a Euclidean polytope and glue the polytopes isometrically, a problem the paper leaves open.
  • A positive answer to the downward cell property would make the cell complex locally reconstructible from vertex neighborhoods, giving a purely graph-theoretic construction of the cells.
  • Because non-realizable simplicial oriented matroids exist, the contractible complex from Theorem 1 should be regarded as the natural general structure, with a CAT(0) metric expected only for realizable subfamilies.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 3 minor

Summary. The paper studies bipartite mediangle graphs, a common generalization of median graphs and Coxeter graphs introduced by Genevois. Theorem 1 claims that every bipartite mediangle graph is the tope graph of a finitary Complex of Oriented Matroids and therefore admits the structure of a contractible cell complex. Theorem 2 claims that, for a partial cube, being mediangle and antipodal is equivalent to being apiculate and antipodal and to being the tope graph of a simplicial oriented matroid. The proof proceeds by showing that bipartite mediangle graphs are apiculate (Lemma 16), that apiculate partial cubes are tope graphs of COMs (Lemma 17), and that finitary COMs yield contractible complexes (Theorem 15). The paper also poses several questions about hyperplanes, fixed cells, and CAT(0) structures.

Significance. If the main theorems were established in full generality, the paper would give a positive answer to Genevois's contractibility question for bipartite mediangle graphs and would connect this class to the well-developed theory of COMs and simplicial oriented matroids. The characterization of the cells as simplicial OMs is conceptually attractive and would unify the known cell structures of median graphs and Coxeter graphs. The paper relies on, rather than redevelops, the theory of COMs, and the combinatorial arguments in Lemmas 16 and 17 are coherent for the finite case. However, the central claim for arbitrary bipartite mediangle graphs is not supported, and a concrete counterexample shows that Theorem 1 is false as stated.

major comments (3)
  1. [Theorem 1, Lemma 17, Definition 14]
  2. [Theorem 15]
  3. [Theorem 2 statement]
minor comments (3)
  1. [Throughout]
  2. [Definition 14]
  3. [Lemma 17 proof]

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the central derivation uses published external characterizations and original lemmas, with no fitted inputs or results reduced to their own assumptions.

full rationale

The paper's derivation chain is not circular. Lemma 16 is an original induction proving that bipartite mediangle graphs are apiculate. Lemma 17 is an original argument verifying that, in an apiculate partial cube, every antipodal subgraph is gated; it does not assume the Knauer–Marc characterization as its conclusion but rather uses Theorem 12 of [25] as an external criterion, and the proof in the paper establishes precisely that criterion. Theorem 15 is proved in the paper from Whitehead's theorem together with the known contractibility of finite COM complexes from [4], not from the theorem being derived. Theorem 2 is a new equivalence proved from the original Lemma 16 plus known results about simplicial oriented matroids ([5], [6]); the fact that the equivalence (ii)⇔(iii) was conjectured in the second author's habilitation [26] and is now proved is not circularity. The self-citations to [4], [12], [25], and [26] are references to published, independently established results that do not incorporate the present theorems as assumptions. There is a real mathematical gap in Lemma 17 and Theorem 1 regarding the extension from finite COMs to finitary COMs, and the uncountable star K_{1,κ} shows the statement as written cannot hold for all infinite bipartite mediangle graphs; however, this is a correctness issue, not a circularity. Nothing in the paper is fitted, renamed, or derived from its own conclusion, so the circularity score is 0.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

No free parameters or invented entities. The central claim rests on established theorems from partial cubes, COMs, and oriented matroids, plus a finite-to-finitary COM extension that is not fully spelled out.

assumptions (6)
  • standard math Djoković's characterization: a graph is a partial cube iff it is bipartite and every edge defines complementary halfspaces (Theorem 4 [13]).
    Used throughout to view bipartite mediangle graphs as isometric subgraphs of hypercubes, which is needed for the COM tope graph framework.
  • standard math Bipartite mediangle graphs are partial cubes (Theorem 6 [18]).
    Borrowed from prior work; foundational for applying partial cube theory to mediangle graphs.
  • standard math Convex cycles in bipartite mediangle graphs are gated (Theorem 7 [18]).
    Used in Lemma 16 to ensure the cycles produced by the mediangle condition are gated.
  • standard math Knauer-Marc characterization: a partial cube is the tope graph of a COM iff all antipodal subgraphs are gated (Theorem 12 [25]).
    Load-bearing in Lemma 17; requires a finitary or infinite extension for Theorem 1 that the paper does not explicitly prove.
  • standard math Finite COM cell complexes are contractible, and the finite-to-finitary limit is handled by Whitehead's theorem (Theorem 13 [4], Theorem 15).
    Provides the contractibility conclusion of Theorem 1.
  • standard math Simplicial oriented matroid facts from [6]: lattice orders imply simplicial topes and the interval property in Lemma 4.4.4.
    Used in Theorem 2 to connect apiculate antipodal graphs to simplicial OMs and back.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Cell structure of mediangle graphs." pith.science (2026). https://pith.science/paper/R67QLGV4

@misc{pith2026250523293,
  author       = {Pith},
  title        = {Pith review of: Cell structure of mediangle graphs},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/R67QLGV4}},
  note         = {Machine review of arXiv:2505.23293}
}
read the original abstract

Mediangle graphs are a common generalization of median graphs (1-sekeleta of CAT(0) cube complexes) and Coxeter graphs (Cayley graphs of Coxeter systems). Answering a question motivated from geometric group theory, we show that these graphs can be endowed with the structure of a contractible cell complex. We further show that the cells of this complex are products of simplices and simplicial oriented matroids. A crucial part of the proof identifies bipartite mediangle graphs as tope graphs of finitary Complexes of Oriented Matroids.

Figures

Figures reproduced from arXiv: 2505.23293 by the authors.

Figure 1
Figure 1. Left: a bipartite mediangle graph G with 4 antipodal subgraphs of rank 2. Right: the big face semilattice of the COM M whose tope graph is G. The purple antipodal subgraph on the left corresponds to a face on the right. We only labeled minimal and maximal covectors in order to not convolute the drawing. Definition 11 (Simpliciality). A tope T of an oriented matroid M of rank r is simplicial if the degree of T in the… view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Ample sets in Cartesian products

    math.CO 2026-07 accept novelty 7.0 of 10

    Ample sets of Cartesian products are characterized by shattering-to-strong-shattering of minor-subproducts and inherit the main binary-case equivalences plus contractible prism complexes.

Reference graph

Works this paper leans on

34 extracted references · 21 canonical work pages · cited by 1 Pith paper

  1. [25]

    Knauer and T

    K. Knauer and T. Marc. On tope graphs of complexes of oriented matroids.Discrete Comput. Geom., 63(2):377– 417, 2020.doi:10.1007/s00454-019-00111-z

    doi:10.1007/s00454-019-00111-z 2020

  2. [18]

    Rotation groups, mediangle graphs, and periagroups: a unified point of view on Coxeter groups and graph products of groups

    Anthony Genevois. Rotation groups, mediangle graphs, and periagroups: a unified point of view on Coxeter groups and graph products of groups. Preprint, arXiv:2212.06421 [math.GR] (2022), 2022. URL: https: //arxiv.org/abs/2212.06421

    arXiv 2022

  3. [1]

    Laura Anderson.Oriented matroids (to appear), volume 216 ofCamb. Stud. Adv. Math.Cambridge: Cambridge University Press, 2025

    work page 2025

  4. [2]

    Bandelt, V

    H.-J. Bandelt, V. Chepoi, A. W. M. Dress, and J. H. Koolen. Combinatorics of lopsided sets.European J. Combin., 27(5):669–689, 2006.doi:10.1016/j.ejc.2005.03.001

    work page doi:10.1016/j.ejc.2005.03.001 2006

  5. [3]

    The algebra of metric betweenness I: Subdirect representation and retraction.European J

    Hans-J¨ urgen Bandelt and Victor Chepoi. The algebra of metric betweenness I: Subdirect representation and retraction.European J. Combin., 28(6):1640–1661, 2007.doi:10.1016/j.ejc.2006.07.003

    work page doi:10.1016/j.ejc.2006.07.003 2007

  6. [4]

    COMs: Complexes of oriented matroids.J

    Hans-J¨ urgen Bandelt, Victor Chepoi, and Kolja Knauer. COMs: Complexes of oriented matroids.J. Combin. Theory Ser. A, 156:195–237, 2018.doi:10.1016/j.jcta.2018.01.002

    doi:10.1016/j.jcta.2018.01.002 2018

  7. [5]

    Edelman, and G¨ unter M

    Anders Bj¨ orner, Paul H. Edelman, and G¨ unter M. Ziegler. Hyperplane arrangements with a lattice of regions.Dis- crete Comput. Geom., 5(3):263–288, 1990. URL:https://eudml.org/doc/131117,doi:10.1007/BF02187790

    doi:10.1007/bf02187790 1990

  8. [6]

    Anders Bj¨ orner, Michel Las Vergnas, Bernd Sturmfels, Neil White, and G¨ unter Ziegler.Oriented ma- troids., volume 46 ofEncycl. Math. Appl.Cambridge University Press, 2nd ed. edition, 1999. doi: 10.1017/CBO9780511586507

    doi:10.1017/cbo9780511586507 1999

Show all 34 references
  1. [7]

    R. G. Bland and M. Las Vergnas. Orientability of matroids.J. Comb. Theory, Ser. B, 24(1):94–123, 1978. doi:10.1016/0095-8956(78)90080-1. 8

    1978 doi

  2. [8]

    Graphs of some CAT(0) complexes.Adv

    Victor Chepoi. Graphs of some CAT(0) complexes.Adv. in Appl. Math., 24(2):125–179, 2000. doi:10.1006/ aama.1999.0677

    2000

  3. [9]

    Hypercellular graphs: partial cubes without Q− 3 as partial cube minor.Discrete Math., 343(4):28, 2020

    Victor Chepoi, Kolja Knauer, and Tilen Marc. Hypercellular graphs: partial cubes without Q− 3 as partial cube minor.Discrete Math., 343(4):28, 2020. Id/No 111678.doi:10.1016/j.disc.2019.111678

    2020

  4. [10]

    M. W. Davis.The geometry and topology of Coxeter groups, volume 32 ofLondon Math. Soc. Monogr. Ser. Princeton Univ. Press, Princeton, NJ, 2008

    2008

  5. [11]

    Les immeubles des groupes de tresses g´ en´ eralises.Invent

    Pierre Deligne. Les immeubles des groupes de tresses g´ en´ eralises.Invent. Math., 17:273–302, 1972. URL: https://eudml.org/doc/142173,doi:10.1007/BF01406236

    1972 doi

  6. [12]

    Finitary affine oriented matroids.Discrete Comput

    Emanuele Delucchi and Kolja Knauer. Finitary affine oriented matroids.Discrete Comput. Geom., 73(1):208–257, 2025.doi:10.1007/s00454-024-00651-z

    2025 doi

  7. [13]

    Djokovi´ c

    Dragomir ˇZ. Djokovi´ c. Distance-preserving subgraphs of hypercubes.J. Combin. Theory Ser. B, 14(3):263–267, 1973.doi:10.1016/0095-8956(73)90010-5

    1973 doi

  8. [14]

    Andreas W. M. Dress. Towards a theory of holistic clustering. InMathematical Hierarchies and Biology, volume 37 ofDIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 271–290. DIMACS, Amer. Math. Soc., 1996. doi:10.1090/dimacs/037/19

    1996 doi

  9. [15]

    Andreas W. M. Dress and Rudolf Scharlau. Gated sets in metric spaces.Aequationes Math., 34(1):112–120, 1987. doi:10.1007/BF01840131

    1987 doi

  10. [16]

    Edmonds and A

    J. Edmonds and A. Mandel.Topology of Oriented Matroids. PhD thesis, University of Waterloo, 1982. PhD thesis of A. Mandel, 333 pages

    1982

  11. [17]

    Folkman and J

    J. Folkman and J. Lawrence. Oriented matroids.J. Comb. Theory, Ser. B, 25(2):199–236, 1978. doi: 10.1016/0095-8956(78)90039-4

    1978 doi

  12. [19]

    Rotation groups virtually embed into right-angled rotation groups

    Anthony Genevois. Rotation groups virtually embed into right-angled rotation groups. Preprint, arXiv:2404.15652 [math.GR] (2024), 2024. URL:https://arxiv.org/abs/2404.15652

    2024 arXiv

  13. [20]

    Gr¨ unbaum.Convex polytopes

    B. Gr¨ unbaum.Convex polytopes. Prepared by Volker Kaibel, Victor Klee, and G¨ unter M. Ziegler, volume 221 of Grad. Texts Math.New York, NY: Springer, 2nd ed. edition, 2003

    2003

  14. [21]

    Simplicit´ e de groupes d’automorphismes d’espaces ` a courbure n´ egative

    Fr´ ed´ eric Haglund and Fr´ ed´ eric Paulin. Simplicit´ e de groupes d’automorphismes d’espaces ` a courbure n´ egative. InThe Epstein Birthday Schrift, volume 1 ofGeom. Topol. Monogr., pages 181–248. Math. Sci. Publ., Coventry, 1998.doi:10.2140/gtm.1998.1.181

    1998 doi

  15. [22]

    Fr´ ed´ eric Haglund and Daniel T. Wise. Special cube complexes.Geom. Funct. Anal., 17(5):1551–1620, 2008. doi:10.1007/s00039-007-0629-4

    2008 doi

  16. [23]

    Cambridge Univ

    Allen Hatcher.Algebraic Topology. Cambridge Univ. Press, Cambridge, 2002

    2002

  17. [24]

    Convex excess in partial cubes.J

    Sandi Klavˇ zar and Sergey Shpectorov. Convex excess in partial cubes.J. Graph Theory, 69(3-4):356–369, 2012. doi:10.1002/jgt.20589

    2012 doi

  18. [26]

    Oriented matroids and beyond: complexes, partial cubes, and corners

    Kolja Knauer. Oriented matroids and beyond: complexes, partial cubes, and corners. Habilitation Thesis, Aix-Marseille Universit´ e, 2021

    2021

  19. [27]

    J. F. Lawrence. Lopsided sets and orthant-intersection of convex sets.Pacific J. Math., 104(1):155–173, 1983. doi:10.2140/pjm.1983.104.155. 9

    1983 doi

  20. [28]

    H. M. Mulder.The interval function of a graph, volume 132 ofMath. Cent. Tracts. Centrum voor Wiskunde en Informatica (CWI), Amsterdam, 1980

    1980

  21. [29]

    Notes Math.Berlin: Springer, 1997

    J¨ urgen Richter-Gebert.Realization spaces of polytopes, volume 1643 ofLect. Notes Math.Berlin: Springer, 1997. doi:10.1007/BFb0093761

    1997 doi

  22. [30]

    Poc sets, median algebras and group actions

    Martin Roller. Poc sets, median algebras and group actions. Technical report, Univ. of Southampton, 1998

    1998

  23. [31]

    Ends of group pairs and non-positively curved cube complexes.Proc

    Michah Sageev. Ends of group pairs and non-positively curved cube complexes.Proc. London Math. Soc., s3-71(3):585–617, 1995.doi:10.1112/plms/s3-71.3.585

    1995 doi

  24. [32]

    Notes Math.Springer, Cham, 1974

    Jacques Tits.Buildings of spherical type and finite BN-pairs, volume 386 ofLect. Notes Math.Springer, Cham, 1974

    1974

  25. [33]

    Ziegler.Lectures on Polytopes, volume 152 ofGrad

    G¨ unter M. Ziegler.Lectures on Polytopes, volume 152 ofGrad. Texts in Math.Springer–Verlag, New York, 1995. doi:10.1007/978-1-4613-8431-1

    1995 doi

  26. [34]

    Ziegler, Laura Anderson, and Kolja Knauer

    G¨ unter M. Ziegler, Laura Anderson, and Kolja Knauer. Oriented matroids today.The Electronic Journal of Combinatorics, Dynamic Surveys(DS4), 2024.doi:10.37236/25. 10

    2024 doi

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.