Combinatorics of normal sequences of braids

DOI10.1016/J.JCTA.2006.06.004MaRDI QIDQ878008zbMATH OpenOpenAlexFDO

Authors Patrick Dehornoy

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

zbMATH Keywords

generating functionnormal formcountingbraid groupfundamental braid

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Braid groups; Artin groups (20F36)

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

• A NORMAL FORM FOR BRAIDS
• Normal forms of random braids.
• The rotating normal form of braids is regular
• Alternating normal forms for braids and locally Garside monoids.
• Dual Garside structure of braids and free cumulants of products.

Cites work

• 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?)
• 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
• 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

(12)

• Cataland: why the Fuss?
• Design and serial construction of digraph braids
• A divisibility result in combinatorics of generalized braids
• Experiments on growth series of braid groups
• Bijective combinatorics of positive braids
• Dual Garside structure of braids and free cumulants of products.
• The relaxation normal form of braids is regular
• Uniform measures on braid monoids and dual braid monoids
• A NORMAL FORM FOR BRAIDS
• The rotating normal form of braids is regular
• On the penetration distance in Garside monoids
• On a conjecture by Dehornoy

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)