Related papers: Completely uniformly distributed sequences based o…

The topic of this paper is the distributed and incremental generation of long executions of concurrent systems, uniformly or more generally with weights associated to elementary actions. Synchronizing sequences of letters on alphabets…

For $m\geq 2$, we determine the Dirichlet spectrum in $\Rm$ with respect to simultaneous approximation and the maximum norm as the entire interval $[0,1]$. This complements previous work of several authors, especially Akhunzhanov and…

Let T d (n) be the set of d-ary rooted trees with n internal nodes. We give a method to construct a sequence (t n , n $\ge$ 0) where, for any n $\ge$ 1, t n has the uniform distribution in T d (n), and t n is constructed from t n--1 by the…

In 1972 Mykkeltveit proved that the maximum number of vertex-disjoint cycles in the de Bruijn graphs of order $n$ is attained by the pure cycling register rule, as conjectured by Golomb. We generalize this result to the tensor product of…

The binary Euclidean algorithm is a modification of the classical Euclidean algorithm for computation of greatest common divisors which avoids ordinary integer division in favour of division by powers of two only. The expectation of the…

For every natural number $n\geq 2$ and every finite sequence $L$ of natural numbers, we consider the set $UD_n(L)$ of all uniquely decodable codes over an $n$-letter alphabet with the sequence $L$ as the sequence of code word lengths, as…

Let $Q=(q_n)_{n=1}^{\infty}$ be a sequence of integers greater than or equal to 2. We say that a real number $x$ in $[0,1)$ is {\it $Q$-distribution normal} if the sequence $(q_1q_2... q_n x)_{n=1}^{\infty}$ is uniformly distributed mod 1.…

It is well known that, whenever $k$ divides $n$, the complete $k$-uniform hypergraph on $n$ vertices can be partitioned into disjoint perfect matchings. Equivalently, the set of $k$-subsets of an $n$-set can be partitioned into parallel…

We introduce a variant of de Bruijn words that we call perfect necklaces. Fix a finite alphabet. Recall that a word is a finite sequence of symbols in the alphabet and a circular word, or necklace, is the equivalence class of a word under…

In this article, we prove the existence and uniqueness of a certain distribution function on the unit interval. This distribution appears in Brent's model of the analysis of the binary gcd algorithm. The existence and uniqueness of such a…

In this paper, we give the concepts of properly distributed and simply distributed sequences, and prove that they are almost convergent. Basing on these, we review the work of Feng and Li [Feng, B. Q. and Li, J. L., Some estimations of…

One of the fundamental theorems of uniform distribution theory states that the fractional parts of the sequence $(n \alpha)_{n \geq 1}$ are uniformly distributed modulo one (u.d. mod 1) for every irrational number $\alpha$. Another…

We generalize Knuth's construction of Case I semifields quadratic over a weak nucleus, also known as generalized Dickson semifields, by doubling of central simple algebras. We thus obtain division algebras of dimension $2s^2$ by doubling…

A classical result of MacMahon states that inversion number and major index have the same distribution over permutations of a given multiset. In this work we prove a strengthening of this theorem originally conjectured by Haglund. Our…

A universal partial cycle (or upcycle) for $\mathcal{A}^n$ is a cyclic sequence that covers each word of length $n$ over the alphabet $\mathcal{A}$ exactly once -- like a De Bruijn cycle, except that we also allow a wildcard symbol…

A systematic study of the probability distribution of superimposed random codes is presented through the use of generating functions. Special attention is paid to the cases of either uniformly distributed but not necessarily independent or…

A balanced generalized de Bruijn sequence with parameters $(n,l,k)$ is a cyclic sequence of $n$ bits such that (a) the number of 0's equals the number of 1's, and (b) each substring of length $l$ occurs at most $k$ times. We determine…

Dedekind sums have applications in quite a number of fields of mathematics. Therefore, their distribution has found considerable interest. This article gives a survey of several aspects of the distribution of these sums. In particular, it…

Lenz and Stollmann recently proved the existence of the integrated density of states in the sense of uniform convergence of the distributions for certain operators with aperiodic order. The goal of this paper is to establish a relation…

This paper describes new, simple, recursive methods of construction for orientable sequences, i.e. periodic binary sequences in which any n-tuple occurs at most once in a period in either direction. As has been previously described, such…