On the penetration distance in Garside monoids
DOI10.1016/j.jalgebra.2016.01.003zbMath1380.20038arXiv1403.2669OpenAlexW1482807877MaRDI QIDQ908363
Publication date: 4 February 2016
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.2669
normal formsregular languageArtin monoidsrandom elementsGarside monoidspenetration distanceessential transitivity
Free semigroups, generators and relations, word problems (20M05) Braid groups; Artin groups (20F36) Asymptotic properties of groups (20F69) Means on groups, semigroups, etc.; amenable groups (43A07) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Normal forms of random braids.
- Combinatorics of normal sequences of braids
- Zappa-Szép products of Garside monoids
- Random walks on discrete groups: Boundary and entropy
- Geodesic automation and growth functions for Artin groups of finite type
- On the Collatz-Wielandt sets associated with a cone-preserving map
- On the genericity of pseudo-Anosov braids. I: Rigid braids.
- Foundations of Garside theory
- Randomly growing braid on three strands and the Manta Ray
- Parabolic subgroups of Garside groups.
- Les immeubles des groupes de tresses généralises
- Artin-Gruppen und Coxeter-Gruppen
- Combinatorics of Coxeter Groups
- Groupes de Garside
- Combinatorial Complexity of Regular Languages
- Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
- The Complete Enumeration of Finite Groups of the Form Ri2=(RiRj)kij=1
- Random Walks on Infinite Graphs and Groups
- The center of thin Gaussian groups
This page was built for publication: On the penetration distance in Garside monoids