The graphicahedron
From MaRDI portal
Publication:709258
DOI10.1016/J.EJC.2010.03.004zbMATH Open1222.05093arXiv0910.3908OpenAlexW2913036287MaRDI QIDQ709258FDOQ709258
Authors: G. Araujo-Pardo, Mariana López-Dudet, Egon Schulte, María Del Río Francos, Deborah Oliveros
Publication date: 18 October 2010
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Abstract: The paper describes a construction of abstract polytopes from Cayley graphs of symmetric groups. Given any connected graph G with p vertices and q edges, we associate with G a Cayley graph of the symmetric group S_p and then construct a vertex-transitive simple polytope of rank q, called the graphicahedron, whose 1-skeleton (edge graph) is the Cayley graph. The graphicahedron of a graph G is a generalization of the well-known permutahedron; the latter is obtained when the graph is a path. We also discuss symmetry properties of the graphicahedron and determine its structure when G is small.
Full work available at URL: https://arxiv.org/abs/0910.3908
Recommendations
Cites Work
- Title not available (Why is that?)
- Oriented Matroids
- Title not available (Why is that?)
- Abstract Regular Polytopes
- Title not available (Why is that?)
- A simple way to tell a simple polytope from its graph
- Title not available (Why is that?)
- Puzzles and polytope isomorphisms
- Symmetric graphicahedra
- Cayley graphs and symmetric 4-polytopes
- CPR graphs and regular polytopes
- Space tiling zonotopes
- Title not available (Why is that?)
- Combinatorial Properties of Associated Zonotopes
- Root systems and generalized associahedra
- Regular incidence-polytopes with Euclidean or toroidal faces and vertex- figures
- Title not available (Why is that?)
- Eisenstein integers and related \(C\)-groups
- Hermitian forms and locally toroidal regular polytopes
Cited In (12)
- Mirror graphs: graph theoretical characterization of reflection arrangements and finite Coxeter groups
- Cayley graphs for some well-known groups
- Generalized CPR-graphs and applications
- Toric Bruhat interval polytopes
- The correlahedron
- CPR graphs and regular polytopes
- The monodromy group of a truncated simplex
- Capturing polytopal symmetries by coloring the edge-graph
- Symmetric graphicahedra
- On the flag graphs of regular abstract polytopes: Hamiltonicity and Cayley index
- Colorful polytopes and graphs
- Cayley graphs and symmetric 4-polytopes
This page was built for publication: The graphicahedron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709258)