English
Related papers

Related papers: Some explicit constructions of sets with more sums…

200 papers

Let $A$ be a nonempty finite subset of an additive abelian group $G$. Given a nonnegative integer $h$, the $h$-fold sumset $hA$ is the set of all sums of $h$ elements of $A$, and the restricted $h$-fold sumset $h^\wedge A$ is the set of all…

Number Theory · Mathematics 2025-08-19 Vivekanand Goswami , Raj Kumar Mistri

Given $d \in \mathbb{N}$, we establish sum-product estimates for finite, non-empty subsets of $\mathbb{R}^d$. This is equivalent to a sum-product result for sets of diagonal matrices. In particular, let $A$ be a finite, non-empty set of $d…

Combinatorics · Mathematics 2021-01-27 Akshat Mudgal

We study sets of the form $A = \big\{ n \in \mathbb N \big| \lVert p(n) \rVert_{\mathbb R / \mathbb Z} \leq \varepsilon(n) \big\}$ for various real valued polynomials $p$ and decay rates $\varepsilon$. In particular, we ask when such sets…

Number Theory · Mathematics 2018-07-20 Jakub Konieczny

We show that if V is a subvariety of the affine N-space defined by polynomials of degree at most d, then the sum of its $\ell$-adic Betti numbers does not exceed $2(N + 1)^{2N +1}(d+ 1)^N$. This answers a question of Katz (FFA 2001).

Algebraic Geometry · Mathematics 2025-01-24 Dingxin Zhang

A conjecture of Freiman gives an exact formula for the largest volume of a finite set $A$ of integers with given cardinality $k = |A|$ and doubling $T = |2A|$. The formula is known to hold when $T \le 3k-4$, for some small range over $3k-4$…

Number Theory · Mathematics 2018-08-28 Gregory A. Freiman , Oriol Serra , Christoph Spiegel

Let $A$ be a nonempty finite set of $k$ integers. Given a subset $B$ of $A$, the sum of all elements of $B$, denoted by $s(B)$, is called the subset sum of $B$. For a nonnegative integer $\alpha$ ($\leq k$), let \[\Sigma_{\alpha}…

Number Theory · Mathematics 2019-09-04 Jagannath Bhanja , Ram Krishna Pandey

In contrast to finite arithmetic configurations, relatively little is known about which infinite patterns can be found in every set of natural numbers with positive density. Building on recent advances showing infinite sumsets can be found,…

Combinatorics · Mathematics 2025-05-15 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

A MAD (maximal almost disjoint) family is an infinite subset A of the infinite subsets of {0,1,2,..} such that any two elements of A intersect in a finite set and every infinite subset of {0.1.2...} meets some element of $\aa$ in an…

Logic · Mathematics 2007-05-23 Arnold W. Miller

We give a new proof of the discretized ring theorem for sets of real numbers. As a special case, we show that if $A\subset\mathbb{R}$ is a $(\delta,1/2)_1$-set in the sense of Katz and Tao, then either $A+A$ or $A.A$ must have measure at…

Classical Analysis and ODEs · Mathematics 2023-08-24 Larry Guth , Nets Hawk Katz , Joshua Zahl

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…

Dynamical Systems · Mathematics 2007-11-21 A. Fish

We say the sets of nonnegative integers A and B are additive complements if their sum contains all sufficiently large integers. In this paper we prove a conjecture of Chen and Fang about additive complement of a finite set.

Number Theory · Mathematics 2013-04-26 Sándor Z. Kiss , Eszter Rozgonyi , Csaba Sándor

We prove some new bounds for the size of the maximal dissociated subset of structured (having small sumset, large energy and so on) subsets A of an abelian group.

Combinatorics · Mathematics 2015-12-30 Tomasz Schoen , Ilya D. Shkredov

We prove that there is a small but fixed positive integer e such that for every prime larger than a fixed integer, every subset S of the integers modulo p which satisfies |2S|<(2+e)|S| and 2(|2S|)-2|S|+2 < p is contained in an arithmetic…

Number Theory · Mathematics 2009-10-03 Oriol Serra , Gilles Zémor

For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…

Combinatorics · Mathematics 2012-07-16 Noga Alon

Suppose that $K$ and $ K'$ are two affine Cantor sets. It is shown that the sum set $K+K'$ has equal box and Hausdorff dimensions and in this number named $s$, $H^s(K+K')<\infty$. Moreover, for almost every pair $(K,K')$ satisfying…

Dynamical Systems · Mathematics 2024-11-25 Mehdi Pourbarat

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…

Combinatorics · Mathematics 2021-01-25 Peter Borg , Carl Feghali

By using nonstandard analysis, we prove embeddability properties of difference sets $A-B$ of sets of integers. (A set $A$ is "embeddable" into $B$ if every finite configuration of $A$ has shifted copies in $B$.) As corollaries of our main…

Logic · Mathematics 2013-12-25 Mauro Di Nasso

Let f(x_1,x_2,...,x_m) = u_1x_1+u_2 x_2+... + u_mx_m be a linear form with positive integer coefficients, and let N_f(k) = min{|f(A)| : A \subseteq Z and |A|=k}. A minimizing k-set for f is a set A such that |A|=k and |f(A)| = N_f(k). A…

Number Theory · Mathematics 2021-01-06 Melvyn B. Nathanson

Cameron and Erd\H{o}s asked whether the number of \emph{maximal} sum-free sets in $\{1, \dots , n\}$ is much smaller than the number of sum-free sets. In the same paper they gave a lower bound of $2^{\lfloor n/4 \rfloor }$ for the number of…

Combinatorics · Mathematics 2018-05-14 József Balogh , Hong Liu , Maryam Sharifzadeh , Andrew Treglown

We show that the biggest possible average set size in the complement $2^{\{1,2,\ldots, n\}} \setminus A$ of a union-closed family $A \subset 2^{\{1,2, \ldots, n\}}$ is $\tfrac{n+1}{2}$. With the same proof we get a sharp upper bound for the…

Combinatorics · Mathematics 2020-05-04 Luca Studer
‹ Prev 1 8 9 10 Next ›