Non-broken circuits of reflection groups and factorization in \(D_ n\)

DOI10.1007/BF02761652zbMath0839.20053OpenAlexW2021490150MaRDI QIDQ1903117

Alain Goupil, Hélène Barcelo

Publication date: 10 June 1996

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02761652

zbMATH Keywords

Weyl groupsfinite reflection groupsreflectionsOrlik-Solomon algebrasranked posetssystem of rootsgeometric latticesbroken circuitsenumerating polynomialsnon-broken circuits

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Semimodular lattices, geometric lattices (06C10)

Related Items (7)

Unnamed Item ⋮ A generalization of semimodular supersolvable lattice ⋮ On configuration spaces and Whitehouse's lifts of the Eulerian representations ⋮ Why the characteristic polynomial factors ⋮ Eulerian representations for real reflection groups ⋮ Cohomology of pure braid groups of exceptional cases. ⋮ Lattices of parabolic subgroups in connection with hyperplane arrangements

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorics and topology of complements of hyperplanes
• Generalized exponents of a free arrangement of hyperplanes and Shepherd- Todd-Brieskorn formula
• Signed graphs
• A generalization of semimodular supersolvable lattice
• A logical expansion in mathematics
• Invariants of Finite Reflection Groups
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• Finite Unitary Reflection Groups

This page was built for publication: Non-broken circuits of reflection groups and factorization in \(D_ n\)