Length enumeration of fully commutative elements in finite and affine Coxeter groups
From MaRDI portal
Publication:1786472
DOI10.1016/J.JALGEBRA.2018.06.009zbMATH Open1402.20050arXiv1612.07591OpenAlexW2962745852WikidataQ129586951 ScholiaQ129586951MaRDI QIDQ1786472FDOQ1786472
Authors: Riccardo Biagioli, Mireille Bousquet-Mélou, Frédéric Jouhet, Philippe Nadeau 
Publication date: 24 September 2018
Published in: Journal of Algebra (Search for Journal in Brave)
Abstract: An element w of a Coxeter group W is said to be fully commutative, if any reduced expression of w can be obtained from any other by transposing adjacent pairs of generators. These elements were described in 1996 by Stembridge in the case of finite irreducible groups, and more recently by Biagioli, Jouhet and Nadeau (BJN) in the affine cases. We focus here on the length enumeration of these elements. Using a recursive description, BJN established for the associated generating functions systems of non-linear q-equations. Here, we show that an alternative recursive description leads to explicit expressions for these generating functions.
Full work available at URL: https://arxiv.org/abs/1612.07591
Recommendations
- The enumeration of fully commutative elements of Coxeter groups
- Fully commutative elements in finite and affine Coxeter groups
- Characterization of cyclically fully commutative elements in finite and affine Coxeter groups
- On the fully commutative elements of Coxeter groups
- Long fully commutative elements in affine Coxeter groups.
- Length of involutions and classification of finite Coxeter groups
- Lengths of involutions in finite Coxeter groups
- On the cyclically fully commutative elements of Coxeter groups.
- Lengths of subsets in Coxeter groups.
- Combinatorics of fully commutative involutions in classical Coxeter groups
Exact enumeration problems, generating functions (05A15) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Reflection and Coxeter groups (group-theoretic aspects) (20F55)
Cites Work
- Title not available (Why is that?)
- Combinatorics of Coxeter Groups
- Combinatorics of fully commutative involutions in classical Coxeter groups
- Some combinatorial aspects of reduced words in finite Coxeter groups
- Title not available (Why is that?)
- A method for the enumeration of various classes of column-convex polygons
- Title not available (Why is that?)
- Some combinatorial properties of Schubert polynomials
- Combinatorial problems of commutation and rearrangements
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- On the fully commutative elements of Coxeter groups
- The enumeration of fully commutative affine permutations
- Non-commutative elimination in Ore algebras proves multivariate identities
- On 321-avoiding permutations in affine Weyl groups
- The enumeration of fully commutative elements of Coxeter groups
- Fully commutative elements in finite and affine Coxeter groups
- Coding the convex polyominoes and equations for the enumeration according to the area
- Some permutations with forbidden subsequences and their inversion number
- Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes)
- A \(q\)-enumeration of convex polyominoes by the festoon approach
- Exact solution of the discrete \((1+1)\)-dimensional SOS model with field and surface interactions
- Critical exponents from nonlinear functional equations for partially directed cluster models
- Long fully commutative elements in affine Coxeter groups.
- Title not available (Why is that?)
- The generating function of convex polyominoes: The resolution of a \(q\)- differential system
- An alternative method for \(q\)-counting directed column-convex polyominoes.
- Rational solutions of linear difference and \(q\)-differential equations with polynomial coefficients
- Asymptotic bounds for the number of convex \(n\)-ominoes
- On the length of fully commutative elements
- 321-avoiding affine permutations, heaps, and periodic parallelogram polyominoes
- Periodic parallelogram polyominoes
Cited In (20)
- On inversion triples and braid moves
- Long fully commutative elements in affine Coxeter groups.
- On the cyclically fully commutative elements of Coxeter groups.
- Fully commutative elements and lattice walks
- On the length of fully commutative elements
- A note on fully commutative elements in complex reflection groups
- Block number, descents and Schur positivity of fully commutative elements in \(B_n\)
- 321-avoiding affine permutations and their many heaps
- The enumeration of fully commutative affine permutations
- Characterization of cyclically fully commutative elements in finite and affine Coxeter groups
- The Jones-Wenzl idempotent of a generalized Temperley-Lieb algebra
- Enumerating in Coxeter groups (survey)
- Fully commutative elements of the complex reflection groups
- The enumeration of fully commutative affine permutations
- Combinatorics of fully commutative involutions in classical Coxeter groups
- Maximal length elements of excess zero in finite Coxeter groups
- Fully commutative elements in finite and affine Coxeter groups
- On 321-avoiding permutations in affine Weyl groups
- The enumeration of fully commutative elements of Coxeter groups
- A root system criterion for fully commutative and short braid-avoiding elements in affine Weyl groups
Uses Software
This page was built for publication: Length enumeration of fully commutative elements in finite and affine Coxeter groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786472)
