English
Related papers

Related papers: Improving the Burgess bound via Polya-Vinogradov

200 papers

We give new improvements to the Chudnovsky-Chudnovsky method that provides upper bounds on the bilinear complexity of multiplication in extensions of finite fields through interpolation on algebraic curves. Our approach features three…

Computational Complexity · Computer Science 2012-03-19 Hugues Randriambololona

We obtain new bounds, pointwisely and on average, for Dedekind sums $\mathsf{s}(\lambda,p)$ modulo a prime $p$ with $\lambda$ of small multiplicative order $d$ modulo $p$. Assuming the infinitude of Mersenne primes, the range of our results…

Number Theory · Mathematics 2024-02-20 Bence Borda , Marc Munsch , Igor Shparlinski

In 2015, the author proved combinatorially character formulas expressing sums of the (formal) dimensions of irreducible representations of symplectic groups, refining some works of Nekrasov and Okounkov, Han, King, and Westbury. In this…

Combinatorics · Mathematics 2016-12-13 Mathias Pétréolle

We obtain nontrivial bounds for character sums with multiplicative and additive characters over finite fields over elements with restricted coordinate expansion. In particular, we obtain a nontrivial estimate for such a sum over a finite…

Number Theory · Mathematics 2023-10-24 Siddharth Iyer , Igor Shparlinski

We give tight bounds for logarithmic mean. We also give new Frobenius norm inequalities for two positive semidefinite matrices. In addition, we give some matrix inequalities on matrix power mean.

Functional Analysis · Mathematics 2014-02-05 Shigeru Furuichi , Kenjiro Yanagi

We generalize an improved Lech bound, due to Huneke, Smirnov, and Validashti, for the Buchsbaum-Rim multiplicity and mixed multiplicity. We reduce the problem to the graded case and then to the polynomial ring case. There we use complete…

Commutative Algebra · Mathematics 2020-08-05 Vinh Nguyen , Kelsey Walters

The best polynomial approximation and Chebyshev approximation are both important in numerical analysis. In tradition, the best approximation is regarded as more better than the Chebyshev approximation, because it is usually considered in…

Numerical Analysis · Mathematics 2021-11-17 Xiaolong Zhang

The main aim of this article is to establish a sharp improvement of the classical Bohr inequality for bounded holomorphic mappings in the polydisk $\mathbb{P}\Delta(0;1_n)$. We also prove two other sharp versions of the Bohr inequality in…

Complex Variables · Mathematics 2025-12-09 Molla Basir Ahamed , Sujoy Majumder , Nabadwip Sarkar , Ming-Sheng Liu

We combine Wooley's efficient congruencing method with earlier work of Vinogradov and Hua to get effective bounds on Vinogradov's mean value theorem.

Number Theory · Mathematics 2019-06-19 Raphael S. Steiner

Using the recent result of Bourgain, Demeter and Guth on Vinogradov's mean value, a number of new results about small fractional parts of polynomials and fractional parts of additive forms are obtained. These improve work of Baker, Cook,…

Number Theory · Mathematics 2016-03-03 Roger Baker

We offer new proofs, refinements as well as new results related to classical means of two variables, including the identric and logarithmic means.

Classical Analysis and ODEs · Mathematics 2015-03-23 József Sándor , Barkat Ali Bhayo

In this paper, we derive new probability bounds for Chebyshev's inequality if the supremum of the probability density function is known. This result holds for one-dimensional or multivariate continuous probability distributions with finite…

Methodology · Statistics 2019-02-12 Tomohiro Nishiyama

We estimate double sums $$ S_\chi(a, I, G) = \sum_{x \in I} \sum_{\lambda \in G} \chi(x + a\lambda), \qquad 1\le a < p-1, $$ with a multiplicative character $\chi$ modulo $p$ where $I= \{1,\ldots, H\}$ and $G$ is a subgroup of order $T$ of…

Number Theory · Mathematics 2014-05-21 Mei-Chu Chang , Igor E. Shparlinski

The Riesz-Sobolev inequality provides an upper bound, in integral form, for the convolution of indicator functions of subsets of Euclidean space. We formulate and prove a sharper form of the inequality. This can be equivalently phrased as a…

Classical Analysis and ODEs · Mathematics 2017-06-08 Michael Christ

Under Poincar\'e-type conditions, upper bounds are explored for the Kolmogorov distance between the distributions of weighted sums of dependent summands and the normal law. Based on improved concentration inequalities on high-dimensional…

Probability · Mathematics 2020-11-19 S. G. Bobkov , G. P. Chistyakov , F. Götze

In this paper, we introduce and investigate a new subclass of bi-prestarlike functions defined in the open unit disk, associated with Chebyshev Polynomials. Furthermore, we find estimates of first two coefficients of functions in these…

Complex Variables · Mathematics 2020-03-24 Hatun Ozlem Guney , G. Murugusundaramoorthy , K. Vijaya , K. Thilagavathi

A sharp quantitative polygonal isoperimetric inequality is obtained.

Analysis of PDEs · Mathematics 2015-02-23 Emanuel Indrei

Let $q$ be a power of a prime and let $\mathbb{F}_q$ be the finite field consisting of $q$ elements. We establish new explicit estimates on Gauss sums of the form $S_n(a) = \sum_{x\in \mathbb{F}_q}\psi_a(x^n)$, where $\psi_a$ is a…

Number Theory · Mathematics 2019-06-03 Ali Mohammadi

We use the characterization of weak type inequalities via Garsia-Rodemich conditions to show self improving properties of Poincar\'e-Sobolev inequalities in a very general context.

Functional Analysis · Mathematics 2016-05-17 Mario Milman

Many upper bounds for the moduli of polynomial roots have been proposed but reportedly assessed on selected examples or restricted classes only. Regarding quality measured in terms of worst-case relative overestimation of the maximum…

Numerical Analysis · Mathematics 2024-11-26 Prashant Batra