Asymptotics of the Partition of the Cube into Weyl Simplices and an Encoding of a Bernoulli Scheme


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

We suggest a combinatorial method for encoding continuous symbolic dynamical systems. We transform a continuous phase space, the infinite-dimensional cube, into the path space of a tree, and the shift corresponds to a transformation which we called “transfer.” The central problem is that of distinguishability: does the encoding distinguishes between almost all points of the space? The main result says that the encoding by means of the partition of the cube into Weyl simplices has this property.

About the authors

A. M. Vershik

St. Petersburg Department of Steklov Institute of Mathematics, Russian Academy of Sciences; St. Petersburg State University; Institute for Information Transmission Problems, Russian Academy of Sciences

Email: funan@pleiadesonline.com
Russian Federation, St. Petersburg; St. Petersburg; Moscow

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2019 Springer Science+Business Media, LLC, part of Springer Nature