Random operator approach for word enumeration in braid groups

From MaRDI portal
Publication:3836035

DOI10.1088/0305-4470/31/26/003zbMATH Open0954.82008arXivcond-mat/9707120OpenAlexW3100137614MaRDI QIDQ3836035FDOQ3836035


Authors: Alain Comtet, S. Nechaev Edit this on Wikidata


Publication date: 6 December 1999

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

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


Full work available at URL: https://arxiv.org/abs/cond-mat/9707120




Recommendations




Cited In (5)





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)