On the length of fully commutative elements

DOI10.1090/tran/7183zbMath1388.05195arXiv1511.08788OpenAlexW2272070983MaRDI QIDQ4642523

Philippe Nadeau

Publication date: 23 May 2018

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.08788

zbMATH Keywords

reduced expressionsCoxeter groupsrational functionsfinite automataTemperley-Lieb algebrafully commutative elementsperiodic sequencesCoxeter length

Mathematics Subject Classification ID

Related Items (3)

RSK tableaux and the weak order on fully commutative permutations ⋮ On inversion triples and braid moves ⋮ Length enumeration of fully commutative elements in finite and affine Coxeter groups

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata, reduced words and Garside shadows in Coxeter groups.
• The center of the affine nilTemperley-Lieb algebra
• Fully commutative elements in finite and affine Coxeter groups
• The enumeration of fully commutative affine permutations
• Hecke algebra representations of braid groups and link polynomials
• A finiteness property and an automatic structure for Coxeter groups
• Nilpotent orbits and commutative elements
• Computing global extension modules
• Noncommutative Schur functions and their applications
• On the fully commutative elements of Coxeter groups
• Affine approach to quantum Schubert calculus
• Combinatorics of Coxeter Groups
• Growth of generalized Temperley–Lieb algebras connected with simple graphs
• Some combinatorial aspects of reduced words in finite Coxeter groups
• Introduction
• Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
• Inhomogeneous sorting

This page was built for publication: On the length of fully commutative elements