Asymptotics of the partition of the cube into Weyl simplices and an encoding of a Bernoulli scheme

DOI10.1134/S0016266319020023zbMATH Open1427.37033arXiv1904.02924OpenAlexW2963841085WikidataQ127493423 ScholiaQ127493423MaRDI QIDQ2278741FDOQ2278741

Authors: A. M. Vershik 

Publication date: 10 December 2019

Published in: Functional Analysis and Its Applications (Search for Journal in Brave)

Abstract: We suggest a combinatorial method of encoding continuous symbolic dynamical systems. A~continuous phase space, the infinite-dimensional cube, turns into the path space of a tree, and the shift is mapped to a transformation which was called a "transfer." The central problem is that of distinguishability: does the encoding separate almost all points of the space? The main result says that the partition of the cube into Weyl simplices satisfies this property.footnote{{it Keywords:} combinatorial encoding, transfer, Bernoulli scheme, graded graph.

Full work available at URL: https://arxiv.org/abs/1904.02924

Recommendations

• On the asymptotics of higher dimensional partitions
• scientific article; zbMATH DE number 2114726
• Enumeration and asymptotic formulas for rectangular partitions of the hypercube
• Estimating the asymptotic behavior of the entropy of an invariant sequence of partitions of the infinite-dimensional cube
• On approximation of asymmetric separators of the \(n\)-cube
• Weyl sequences: Asymptotic distributions of the partition lengths
• Asymptotics and inequalities for partitions into squares
• The asymptotics of plane partitions with fixed volumes of diagonal parts
• Estimating the asymptotics of solid partitions
• Asymptotics of several-partition Hurwitz numbers

zbMATH Keywords

graded graphtransferBernoulli schemecombinatorial encoding

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Combinatorial dynamics (types of periodic orbits) (37E15)

Cites Work

• Title not available (Why is that?)
• Robinson-Schensted-Knuth algorithm, jeu de taquin, and Kerov-Vershik measures on infinite tableaux
• Classification of measurable functions of several variables and invariantly distributed random matrices
• LECTURES ON THE ENTROPY THEORY OF MEASURE-PRESERVING TRANSFORMATIONS
• The Characters of the Infinite Symmetric Group and Probability Properties of the Robinson–Schensted–Knuth Algorithm
• The universal minimal system for the group of homeomorphisms of the Cantor set
• Harmonic analysis on the infinite symmetric group
• Jeu de taquin dynamics on infinite Young tableaux and second class particles
• The theory of filtrations of subalgebras, standardness, and independence
• Three theorems on the uniqueness of the Plancherel measure from different viewpoints

Cited In (5)

• A method of defining central and Gibbs measures and the ergodic method
• On approximation of asymmetric separators of the \(n\)-cube
• Estimating the asymptotic behavior of the entropy of an invariant sequence of partitions of the infinite-dimensional cube
• The problem of combinatorial encoding of a continuous dynamics and the notion of transfer of paths in graphs
• Combinatorial encoding of Bernoulli schemes and the asymptotic behavior of Young tableaux

This page was built for publication: Asymptotics of the partition of the cube into Weyl simplices and an encoding of a Bernoulli scheme

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2278741)