Non-broken circuits of reflection groups and factorization in D_ n
DOI10.1007/BF02761652zbMATH Open0839.20053OpenAlexW2021490150MaRDI QIDQ1903117FDOQ1903117
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
reflectionsfinite reflection groupsWeyl groupsOrlik-Solomon algebrasranked posetssystem of rootsgeometric latticesbroken circuitsenumerating polynomialsnon-broken circuits
Exact enumeration problems, generating functions (05A15) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Semimodular lattices, geometric lattices (06C10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Signed graphs
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Generalized exponents of a free arrangement of hyperplanes and Shepherd- Todd-Brieskorn formula
- Finite Unitary Reflection Groups
- Combinatorics and topology of complements of hyperplanes
- Invariants of Finite Reflection Groups
- A logical expansion in mathematics
- A generalization of semimodular supersolvable lattice
Cited In (7)
- On configuration spaces and Whitehouse's lifts of the Eulerian representations
- A generalization of semimodular supersolvable lattice
- Lattices of parabolic subgroups in connection with hyperplane arrangements
- Why the characteristic polynomial factors
- Eulerian representations for real reflection groups
- Cohomology of pure braid groups of exceptional cases.
- Title not available (Why is that?)
This page was built for publication: Non-broken circuits of reflection groups and factorization in \(D_ n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1903117)