Answers are grounded in this paper and cite their sources.
Let w ≠ 1 be a free word in the symbols g 1 ,…, g k and their inverses (i.e., an element of the free group F k ). For any s 1 ,…, s k , in the group s n of all permutation of n objects, we denote by w ( s 1 ,…, s k ) ϵ S n the permutation obtained by replacing g 1 ,…, g k with s 1 ,…, s k in the expression of w . Let X ( s 1 ,…, s k ) denote the number of cycles of length L of w ( s 1 ,…, s k ). For fixed w and L , we show that X , viewed as a random variable on S n k , has (for n →∞) a Poisson‐type limit distribution, which can be computed precisely.
No takes yet. Share an insight, caveat, or question.
Alexandru Nica (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: