Abstract
AbstractWe study the cycle structure of words in several random permutations. We assume that the permutations are independent and that their distribution is conjugation invariant, with a good control on their short cycles. If, after successive cyclic simplifications, the word still contains at least two different letters, then we get a universal limiting joint law for short cycles for the word in these permutations. These results can be seen as an extension of our previous work (Kammoun and Maïda. Electron. Commun. Probab. 2020;25:1‐14.) from the product of permutations to any non‐trivial word in the permutations and also as an extension of the results of Nica (Random Struct. Algorithms1994;5:703‐730.) from uniform permutations to general conjugation invariant random permutations. In particular, we get optimal assumptions in the case of the commutator of two such random permutations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
