Related papers: Burgess's Bounds for Character Sums

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…

In this article we give bounds for the eigenvalues of a matrix, which can be seen as a common generalization of meet and join matrices and therefore also as a generalization of both GCD and LCM matrices. Although there are some results…

In this paper, we investigate the distribution of the maximum of partial sums of certain cubic exponential sums, commonly known as "Birch sums". Our main theorem gives upper and lower bounds (of nearly the same order of magnitude) for the…

Motivated, roughly, by comparing the mean and median of an IID sum of bounded lattice random variables, we develop explicit and effective bounds on the errors involved in the one-term Edgeworth expansion for such sums.

It is proved the the restriction of any supercharacter of a finite group of triangular type on its subgroup is a sum of supercharacters with nonnegative integer coefficients. We define superinduction and prove the analog of the Frobenius…

We obtain lower bounds for the cardinality of $k$-fold sum-sets of reciprocals of elements of suitable defined short intervals in high degree extensions of finite fields. Combining our results with bounds for multilinear character sums we…

This paper considers a probabilistic model for floating-point computation in which the roundoff errors are represented by bounded random variables with mean zero. Using this model, a probabilistic bound is derived for the forward error of…

We extend known methods to establish upper bounds on the least character non-residues contingent on different zero-free regions within the critical strip, in particular on bounded rectangles within the critical strip along the $\sigma=1$…

We consider a family of character sums as multiplicative analogues of Kloosterman sums. Using Gauss sums, Jacobi sums and Deligne's bound for hyper-Kloosterman sums, we establish asymptotic formulae for any real (positive) moments of the…

Via a covariance representation based on characteristic functions, a known elementary proof of the Gaussian concentration inequality is presented. A few other applications are briefly mentioned.

In this paper, we study the power mean of a sum analogous to the Kloosterman sum by using analytic methods for character sums.

We establish a Berry--Esseen bound for general multivariate nonlinear statistics by developing a new multivariate-type randomized concentration inequality. The bound is the best possible for many known statistics. As applications,…

We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.

We are interested in determining the bound of the average of the degrees of the irreducible characters whose degrees are not divisible by some prime $p$ that guarantees a finite group $G$ of odd order is $p$-nilpotent. We find a bound that…

In this paper, we study the sum of additive characters over finite fields, with a focus on those of specified \(\mathbb{F}_q\)-Order. We establish a general formula for these character sums, providing an additive analogue to classical…

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with…

We establish upper and lower bounds with matching leading terms for tails of weighted sums of two-sided exponential random variables. This extends Janson's recent results for one-sided exponentials.

We obtain transformation formulas for quadratic character sums with quartic and cubic polynomial arguments.

We use some elementary arguments to obtain a new bound on bilinear sums with weighted Kloosterman sums which complements those recently obtained by E. Kowalski, P. Michel and W. Sawin (2020).

The probability that the sum of independent, centered, identically distributed, heavy-tailed random variables achieves a very large value is asymptotically equal to the probability that there exists a single summand equalling that value. We…