English
Related papers

Related papers: On new sum-product type estimates

200 papers

We augment the method of Wooley (2015) by some new ideas and in a series of results, improve his metric bounds on the Weyl sums and the discrepancy of fractional parts of real polynomials with partially prescribed coefficients. We also…

Classical Analysis and ODEs · Mathematics 2019-10-09 Changhao Chen , Igor E. Shparlinski

This paper provides new bounds on the size of spheres in any coordinate-additive metric with a particular focus on improving existing bounds in the sum-rank metric. We derive improved upper and lower bounds based on the entropy of a…

Information Theory · Computer Science 2025-07-04 Hugo Beeloo-Sauerbier Couvée , Thomas Jerkovits , Jessica Bariffi

A subset of a group is product-free if it does not contain elements a, b, c such that ab = c. We review progress on the problem of determining the size of the largest product-free subset of an arbitrary finite group, including a lower bound…

Group Theory · Mathematics 2007-11-08 Kiran S. Kedlaya

We present a new family of information-theoretic generalization bounds within the framework of conditional mutual information (CMI). Most of our results are established based on the leave-$m$-out (L$m$O) cross-validation error, with $m$…

Information Theory · Computer Science 2026-05-21 Yang Lu , Matthias Frey , Margreta Kuijper , Jingge Zhu

This paper gives an improved sum-product estimate for subsets of a finite field whose order is not prime. It is shown, under certain conditions, that $$\max\{|A+A|,|A\cdot{A}|\}\gg{\frac{|A|^{12/11}}{(\log_2|A|)^{5/11}}}.$$ This new…

Combinatorics · Mathematics 2011-06-07 Liangpan Li , Oliver Roche-Newton

For finite subsets A_1,...,A_n of a field, their sumset is given by {a_1+...+a_n: a_1 in A_1,...,a_n in A_n}. In this paper we study various restricted sumsets of A_1,...,A_n with restrictions of the following forms: a_i-a_j not in S_{ij},…

Combinatorics · Mathematics 2007-05-23 Zhi-Wei Sun , Yeong-Nan Yeh

Besides various asymptotic results on the concept of sum-product bases in $\mathbb{N}_0$, we consider by probabilistic arguments the existence of thin sets $A,A'$ of integers such that $AA+A=\mathbb{N}_0$ and $A'A'+A'A'=\mathbb{N}_0$.

Number Theory · Mathematics 2019-04-15 Francois Hennecart , Gyan Prakash , E. Pramod

We improve the known upper bound for short exponential sums and increase the range on which a sharp upper bound is known.

Number Theory · Mathematics 2012-01-13 Anne-Maria Ernvall-Hytönen

In the paper we develop the method of higher energies. New upper bounds for the additive energies of convex sets, sets A with small |AA| and |A(A+1)| are obtained. We prove new structural results, including higher sumsets, and develop the…

Combinatorics · Mathematics 2013-01-01 Ilya D. Shkredov

This is a survey of old and new problems and results in additive number theory.

Number Theory · Mathematics 2025-10-28 Melvyn B. Nathanson

We introduce methods to bound the mean of a discrete distribution (or finite population) based on sample data, for random variables with a known set of possible values. In particular, the methods can be applied to categorical data with…

Statistics Theory · Mathematics 2021-11-16 Eric Bax , Frédéric Ouimet

Known Bernstein-type upper bounds on the tail probabilities for sums of independent zero-mean sub-exponential random variables are improved in several ways at once. The new upper bounds have a certain optimality property.

Probability · Mathematics 2022-08-15 Iosif Pinelis

Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…

Information Theory · Computer Science 2007-07-13 Beniamin Mounits , Tuvi Etzion , Simon Litsyn

A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…

Classical Analysis and ODEs · Mathematics 2011-10-26 Armen Bagdasaryan

The lambda-dilate of a set A is lambda*A={lambda a : a \in A}. We give an asymptotically sharp lower bound on the size of sumsets of the form lambda_1*A+...+lambda_k*A for arbitrary integers lambda_1,...,lambda_k and integer sets A. We also…

Number Theory · Mathematics 2008-04-03 Boris Bukh

We develop the foundations of a general framework for producing optimal upper and lower bounds on the sum $\sum_p a_p$ over primes $p$, where $(a_n)_{x/2<n\le x}$ is an arbitrary non-negative sequence satisfying Type I and Type II…

Number Theory · Mathematics 2024-07-22 Kevin Ford , James Maynard

Rough Set based Spanning Sets were recently proposed to deal with uncertainties arising in the problem in domain of natural language processing problems. This paper presents a novel span measure using upper approximations. The key…

Artificial Intelligence · Computer Science 2021-07-27 Nidhika Yadav

We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…

Mathematical Physics · Physics 2007-05-23 Mark W. Coffey

This is a sequel to the paper arXiv:1312.6438 by the same authors. In this sequel, we quantitatively improve several of the main results of arXiv:1312.6438, and build on the methods therein. The main new results is that, for any finite set…

Combinatorics · Mathematics 2017-04-05 Brendan Murphy , Oliver Roche-Newton , Ilya Shkredov

In this paper we show some multiplicity estimates theorems for a connected algebraic group (not necessarily commutative) $G$ over an algebraically closed subfield of $\mathbb{C}$. More specifically, under particular assumptions on the…

Algebraic Geometry · Mathematics 2015-12-15 Mario Huicochea