In [5], Elnitsky constructed three elegant bijections between classes of reduced words for Type $\mathrm{A}$, $\mathrm{B}$ and $\mathrm{D}$ families of Coxeter groups and certain tilings of polygons. This paper offers a particular generalization of this concept to all finite Coxeter Groups in terms of embeddings into the Symmetric Group. [5] Elnitsky, Serge. Rhombic tilings of polygons and classes of reduced words in Coxeter groups. PhD dissertation, University of Michigan, 1993
Let W be a Coxeter group. We define an element w ε W to be fully commutative if any reduced expressi...
57 pages, 6 figuresInternational audienceFor any finite Coxeter group W, we introduce two new object...
International audienceIt is known that Euler numbers, defined as the Taylor coefficients of the tang...
AbstractIn the standard Coxeter presentation, the symmetric groupSnis generated by the adjacent tran...
In the standard Coxeter presentation, the symmetric group $S\sb{n}$ is generated by the adjacent tra...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2006.Includes bibliogr...
AbstractLet r(w) denote the number of reduced words for an element w in a Coxeter group W. Stanley p...
This dissertation consists of three papers in combinatorial Coxeter group theory. A Coxeter group is...
Let r(w) denote the number of reduced decompositions of the element w of a Coxeter group W. Using th...
Abstract(1) The Poincaré polynomials of the finite irreducible Coxeter groups are derived by an elem...
arXiv : http://arxiv.org/abs/0912.2212International audienceFor any finite Coxeter group $W$, we int...
AbstractLet W be a finite Coxeter group. For a given w∈W, the following assertion may or may not be ...
Let W = (W,S) be a Coxeter group with S the set of its Coxeter genera-tors. Let ≤ be the Bruhat orde...
AbstractIn [R.P. Stanley, The descent set and connectivity set of a permutation, J. Integer Seq. 8 (...
This thesis is concerned with the graph R of all reduced words for the longest element in the Coxete...
Let W be a Coxeter group. We define an element w ε W to be fully commutative if any reduced expressi...
57 pages, 6 figuresInternational audienceFor any finite Coxeter group W, we introduce two new object...
International audienceIt is known that Euler numbers, defined as the Taylor coefficients of the tang...
AbstractIn the standard Coxeter presentation, the symmetric groupSnis generated by the adjacent tran...
In the standard Coxeter presentation, the symmetric group $S\sb{n}$ is generated by the adjacent tra...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2006.Includes bibliogr...
AbstractLet r(w) denote the number of reduced words for an element w in a Coxeter group W. Stanley p...
This dissertation consists of three papers in combinatorial Coxeter group theory. A Coxeter group is...
Let r(w) denote the number of reduced decompositions of the element w of a Coxeter group W. Using th...
Abstract(1) The Poincaré polynomials of the finite irreducible Coxeter groups are derived by an elem...
arXiv : http://arxiv.org/abs/0912.2212International audienceFor any finite Coxeter group $W$, we int...
AbstractLet W be a finite Coxeter group. For a given w∈W, the following assertion may or may not be ...
Let W = (W,S) be a Coxeter group with S the set of its Coxeter genera-tors. Let ≤ be the Bruhat orde...
AbstractIn [R.P. Stanley, The descent set and connectivity set of a permutation, J. Integer Seq. 8 (...
This thesis is concerned with the graph R of all reduced words for the longest element in the Coxete...
Let W be a Coxeter group. We define an element w ε W to be fully commutative if any reduced expressi...
57 pages, 6 figuresInternational audienceFor any finite Coxeter group W, we introduce two new object...
International audienceIt is known that Euler numbers, defined as the Taylor coefficients of the tang...