**0**

votes

**0**answers

20 views

### combinations of $k$ values that equals a sum within a sequence of ordered linear values [on hold]

exemple :
subset size : $k = 2$ (can be $> 2$)
Sum to find : 11
sequence : $ 1,2,3,4,5,6,7,8,9,10, \dotsc, n$
=> result of $k$-size [1,10] [2,9] [3,8] [4,7] ....
Any optimized, dichotomic ...

**6**

votes

**1**answer

193 views

### Is the exponent $2$ sharp in the Balog-Szemerédi-Gowers Theorem?

The Balog-Szemerédi-Gowers theorem can be stated in the following form: let $A,B$ be subsets of $\mathbb{Z}/n\mathbb{Z}$ (say) with equal cardinality, such that
$$
\|1_A*1_B\|_2 \ge K^{-1} \|1_A\|_1 ...

**10**

votes

**3**answers

1k views

### When does $P(a−b)=0$ for $a≠b$ ensure $P(0)=0$? (Continued.)

As a natural (and expectable) extension of my earlier question:
How large must be a set $A\subset F_2^n$ to ensure that if $P$ is a cubic polynomial in $n$ variables over the field $F_2$, ...

**15**

votes

**1**answer

312 views

### Combinatorics problem about sum of natural numbers

Following combinatorics problem is claimed to be an open problem in "The Princeton Companion to Mathematics" (pp. 6)
Let $a_1,a_2,a_3,...$ be a sequence of positive integers, and suppose that each ...

**7**

votes

**1**answer

516 views

### A variation of Minkowski sum

I have to work with the following variation of Minkowski sum:
Let $\mathbb E$ be a Euclidean space and $K$ be a convex set in $\mathbb E\times \mathbb E$.
Set
$$K^+=\{\\,x+y\in\mathbb ...

**7**

votes

**1**answer

973 views

### Coin problem with permutations

Let $a,b,c$ be positive integers with gcd$(a,b,c)=1$, and let $\mathbb{N}$ denote the set of nonnegative integers.
It is well known that $\mathbb{N} \setminus (a \mathbb{N}+b \mathbb{N} + c ...

**2**

votes

**0**answers

171 views

### Generalized arithmetic progressions contained in Bohr sets

Recall that a generalized arithmetic progression of dimension $d$ is, by definition, a set of the form $P = P_1+\dots+P_d$, where $P_j = \{lp_j\ \mid \ |l|\leq l_j\}\subset \mathbb Z$ is an ordinary ...

**3**

votes

**1**answer

174 views

### Find a subset such that its sum is divisible by $n$

It is said that the following proposition is true.
$\forall S \subset \mathbb{Z}, |S| = 2n-1.\ \exists A \subset S, |A| = n$ which satisfies
$$
n \ | \ \sum_{a \in A}a.
$$
Could someone gives a ...

**8**

votes

**0**answers

138 views

### Sets of natural numbers which are almost closed under addition

I am interested in a classification of sets $A \subseteq \mathbb{N}$ such that for all $k \in A$, $d( A+k \cap \mathbb{N} \setminus A) = 0$ where $d$ is the asymptotic density and $A+k = \{n \in ...

**6**

votes

**1**answer

104 views

### Are the extremal points of a certain set of functions $\mathcal P(\mathbf N) \to \bf R$ weakly additive?

Let an upper density (on $\mathbf N$) be a (set) function $f: \mathcal P(\mathbf N) \to \mathbf R$ such that, for all $X, Y \subseteq \bf N$ and $h,k \in \mathbf N^+$, the following hold:
(F1) ...

**13**

votes

**3**answers

1k views

### A seemingly simple combinatorial object that must have an easy generating function

One more question related to my earlier "Special" meanders.
I am trying to isolate simplest problems related to it. Here is one.
For a composition (i. e. a tuple of natural numbers) ...

**4**

votes

**1**answer

174 views

### “Pseudo-random” subsets of additive bases

We say that a subset $B \subset \mathbb{N}$ is an (asymptotic) additive basis of order $k$ if the set $kB = B + \cdots + B = \mathbb{N} \setminus C$, where $C$ is a finite set of positive integers. ...

**0**

votes

**0**answers

77 views

### Embedding a cancellative monoid into another in such a way that $|X-x|=|X|$, where $X$ is a fixed finite set and $x\in X$

Preliminaries.
Let $\mathbb A = (A, +)$ be a possibly non-commutative semigroup. For $X, Y \subseteq A$ we set
$$
X - Y := \{a \in A: a + y \in X\text{ for some }y \in Y\},
$$
which is just the usual ...

**5**

votes

**1**answer

235 views

### Zero-sum sets in union-closed families

The Davenport constant $D(G)$ of a finite abelian group $G$ is the minimum integer $n$ such that whenever $a_1, \ldots, a_n \in G$ (not necessarily distinct), there is a non-empty $I \subseteq [n]$ ...

**10**

votes

**2**answers

341 views

### Iterated sumset inequalities in cancellative semigroups

This question is motivated by the following well-known theorems:
Thm (Plünnecke): If $A$ is a finite nonempty subset of an abelian group, then for every $n$ we have $|A^n| \le ...

**1**

vote

**1**answer

92 views

### Does positive relative density imply asymptotic additive basis behaviour?

First definitions: let $A, B \ \subset \mathbb{Z_{>0}}$ and $1\in A, 1\in B$. We define the relative density of $A$ with respect to $B$ to be $$rel(A, B) = \inf_n \frac{|A \cap [1,n]|}{| B \cap ...

**9**

votes

**1**answer

284 views

### Largeness and arithmetic progression properties of generic reals

Consider the following properties for a subset $A$ of $\mathbb{N}$:
(1) $A$ is large: $\sum_{n \in A}$$ 1\over n$$=\infty,$
(2) $A^\infty=\limsup \frac{|A \cap \{ 1, \dots, n\}|}{n} >0$,
(3) ...

**3**

votes

**1**answer

127 views

### 3-dimensional vectors satisfying certain equalities

Question: Are there 5 distinct vectors $u,v,w,x,y \in \mathbb{R}^3$, all on the unit sphere (i.e. $||u||=||v||=||w||=||x||=||y||=1$), such that:
$||u+v+x||=||u+v+y||=||u+w+x||=||u+w+y||=1$
?
Also, ...

**9**

votes

**1**answer

441 views

### Who was/were the first to note that if $\sum_{x \in X} \frac{1}{x} < \infty$ then the natural density of $X$ is zero?

It is a result of folklore that the natural density of a set $X$ of positive integers such that $\sum_{x \in X} \frac{1}{x} < \infty$ is zero. This is reproved, e.g., in T. Šalát's paper: ...

**7**

votes

**1**answer

354 views

### Does $|A+A|$ concentrate near its mean?

Fix $N$ to be a large prime. Let $A \subset \mathbb{Z}/N\mathbb{Z}$ be a random subset defined by $\mathbb{P}(a \in A) = p$, where $p = N^{-2/3 + \epsilon}$ for some fixed $\epsilon > 0$. My ...

**22**

votes

**1**answer

713 views

### Two conjectures about zero inner products and dissociated sets

The following problems come from something I worked on (with my coauthors) related to proving a new time lower bound for streaming problems. Having worked on these problems for some time with little ...

**4**

votes

**0**answers

226 views

### The original proof of Szemerédi's Theorem

Nowadays there are plenty of different proofs of the celebrated Szemerédi's Theorem but for historical reasons I would like to read and understand the original proof. The proof is very tricky and, for ...

**6**

votes

**1**answer

313 views

### Additivity of upper densities with respect to arithmetic progressions of integers

Let $\mathsf{d}^\star$ be the asymptotic upper density, defined on the power set of positive integers $\mathbf{N}^+$, so that
$$
\mathsf{d}^\star\colon \mathcal{P}(\mathbf{N}^+) \to\mathbf{R}\colon ...

**3**

votes

**1**answer

159 views

### Freiman-isomorphic sets

Haw can we prove that an arbitrary set $A$ of $n$ positive integers is 2-Freiman isomorphic to a subset of {$ 1,2,...,4^{n}$} and $4^{n}$ cannot be improved to $2^{n}$?

**4**

votes

**1**answer

156 views

### Reference to a variant of Abel's summation formula

Edit. A stronger version of the formula is true (details follow).
Let $(a_n)_{n \ge 1}$ be a sequence of complex numbers, $(\lambda_n)_{n \ge 1}$ a nondecreasing sequence of positive reals such that ...

**2**

votes

**1**answer

219 views

### Some divisibility constraints in Frobenius coin problem

Let's say that the linear form $ax+by$ represents $n$ if $ax+by=n$ for some positive integer $x$ and $y$.
Call a pair $(a,b)\in\Bbb N\times\Bbb N$ with $\mathsf{gcd}(a,b)=1$ excellent if linear form ...

**2**

votes

**1**answer

58 views

### l-wise t-intersecting families of shifts of finite sets of integers

Let $A$ be a finite set of non-negative integers and write $I_k$ for the set ${0,1,\ldots,k-1}$. Form all possible l-wise intersections $(A+k_1)\cap \ldots \cap (A+k_l)$, where each $k_i$ runs through ...

**3**

votes

**1**answer

259 views

### Problem related to Frobenius coin problem

Let's say that the linear form $ax+by$ represents $n$ if $ax+by=n$ for some positive integer $x$ and $y$.
Call a pair $(a,b)\in\Bbb N\times\Bbb N$ with $\mathsf{gcd}(a,b)=1$ good if,
for any ...

**3**

votes

**2**answers

113 views

### Partition regular systems: do they have solution in (very dense) set of integers?

A partition regular system is a linear system of equations of the form $A\cdot x=0$, which satisfies a Ramsey-type result (namely, that for each $r>0$ whenever we colour the integers in $r$ ...

**2**

votes

**1**answer

100 views

### Intersections of translates of finite sets of integers

I am searching for a result in the literature that I am sure must be known, but I just fail to find it.
Let us starts with a simple example:
Let $A, B\subset \mathbb{Z}$ be a finite sets of integers ...

**1**

vote

**0**answers

79 views

### Consecutive integers divisible by consecutive small numbers

Given $n$, what is the largest set of consecutive integers in $[n,2n]$ can we have so that each integer is divisible by a distinct element from $[\log n,2\log n]$ (no partiular order)? So apriori I am ...

**5**

votes

**0**answers

70 views

### Some questions about the Lévy monoid of certain densities

Let $\bf H$ be a set, $f: \mathcal P({\bf H}) \rightharpoonup \bf R$ a partial function, and $\mathcal{D}$ the domain of $f$.
Next, denote by $\mathcal M(f)$ the set of all (total) functions $\theta: ...

**0**

votes

**0**answers

51 views

### $\mathsf{GCD}$s of random linear form

Given $a,b\in\Bbb N_{<M}$ where $M\in\Bbb N_{>\exp(18)}$ is arbitrary with $(a,b)=1$, the probability that $\mathsf{gcd}(ax_1+by_1,ax_2+by_2)=1$ where $x_1,x_2,y_1,y_2\in\Bbb N_{>\ln M}$ is ...

**3**

votes

**1**answer

143 views

### Exact statistics in the Frobenius coin problem

The Frobenius coin problem guarantees that if $(a,b)=1$, then
$$ax+by$$ does not represent exactly $\frac{(a-1)(b-1)}2$ numbers all below $g(a,b)=ab-a-b$ if $x,y\geq0$ holds.
Assume $m\in[0,ab-a-b]$ ...

**8**

votes

**0**answers

209 views

### An abstract zero-sum problem

I would like to know whether the problem described below has appeared in the literature and/or whether similar questions have been studied. I would be very happy to find some references or, if none ...

**9**

votes

**0**answers

297 views

### A characterization of quadratics similar to an inverse sieve problem

Suppose $\mathscr{A} \subset \mathbb{N}$ enjoys for all large enough cutoffs $X$ the following properties:
$|\mathscr{A} \cap [1,X]| > \sqrt{X}/10$; and
the discriminant $\prod_{\alpha \neq ...

**12**

votes

**1**answer

804 views

### Where did the term “additive energy” originate?

A fundamental object in modern additive combinatorics and harmonic analysis is additive energy. Given a subset $A$ of (say) an abelian group $G$ the additive energy of $A$ is defined to be the ...

**8**

votes

**0**answers

204 views

### Partition regularity in the squares

A linear equation $c_1x_1 + \cdots + c_sx_s = 0$ is partition regular if for every partition of the natural numbers into colour classes $A_1, \ldots, A_r$, there is a solution to the equation in which ...

**5**

votes

**0**answers

185 views

### Is $AA+A$ always at least as large as $A/A$?

Let $A$ be a finite set of real numbers. Is it always the case that $|AA+A| \geq |A/A|$?
In the line above, $AA+A:=\{ab+c:a,b,c \in A \}$, while $A/A:=\{a/b:a,b \in A, b\neq 0 \}$ is the ratio set.
...

**6**

votes

**1**answer

269 views

### Subsets of [1..N] with no three-term arithmetic progressions and no large gaps

Let S be a subset of [1..N] containing no three-term arithmetic progression, and let h(S) be the size of the largest gap between two consecutive elements of S. By Roth's theorem, h(S) has to grow ...

**42**

votes

**3**answers

3k views

### Number of elements in the set $\{1,\cdots,n\}\cdot\{1,\cdots,n\}$

Let $A_n=\{a\cdot b : a,b \in \mathbb{N}, a,b\leq n\}$. Are there any estimates for $|A_n|$? Will it be $o(n^2)$?

**6**

votes

**2**answers

263 views

### Additive energy of Piatetski-Shapiro sequences

Let $c>1$, and let $A$ denote the set
$$
\Big\{ \lfloor n^c \rfloor, \quad 1 \leq n \leq N \Big\}.
$$
Thus $A$ consists of the first $N$ elements of a so-called Piatetski-Shapiro sequence.
The ...

**1**

vote

**1**answer

155 views

### limit and combinatorics

Given $x \in (0,\frac{1}{2})$ and $y \in (0,\frac{1}{2}]$, what is the value of the following limit:
$\lim_{n\rightarrow \infty}\sum_{k=0}^{n}{n \choose k}|x^{n-k}(1-x)^{k}-y^{n-k}(1-y)^{k}|?$
When ...

**2**

votes

**0**answers

114 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\}.
...

**20**

votes

**1**answer

665 views

### Avoiding multiples of $p$

Let $p$ be a prime number and $P=\{1,2,...,p-1\}$
In how many ways we can sum all the elements of $P$ in such a way that we will reach a multiple of $p$
only when we sum the last summand?
For ...

**13**

votes

**1**answer

525 views

### Erdös-Turán via Hardy-Littlewood circle method?

For any set $B\subseteq \mathbb{N}$ one can associate the formal series
$$f_B(z) = \sum_{b\in B}z^b$$
and obtain
$$f_B(z)^k = \sum_{n\geqslant 0} r_{B,k}(n)z^n,$$
where $r_{B,k}(n) = ...

**3**

votes

**2**answers

327 views

### Is the sumset or the sumset of the square set always large?

Let A be a finite subset of $\mathbb{N}$, $\mathbb{R}$, or a sufficiently small subset of $\mathbb{F}_{p}$.
Do we have a lower bound of the form $|A|^{1+\delta}$ on the following quantity:
$$\max ...

**11**

votes

**2**answers

751 views

### Most dense subset of numbers that avoids arbitrarily long arithmetic progressions

The famous Green-Tao theorem says that there exist arbitrarily long sequences of primes in arithmetic progression.
I am wondering: How dense can a subset $S \subset \mathbb{N}$ be and still avoid
...

**3**

votes

**0**answers

156 views

### On covering by smooth numbers

Denote $P(n)=\mathsf{greatest}\mbox{ }\mathsf{prime}\mbox{ }\mathsf{factor}\mbox{ }\mathsf{of}\mbox{ }n$.
Denote $S(x,y)=\{n<x: P(n)<y\}$.
Denote $S_t(x,y)=\sum_{i=1}^tS(x,y)$ as $t$-fold ...

**18**

votes

**0**answers

496 views

### Which sets of roots of unity give a polynomial with nonnegative coefficients?

The question in brief: When does a subset $S$ of the complex $n$th roots of unity have the property that
$$\prod_{\alpha\, \in \,S} (z-\alpha)$$
gives a polynomial in $\mathbb R[z]$ with ...