English
Related papers

Related papers: Sublacunary sequences that are strong sweeping out

200 papers

In this paper, we prove the following result: {quote} Let $\A$ be an infinite set of positive integers. For all positive integer $n$, let $\tau_n$ denote the smallest element of $\A$ which does not divide $n$. Then we have $$\lim_{N \to +…

Number Theory · Mathematics 2009-12-15 Bakir Farhi

The goal of this expository article is a fairly self-contained account of some averaging processes of functions along sequences of the form $(\alpha^n x)^{}_{n\in\mathbb{N}}$, where $\alpha$ is a fixed real number with $| \alpha | > 1$ and…

Number Theory · Mathematics 2018-01-24 Michael Baake , Alan Haynes , Daniel Lenz

A positive integer $n$ is said to be $k$-layered if its divisors can be partitioned into $k$ sets with equal sum. In this paper, we start the systematic study of these class of numbers. In particular, we state some algorithms to find some…

Number Theory · Mathematics 2022-07-20 Farid Jokar

Sharpening (a particular case of) a result of Szemeredi and Vu and extending earlier results of Sarkozy and ourselves, we find, subject to some technical restrictions, a sharp threshold for the number of integer sets needed for their sumset…

Number Theory · Mathematics 2008-06-30 Vsevolod F. Lev

A \emph{covering array} is an $N \times k$ array of elements from a $v$-ary alphabet such that every $N \times t$ subarray contains all $v^t$ tuples from the alphabet of size $t$ at least $\lambda$ times; this is denoted as $\CA_\lambda(N;…

Combinatorics · Mathematics 2023-06-06 Mason R. Calbert , Ryan E. Dougherty

Sequence transformations accomplish an acceleration of convergence or a summation in the case of divergence by detecting and utilizing regularities of the elements of the sequence to be transformed. For sufficiently large indices, certain…

Numerical Analysis · Mathematics 2025-10-20 Ernst Joachim Weniger

The problem of universal outlying sequence detection is studied, where the goal is to detect outlying sequences among $M$ sequences of samples. A sequence is considered as outlying if the observations therein are generated by a distribution…

Information Theory · Computer Science 2020-05-27 Yuheng Bu , Shaofeng Zou , Venugopal V. Veeravalli

Let $R(n)$ denote the number of rich words of length $n$ over a given finite alphabet. In 2017 it was proved that $\lim_{n\rightarrow\infty} \sqrt[n]{R(n)}=1$; it means the number of rich words has a subexponential growth. However, up to…

Combinatorics · Mathematics 2025-11-17 Josef Rukavicka

We consider numbers of the form $S_\beta(\boldsymbol{u}):=\sum_{n=0}^\infty \frac{u_n}{\beta^n}$ for $\boldsymbol{u}=\langle u_n \rangle_{n=0}^\infty$ a Sturmian sequence over a binary alphabet and $\beta$ an algebraic number with…

Formal Languages and Automata Theory · Computer Science 2023-08-29 Florian Luca , Joel Ouaknine , James Worrell

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as the sum of non-consecutive Fibonacci numbers $\{ F_i \}_{i = 1}^{\infty}$. A set $S \subset \mathbb{Z}$ is said to satisfy Benford's law if the density…

We study intermediate-scale statistics for the fractional parts of the sequence $(\alpha a_n)_{n=1}^{\infty}$, where $(a_n)_{n=1}^{\infty}$ is a positive, real-valued lacunary sequence, and $\alpha\in\mathbb{R}$. In particular, we consider…

Number Theory · Mathematics 2023-08-16 Nadav Yesha

For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $\Sigma_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small,…

Number Theory · Mathematics 2019-10-28 David J. Grynkiewicz

Let $w$ be a finite word over the alphabet $\{0,1\}$. For any natural number $n$, let $s_w(n)$ denote the number of occurrence of $w$ in the binary expansion of $n$ as a scattered subsequence. We study the behavior of the partial sum…

Number Theory · Mathematics 2024-11-18 Pranjal Jain , Shuo Li

The 3x+1 Conjecture asserts that the T-orbit of every positive integer contains 1, where T maps x\mapsto x/2 for x even and x\mapsto (3x+1)/2 for x odd. A set S of positive integers is sufficient if the orbit of each positive integer…

Dynamical Systems · Mathematics 2012-04-23 Keenan Monks , Kenneth G. Monks , Kenneth M. Monks , Maria Monks

We consider a notion of uniform thinning for a finite sequence of random variables $(X_1,...,X_n)$ obtained by removing one random variable, uniformly at random. If a triangular array of random variables $(X_{n,k} : n \in \mathbb{N}_+, 1…

Probability · Mathematics 2007-05-23 Shannon Starr

Golomb's sequence is the unique nondecreasing sequence of positive integers in which each $n$ appears exactly $a(n)$ times. It satisfies the global self-referential rule \[ a\bigl(a(n)+a(n-1)+\cdots+a(1)\bigr)=n, \] grows smoothly like a…

Number Theory · Mathematics 2026-04-06 Benoit Cloitre

A beautiful theorem of Zeckendorf states that every positive integer has a unique decomposition as a sum of non-adjacent Fibonacci numbers. Such decompositions exist more generally, and much is known about them. First, for any positive…

Number Theory · Mathematics 2019-09-05 Neelima Borade , Dexter Cai , David Z. Chang , Bruce Fang , Alex Liang , Steven J. Miller , Wanqiao Xu

Let the sequence $\{t_n\}_{n=1}^{\infty}$ of reals satisfy the condition $ \frac{t_{n+1}}{t_n} \ge 1+ \frac{\gamma}{n^\beta},0\le \beta <1, \gamma >0. $ Then the set $ \{\alpha \in [0,1]: \exists \varkappa > 0 \forall n \in \mathbb{N} ||t_n…

Number Theory · Mathematics 2007-10-20 Nikolai G. Moshchevitin

Complex moment sequences are exactly those which admit positive definite extensions on the integer lattice points of the upper diagonal half-plane. Here we prove that the aforesaid extension is unique provided the complex moment sequence is…

Functional Analysis · Mathematics 2018-03-09 D. Cichoń , J. Stochel. F. H. Szafraniec

The Thue--Morse sequence $\{t(n)\}_{n\geqslant 1}$ is the indicator function of the parity of the number of ones in the binary expansion of positive integers $n$, where $t(n)=1$ (resp. $=0$) if the binary expansion of $n$ has an odd (resp.…

Number Theory · Mathematics 2023-12-13 Michael Coons , Yohei Tachiya