Related papers: Completely uniformly distributed sequences based o…
We study universal compression of sequences generated by monotonic distributions. We show that for a monotonic distribution over an alphabet of size $k$, each probability parameter costs essentially $0.5 \log (n/k^3)$ bits, where $n$ is the…
The de Bruijn torus (or grid) problem looks to find an $n$-by-$m$ binary matrix in which every possible $j$-by-$k$ submatrix appears exactly once. The existence and construction of these binary matrices was determined in the 70's, with…
We generalize the notion of a de Bruijn sequence to a "multi de Bruijn sequence": a cyclic or linear sequence that contains every k-mer over an alphabet of size q exactly m times. For example, over the binary alphabet {0,1}, the cyclic…
We study the problem of constructing sequences $(x_n)_{n=1}^{\infty}$ on $[0,1]$ in such a way that $$ D_N^* = \sup_{0 \leq x \leq 1} \left| \frac{ \left\{1 \leq i \leq N: x_i \leq x \right\}}{N} - x \right|$$ is uniformly small. A result…
The concept of uniform distribution in $[0,1]$ is extended for a certain strictly separated maximal (in the sense of cardinality) family $(\lambda_t)_{t \in [0,1]}$ of invariant extensions of the linear Lebesgue measure $\lambda$ in…
In this paper we will study uniformly distributed sequences of partitions of [0,1], a concept which has been introduced by Kakutani in 1976. We will construct new families of u.d. sequences of partitions and study relations with the…
By a classical theorem of Koksma the sequence of fractional parts $(\{x^n\})_{n \geq 1}$ is uniformly distributed for almost all values of $x$. In the present paper we obtain an exact quantitative version of Koksma's theorem, by calculating…
Universal Cycles, or U-cycles, as originally defined by de Bruijn, are an efficient method to exhibit a large class of combinatorial objects in a compressed fashion, and with no repeats. de Bruijn's theorem states that U-cycles for $n$…
Motivated by the work on the domination number of directed de Bruijn graphs and some of its generalizations, in this paper we introduce a natural generalization of de Bruijn graphs (directed and undirected), namely $t$-constrained de Bruijn…
We study coverage processes in which each draw reveals a subset of $[n]$, and the goal is to determine the expected number of draws until all items are seen at least once. A classical example is the Coupon Collector's Problem, where each…
A de Bruijn cycle is a cyclic listing of length A, of a collection of A combinatorial objects, so that each object appears exactly once as a set of consecutive elements in the cycle. In this paper, we show the power of de Bruijn's original…
De novo DNA assembly is a fundamental task in Bioinformatics, and finding Eulerian paths on de Bruijn graphs is one of the dominant approaches to it. In most of the cases, there may be no one order for the de Bruijn graph that works well…
The focus of this work is to show how to combine Zech's logarithms and each of the cycle joining and cross-join pairing methods to construct binary de Bruijn sequences of any order. A basic implementation is supplied as a proof-of-concept.…
This work represents a systematic computational study of the distribution of the Fourier coefficients of cuspidal Hecke eigenforms of level $\Gamma_0(4)$ and half-integral weights. Based on substantial calculations, the question is raised…
Hecke studies the distribution of fractional parts of quadratic irrationals with Fourier expansion of Dirichlet series. This method is generalized by Behnke and Ash-Friedberg, to study the distribution of the number of totally positive…
Given an increasing sequence of integers a(n), it is known (due to Weyl) that for almost all reals t, the fractional parts of the dilated sequence t*a(n) are uniformly distributed in the unit interval. Some effort has been made recently to…
Sequential probability assignment and universal compression go hand in hand. We propose sequential probability assignment for non-binary (and large alphabet) sequences with empirical distributions whose parameters are known to be bounded…
Universal cycles are generalizations of de Bruijn cycles and Gray codes that were introduced originally by Chung, Diaconis, and Graham in 1990. They have been developed by many authors since, for various combinatorial objects such as…
We propose a generalized model for uniform recursive tree (URT) by introducing an imperfect growth process, which may generate disconnected components (clusters). The model undergoes an interesting phase transition from a singly connected…
We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let $f\colon\{0,1\}^m\to\{0,1\}^n$ be a Boolean function where each output bit of $f$ depends only on $O(1)$ input bits. Assume the…