首页/论文/2003.04075

arXiv 2003.040752020-03-09math.NTmath.CO

An analytic approach to cardinalities of sumsets

Dávid Matolcsi, Imre Ruzsa, George Shakan, Dmitrii Zhelezov

备注：: 25 pages

英文摘要：

Let $d$ be a positive integer and $U \subset \mathbb{Z}^d$ finite. We study $$β(U) : = \inf_{\substack{A , B \neq \emptyset \\ \text{finite}}} \frac{|A+B+U|}{|A|^{1/2}{|B|^{1/2}}},$$ and other related quantities. We employ tensorization, which is not available for the doubling constant, $|U+U|/|U|$. For instance, we show $$β(U) = |U|,$$ whenever $U$ is a subset of $\{0,1\}^d$. Our methods parallel those used for the Prékopa-Leindler inequality, an integral variant of the Brunn-Minkowski inequality.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

New lower bounds for cardinalities of higher dimensional difference sets and sumsets

Let $d \geq 4$ be a natural number and let $A$ be a finite, non-empty subset of $\mathbb{R}^d$ such that $A$ is not contained in a translate of a hyperplane. In this setting, we show that \[ |A-A| \geq \bigg(2d - 2 + \frac{1}{d-1} \bigg) |A| - O_{d}(|A|^{1- δ}), \] for some absolute constant $δ>0$ that only depends on $d$. This provides a sharp main term, consequently answering questions of Ruzsa and Stanchescu up to an $O_{d}(|A|^{1- δ})$ error term. We also prove new lower bounds for restricted type difference sets and asymmetric sumsets in $\mathbb{R}^d$.

2022-11-30math.COmath.NT

四点集和集基数的精确直径压缩

Exact diameter compression for four-point sumset cardinalities

University of Toronto Scarborough（多伦多大学士嘉堡校区）

该论文研究四元素整数集合的$h$重和集基数所需的最小区间直径，统一证明$h\ge17$时的精确公式，并通过有限搜索和构造给出完整刻画。

2026-10-05math.COmath.NT

加性数论中的问题，VI：和集的大小

Problems in additive number theory, VI: Sizes of sumsets

本文探讨整数及有序阿贝尔群有限子集的和集与受限和集的基数可能取值问题。

2025-03-07math.GRmath.NT

Some inverse results of sumsets

Let $h\geq 2$ and $A=\{a_0,a_1,\ldots,a_{k-1}\}$ be a finite set of integers. It is well-known that $\left|hA\right|=hk-h+1$ if and only if $A$ is a $k$-term arithmetic progression. In this paper, we give some nontrivial inverse results of the sets $A$ with some extrema the cardinalities of $hA$.

2019-11-03math.NT

The typical approximate structure of sets with bounded sumset

Let $A_1$ and $A_2$ be randomly chosen subsets of the first $n$ integers of cardinalities $s_2\geq s_1 = Ω(s_2)$, such that their sumset $A_1+A_2$ has size $m$. We show that asymptotically almost surely $A_1$ and $A_2$ are almost fully contained in arithmetic progressions $P_1$ and $P_2$ with the same common difference and cardinalities approximately $s_i m/(s_1+s_2)$. We also prove a counting theorem for such pairs of sets in arbitrary abelian groups. The results hold for $s_i = ω(\log^3 n)$ and $s_1+s_2 \leq m = o(s_2/\log^3 n)$. Our main tool is an asymmetric version of the method of hyperg…

2023-01-30math.COmath.NTmath.PR

和集的可能大小

Possible Sizes of Sumsets

研究$h$重和集基数范围$R(h,k)$的形式，证明对$h \in \mathbb{N}$存在常数$k_h$，当$k > k_h$时$R(h,k)$的特定形式，且给出$k_3 = 2$。

2026-07-17math.COmath.NT

更多相关论文收起更多论文

Sumsets of sequences in abelian groups and flags in field extensions

For a finite abelian group $G$ with subsets $A$ and $B$, the sumset $AB$ is $\{ab \mid a\in A, b \in B\}$. A fundamental problem in additive combinatorics is to find a lower bound for the cardinality of $AB$ in terms of the cardinalities of $A$ and $B$. This article addresses the analogous problem for sequences in abelian groups and flags in field extensions. For a positive integer $n$, let $[n]$ denote the set $\{0,\dots,n-1\}$. To a finite abelian group $G$ of cardinality $n$ and an ordering $G = \{1=v_0,\dots,v_{n-1}\}$, associate the function $T \colon [n] \times [n] \rightarrow [n]$ defin…

2022-07-21math.COmath.NT

When Generalized Sumsets are Difference Dominated

We study the relationship between the number of minus signs in a generalized sumset, $A+...+A-...-A$, and its cardinality; without loss of generality we may assume there are at least as many positive signs as negative signs. As addition is commutative and subtraction is not, we expect that for most $A$ a combination with more minus signs has more elements than one with fewer; however, recently Iyer, Lazarev, Miller and Zhang proved that a positive percentage of the time the combination with fewer minus signs can have more elements. Their analysis involves choosing sets $A$ uniformly at random …

2013-01-24math.NT

Prescribing the binary digits of squarefree numbers and quadratic residues

We study the equidistribution of multiplicatively defined sets, such as the squarefree integers, quadratic non-residues or primitive roots, in sets which are described in an additive way, such as sumsets or Hilbert cubes. In particular, we show that if one fixes any proportion less than $40\%$ of the digits of all numbers of a given binary bit length, then the remaining set still has the asymptotically expected number of squarefree integers. Next, we investigate the distribution of primitive roots modulo a large prime $p$, establishing a new upper bound on the largest dimension of a Hilbert cu…

2016-01-18math.NT

关于和集的密度，II

On the density of sumsets, II

该研究针对算术拟密度下和集的密度问题，证明对于覆盖模n!的o(n!)个剩余类的非空集B，存在集A使A与A+B在所有算术拟密度定义域内且和集密度可取[0,1]中任意值，拓展了和集密度理论。

2022-12-21math.NT

关于一个非对称加法能量不等式

On an asymmetric additive energy inequality

University of Warwick（华威大学）

研究关于广义加法能量不等式，给出其纯组合证明，不依赖傅里叶或谱分析，通过柯西 - 施瓦茨不等式等论证，还记录了非阿贝尔情形变体及和集类似结果。

2026-07-29math.COmath.NT