scholarly journals Trees in Positive Entropy Subshifts

Axioms ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 77
Author(s):  
Ville Salo
Keyword(s):  
Simple Proof ◽  
Binary Trees ◽  
Asymptotic Density ◽  
Positive Entropy

I give a simple proof for the fact that positive entropy subshifts contain infinite binary trees where branching happens synchronously in each branch, and that the branching times form a set with positive lower asymptotic density.

Gray-Code Ranking and Unranking on Left-Weight Sequences of Binary Trees

2016 ◽  
Vol E99.A (6) ◽  
pp. 1067-1074 ◽  
Author(s):  
Ro-Yu WU ◽  
Jou-Ming CHANG ◽  
Sheng-Lung PENG ◽  
Chun-Liang LIU
Keyword(s):  
Gray Code ◽  
Binary Trees

Model sets with positive entropy in Euclidean cut and project schemes

2019 ◽  
Vol 52 (5) ◽  
pp. 1073-1106 ◽  
Author(s):  
Tobias JÄGER ◽  
Daniel LENZ ◽  
Christian OERTEL
Keyword(s):  
Positive Entropy ◽  
Model Sets

Density of sets with missing differences and applications

2021 ◽  
Vol 71 (3) ◽  
pp. 595-614
Author(s):  
Ram Krishna Pandey ◽  
Neha Rai
Keyword(s):  
Number Theory ◽  
Asymptotic Density ◽  
Theory Problem ◽  
Distance Graphs ◽  
Positive Integers ◽  
Infinite Set

Abstract For a given set M of positive integers, a well-known problem of Motzkin asks to determine the maximal asymptotic density of M-sets, denoted by μ(M), where an M-set is a set of non-negative integers in which no two elements differ by an element in M. In 1973, Cantor and Gordon find μ(M) for |M| ≤ 2. Partial results are known in the case |M| ≥ 3 including some results in the case when M is an infinite set. Motivated by some 3 and 4-element families already discussed by Liu and Zhu in 2004, we study μ(M) for two families namely, M = {a, b,a + b, n(a + b)} and M = {a, b, b − a, n(b − a)}. For both of these families, we find some exact values and some bounds on μ(M). This number theory problem is also related to various types of coloring problems of the distance graphs generated by M. So, as an application, we also study these coloring parameters associated with these families.

scholarly journals The set of points with Markovian symbolic dynamics for non-uniformly hyperbolic diffeomorphisms

2020 ◽  
pp. 1-26
Author(s):  
SNIR BEN OVADIA
Keyword(s):  
Symbolic Dynamics ◽  
Full Measure ◽  
Probability Measures ◽  
Positive Entropy ◽  
Surface Diffeomorphisms ◽  
Srb Measures ◽  
Hyperbolic Diffeomorphisms ◽  
Set Of Points ◽  
Math Phys ◽  
Homoclinic Classes

Abstract The papers [O. M. Sarig. Symbolic dynamics for surface diffeomorphisms with positive entropy. J. Amer. Math. Soc.26(2) (2013), 341–426] and [S. Ben Ovadia. Symbolic dynamics for non-uniformly hyperbolic diffeomorphisms of compact smooth manifolds. J. Mod. Dyn.13 (2018), 43–113] constructed symbolic dynamics for the restriction of $C^r$ diffeomorphisms to a set $M'$ with full measure for all sufficiently hyperbolic ergodic invariant probability measures, but the set $M'$ was not identified there. We improve the construction in a way that enables $M'$ to be identified explicitly. One application is the coding of infinite conservative measures on the homoclinic classes of Rodriguez-Hertz et al. [Uniqueness of SRB measures for transitive diffeomorphisms on surfaces. Comm. Math. Phys.306(1) (2011), 35–49].

Load Balancing in Mesh-like Computations using Prediction Binary Trees

2008 ◽  
Author(s):  
Biagio Cosenza ◽  
Gennaro Cordasco ◽  
Rosario De Chiara ◽  
Ugo Erra ◽  
Vittorio Scarano
Keyword(s):  
Load Balancing ◽  
Binary Trees

scholarly journals A simple proof of Andrews’s 5 F 4 evaluation

2013 ◽  
Vol 36 (1-2) ◽  
pp. 165-170 ◽  
Author(s):  
Ira M. Gessel
Keyword(s):  
Simple Proof
Sign in / Sign up

Export Citation Format

Share Document