Random Operator Approach for Word Enumeration in Braid Groups

Details Random Operator Approach for Word Enumeration in Braid Groups Random Operator Approach for Word Enumeration in Braid Groups

1997-07-11

arxiv.org/abs/cond-mat/9707120v1

Physics

Condensed Matter

Statistical Mechanics

36 pages, LaTeX, 4 separated Postscript figures, submitted to Nucl. Phys. B [PM]

Scientific paper

10.1088/0305-4470/31/26/003

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

Affiliated with

Also associated with

No associations

Rating

Random Operator Approach for Word Enumeration in Braid Groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random Operator Approach for Word Enumeration in Braid Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random Operator Approach for Word Enumeration in Braid Groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-446705