Braid graphs in simply-laced triangle-free Coxeter systems are partial cubes

DOI10.1016/j.ejc.2024.103931arXiv2104.12318OpenAlexW4391669499MaRDI QIDQ6201914

Fadi Awik, Quentin Cadman, Dana C. Ernst, Jadyn Breland

Publication date: 26 March 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.12318

zbMATH Keywords

Fibonacci linkssimply-laced Coxeter systems

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Combinatorial aspects of tessellation and tiling problems (05B45) Symmetric groups (20B30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial cubes: Structures, characterizations, and constructions
• On the number of reduced decompositions of elements of Coxeter groups
• Axioms and hulls
• On commutation classes of reduced words in Weyl groups
• Rhombic tilings of polygons and classes of reduced words in Coxeter groups
• Enumerations relating braid and commutation classes
• Proof of a conjecture of Bergeron, Ceballos and Labbé
• Structure of Fibonacci cubes: a survey
• Structure and enumeration results of matchable Lucas cubes
• Fan realizations of type \(A\) subword complexes and multi-associahedra of rank 3
• Higher Bruhat orders and cyclic hyperplane arrangements
• Reduced decompositions and permutation patterns
• On median nature and enumerative properties of Fibonacci-like cubes

This page was built for publication: Braid graphs in simply-laced triangle-free Coxeter systems are partial cubes