English
Related papers

Related papers: On the compatibility of binary sequences

200 papers

We consider two quantities that measure complexity of binary strings: $\mathit{KA}(x)$ is defined as the minus logarithm of continuous a priori probability on the binary tree, and $\mathit{KP}(x)$ denotes prefix complexity of a binary…

Information Theory · Computer Science 2014-01-08 Mikhail Andreev , Akim Kumok

Consider the problem of finding high dimensional approximate nearest neighbors, where the data is generated by some known probabilistic model. We will investigate a large natural class of algorithms which we call bucketing codes. We will…

Information Theory · Computer Science 2016-11-17 Moshe Dubiner

Let $\Omega$ be a smooth bounded domain in $\mathbb{R}^N$ and $\delta(x)=\text{dist}\,(x,\partial \Omega)$. Assume $\mu>0$, $\nu$ is a nonnegative finite measure on $\partial \Omega$ and $g \in C(\Omega \times \mathbb{R}_+)$. We study…

Analysis of PDEs · Mathematics 2015-10-29 Phuoc-Tai Nguyen

We revisit the problem of statistical sequence matching initiated by Unnikrishnan (TIT 2015) and derive theoretical performance guarantees for sequential tests that have bounded expected stopping times. Specifically, in this problem, one is…

Information Theory · Computer Science 2025-06-05 Lin Zhou , Qianyun Wang , Yun Wei , Jingjing Wang

In this paper, we study Bernoulli random sequences, i.e., sequences that are Martin-L\"of random with respect to a Bernoulli measure $\mu_p$ for some $p\in[0,1]$, where we allow for the possibility that $p$ is noncomputable. We focus in…

Logic · Mathematics 2019-03-26 Christopher P. Porter

The distance of a binary operation from being associative can be "measured" by its associative spectrum, an appropriate sequence of positive integers. Particular instances and general properties of associative spectra are studied.

Rings and Algebras · Mathematics 2011-02-11 Béla Csákány , Tamás Waldhauser

Let $M$ and $N$ be fixed non-negative integer numbers and let $\pi_N$ be a polynomial of degree $N$. Suppose that $(P_n)_{n\geq0}$ and $(Q_n)_{n\geq0}$ are two orthogonal polynomial sequences such that %their derivatives of orders $k$ and…

Classical Analysis and ODEs · Mathematics 2019-06-19 K. Castillo , D. Mbouna

We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…

Information Theory · Computer Science 2022-03-30 Jiachun Pan , Yonglong Li , Vincent Y. F. Tan

Deciding which sets of quantum measurements allow a simultaneous readout is a central problem in quantum measurement theory. The problem is relevant not only from the foundational perspective but also has direct applications in quantum…

Quantum Physics · Physics 2025-11-17 Dmitry Grinko , Roope Uola

For any positive integer r, let pi_{2r}(x) denote the number of prime pairs (p, p+2r) with p not exceeding (large) x. According to the prime-pair conjecture of Hardy and Littlewood, pi_{2r}(x) should be asymptotic to 2C_{2r}li_2(x) with an…

Number Theory · Mathematics 2008-06-26 Jacob Korevaar

In 2003, Zhao discovered a curious congruence involving harmonic series and Bernoulli numbers: for any odd prime $p$, $$\sum_{\substack{i,j,k\ge 1\\\gcd(ijk,p)=1\\i+j+k=p}}\frac{1}{ijk}\equiv -2B_{p-3} \pmod{p},$$ where $B_n$ is the $n$-th…

Number Theory · Mathematics 2021-10-20 Shane Chern

We present a strongly exponential lower bound that applies both to the subset synchronization threshold for binary deterministic automata and to the careful synchronization threshold for binary partial automata. In the later form, the…

Formal Languages and Automata Theory · Computer Science 2016-02-16 Vojtěch Vorel

Consider Bernoulli(1/2) percolation on $\Z^d$, and define a perfect matching between open and closed vertices in a way that is a deterministic equivariant function of the configuration. We want to find such matching rules that make the…

Probability · Mathematics 2009-09-08 Adam Timar

Incompatible observables can be approximated by compatible observables in joint measurement or measured sequentially, with constrained accuracy as implied by Heisenberg's original formulation of the uncertainty principle. Recently, Busch,…

We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements,…

Combinatorics · Mathematics 2018-10-16 Colin McDiarmid , David Penman , Vasileios Iliopoulos

We show that in many parametrized families of self-similar measures, their projections, and their convolutions, the set of parameters for which the measure fails to be absolutely continuous is very small - of co-dimension at least one in…

Dynamical Systems · Mathematics 2016-07-29 Pablo Shmerkin , Boris Solomyak

In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…

Discrete Mathematics · Computer Science 2010-07-29 Zan Pan

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…

Number Theory · Mathematics 2016-01-28 Liuquan Wang

Kemnitz Conjecture [9] states that if we take a sequence of elements in $Z_{p}^{2}$ of length $4p-3$, $p$ is a prime number, then it has a subsequence of length $p$, whose sum is $0$ modulo $p$. It is known that in $Z_{p}^{3}$ to get a…

Number Theory · Mathematics 2014-09-10 Satwik Mukherjee

A deterministic sequence of real numbers in the unit interval is called \emph{equidistributed} if its empirical distribution converges to the uniform distribution. Furthermore, the limit distribution of the pair correlation statistics of a…

Number Theory · Mathematics 2016-12-19 Christoph Aistleitner , Thomas Lachmann , Florian Pausinger