中文
相关论文

相关论文: An explicit economical additive basis

200 篇论文

Let n(2,k) denote the largest integer n for which there exists a set A of k nonnegative integers such that the sumset 2A contains {0,1,2,...,n-1}. A classical problem in additive number theory is to find an upper bound for n(2,k). In this…

数论 · 数学 2007-05-23 Sinan Gunturk , Melvyn B. Nathanson

For each integer $b \geq 3$ and every $x \geq 1$, let $\mathcal{N}_{b,0}(x)$ be the set of positive integers $n \leq x$ which are divisible by the product of their nonzero base $b$ digits. We prove bounds of the form $x^{\rho_{b,0} + o(1)}…

数论 · 数学 2020-12-15 Carlo Sanna

We show that if a subset A of {1,...,N} does not contain any solutions to the equation x+y+z=3w with the variables not all equal, then A has size at most exp(-c(log N)^{1/7}) N, where c > 0 is some absolute constant. In view of Behrend's…

组合数学 · 数学 2014-08-13 Tomasz Schoen , Olof Sisask

In additive number theory, a finite set $A$ of integers is an $h$-basis for $n$ if every integer in $\{0,1,2,\ldots, n\}$ can be represented as the sum of exactly $h$ not necessarily distinct elements of $A$. This paper introduces a new…

数论 · 数学 2026-05-28 Melvyn B. Nathanson

Let $\beta,\epsilon \in (0,1]$, and $k \geq \exp(122 \max\{1/\beta,1/\epsilon\})$. We prove that if $A,B$ are subsets of a prime field $\mathbb{Z}_{p}$, and $|B| \geq p^{\beta}$, then there exists a sum of the form $$S = a_{1}B \pm \ldots…

组合数学 · 数学 2018-01-30 Tuomas Orponen , Laura Venieri

Given two subsets $A, B \subseteq \mathbb{F}_p$ and a binary relation $\mathcal{R} \subseteq A \times B$, the restricted sumset of $A, B$ with respect to $\mathcal{R}$ is defined as $A +_{\mathcal{R}} B = \{ a+b \colon (a,b) \notin…

组合数学 · 数学 2025-09-05 Minghui Ouyang

Suppose that A is a subset of the integers {1,...,N} of density a. We provide a new proof of a result of Green which shows that A+A contains an arithmetic progression of length exp(ca(log N)^{1/2}) for some absolute c>0. Furthermore we…

数论 · 数学 2010-04-02 Tom Sanders

For every positive integer N and every $\alpha\in [0,1)$, let $B(N, \alpha)$ denote the probabilistic model in which a random set $A\subset \{1,\dots,N\}$ is constructed by choosing independently every element of $\{1,\dots,N\}$ with…

数论 · 数学 2020-05-15 Daniele Mastrostefano

We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$

组合数学 · 数学 2008-06-23 Jozsef Solymosi

When $g\in\mathbb{N}$ we say that $A\subset\mathbb{N}$ is a $B_{2}[g]$ sequence if every $m\in\mathbb{N}$ has at most $g$ distinct representations of the shape $m=b_{1}+b_{2}$ with $b_{1}\leq b_{2}$ and $b_{1},b_{2}\in A$. We show for every…

数论 · 数学 2024-05-08 Javier Pliego

The famous Erdos-Heilbronn conjecture plays an important role in the development of additive combinatorics. In 2007 Z. W. Sun made the following further conjecture (which is the linear extension of the Erdos-Heilbronn conjecture): For any…

数论 · 数学 2011-10-13 Zhi-Wei Sun , Li-Lu Zhao

We give a short proof of the fact that every set of natural numbers with positive upper Banach density contains the sum of two infinite sets. The approach simplifies earlier existing proofs.

动力系统 · 数学 2026-03-31 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

A set $S\subset \mathbb{N}$ is a Sidon set if all pairwise sums $s_1+s_2$ (for $s_1, s_2\in S$, $s_1\leq s_2$) are distinct. A set $S\subset \mathbb{N}$ is an asymptotic basis of order 3 if every sufficiently large integer $n$ can be…

数论 · 数学 2024-05-14 Cédric Pilatte

We establish that the summability of the series $\sum\varepsilon_n$ is the necessary and sufficient criterion ensuring that every $(1+\varepsilon_n)$ Markushevich basis in a separable Hilbert space is a Riesz basis. Further we show that if…

泛函分析 · 数学 2024-06-11 Beata Randrianantoanina , Michał Wojciechowski , Pavel Zatitskii

We prove that for sets $A, B, C \subset \mathbb{F}_p$ with $|A|=|B|=|C| \leq \sqrt{p}$ and a fixed $0 \neq d \in \mathbb{F}_p$ holds $$ \max(|AB|, |(A+d)C|) \gg|A|^{1+1/26}. $$ In particular, $$ |A(A+1)| \gg |A|^{1 + 1/26} $$ and $$…

数论 · 数学 2015-07-21 Dmitrii Zhelezov

Let $K$ be a number field with ring of integers $\mathcal{O}_K$. Let $\mathcal{N}_K$ be the set of positive integers $n$ such that there exist units $\varepsilon, \delta \in \mathcal{O}_K^\times$ satisfying $\varepsilon + \delta = n$. We…

数论 · 数学 2026-05-12 Magdaléna Tinková , Robin Visser , Pavlo Yatsyna

Additive combinatorics asks for lower bounds on sumsets and restricted sumsets over finite fields. Central examples are the Cauchy-Davenport theorem and the Erd\H{o}s-Heilbronn conjecture. In this note, we develop Das's linear algebraic…

组合数学 · 数学 2026-05-20 Guanzhong Yang

Let $a(n)$ be the number of partitions of $n$ of the form $a_1 + a_2 + \cdots + a_k$ where $a_{i + 1}$ is a proper divisor of $a_i$ for all $i < k$. Erd{\H o}s and Loxton showed that the sum of $a(n)$ over all $n \leq x$ is asymptotic to a…

数论 · 数学 2025-04-07 Noah Lebowitz-Lockard

Let $F$ be a field and a finite $A\subset F$ be sufficiently small in terms of the characteristic $p$ of $F$ if $p>0$. We strengthen the "threshold" sum-product inequality $$|AA|^3 |A\pm A|^2 \gg |A|^6\,,\;\;\;\;\mbox{hence} \;\;…

组合数学 · 数学 2018-09-27 Misha Rudnev , George Shakan , Ilya Shkredov

We study some variants of the Erd\H{o}s similarity problem. We pose the question if every measurable subset of the real line with positive measure contains a similar copy of an infinite geometric progression. We construct a compact subset…

度量几何 · 数学 2023-10-20 Alex Burgin , Samuel Goldberg , Tamás Keleti , Connor MacMahon , Xianzhi Wang