Related papers: Some Connections Between Discrepancy, Finite Gap P…
In this paper, we consider the {\it generalized polynomial complementarity problem} (GPCP), which covers the recently introduced {\it polynomial complementarity problem} (PCP) and the well studied {\it tensor complementarity problem} (TCP)…
The classic example of a low-discrepancy sequence in $\mathbb{Z}_p$ is $(x_n) = an+b$ with $a \in \mathbb{Z}_p^x$ and $b \in \mathbb{Z}_p$. Here we address the non-linear case and show that a polynomial $f$ generates a low-discrepancy…
Optical orthogonal codes (OOCs) are sets of $(0,1)$-sequences with good auto- and cross-correlation properties. They were originally introduced for use in multi-access communication, particularly in the setting of optical CDMA…
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…
This paper adresses the question whether the $LS$-sequences constructed by Carbone yield indeed a new family of low discrepancy sequences. While it is well known that the case $S=0$ corresponds to van der Corput sequences, we prove here…
In this article we prove that if the additive energy of a strictly increasing sequence $(a_n)$ of natural numbers is less than $N^3/(\log N)^C$ for some $C\geq13.155$, then $(\{a_n\alpha\})$ has Poissonian pair correlation for almost all…
We investigate random spatially coupled low-density parity-check (SC-LDPC) code ensembles over finite fields. Under different variable-node edge-spreading rules, the random Tanner graphs of several coupled ensembles are defined by multiple…
Optimal gap sequences in Shellsort, defined as gap sequences having the minimised maximum number of comparisons for a fixed number of pairwise distinct elements, are found by minimax search in reduced permutational spaces, namely Bad…
The determinant lower bound of Lovasz, Spencer, and Vesztergombi [European Journal of Combinatorics, 1986] is a powerful general way to prove lower bounds on the hereditary discrepancy of a set system. In their paper, Lovasz, Spencer, and…
We present a new family of low-density parity-check (LDPC) convolutional codes that can be designed using ordered sets of progressive differences. We study their properties and define a subset of codes in this class that have some desirable…
In 1931, Van der Corput showed that if for each positive integer $s$, the sequence $\{x_{n+s}-x_n\}$ is uniformly distributed (mod 1), then the sequence $x_n$ is uniformly distributed (mod 1). The converse of above result is surprisingly…
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…
Holroyd and Propp used Hall's marriage theorem to show that, given a probability distribution pi on a finite set S, there exists an infinite sequence s_1,s_2,... in S such that for all integers k >= 1 and all s in S, the number of i in…
Elkies and McMullen [Duke Math.J.~123 (2004) 95--139] have shown that the gaps between the fractional parts of \sqrt n for n=1,\ldots,N, have a limit distribution as N tends to infinity. The limit distribution is non-standard and differs…
We show that sequences of the form $\alpha n^{\theta} \pmod{1}$ with $\alpha > 0$ and $0 < \theta < \tfrac{43}{117} = \tfrac{1}{3} + 0.0341 \ldots$ have Poissonian pair correlation. This improves upon the previous result by Lutsko,…
We prove a generalization of van der Corput's Difference Theorem in the theory of uniform distribution by establishing a connection with unitary operators that have Lebesgue spectrum. This allows us to show, for example, that if $(x_n)_{n =…
Discrepancy is a well-known measure for the irregularity of the distribution of a point set. Point sets with small discrepancy are called low-discrepancy and are known to efficiently fill the space in a uniform manner. Low-discrepancy…
George R. Terrell (1983, {Ann. Probab., vol. 11(3), pp. 823--826) showed that the Pearson coefficient of correlation of an ordered pair from a random sample of size two is at most one-half, and the equality is attained only for rectangular…
The well-known "Janson's inequality" gives Poisson-like upper bounds for the lower tail probability \Pr(X \le (1-\eps)\E X) when X is the sum of dependent indicator random variables of a special form. We show that, for large deviations,…
In this paper, we study the power and limitations of computing effectively generic sequences using effectively random oracles. Previously, it was known that every 2-random sequence computes a 1-generic sequence (as shown by Kautz) and every…