English
Related papers

Related papers: Periodicity of complementing multisets

200 papers

We show that if $A=\{a_1,a_2,..., a_k\}$ is a monotone increasing set of numbers, and the differences of the consecutive elements are all distinct, then $|A+B|\geq c|A|^{1/2}|B|$ for any finite set of numbers $B$. The bound is tight up to…

Combinatorics · Mathematics 2007-05-23 J. Solymosi

A sequence $(e_i)_{i \le m}$ of nonnegative integers $e_i$, where $m \in \mathbb{N}$ or $m =\infty$, is called a binomid index if $\sum_{i=n-k+1}^{n} e_i\geq \sum_{i=1}^ke_i$ for all $k, n \in \mathbb{N}$ such that $ 1\le k \le n < m$.…

Combinatorics · Mathematics 2025-05-27 Jonathan Caalim , Yu-ichi Tanaka

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

Combinatorics · Mathematics 2021-07-01 Imre Ruzsa , Jozsef Solymosi

A subset $C$ of an abelian group $G$ is a minimal additive complement to $W \subseteq G$ if $C + W = G$ and if $C' + W \neq G$ for any proper subset $C' \subset C$. In this paper, we study which sets of integers arise as minimal additive…

Combinatorics · Mathematics 2020-07-10 Amanda Burcroff , Noah Luntzlara

In this paper it is dealt with the following system of difference equations x_{n+1}=((a_{n})/(x_{n}))+((b_{n})/(y_{n})), y_{n+1}=((c_{n})/(x_{n}))+((d_{n})/(y_{n})), n in N_0, where the initial values x_0,y_0 are positive real numbers and…

Dynamical Systems · Mathematics 2021-09-17 Durhasan Turgut Tollu

In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…

Discrete Mathematics · Computer Science 2007-05-23 Yuri Pritykin

A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new estimation for the upper bound of B_k sequences.

Combinatorics · Mathematics 2015-07-02 An-Ping Li

A run is a maximal occurrence of a repetition $v$ with a period $p$ such that $2p \le |v|$. The maximal number of runs in a string of length $n$ was studied by several authors and it is known to be between $0.944 n$ and $1.029 n$. We…

Data Structures and Algorithms · Computer Science 2009-07-14 Maxime Crochemore , Costas Iliopoulos , Marcin Kubica , Jakub Radoszewski , Wojciech Rytter , Tomasz Walen

Suppose that P is an infinite set of primes such that P = A + B + C, where A,B,C are sets with at least two elements. We show that if P(x) > c x/log^d x (where P(x) = the number of elements of P that are <= x), and if A,B,C is a "regular"…

Number Theory · Mathematics 2007-05-23 Ernie Croot , Christian Elsholtz

For integers a and n>0, let a(n) denote the residue class {x\in Z: x=a (mod n)}. Let A be a collection {a_s(n_s)}_{s=1}^k of finitely many residue classes such that A covers all the integers at least m times but {a_s(n_s)}_{s=1}^{k-1} does…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

A sequence $s(n)$ of integers is MC-finite if for every $m \in \mathbb{N}^+$ the sequence $s^m(n) = s(n) \bmod{m}$ is ultimately periodic. We discuss various ways of proving and disproving MC-finiteness. Our examples are mostly taken from…

Combinatorics · Mathematics 2023-07-04 Yuval Filmus , Eldar Fischer , Johann A. Makowsky , Vsevolod Rakita

Let $X$ be an $n$-element set. A set-pair system $\mbox{$\cal P$}=\{(A_i,B_i)\}_{1\leq i\leq m}$ is a collection of pairs of disjoint subsets of $X$. It is called skew Bollob\'as system if $A_i\cap B_j\neq \emptyset$ for all $1\leq i<j \leq…

Combinatorics · Mathematics 2023-07-28 Gábor Hegedüs , Péter Frankl

It is decidable if a set of numbers, whose representation in a base b is a regular language, is ultimately periodic. This was established by Honkala in 1986. We give here a structural description of minimal automata that accept an…

Formal Languages and Automata Theory · Computer Science 2013-06-11 Victor Marsault , Jacques Sakarovitch

Let $K$ be an arbitrary field. Let $\a = (a_1< ... <a_n)$ be a sequence of positive integers. Let $C(\a)$ be the affine monomial curve in ${\mathbb A}^n$ parametrized by $t\to (t^{a_1}, ..., t^{a_n})$. Let $I(\a)$ be the defining ideal of…

Commutative Algebra · Mathematics 2013-04-08 Thanh Vu

Given an integer $n$, we introduce the integral Lie ring of partitions with bounded maximal part, whose elements are in one-to-one correspondence to integer partitions with parts in $\{1,2,\dots, n-1\}$. Starting from an abelian subring, we…

Combinatorics · Mathematics 2023-03-10 Riccardo Aragona , Roberto Civino , Norberto Gavioli

We obtain an upper bound for the number of pairs $ (a,b) \in {A\times B} $ such that $ a+b $ is a prime number, where $ A, B \subseteq \{1,...,N \}$ with $|A||B| \, \gg \frac{N^2}{(\log {N})^2}$, $\, N \geq 1$ an integer. This improves on a…

Number Theory · Mathematics 2017-10-24 Kummari Mallesham

A ring $R$ is periodic provided that for any $a\ in R$ there exist distinct elements $m,n \in {\Bbb N}$ such that $a^m=a^n$. We shall prove that periodicity is inherited by a type of generalized matrix rings.We define strongly periodic…

Rings and Algebras · Mathematics 2016-03-25 Huanyin Chen , Marjan Sheibani Abdolyousefi

For any irrational $\alpha > 0$ and any initial value $z_{-1} \in \mathbb{C}$, we define a sequence of complex numbers $(z_n)_{n=0}^{\infty}$ as follows: $z_n$ is $z_{n-1} + e^{2 \pi i \alpha n}$ or $z_{n-1} - e^{2 \pi i \alpha n}$,…

Dynamical Systems · Mathematics 2024-11-14 Stefan Steinerberger , Tony Zeng

Natural numbers satisfying a certain unusual property are defined by the author in a previous note. Later, the author called such numbers $v$-palindromic numbers and proved a periodic phenomenon pertaining to such numbers and repeated…

Number Theory · Mathematics 2021-06-22 Daniel Tsai

If a finite set $A$ tiles the integers by translations, it also admits a tiling whose period $M$ has the same prime factors as $|A|$. We prove that the minimal period of such a tiling is bounded by $\exp(c(\log D)^2/\log\log D)$, where $D$…

Number Theory · Mathematics 2024-07-08 Izabella Łaba , Dmitrii Zakharov