Related papers: Completely uniformly distributed sequences based o…
Among the currently known constructions of absolutely normal numbers, the one given by Mordechay Levin in 1979 achieves the lowest discrepancy bound. In this work we analyze this construction in terms of computability and computational…
There is a natural bijection between permutations obtainable using a stack (those avoiding the pattern 312) and permutations obtainable using a queue (those avoiding 321). This bijection is equivalent to one described by Simion and Schmidt…
We elaborate the notions of Martin-L\"of and Schnorr randomness for real numbers in terms of uniform distribution of sequences. We give a necessary condition for a real number to be Schnorr random expressed in terms of classical uniform…
The dynamical system generated by the iterated calculation of the high order gaps between neighboring terms of a sequence of natural numbers is remarkable and only incidentally characterized at the boundary by the notable Proth-Glibreath…
We extend the Reed Dawson identity for Knuth's old sum with a complex parameter, and we offer two separate hypergeometric series-based proofs of this generalization, and we apply this generalization to introduce binomial-harmonic sum…
In this paper we consider the set ${\mathbb Z}^{\pm\omega}_{6}$ of two-way infinite words $\xi$ over the alphabet $\{0,1,2,3,4,5\}$ with the integer left part $\lfloor\xi\rfloor$ and the fractional right part $\{\xi\}$ separated by a radix…
Uniform laws of large numbers form a cornerstone of Vapnik--Chervonenkis theory, where they are characterized by the finiteness of the VC dimension. In this work, we study uniform convergence phenomena in cartesian product spaces, under…
Universal cycles, such as De Bruijn cycles, are cyclic sequences of symbols that represent every combinatorial object from some family exactly once as a consecutive subsequence. Graph universal cycles are a graph analogue of universal…
We consider sequences of $U$-processes based on symmetric kernels of a fixed order, that possibly depend on the sample size. Our main contribution is the derivation of a set of analytic sufficient conditions, under which the aforementioned…
We study rack and quandle coverings from a universal algebraic viewpoint and we show how they can be understood using the notion of strongly abelian congruences. We provide an abstract characterization of several particular types of…
On a deformation to the normal cone $\operatorname{DNC}(M,V)$ we show that given a distribution $u\in\mathcal{D}'(\operatorname{DNC}(M,V)\setminus V\times\mathbb{R})$ if $u$ is homogeneous of order $a$ for the zoom action, then it admits an…
Let (k(n)) n=1,2,... be a strictly increasing sequence of positive integers . We consider a specific sequence of differential operators Tk(n),{\lambda} , n=1,2,... on the space of entire functions , that depend on the sequence (k(n))…
Many years ago, Griego, Heath and Ruiz-Moncayo proved that it is possible to define realizations of a sequence of uniform transform processes that converges almost surely to the standard Brownian motion, uniformly on the unit time interval.…
Kwapie\'{n}'s theorem asserts that every continuous linear operator from $\ell_{1}$ to $\ell_{p}$ is absolutely $\left( r,1\right) $-summing for $1/r=1-\left\vert 1/p-1/2\right\vert .$ When $p=2$ it recovers the famous Grothendieck's…
We show that two notions of continued fraction normality, one where overlapping occurrences of finite patterns are counted as distinct occurrences, and another where only disjoint occurrences are counted as distinct, are identical. This…
By Zeckendorf's theorem, an equivalent definition of the Fibonacci sequence (appropriately normalized) is that it is the unique sequence of increasing integers such that every positive number can be written uniquely as a sum of non-adjacent…
A graph that is completely determined by its degree sequence is called a unigraph. In 2000, Regina Tyshkevich published one of the most important papers on unigraphs. There are two parts to the paper: a decomposition theorem that describes…
Integer partitions have fascinated people for centuries, from Ramanujan's groundbreaking congruences to the modern theory of modular forms. This paper investigates the statistical properties of odd unimodal sequences--a natural refinement…
For $x\ge y>1$ and $u:= \log x/\log y$, let $\Phi(x,y)$ denote the number of positive integers up to $x$ free of prime divisors less than or equal to $y$. In 1950 de Bruijn [1] studied the approximation of $\Phi(x,y)$ by the quantity…
This paper studies the problem of upper bounding the number of independent sets in a graph, expressed in terms of its degree distribution. For bipartite regular graphs, Kahn (2001) established a tight upper bound using an…