Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 57 min ago
PreprintCC BY-NC-ND 4.0HAL

Cell structure of mediangle graphs

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.

Related

  1. Rotation groups, mediangle graphs, and periagroups: A unified point of view on Coxeter groups and graph products of groups
    Anthony Genevois
    Groups Geometry and DynamicsPeer-reviewedCC BY13 citedGeometry & topologyOpenAlex
  2. On the structure of the sandpile identity element on Sierpiński gasket graphs.
    Robin Kaiser, Ecaterina Sava-Huss, Julia Überbacher
    Computational & applied mathematicsPeer-reviewedCC BYFull textMathematical physicsEurope PMC
  3. On the Connected Components of Structure Graphs of Associative Rings
    Andrey M. Chernev, Nikolay A. Chernev
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. The parameterised complexity of generalised temporal domination on temporal graphs with modular structure
    Jessica Enright, Kitty Meeks, Elena Moss
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. Walk/Zeta correspondence for quantum walks on path graphs: a pre-geometric structure implied by a generalized reflection principle
    Jiro Akahori, Riki Kitano, Norio Konno +1
    arXivPreprintarXiv licenceFull textMathematical physicsProbabilityarXiv
BibTeX
@misc{chepoi2026cell,
  title = {{Cell structure of mediangle graphs}},
  author = {Victor Chepoi and Anthony Genevois and Kolja Knauer},
  howpublished = {HAL},
  year = {2026},
  month = sep,
  eprint = {2505.23293},
  archivePrefix = {arXiv},
  url = {https://hal.science/hal-05768723v1},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - Cell structure of mediangle graphs
AU  - Victor Chepoi
AU  - Anthony Genevois
AU  - Kolja Knauer
PY  - 2026
DA  - 2026/09/29
PB  - HAL
UR  - https://hal.science/hal-05768723v1
AB  - 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.
ER  -