Related papers: Periodic Sequences modulo $m$

We study Piatetski-Shapiro sequences $(\lfloor n^c\rfloor)_n$ modulo m, for non-integer $c >1$ and positive $m$, and we are particularly interested in subword occurrences in those sequences. We prove that each block $\in\{0,1\}^k$ of length…

A celebrated result of Morse and Hedlund, stated in 1938, asserts that a sequence $x$ over a finite alphabet is ultimately periodic if and only if, for some $n$, the number of different factors of length $n$ appearing in $x$ is less than…

A simple non-autonomous scalar differential equation with delay, exponential decay, nonlinear negative feedback and a periodic multiplicative coefficient is considered. It is shown that stable slowly oscillating periodic solutions with the…

Let $\mathcal{A}$ be a finite subset of $\mathbb{N}$ including $0$ and $f_\mathcal{A}(n)$ be the number of ways to write $n=\sum_{i=0}^{\infty}\epsilon_i2^i$, where $\epsilon_i\in\mathcal{A}$. The sequence $\left(f_\mathcal{A}(n)\right)…

Using a special metric in the space of sequences, we give a geometric description of almost periodic sets in the $k$-dimensional Euclidean space. We prove the completeness of the space of almost periodic sets and some analogue of the…

We consider the semiconjugate factorization and reduction of order for non-autonomous, nonlinear, higher order difference equations containing linear arguments. These equations have appeared in several mathematical models in biology and…

We prove results about the asymptotic formulae in short intervals for the average number of representations of integers of the forms $n=p_{1}^{\ell_1}+p_{2}^{\ell_2}$, with $\ell_1, \ell_2\in\{2,3\}$, $\ell_1+\ell_2\le 5$ are fixed…

Let $\underline{x} = x_1,\ldots,x_k$ denote an ordered sequence of elements of a commutative ring $R$. Let $M$ be an $R$-module. We recall the two notions that $\underline{x}$ is $M$-proregular given by Greenlees and May (see \cite{[5]})…

In this paper, we present a method for estimating the least common multiple of a large class of binary linear recurrence sequences. Let $P,Q,R_0$, and $R_1$ be fixed integers and let $\boldsymbol{R}=\left(R_n\right)_{n}$ be the recurrence…

It is a well known that, for odd $n$, the number of subsets of $\{1,2,\dots,n\}$ the sum of whose elements is divisible by $n$ equals the number of binary necklaces of length $n$. In this paper generalize this result in two directions. On…

This paper provides two results that are useful in the study of the existence and the stability properties of a periodic solution for a given dynamical system. The first result deals with scalar time-periodic systems and establishes the…

We investigate the function $L(h,p,q)$, called here the threshold function, related to periodicity of partial words (words with holes). The value $L(h,p,q)$ is defined as the minimum length threshold which guarantees that a natural…

Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…

The existence, uniqueness, and asymptotic stability of modulo periodic Poisson stable solutions of dynamic equations on a periodic time scale are investigated. The model under investigation involves a term which is constructed via a Poisson…

Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…

Let $d>m>1$ be integers, let $c_1,\dots, c_{m+1}$ be distinct complex numbers, and let $\mathbf{f}(z):=z^d+t_1z^{m-1}+t_2z^{m-2}+\cdots + t_{m-1}z+t_m$ be an $m$-parameter family of polynomials. We prove that the set of $m$-tuples of…

We try to improve a problem asked in an Indian Math Olympiad. We give a brief overview of the work done in Saikia and Vogrinc (2011) and Saikia and Vogrinc where the authors have found a periodic sequence and the length of its period, all…

Let $d\geq 2$ be an integer. In this paper we study arithmetic properties of the sequence $(H_d(n))_{n\in\N}$, where $H_{d}(n)$ is the number of permutations in $S_{n}$ being products of pairwise disjoint cycles of a fixed length $d$. In…

Let $\{a_i\}_{i=1}^\ell$ be a strongly unimodal positive integer sequence with peak position $k$. The rank of such sequence is defined to be $\ell-2k+1$. Let $u(m,n)$ denote the number of sequences $\{a_i\}_{i=1}^\ell$ with rank $m$ and…

We study an analogue of a classical arithmetic problem over the ring of polynomials. We prove that $m = 5$ is the minimal number such that the sums of any two distinct polynomials in a set of $m$ polynomials over $\F_2[x]$ cannot all be of…