Virtual permutations and polymorhisms

Abstract

There is a natural map from a symmetric group Sn to a smaller symmetric group Sn-1, we write a decomposition of a permutation into a product of disjoint cycles and remove the element n from this expression. For this reason there exists the inverse limit S of sets Sn. We equip Sn with the uniform distribution (or more generally with an Ewens distribution) and get a structure of a measure space on S (it is called 'virtual permutations' or 'Chinese restaurant process'), a double S∞× S∞ of an infinite symmetric group acts on S by left and right 'multiplications'. We discuss the closure of S∞× S∞ in the semigroup of polymorphisms (spreading maps with spreaded Radon--Nikodym derivatives) of 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…