English
Related papers

Related papers: Compatible sequences and a slow Winkler percolatio…

200 papers

Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler asked the question: for which graphs are two independent walks…

Probability · Mathematics 2011-04-20 Peter Gacs

An ordered pair of semi-infinite binary sequences $(\eta,\xi)$ is said to be compatible if there is a way of removing a certain number (possibly infinite) of ones from $\eta$ and zeroes from $\xi$, whichwould map both sequences to the same…

Probability · Mathematics 2012-04-17 Harry Kesten , Bernardo N. B. de Lima , Vladas Sidoravicius , Maria Eulália Vares

The extent to which a sequence of finite length differs from a shifted version of itself is measured by its aperiodic autocorrelations. Of particular interest are sequences whose entries are 1 or -1, called binary sequences, and sequences…

Information Theory · Computer Science 2016-02-12 Kai-Uwe Schmidt

We apply the Inclusion-Exclusion Principle to a unique pair of prime number subsequences to determine whether these subsequences form a small set or a large set and thus whether the infinite sum of the inverse of their terms converges or…

General Mathematics · Mathematics 2024-02-21 Michael P. May

Nearly linear recurrences are a generalisation of linear recurrences and are instances of linear time-invariant systems in control theory and linear constraint loops in program analysis. In this paper we formulate the Positivity Problem for…

Dynamical Systems · Mathematics 2026-03-04 Amaury Pouly , Mahsa Shirmohammadi , James Worrell

A nondecreasing sequence of positive integers is $(\alpha,\beta)$-Conolly, or Conolly-like for short, if for every positive integer $m$ the number of times that $m$ occurs in the sequence is $\alpha + \beta r_m$, where $r_m$ is $1$ plus the…

Combinatorics · Mathematics 2015-09-10 Alejandro Erickson , Abraham Isgur , Bradley W. Jackson , Frank Ruskey , Stephen M. Tanny

We develop a new multi-scale framework flexible enough to solve a number of problems involving embedding random sequences into random sequences. Grimmett, Liggett and Richthammer asked whether there exists an increasing M-Lipschitz…

Probability · Mathematics 2012-04-20 Riddhipratim Basu , Allan Sly

In this paper, we study existence, equivalence and spectrality of infinite convolutions which may not be compactly supported in $d$-dimensional Euclidean space by manipulating various techniques in probability theory. First, we define the…

Functional Analysis · Mathematics 2025-06-10 Junjie Miao , Hongbo Zhao

Aperiodic autocorrelation is an important indicator of performance of sequences used in communications, remote sensing, and scientific instrumentation. Knowing a sequence's autocorrelation function, which reports the autocorrelation at…

Information Theory · Computer Science 2025-01-07 Daniel J. Katz , Adeebur Rahman , Michael J Ward

A generic uniformly distributed sequence $(x_n)_{n \in \mathbb{N}}$ in $[0,1)$ possesses Poissonian pair correlations (PPC). Vice versa, it has been proven that a sequence with PPC is uniformly distributed. Grepstad and Larcher gave an…

Number Theory · Mathematics 2022-06-30 Christian Weiß

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

Number Theory · Mathematics 2014-06-25 Tewodros Amdeberhan

The main result is the following Theorem: Let p=p(n) be such that p(n) in [0,1] for all n and either p(n)<< n^{-1} or for some positive integer k, n^{-1/k}<< p(n)<< n^{-1/(k+1)} or for all epsilon >0, n^{- epsilon}<< p(n) and n^{-…

Logic · Mathematics 2009-09-25 Saharon Shelah , Joel Spencer

On the complete graph ${\cal{K}}_M$ with $M \ge3$ vertices consider two independent discrete time random walks $\mathbb{X}$ and $\mathbb{Y}$, choosing their steps uniformly at random. A pair of trajectories $\mathbb{X} = \{ X_1, X_2, \dots…

Probability · Mathematics 2014-11-17 Riddhipratim Basu , Vladas Sidoravicius , Allan Sly

We define an index of compatibility for a probabilistic theory (PT). Quantum mechanics with index 0 and classical probability theory with index 1 are at the two extremes. In this way, quantum mechanics is at least as incompatible as any PT.…

Quantum Physics · Physics 2022-09-01 Stan Gudder

Finding the underlying probability distributions of a set of observed sequences under the constraint that each sequence is generated i.i.d by a distinct distribution is considered. The number of distributions, and hence the number of…

Information Theory · Computer Science 2018-10-16 Sara Shahi , Daniela Tuninetti , Natasha Devroye

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…

Probability · Mathematics 2014-03-24 Peter Gacs

Consider a finite set of sources, each producing i.i.d. observations that follow a unique probability distribution on a finite alphabet. We study the problem of matching a finite set of observed sequences to the set of sources under the…

Information Theory · Computer Science 2014-12-09 Jayakrishnan Unnikrishnan

In this paper, by establishing a Borel-Cantelli lemma for a capacity which is not necessarily continuous, and a link between a sequence of independent random variables under the sub-linear expectation and a sequence of independent random…

Probability · Mathematics 2021-09-21 Li-Xin Zhang

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

Number Theory · Mathematics 2017-04-21 Zhi-Wei Sun

Consider a random $n\times n$ zero-one matrix with "density" $p$, sampled according to one of the following two models: either every entry is independently taken to be one with probability $p$ (the "Bernoulli" model), or each row is…

Combinatorics · Mathematics 2021-04-22 Asaf Ferber , Matthew Kwan , Lisa Sauermann
‹ Prev 1 2 3 10 Next ›