Related papers: Sublacunary sequences that are strong sweeping out
We describe a curious dynamical system that results in sequences of real numbers in $[0,1]$ with seemingly remarkable properties. Let the function $f:\mathbb{T} \rightarrow \mathbb{R}$ satisfy $\hat{f}(k) \geq c|k|^{-2}$ and define a…
By a classical principle of analysis, sufficiently thin subsequences of general sequences of functions behave like sequences of independent random variables. This observation not only explains the remarkable properties of lacunary…
We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…
This note is devoted to study the recurrent numerical sequence defined by: $a_0 = 0$, $a_n = \frac{n}{2} a_{n - 1} + (n - 1)!$ ($\forall n \geq 1$). Although, it is immediate that ${(a_n)}_n$ is constituted of rational numbers with…
We study non-stationary averaging processes, where each term of a sequence is a weighted average of previous terms, namely $a_{n+1} = \sum_{j=1}^n p_n(j) a_j$. Our results extend classical theory in two distinct regimes. First, we prove a…
Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…
We define a triangular array closely related to Stern's diatomic array and show that for a fixed integer $r\geq 1$, the sum $u_r(n)$ of the $r$th powers of the entries in row $n$ satisfy a linear recurrence with constant coefficients. The…
Each positive increasing integer sequence $\{a_n\}_{n\geq 0}$ can serve as a numeration system to represent each non-negative integer by means of suitable coefficient strings. We analyse the case of $k$-generalized Fibonacci sequences…
We study the asymptotic behavior of the sequence $\{\Omega(n) \}_{ n \in \mathbb{N} }$ from a dynamical point of view, where $\Omega(n)$ denotes the number of prime factors of $n$ counted with multiplicity. First, we show that for any…
Let $A$ be a subset of positive integers. For a given positive integer $n$ and $0\leq i\leq n$ let $c_{A}(i,n)$ denotes the number of $A$-compositions of $n$ with exactly $i$ parts. In this note we investigate the sign behaviour of the…
A set $A \subseteq \mathbb{N}$ is a set of pointwise recurrence if for all minimal dynamical systems $(X, T)$, all $x \in X$, and all open neighborhoods $U \subseteq X$ of $x$, there exists a time $n \in A$ such that $T^n x \in U$. The set…
A sequence of positive integers $(a_1,a_2,\ldots,a_k)$ is called $\ell$-additive if $a_1+a_2+\cdots+a_k=\ell a_1$ or $\ell a_k$. In this paper, we prove that for all $k\geq3$, if $n$ is sufficiently large, then every permutation of…
If $G$ is an abelian group, we say $S\subset G$ is a set of recurrence if for every probability measure preserving $G$-system $(X,\mu,T)$ and every $D\subset X$ having $\mu(D)>0$, there is a $g\in S$ such that $\mu(D\cap T^{g}D)>0$. We say…
Aperiodic autocorrelation is an important indicator of performance of sequences used in communications, remote sensing, and scientific instrumentation. Knowing a sequence's autocorrelation function, which reports the autocorrelation at…
In this paper, our primary objective is to study a possible decomposition of an approximately convex sequence. For a given $\varepsilon>0$; a sequence $\big<u_n\big>_{n=0}^{\infty}$ is said to be $\varepsilon$-convex, if for any…
In 1960, Sierpi\'nski proved that there exist infinitely many odd positive integers $k$ such that $k\cdot 2^n+1$ is composite for all positive integers $n$. In this paper, we prove some generalizations of Sierpi\'nski's theorem with $2^n$…
A space $X$ is called {\it selectively pseudocompact} if for each sequence $(U_{n})_{n\in \mathbb{N}}$ of pairwise disjoint nonempty open subsets of $X$ there is a sequence $(x_{n})_{n\in \mathbb{N}}$ of points in $X$ such that $cl_X(\{x_n…
An $(n,R)$-covering sequence is a cyclic sequence whose consecutive $n$-tuples form a code of length $n$ and covering radius $R$. Using several construction methods improvements of the upper bounds on the length of such sequences for $n…
Given lacunary sequence of integers, $n_k$, $n_{k+1}/n_k>\lambda>1$, we define a new sequence $\{m_k\}$ formed by all possible $l$-wise sums $\pm n_{k_1}\pm n_{k_2}\pm \ldots\pm n_{k_l}$. We prove if $\lambda>\lambda_l$, then any series…
For $n=1,2,3,\ldots$ let $S_n$ be the sum of the first $n$ primes. We mainly show that the sequence $a_n=\root n\of{S_n/n}\ (n=1,2,3,\ldots)$ is strictly decreasing, and moreover the sequence $a_{n+1}/a_n\ (n=10,11,\ldots)$ is strictly…