Related papers: A Slight Improvement to Garaev's Sum Product Estim…
Computing the probability of evidence even with known error bounds is NP-hard. In this paper we address this hard problem by settling on an easier problem. We propose an approximation which provides high confidence lower bounds on…
This paper proposes a new sharpened version of the Jensen's inequality. The proposed new bound is simple and insightful, is broadly applicable by imposing minimum assumptions, and provides fairly accurate result in spite of its simple form.…
In this paper, we develop a method of evaluating general exponential sums with rational amplitude functions for multiple variables which complements works by T. Cochrane and Z. Zheng on the single variable case. As an application, for…
We improve the "sieve" part of the number field sieve used in factoring integer and computing discrete logarithm. The runtime of our method is shorter than that of existing methods. Under some reasonable assumptions, we prove that it is…
In this note, an upper bound for the sum of fractional parts of certain smooth functions is established. Such sums arise naturally in numerous problems of analytic number theory. The main feature is here an improvement of the main term due…
In our paper, we introduce a new method for estimating incidences via representation theory. We obtain several applications to various sums with multiplicative characters and to Zaremba's conjecture from number theory.
Some improvements of the celebrated Schwarz inequality in complex inner product spaces are given. Applications for n-tuples of complex numbers are provided.
We improve the known upper bound for short exponential sums and increase the range on which a sharp upper bound is known.
Our previous theorems on exponential sums often did not apply or did not give sharp results when certain powers of a variable appearing in the polynomial were divisible by p. We remedy that defect in this paper by systematically applying…
We present a new advancement in the sum and difference of sets problem, which improves upon recent results by both DeepMind's AlphaEvolve ($\theta = 1.1584$) and subsequent explicit constructions ($\theta = 1.173050$). In this work, we…
We prove an exponential integral estimate for the quadratic partial sums of multiple Fourier series on large sets that implies some new properties of Fourier series.
We describe a novel optimization method for finite sums (such as empirical risk minimization problems) building on the recently introduced SAGA method. Our method achieves an accelerated convergence rate on strongly convex smooth problems.…
We establish several sum-product estimates over finite fields that involve polynomials and rational functions. First, |f(A)+f(A)|+|AA| is substantially larger than |A| for an arbitrary polynomial f over F_p. Second, a characterization is…
In this paper we proved a new numerically explicit version of the P\'{o}lya--Vinogradov inequality. Our proof is based on the new ideas of V.A. Bykovskii and improves a recent inequality obtained by C. Pomerance.
We show two asymmetric estimates, one on the number of collinear triples and the other on that of solutions to $(a_1+a_2)(a_1^{\prime\prime\prime}+a_2^{\prime\prime\prime})=(a_1^\prime+a_2^\prime)(a_1^{\prime\prime}+a_2^{\prime\prime})$. As…
We extend the recent Solymosi's sum-product estimate for reals to the complex case.
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…
In this paper, we study the average size of the product of a number and its multiplicative inverse modulo a prime p. This turns out to be related to moments of L-functions and leads to a curious asymptotic formula for a certain triple…
Under the Riemann Hypothesis, we improve the error term in the asymptotic formula related to the counting lattice problem studied in a first part of this work. The improvement comes from the use of Weyl's bound for exponential sums of…
We obtain asymptotic formulas for sums over arithmetic progressions of coefficients of polynomials of the form $$\prod_{j=1}^n\prod_{k=1}^{p-1}(1-q^{pj-k})^s,$$ where $p$ is an odd prime and $n, s$ are positive integers. Let us denote by…