On the Compatibility of Binary Sequences
From MaRDI portal
Abstract: An ordered pair of semi-infinite binary sequences is said to be compatible if there is a way of removing a certain number (possibly infinite) of ones from and zeroes from , whichwould map both sequences to the same semi-infinite sequence. This notion was introduced by Peter Winkler, who also posed the following question: and being independent i.i.d. Bernoulli sequences with parameters and respectively, does it exist so that the set of compatible pairs has positive measure? It is known that this does not happen for and very close to 1/2. In the positive direction, we construct, for any , a deterministic binary sequence whose set of zeroes has Hausdorff dimension larger than , and such that for small enough, where stands for the product Bernoulli measure with parameter .
Recommendations
- scientific article; zbMATH DE number 2154139
- On a Class of Binary Sequences
- On the existence of periodic complementary binary sequences
- scientific article; zbMATH DE number 5150220
- On aperiodic and periodic complementary binary sequences
- Equivalence Systems on Sets of Binary Sequences
- scientific article; zbMATH DE number 1123791
- On binary recurrence sequences
- On random binary sequences
- On Jacobsthal binary sequences
Cites work
- scientific article; zbMATH DE number 1496578 (Why is no real title available?)
- scientific article; zbMATH DE number 1416163 (Why is no real title available?)
- scientific article; zbMATH DE number 3205162 (Why is no real title available?)
- Compatible Sequences and a Slow Winkler Percolation
- Defining Fractal Subsets of Z d
- Dimensions of fractals in the large
- Lipschitz embeddings of random sequences
- Percolation of arbitrary words in \(\{0, 1\}^ \mathbb{N}\)
- Percolation of arbitrary words in one dimension
Cited in
(8)- Dependent percolation on \(\mathbb{Z}^2\)
- Lipschitz embeddings of random sequences
- Oriented percolation in a random environment
- Compatible sequences and a slow Winkler percolation
- Embedding binary sequences into Bernoulli site percolation on \(\mathbb{Z}^3\)
- Discrete fractals: dimensions, quasi-isometric invariance and self-similarity
- Scheduling of non-colliding random walks
- Sequences of binary strings with relation of conditional simplicity
This page was built for publication: On the Compatibility of Binary Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418793)