All Questions
4 questions with no upvoted or accepted answers
8
votes
0
answers
145
views
Minimum length of sequence such that every integer from 1 to n can be achieved as the sum of some contiguous subsequence
This question literally came to me in a fever dream last night, and it's frustrating me to no end. I'll try to explain it as best I can, but there may not be a satisfying answer; the best outcome ...
5
votes
0
answers
307
views
On $s$-additive sequences
For a non-negative integer $s$, a strictly increasing sequence of positive integers $\{a_n\}$ is called $s$-additive if for $n>2s$, $a_n$ is the least integer exceeding $a_{n-1}$ which has ...
3
votes
0
answers
180
views
Additive combinatorics and a Diophantine equation
Let $(n_k)_{1 \leq k \leq N}$ be a sequence of distinct positive integers. For $v \in \mathbb{Z}$ set
$$
A_N(v) = \# \Big\{ (k,\ell) \in \{1, \dots, N\}^2, ~k \neq \ell:\quad n_k - n_\ell = v \Big\}.
$...
0
votes
0
answers
88
views
Infinite difference length of integer subsets
Let $A$ be a set of integers. In our recent researches, we've faced to the following property and definition:
We say $A$ has infinite difference length, if
(a) For every integer $n$ there exist a ...