English

Virtual permutations and polymorhisms

Representation Theory 2022-03-01 v1 Combinatorics Dynamical Systems Group Theory

Abstract

There is a natural map from a symmetric group SnS_n to a smaller symmetric group Sn1S_{n-1}, we write a decomposition of a permutation into a product of disjoint cycles and remove the element nn from this expression. For this reason there exists the inverse limit S\mathfrak{S} of sets SnS_n. We equip SnS_n with the uniform distribution (or more generally with an Ewens distribution) and get a structure of a measure space on S\mathfrak{S} (it is called 'virtual permutations' or 'Chinese restaurant process'), a double S×SS_\infty\times S_\infty of an infinite symmetric group acts on S\mathfrak{S} by left and right 'multiplications'. We discuss the closure of S×SS_\infty\times S_\infty in the semigroup of polymorphisms (spreading maps with spreaded Radon--Nikodym derivatives) of S\mathfrak{S}. We get formulas for some polymorphisms, in particular for the center of the closure. Expressions are sums of multiple convolutions of Dirichlet distributions, summation sets are certain collections of dessins d'enfant.

Keywords

Cite

@article{arxiv.2202.12978,
  title  = {Virtual permutations and polymorhisms},
  author = {Yury A. Neretin},
  journal= {arXiv preprint arXiv:2202.12978},
  year   = {2022}
}

Comments

35p

R2 v1 2026-06-24T09:54:30.884Z