Maximal pattern complexity for discrete systems

By Teturo Kamae, Luca Q. Zamboni. Ergodic Theory and Dynamical Systems, 2002

62 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm (2005, unknown): “From these couplings accurate relative solute geometries and information about solute conformational change can be obtained.”
Combinatorial lemmas and applications to dynamics (2009, background): “is pattern Sturmian [20,21] if p∗(n)= 2n for each n ∈N.”
Sequence entropy and the maximal pattern complexity of infinite words (2002, background): “In fact, in [4], it is proved that for any irrational number θ , there exists a closed set S in R/Z such that the symbolic representation α of the rotation by angle θ with respect to the partition {S, Sc} has the maximal pattern complexity p∗ α(k) = 2 (k = 1, 2, .”
Sturmian and episturmian words: a survey of some recent results (2007, background): “[18] An infinite word w is eventually periodic if and only if cw(k) < 2k for some k ≥ 1.”