pith. sign in

arxiv: 2505.23293 · v3 · pith:R67QLGV4new · submitted 2025-05-29 · 🧮 math.CO · math.GR· math.MG

Cell structure of mediangle graphs

classification 🧮 math.CO math.GRmath.MG
keywords graphsmedianglecellcomplexcomplexescoxetermatroidsoriented
0
0 comments X
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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Weak order on groups generated by involutions

    math.GR 2026-04 unverdicted novelty 7.0

    Involution systems generalize Coxeter systems such that their weak orders are complete meet-semilattices for a broader class including cactus groups, with finite presentations for those with sign characters and new ch...