Sinan Gunturk, Melvyn B. Nathanson
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 paper it is proved that limsup_{k\to\infty} n(2,k)/k^2 \leq 0.4789.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Let $A$ be an additive basis of order $h$ and $X$ be a finite nonempty subset of $A$ such that the set $A \setminus X$ is still a basis. In this article, we give several upper bounds for the order of $A \setminus X$ in function of the order $h$ of $A$ and some parameters related to $X$ and $A$. If the parameter in question is the cardinality of $X$, Nathanson and Nash already obtained some of such upper bounds, which can be seen as polynomials in $h$ with degree $(|X| + 1)$. Here, by taking instead of the cardinality of $X$ the parameter defined by $d := \frac{\diam(X)}{\gcd\{x - y | x, y \in …
We study a mean value of the classical additive divisor problem. The main term we are interested in here is the one by Motohashi, but we also give an upper bound for the case where the main term is that of Atkinson. Furthermore, we point out that the proof yields an analogous upper bound for a shifted convolution sum over Fourier coefficients of a fixed holomorphic cusp form in mean.
We say that a set $S$ is additively decomposed into two sets $A$ and $B$ if $S = \{a+b : a\in A, \ b \in B\}$. A. Sárközy has recently conjectured that the set $Q$ of quadratic residues modulo a prime $p$ does not have nontrivial decompositions. Although various partial results towards this conjecture have been obtained, it is still open. Here we obtain a nontrivial upper bound on the number of such decompositions.
In this note we show that the methods of Motohashi and Meurman yield the same upper bound on the error term in the binary additive divisor problem. With this goal, we improve an estimate in the proof of Motohashi.
Additively indecomposable quadratic forms over totally real number fields
本文给出全实域上加法不可分解全正定二次型行列式范数的上界，并应用于确定$n$-万有二次型最小秩的上下界，同时分类了五个二次域上的加法不可分解二元二次型。
A subset $C$ of an abelian group $G$ is a minimal additive complement to $W \subseteq G$ if $C + W = G$ and if $C' + W \neq G$ for any proper subset $C' \subset C$. In this paper, we study which sets of integers arise as minimal additive complements. We confirm a conjecture of Kwon, showing that bounded-below sets with arbitrarily large gaps arise as minimal additive complements. Moreover, our construction shows that any such set belongs to a co-minimal pair, strengthening a result of Biswas and Saha for lacunary sequences. We bound the upper and lower Banach density of syndetic sets that aris…
Let (G, +) be an abelian group. A subset of G is sumfree if it contains no elements x, y, z such that x +y = z. We extend this concept by introducing the Schur degree of a subset of G, where Schur degree 1 corresponds to sumfree. The classical inequality S(n) $\le$ R n (3) -- 2, between the Schur number S(n) and the Ramsey number R n (3) = R(3,. .. , 3), is shown to remain valid in a wider context, involving the Schur degree of certain subsets of G. Recursive upper bounds are known for R n (3) but not for S(n) so far. We formulate a conjecture which, if true, would fill this gap. Indeed, our s…
This paper investigates partitions which have neither parts nor hook lengths divisible by $p$, referred to as $p$-core $p'$-partitions. We show that the largest $p$-core $p'$-partition corresponds to the longest walk on a graph with vertices $\{0, 1, \ldots, p-1\}$ and labelled edges defined via addition modulo $p$. We also exhibit an explicit family of large $p$-core $p'$-partitions, giving a lower bound on the size of the largest such partition which is of the same degree as the upper bound found by McSpirit and Ono.
In the late 1990s, Kim and Vu pioneered an inductive method for showing concentration of certain random variables X. Shortly afterwards, Janson and Ruci{ń}ski developed an alternative inductive approach, which often gives comparable results for the upper tail Pr(X \ge (1+\eps) E[X]). In some cases, both methods yield upper tail estimates which are best possible up to a logarithmic factor in the exponent, but closing this narrow gap has remained a technical challenge. In this paper we present a BK-inequality based combinatorial sparsification idea that can recover this missing logarithmic term …
Let A be an asymptotic basis for N and X a finite subset of A such that A\X is still an asymptotic basis. Farhi recently proved a new batch of upper bounds for the order of A\X in terms of the order of A and a variety of parameters related to the set X. He posed two questions concerning possible improvements to his bounds. In this note, we answer both questions.
Generalized additive bases and difference bases for Cartesian product of finite abelian groups
本文研究有限 Abel 群笛卡尔积 $G^n$ 中的广义 $g$-加法基与 $g$-差基，通过显式构造给出其最小规模的渐近尖锐上界。
Ideal-Smooth Sets and an Explicit Upper Bound for the Real Sum-Product Exponent
本文构造任意大的实数代数整数集，使和集与积集均不超过$|A|^{1.95835}$，通过理想光滑$S$-单位与互素因子结合，并利用张量积秩和区间算术给出显式上界。
Let $0\le α\le β\le 1$. For any finite set $B\subset\mathbb{N}$, we show that there exists a set $A\subset\mathbb{N}$ such that $\underline{d}(A+B) = α$ and $\bar{d}(A+B) = β$, where $\underline{d}(A+ B)$ and $\bar{d}(A+B)$ are the lower and upper asymptotic densities of the set $A+B$, respectively. This partially answers a question by Faisant et al. A theorem involving the so-called highly sparse sets was proved in the previous arXiv version of this note; however, as pointed out by Sai Teja Somu, the proof of the theorem was flawed. The theorem is now an open question.
We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.
We present a new proof of Corvaja and Zannier's \cite{C-Z} the upper bound of the number of solutions $(x,y)$ of the algebraic equation $P(x,y)=0$ over a field $\mathbb{F}_p$ ($p$ is a prime), in the case, where $x\in g_1G$, $y\in g_2G$, ($g_1G$, $g_2G$ -- are cosets by some subgroup $G$ of a multiplicative group $\mathbb{F}_p^*$). The estimate of Corvaja and Zannier was improved in average, and some applications of it has been obtained. In particular we present the new bounds of additive and polynomial energy.
We obtain a new upper bound for $\sum_{h\le H}Δ_k(N,h)$ for $1\le H\le N$, $k\in \N$, $k\ge3$, where $Δ_k(N,h)$ is the (expected) error term in the asymptotic formula for $\sum_{N < n\le2N}d_k(n)d_k(n+h)$, and $d_k(n)$ is the divisor function generated by $ζ(s)^k$. When $k=3$ the result improves, for $H\ge N^{1/2}$, the bound given in the recent work \cite{[1]} of Baier, Browning, Marasingha and Zhao, who dealt with the case $k=3$.
Sidon sets with $Δ$-separated sumsets in additive number theory
该研究针对整数区间内最大Δ-分离西顿集的基数，推导了其上下界，属于加法数论中西顿集相关的理论研究。
We prove bounds for the popularity of products of sets with weak additive structure, and use these bounds to prove results about continued fractions. Namely, we obtain a nearly sharp upper bound for the cardinality of Zaremba's set modulo $p$.
In this article we study the notion of essential subset of an additive basis, that is to say the minimal finite subsets $P$ of a basis $A$ such that $A \setminus P$ doesn't remains a basis. The existence of an essential subset for a basis is equivalent for this basis to be included, for almost all elements, in an arithmetic non-trivial progression. We show that for every basis $A$ there exists an arithmetic progression with a biggest common difference containing $A$. Having this common difference $a$ we are able to give an upper bound to the number of essential subsets of $A$: this is the radi…
For a prime $p$ and a polynomial $F(X,Y)$ over a finite field $\mathbb{F}_p$ of $p$ elements, we give upper bounds on the number of solutions $$ F(x,y)=0, \quad x\in\mathcal{A}, \ y\in \mathcal{B}, $$ where $\mathcal{A}$ and $\mathcal{B}$ are very small intervals or subgroups. These bounds can be considered as positive characteristic analogues of the result of Bombieri and Pila (1989) on sparsity of integral points on curves. As an application we prove that distinct consecutive elements in sequences generated compositions of several rational functions are not contained in any short intervals o…
In the paper we obtain some new upper bounds for exponential sums over multiplicative subgroups G of F^*_p having sizes in the range [p^{c_1}, p^{c_2}], where c_1,c_2 are some absolute constants close to 1/2. As an application we prove that in symmetric case G is always an additive basis of order five, provided by |G| > p^{1/2} log^{1/3} p. Also the method allows us to give a new upper bound for Heilbronn's exponential sum.
Problems in additive number theory, VII: The structure of additive $h$-bases for $n$
本文研究加性数论中有限整数集作为$h$-基的结构问题，提出了一类适合AI求解的新问题。
Additive energy of polynomial images
本文针对模整数环上的首一多项式，给出其像集加性能量的新上界，并应用于乘法特征和，改进了先前结果。
We study a generalization of additive bases into a planar setting. A planar additive basis is a set of non-negative integer pairs whose vector sumset covers a given rectangle. Such bases find applications in active sensor arrays used in, for example, radar and medical imaging. The problem of minimizing the basis cardinality has not been addressed before. We propose two algorithms for finding the minimal bases of small rectangles: one in the setting where the basis elements can be anywhere in the rectangle, and another in the restricted setting, where the elements are confined to the lower left…
I present a construction of permutation polynomials based on cyclotomy, an additive analogue of this construction, and a generalization of this additive analogue which appears to have no multiplicative analogue. These constructions generalize recent results of J. Marcos from arXiv:0810.2738v1.
Remarks on additive representations of natural numbers
本文研究互素无平方因子整数下形如 $a p+b P_{2}$ 的自然数表示，给出表示个数的新下界，并推广和改进了短区间、算术级数及哥德巴赫型上界等特殊情形中的已有结果。
Shortly after Szemerédi's proof that a set of positive upper density contains arbitrarily long arithmetic progressions, Furstenberg gave a new proof of this theorem using ergodic theory. This gave rise to the field of ergodic Ramsey Theory, in which problems motivated by additive combinatorics are proven using ergodic theory. Ergodic Ramsey Theory has since produced combinatorial results, some of which have yet to be obtained by other means, and has also given a deeper understanding of the structure of measure preserving systems. We outline the ergodic theory background needed to understand th…
Let $τ$ denote the divisor function, and $f$ be any multiplicative function that satisfies some mild hypotheses. We establish the asymptotic formula or non-trivial upper bound for the shifted convolution sum $\sum_{n \leq X}f(n)τ(n-1)$. We also derive several applications to multiplicative functions in the automorphic context, including the functions $λ_π(n), \,μ(n)λ_π(n)$ and $λ_ϕ(n)^l$. Here $λ_π(n)$ denotes the $n$-th Dirichlet coefficient of $\text{GL}_m$ automorphic $L$-function $L(s,π)$ for an automorphic irreducible cuspidal representation $π$, $λ_ϕ(n)$ denotes the $n$-th Fourier coeffi…
Least zero of pairs of additive cubic equations
本文研究了成对三次方程组的最小零点问题，给出了满足 $M$-good 条件下的有效上界，并推导了随机方程满足该条件的概率范围。
We obtain upper bounds for the fourth and higher moments of short exponential sums involving Fourier coefficients of holomorphic cusp forms twisted by rational additive twists with small denominators.
This is a survey of some of Erd\H os's work on bases in additive number theory.
The concept of additive basis has been investigated in the literature for several mathematicians which works with number theorem. Recently, the concept of finitely stable additive basis was introduced. In this note we provide a counterexample of the reciprocal of Theorem 2.2 shown in [Ferreira, L.A.: Finite Stable Additive Basis; Bull. Aust. Math. Soc.]. The idea of the construction of such a counterexample can possibly help the process of finding additive bases of some specific order.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。