1. Definitions. An infinite countable ordered set {P,≻, ∅} with minimal element ∅ and no maximal elements is called a locally finite poset if all its principal ideals are finite. A monotone numbering of P (or a part of P ) is an injective map φ : N → P from the set of positive integers to P satisfying the following conditions: if φ(n) ≻ φ(m), then n > m, with φ(0) = ∅. The distributive lattice ΓP of all finite ideals of a locally finite poset {P,≻} forms an N-graded graph (the Hasse diagram of the lattice). A monotone numbering of P can be identified in a natural way with a maximal path in the lattice ΓP . The set TP of all monotone numberings of P , that is, the space of infinite paths in the graph ΓP can be endowed with the natural structure of a Borel and topological space. In the terminology related to the Young graph, the poset P is the set of Z+-finite ideals, that is, Young diagrams, and monotone numberings are Young tableaux. Let P be a finite (|P | < n ∈ N) or locally finite (n = ∞) poset. For each i < n, we define an involution σi acting correctly on the space of numberings TP = {φ} of P :
[1]
A.Vershik.
Three theorems on the uniqueness of the Plancherel measure from different viewpoints
,
2018,
1812.03081.
[2]
A.Vershik,et al.
Ergodicity and totality of partitions associated with the RSK correspondence
,
2021,
2101.06080.
[3]
Nurdin Useev.
tr
,
2019,
MANAS Sosyal Araştırmalar Dergisi.
[4]
Richard L Gregory,et al.
Zap!
,
1991,
IEEE Spectrum.
[5]
A. Vershik,et al.
Groups Generated by Involutions of Diamond-Shaped Graphs, and Deformations of Young’s Orthogonal Form
,
2019,
Journal of Mathematical Sciences.