On minimal lengths of expressions of Coxeter group elements as products of reflections
By M. Dyer. 2001
53 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Discrete Mathematics and Combinatorics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/3f490a33bf5ec09828fcc0bf4c66fc2b476b5bc7
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Discrete Mathematics and Combinatorics
- Henning Krause
- Andrew Hubery
- Ralf Schiffler
- Kiyoshi Igusa
- Axel Hultman
- Gregg Musiker
- Ilke Çanakçi
- Greg Muller
In Geometry and Topology
- Andrew Hubery
- Henning Krause
- Ralf Schiffler
- Kiyoshi Igusa
- Axel Hultman
- B. Keller
- Osamu Iyama
- I. Reiten
Citations in the corpus
- Exceptional sequences and clusters (2009, background): “By [10], the Coxeter element cannot be written as a product of fewer than n reflections, which implies that k = 1.”
- Fixed points of involutive automorphisms of the Bruhat order (2004, background): “Dyer [7] showed that the absolute length l(w) of an element w ∈ W is equal to the smallest number of generators that need to be deleted in any reduced expression for w in order to obtain the identity element e.”
- A categorification of non-crossing partitions (2013, background): “For another description of this length we refer to [19].”