Combinatorics of normal sequences of braids
From MaRDI portal
Abstract: Many natural counting problems arise in connection with the normal form of braids--and seem to have never been considered so far. Here we solve some of them by analysing the normality condition in terms of the associated permutations, their descents and the corresponding partitions. A number of different induction schemes appear in that framework.
Recommendations
Cites work
- 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 conjugacy problem in Garside groups.
- A new approach to the word and conjugacy problems in the braid groups
- ALGORITHMS FOR POSITIVE BRAIDS
- Artin groups of finite type are biautomatic
- Braids, Links, and Mapping Class Groups. (AM-82)
- Enumeration of pairs of permutations
- Enumeration of pairs of permutations and sequences
- Fragments of the word \(\Delta\) in a braid group
- Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
- Geodesic automation and growth functions for Artin groups of finite type
- Groupes de Garside
- Growth Functions and Automatic Groups
- Growth of the positive braid semigroups
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 1946843 (Why is no real title available?)
- scientific article; zbMATH DE number 1759777 (Why is no real title available?)
- Inverse Relations and Combinatorial Identities
- Les immeubles des groupes de tresses généralises
- Still another approach to the braid ordering.
- THE BRAID GROUP AND OTHER GROUPS
- The dual braid monoid
Cited in
(13)- The rotating normal form of braids is regular
- Experiments on growth series of braid groups
- Dual Garside structure of braids and free cumulants of products.
- A divisibility result in combinatorics of generalized braids
- On a conjecture by Dehornoy
- The relaxation normal form of braids is regular
- Design and serial construction of digraph braids
- Bijective combinatorics of positive braids
- A NORMAL FORM FOR BRAIDS
- Uniform measures on braid monoids and dual braid monoids
- Cataland: why the Fuss?
- Cataland: why the Fuß?
- On the penetration distance in Garside monoids
This page was built for publication: Combinatorics of normal sequences of braids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878008)