Related papers: Periodicity of complementing multisets

Let $C,W\subseteq \mathbb{Z}$. If $C+W=\mathbb{Z}$, then the set $C$ is called an additive complement to $W$ in $\mathbb{Z}$. If no proper subset of $C$ is an additive complement to $W$, then $C$ is called a minimal additive complement. Let…

Suppose that A is a finite set of integers of diameter D. Suppose also that the set of integers B is such that A+B is a tiling of the integers, that is each integer is uniquely expressible as a+b, with a in A, b in B. It is well known that…

We prove that a sumset of a TE subset of (\N) (these sets can be viewed as "aperiodic" sets) with a set of positive upper density intersects a set of values of any polynomial with integer coefficients., i.e. for any (A \subset \N ) a TE…

We say a subset $C$ of an abelian group $G$ \textit{arises as a minimal additive complement} if there is some other subset $W$ of $G$ such that $C+W=\{c+w:c\in C,\ w\in W\}=G$ and such that there is no proper subset $C'\supset C$ such that…

A graph is periodic if it can be obtained by joining identical pieces in a cyclic fashion. It is shown that the limit crossing number of a periodic graph is computable. This answers a question of Benny Pinontoan and Bruce Richter (2004).

For a prime $p$ and an integer $x$, the $p$-adic valuation of $x$ is denoted by $\nu_{p}(x)$. For a polynomial $Q$ with integer coefficients, the sequence of valuations $\nu_{p}(Q(n))$ is shown to be either periodic or unbounded. The first…

In this paper, we study the periodicity structure of finite field linear recurring sequences whose period is not necessarily maximal and determine necessary and sufficient conditions for the characteristic polynomial~\(f\) to have exactly…

We consider the number of occurrences of subwords (non-consecutive sub-sequences) in a given word. We first define the notion of subword entropy of a given word that measures the maximal number of occurrences among all possible subwords. We…

Let $G$ be an abelian group. A set $A \subset G$ is a \emph{$B_k^+$-set} if whenever $a_1 + \dots + a_k = b_1 + \dots + b_k$ with $a_i, b_j \in A$ there is an $i$ and a $j$ such that $a_i = b_j$. If $A$ is a $B_k$-set then it is also a…

We show that a set is almost periodic if and only if the associated exponential sum is concentrated in the minor arcs. Hence binary additive problems involving almost periodic sets can be solved using the circle method.

A Ducci sequence is a sequence of integer $n$-tuples obtained by iterating the map \[ D : (a_1, a_2, \ldots, a_n) \mapsto \big(|a_1-a_2|,|a_2-a_3|,\ldots,|a_n-a_1|\big). \] Such a sequence is eventually periodic and we denote by $P(n)$ the…

Periods are defined as integrals of semialgebraic functions defined over the rationals. Periods form a countable ring not much is known about. Examples are given by taking the antiderivative of a power series which is algebraic over the…

We give a few remarks on the periodic sequence $a_n=\binom{n}{x}~(mod~m)$ where $x,m,n\in \mathbb{N}$, which is periodic with minimal length of the period being…

The summatory function of the number of binomial coefficients not divisible by a prime is known to exhibit regular periodic oscillations, yet identifying the less regularly behaved minimum of the underlying periodic functions has been open…

We present a method that allows to distinguish between nearly periodic and strictly periodic time series. To this purpose, we employ a conservative criterion for periodicity, namely that the time series can be interpolated by a periodic…

We prove that if the signed binomial coefficient $(-1)^i\binom{k}{i}$ viewed modulo p is a periodic function of i with period h prime to p in the range $0\le i\le k$, then k+1 is a power of p, provided h is not too large compared to k. (In…

We show that if $A=\{a_1 < a_2 < \ldots < a_k\}$ is a set of real numbers such that the differences of the consecutive elements are distinct, then for and finite $B \subset \mathbb{R}$, $$|A+B|\gg |A|^{1/2}|B|.$$ The bound is tight up to…

Let $\mathcal{A}$ be a sequence of $rk$ terms which is made up of $k$ distinct integers each appearing exactly $r$ times in $\mathcal{A}$. The sum of all terms of a subsequence of $\mathcal{A}$ is called a subsequence sum of $\mathcal{A}$.…

A set of sets is called a family. Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $1 \leq…

We determine the maximal length of the period of a periodic word defined by $n$ restrictions. It happens to be the corresponding Fibonacci number.