Random operator approach for word enumeration in braid groups
From MaRDI portal
Publication:3836035
Abstract: We investigate analytically the problem of enumeration of nonequivalent primitive words in the braid group B_n for n >> 1 by analysing the random word statistics and the target space on the basis of the locally free group approximation. We develop a "symbolic dynamics" method for exact word enumeration in locally free groups and bring arguments in support of the conjecture that the number of very long primitive words in the braid group is not sensitive to the precise local commutation relations. We consider the connection of these problems with the conventional random operator theory, localization phenomena and statistics of systems with quenched disorder. Also we discuss the relation of the particular problems of random operator theory to the theory of modular functions
Recommendations
- Statistical mechanics of braided Markov chains. I: Analytical methods and numerical simulations
- Statistics of reduced words in locally free and braid groups: Abstract studies and applications to ballistic growth model
- Statistical properties of locally free groups with applications to braid groups and growth of random heaps
- On the limiting power of the set of knots generated by 1+1- and 2+1-braids
Cited in
(6)- Enumeration and generating functions of Rota-Baxter words.
- Statistics of reduced words in locally free and braid groups: Abstract studies and applications to ballistic growth model
- Random Sampling of Trivial Words in Finitely Presented Groups
- On the limiting power of the set of knots generated by 1+1- and 2+1-braids
- Statistical properties of locally free groups with applications to braid groups and growth of random heaps
- Enumeration of Rota-Baxter words
This page was built for publication: Random operator approach for word enumeration in braid groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3836035)