Combinatorics of normal sequences of braids
From MaRDI portal
Publication:878008
DOI10.1016/J.JCTA.2006.06.004zbMath1116.05006arXivmath/0511114OpenAlexW2055646784MaRDI QIDQ878008
Publication date: 4 May 2007
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0511114
Related Items (7)
Experiments on growth series of braid groups ⋮ A divisibility result in combinatorics of generalized braids ⋮ Bijective combinatorics of positive braids ⋮ On a conjecture by Dehornoy ⋮ On the penetration distance in Garside monoids ⋮ Uniform measures on braid monoids and dual braid monoids ⋮ Cataland: Why the Fuss?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Artin groups of finite type are biautomatic
- Still another approach to the braid ordering.
- Fragments of the word \(\Delta\) in a braid group
- Growth of the positive braid semigroups
- Enumeration of pairs of permutations
- A Mackey formula in the group of a Coxeter group. With an appendix by J. Tits: Two properties of Coxeter complexes
- A new approach to the word and conjugacy problems in the braid groups
- Geodesic automation and growth functions for Artin groups of finite type
- Les immeubles des groupes de tresses généralises
- A new approach to the conjugacy problem in Garside groups.
- Groupes de Garside
- The dual braid monoid
- Enumeration of pairs of permutations and sequences
- Braids, Links, and Mapping Class Groups. (AM-82)
- ALGORITHMS FOR POSITIVE BRAIDS
- Growth Functions and Automatic Groups
- Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
- Inverse Relations and Combinatorial Identities
- THE BRAID GROUP AND OTHER GROUPS
This page was built for publication: Combinatorics of normal sequences of braids