Tail fields generated by symbol counts in measure-preserving systems

Karl Petersen; Jean-Paul Thouvenot

Colloquium Mathematicae (2004)

  • Volume: 101, Issue: 1, page 9-23
  • ISSN: 0010-1354

Abstract

top
A finite-state stationary process is called (one- or two-sided) super-K if its (one- or two-sided) super-tail field-generated by keeping track of (initial or central) symbol counts as well as of arbitrarily remote names-is trivial. We prove that for every process (α,T) which has a direct Bernoulli factor there is a generating partition β whose one-sided super-tail equals the usual one-sided tail of β. Consequently, every K-process with a direct Bernoulli factor has a one-sided super-K generator. (This partially answers a question of Petersen and Schmidt.)

How to cite

top

Karl Petersen, and Jean-Paul Thouvenot. "Tail fields generated by symbol counts in measure-preserving systems." Colloquium Mathematicae 101.1 (2004): 9-23. <http://eudml.org/doc/286588>.

@article{KarlPetersen2004,
abstract = {A finite-state stationary process is called (one- or two-sided) super-K if its (one- or two-sided) super-tail field-generated by keeping track of (initial or central) symbol counts as well as of arbitrarily remote names-is trivial. We prove that for every process (α,T) which has a direct Bernoulli factor there is a generating partition β whose one-sided super-tail equals the usual one-sided tail of β. Consequently, every K-process with a direct Bernoulli factor has a one-sided super-K generator. (This partially answers a question of Petersen and Schmidt.)},
author = {Karl Petersen, Jean-Paul Thouvenot},
journal = {Colloquium Mathematicae},
keywords = {tail field; -system; super- system; Bernoulli system; exchangeable algebra; entropy},
language = {eng},
number = {1},
pages = {9-23},
title = {Tail fields generated by symbol counts in measure-preserving systems},
url = {http://eudml.org/doc/286588},
volume = {101},
year = {2004},
}

TY - JOUR
AU - Karl Petersen
AU - Jean-Paul Thouvenot
TI - Tail fields generated by symbol counts in measure-preserving systems
JO - Colloquium Mathematicae
PY - 2004
VL - 101
IS - 1
SP - 9
EP - 23
AB - A finite-state stationary process is called (one- or two-sided) super-K if its (one- or two-sided) super-tail field-generated by keeping track of (initial or central) symbol counts as well as of arbitrarily remote names-is trivial. We prove that for every process (α,T) which has a direct Bernoulli factor there is a generating partition β whose one-sided super-tail equals the usual one-sided tail of β. Consequently, every K-process with a direct Bernoulli factor has a one-sided super-K generator. (This partially answers a question of Petersen and Schmidt.)
LA - eng
KW - tail field; -system; super- system; Bernoulli system; exchangeable algebra; entropy
UR - http://eudml.org/doc/286588
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.