Related papers: The Discrepancy of the Lex-Least De Bruijn Sequenc…
The discrepancy of a binary string refers to the maximum (absolute) difference between the number of ones and the number of zeroes over all possible substrings of the given binary string. We provide an investigation of the discrepancy of…
The discrepancy of a binary string is the maximum (absolute) difference between the number of ones and the number of zeroes over all possible substrings of the given binary string. In this note we determine the minimal discrepancy that a…
The skew of a binary string is the difference between the number of zeroes and the number of ones, while the length of the string is the sum of these two numbers. We consider certain suffixes of the lexicographically-least de Bruijn…
We study a finite form of the classical interval discrepancy problem. Starting from the unit interval, one repeatedly splits an existing interval into two until $n$ intervals have been produced. The discrepancy of such a process is the…
M. Levin defined a real number $x$ that satisfies that the sequence of the fractional parts of $(2^n x)_{n\geq 1}$ are such that the first $N$ terms have discrepancy $O((\log N)^2/ N)$, which is the smallest discrepancy known for this kind…
A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing a zero from the longest run of zeros in a binary de Bruijn sequence. The minimal polynomial of the modified sequence is its unique…
We study the tandem duplication distance between binary sequences and their roots. In other words, the quantity of interest is the number of tandem duplication operations of the form $\seq x = \seq a \seq b \seq c \to \seq y = \seq a \seq b…
The aims of this paper are twofold. First, it discusses the Littlewood conjecture and its variants with respect to uniformly distributed sequences. The second aim is to determine the exact order of the discrepancy of the van der…
Mordechay B. Levin has constructed a number $\lambda$ which is normal in base 2, and such that the sequence $(\left\{2^n \lambda\right\})_{n=0,1,2,\ldots}$ has very small discrepancy $D_N$. Indeed we have $N\cdot D_N = \mathcal{O}…
We classify all binary error correcting completely regular codes of length $n$ with minimum distance $\delta>n/2$.
The discrepancy of the $n \times n$ greater-than matrix is shown to be $\frac{\pi}{2 \ln n}$ up to lower order terms.
The deletion distance between two binary words $u,v \in \{0,1\}^n$ is the smallest $k$ such that $u$ and $v$ share a common subsequence of length $n-k$. A set $C$ of binary words of length $n$ is called a $k$-deletion code if every pair of…
Mordechay Levin has constructed a number $\alpha$ which is normal in base 2, and such that the sequence $\left\{2^n \alpha\right\}_{n=0,1,2,\ldots}$ has very small discrepancy $D_N$. Indeed we have $N\cdot D_N = \mathcal{O} \left(\left(\log…
We investigate the asymptotic standard deviation of the Longest Common Subsequence (LCS) of two independent i.i.d. sequences of length n. The first sequence is drawn from a three letter alphabet {0,1,a}, whilst the second sequence is…
In parametric sequence alignment, optimal alignments of two sequences are computed as a function of the penalties for mismatches and spaces, producing many different optimal alignments. Here we give a 3/(2^{7/3}\pi^{2/3})n^{2/3} +O(n^{1/3}…
Let $d_N=ND_N(\omega)$ be the discrepancy of the Van der Corput sequence in base $2$. We improve on the known bounds for the number of indices $N$ such that $d_N\leq \log N/100$. Moreover, we show that the summatory function of $d_N$…
Let $(H(n))_{n \geq 0} $ be a $2-$dimensional Halton's sequence. Let $D_{2} ( (H(n))_{n=0}^{N-1}) $ be the $L_2$-discrepancy of $ (H_n)_{n=0}^{N-1} $. It is known that $\limsup_{N \to \infty } (\log N)^{-1} D_{2} ( H(n) )_{n=0}^{N-1} >0$.…
A combinatorial rectangle may be viewed as a matrix whose entries are all +-1. The discrepancy of an m by n matrix is the maximum among the absolute values of its m row sums and n column sums. In this paper, we investigate combinatorial…
Motivated by the celebrated Beck-Fiala conjecture, we consider the random setting where there are $n$ elements and $m$ sets and each element lies in $t$ randomly chosen sets. In this setting, Ezra and Lovett showed an $O((t \log t)^{1/2})$…
Four problems related to information divergence measures defined on finite alphabets are considered. In three of the cases we consider, we illustrate a contrast which arises between the binary-alphabet and larger-alphabet settings. This is…