Related papers: Burgess's Bounds for Character Sums
We use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solution in boxes with the side…
We show a general lower bound for Mean-value of Dirichlet polynomials
We obtain a non--trivial upper bound for the multiplicative energy of any sufficiently large subset of a subvariety of a finite algebraic group. We also find some applications of our results to growth of conjugates classes, estimates of…
We prove that the ratio of the Newman sum over numbers multiple of a fixed integer which is not multiple of 3 and the Newman sum over numbers multiple of a fixed integer divisible by 3 is o(1) when the upper limit of summing tends to…
We tell the story of the discovery of an interesting bound on finite sums and its application to comparison of Ising models.
We prove generalized ABC theorems for vanishing sums of non-Archimedean entire functions of several variables in arbitrary characteristic.
We give an explicit version of a result due to D. Burgess. Let $\chi$ be a non-principal Dirichlet character modulo a prime $p$. We show that the maximum number of consecutive integers for which $\chi$ takes on a particular value is less…
In 1961, Solomon gave upper and lower bounds for the sum of all the entries in the character table of a finite group in terms of elementary properties of the group. In a different direction, we consider the ratio of the character table sum…
The classical Cram\'er-Rao inequality gives a lower bound for the variance of a unbiased estimator of an unknown parameter, in some statistical model of a random process. In this note we rewrite the statment and proof of the bound using…
We find some general lower bounds of the sum of certain families of multigraded Betti numbers of any simplicial complex with a vertex coloring.
We derive inclusion regions for the eigenvalues of matrix polynomials expressed in a general polynomial basis, which can lead to significantly better results than traditional bounds. We present several applications to engineering problems.
Under certain circumstances, some of which are made explicit here, one can deduce bounds on the full sum of a perturbation series of a physical quantity by using a variational Borel map on the partial series. The method is illustrated by…
We give a new bound on the number of collinear triples for two arbitrary subsets of a finite field. This improves on existing results which rely on the Cauchy inequality. We then us this to provide a new bound on trilinear and quadrilinear…
We establish a central limit theorem for the eigenvalue counting function of a matrix of real Gaussian random variables.
This paper gives two sharp bounds for the generalized ballot problem with candidate A receiving at least \mu times as candidate B for an arbitrary real number \mu.
We construct a new tail bound for the sum of independent random variables for situations in which the expected value of the sum is known and each random variable lies within a specified interval, which may be different for each variable.…
We establish new estimates on short character sums for arbitrary composite moduli with small prime factors. Our main result improves on the Graham-Ringrose bound for square free moduli and also on the result due to Gallagher and Iwaniec…
We give new equivalent characterizations for ideals of Borel type. Also, we prove that the regularity of a product of ideals of Borel type is bounded by the sum of the regularities of those ideals.
In this paper we shall consider some famous means such as arithmetic, harmonic, geometric, root square mean, etc. Considering the difference of these means, we can establish. some inequalities among them. Interestingly, the difference of…
This paper extends the idea of a generalized estimator for a scalar parameter (Vos, 2022) to multi-dimensional parameters both with and without nuisance parameters. The title reflects the fact that generalized estimators provide more than…