Clairvoyant embedding in one dimension

Details Clairvoyant embedding in one dimension Clairvoyant embedding in one dimension

2012-04-22

arxiv.org/abs/1204.4897v1

Mathematics

Probability

48 pages. arXiv admin note: substantial text overlap with arXiv:math/0109152

Scientific paper

Let v, w be infinite 0-1 sequences, and m a positive integer. We say that w is m-embeddable in v, if there exists an increasing sequence n_{i} of integers with n_{0}=0, such that 0< n_{i} - n_{i-1} < m, w(i) = v(n_i) for all i > 0. Let X and Y be independent coin-tossing sequences. We will show that there is an m with the property that Y is m-embeddable into X with positive probability. This answers a question that was open for a while. The proof generalizes somewhat the hierarchical method of an earlier paper of the author on dependent percolation.

Affiliated with

Also associated with

No associations

Rating

Clairvoyant embedding in one dimension does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Clairvoyant embedding in one dimension, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clairvoyant embedding in one dimension will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-522882