Related papers: Completely uniformly distributed sequences based o…
An $(m,n,R)$-de Bruijn covering array (dBCA) is a doubly periodic $M \times N$ array over an alphabet of size $q$ such that the set of all its $m \times n$ windows form a covering code with radius $R$. An upper bound of the smallest array…
We study the relationship between the discrete and the continuous versions of the Kronecker--Weyl equidistribution theorem, as well as their possible extension to manifolds in higher dimensions. We also investigate a way to deduce in some…
This article introduces new algorithms for the uniform random generation of labelled planar graphs. Its principles rely on Boltzmann samplers, as recently developed by Duchon, Flajolet, Louchard, and Schaeffer. It combines the Boltzmann…
D. Hensley showed in 1994 that the number of steps taken by the Euclidean algorithm to find the greatest common divisor of two natural numbers less than or equal to n follows a normal distribution in the limit as n tends to infinity. V.…
The nodes of the de Bruijn graph B(d,3) consist of all strings of length 3, taken from an alphabet of size d, with edges between words which are distinct substrings of a word of length 4. We give an inductive characterization of the maximum…
We prove an abstract index formula about Sinnott's symbol between two different lattices. We also develop the theory of the universal distribution and predistribution in a double complex point of view. The theory of spectral sequence is…
This article is motivated by the following satisfiability question: pick uniformly at random an and/or Boolean expression of length n, built on a set of k_n Boolean variables. What is the probability that this expression is satisfiable?…
We introduce a sound and complete equational theory capturing equivalence of discrete probabilistic programs, that is, programs extended with primitives for Bernoulli distributions and conditioning, to model distributions over finite sets…
We present a new form and a short full proof of explicit two-sided estimates for the distribution function F_{n,p}(x) of the binomial law from the paper published by D.Alfers and H.Dinges in 1984. These inequalities are universal (valid for…
The notion of maximal-spacing in several dimensions was introduced and studied by Deheuvels (1983) for data uniformly distributed on the unit cube. Later on, Janson (1987) extended the results to data uniformly distributed on any bounded…
Directed acyclic graphs are the basic representation of the structure underlying Bayesian networks, which represent multivariate probability distributions. In many practical applications, such as the reverse engineering of gene regulatory…
We employ the spectral theory of Eisenstein series to prove that the Hardy sums, integer-valued analogs of the classical Dedekind sums, are uniformly distributed in $\mathbf{Z} / m \mathbf{Z}$ for any integer $m > 1$.
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…
de Bruijn sequences of order $\ell$, i.e., sequences that contain each $\ell$-tuple as a window exactly once, have found many diverse applications in information theory and most recently in DNA storage. This family of binary sequences has…
The concept of symbolic sequences play important role in study of complex systems. In the work we are interested in ultrametric structure of the set of cyclic sequences naturally arising in theory of dynamical systems. Aimed at construction…
The interest for uniformly distributed (u.d.) sequences of points, in particular for sequences with small discrepancy, arises from various applications. For instance, low-discrepancy sequences, which are sequences with a discrepancy of…
The fundamental theorem in the theory of the uniform convergence of sine series is due to Chaundy and Jolliffe from 1916 (see [1]). Several authors gave conditions for this problem supposing that coefficients are monotone, non-negative or…
A shift rule for the prefer-max De Bruijn sequence is formulated, for all sequence orders, and over any finite alphabet. An efficient algorithm for this shift rule is presented, which has linear (in the sequence order) time and memory…
We consider approximation properties of real points by uniformly distributed sequences. Under some assumptions on the approximation functions, we prove a Khintchine-type $0$-$1$ dichotomy law. We establish a new connection between uniform…
In this paper a class of mappings on unit interval is constructed. These mapping preserve uniform distribution and theirs iterations form a sequence which is Buck uniformly distributed. In the third part some prorties of these mappings are…