English
Related papers

Related papers: The resonance method for large character sums

200 papers

Methods of determining, from small-variable asymptotic expansions, the characteristic exponents for variables tending to infinity are analyzed. The following methods are considered: diff-log Pad\'e summation, self-similar factor…

Statistical Mechanics · Physics 2022-02-22 V. I. Yukalov , S. Gluzman

We find a new lower bound for the maximal number of zeros to harmonic polynomials, $p(z)+\overline{q(z)}$, when ${\rm deg}\, p = n$ and ${\rm deg}\, q = n-2$.

Complex Variables · Mathematics 2015-12-14 Seung-Yeop Lee , Andres Saez

Resonance Saturation in QCD can be understood in the large-Nc limit from the mathematical theory of Pade Approximants to meromorphic functions.

High Energy Physics - Phenomenology · Physics 2009-11-13 Pere Masjuan

A modified Dirichlet character $f$ is a completely multiplicative function such that for some Dirichlet character $\chi$, $f(p)=\chi(p)$ for all but a finite number of primes $p\in S$, and for those exceptional primes $p\in S$, $|f(p)|\leq…

Number Theory · Mathematics 2025-03-25 Marco Aymone , Ana Paula Chaves , Maria Eduarda Ramos

A method of estimating sums of multiplicative functions braided with Dirichlet characters is demonstrated, leading to a taxonomy of the characters for which such sums are large.

Number Theory · Mathematics 2012-08-02 P. D. T. A. Elliott , Jonathan Kish

We obtain explicit estimates for the mixed character sum $S= S(\chi,g,f,p^m) = \sum_{x=1}^{p^m} \chi (g(x)) e_{p^m}(f(x))$, where $p^m$ is a prime power, $\chi$ is a multiplicative character mod $p^m$ and $f,g$ are rational functions over…

Number Theory · Mathematics 2026-04-06 Todd Cochrane , Andrew Granville

We prove new upper bounds on the number of representations of rational numbers $\frac{m}{n}$ as a sum of $4$ unit fractions, giving five different regions, depending on the size of $m$ in terms of $n$. In particular, we improve the most…

Number Theory · Mathematics 2020-12-14 Christian Elsholtz , Stefan Planitzer

This work proves a Burgess bound for short mixed character sums in $n$ dimensions. The non-principal multiplicative character of prime conductor $q$ may be evaluated at any "admissible" form, and the additive character may be evaluated at…

Number Theory · Mathematics 2021-05-27 Lillian B. Pierce

Let $[x]$ be the integral part of $x$, $n>1$ be a positive integer and $\chi_n$ denote the trivial Dirichlet character modulo $n$. In this paper, we use an identity established by Z. H. Sun to get congruences of…

Number Theory · Mathematics 2022-11-30 Ni Li , Rong Ma

This work prepares new probability bounds for sums of random, independent, Hermitian tensors. These probability bounds characterize large-deviation behavior of the extreme eigenvalue of the sums of random tensors. We extend Lapalace…

Probability · Mathematics 2021-01-01 Shih Yu Chang

This paper is devoted to the study of metric subregularity and strong subregularity of any positive order $q$ for set-valued mappings in finite and infinite dimensions. While these notions have been studied and applied earlier for $q=1$…

Optimization and Control · Mathematics 2015-07-20 Boris Mordukhovich , Wei Ouyang

We derive upper and lower bounds on the sum of distances of a spherical code of size $N$ in $n$ dimensions when $N\sim n^\alpha, 0<\alpha\le 2.$ The bounds are derived by specializing recent general, universal bounds on energy of spherical…

Metric Geometry · Mathematics 2023-03-07 Alexander Barg , Peter Boyvalenkov , Maya Stoyanova

We obtain the exact value of the Hausdorff dimension of the set of coefficients of Gauss sums which for a given $\alpha \in (1/2,1)$ achieve the order at least $N^{\alpha}$ for infinitely many sum lengths $N$. For Weyl sums with polynomials…

Number Theory · Mathematics 2021-08-25 Roger C. Baker , Changhao Chen , Igor E. Shparlinski

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

Symbolic Computation · Computer Science 2011-11-10 Jean-Guillaume Dumas

We give explicit upper and lower bounds for $N(T,\chi)$, the number of zeros of a Dirichlet $L$-function with character $\chi$ and height at most $T$. Suppose that $\chi$ has conductor $q>1$, and that $T\geq 5/7$. If…

Number Theory · Mathematics 2020-05-07 Michael A. Bennett , Greg Martin , Kevin O'Bryant , Andrew Rechnitzer

In recent years, tensors have been applied to different applications in science and engineering fields. In order to establish theory about tail bounds of the tensors summation behavior, this work extends previous work by considering the…

Probability · Mathematics 2021-10-05 Shih Yu Chang

Let $f$ be a real-valued $1$-bounded multiplicative function. Suppose that the mean-value of $f^{2}$ exists, and $$\int_{0}^{1} \Big | \sum_{n \leq N} f(n)e^{2\pi i n \alpha} \Big | d \alpha\leq N^{o(1)}$$ as $N \rightarrow \infty$, then…

Number Theory · Mathematics 2025-10-24 Mayank Pandey , Maksym Radziwiłł

The number of frequencies of factors of length $n+1$ in a recurrent aperiodic infinite word does not exceed $3\Delta \C(n)$, where $\Delta \C (n)$ is the first difference of factor complexity, as shown by Boshernitzan. Pelantov\'a together…

Combinatorics · Mathematics 2013-02-05 Lubomira Balkova

We establish that three well-known and rather different looking conjectures about Dirichlet characters and their (weighted) sums, (concerning the P\'{o}lya-Vinogradov theorem for maximal character sums, the maximal admissible range in…

Number Theory · Mathematics 2021-12-24 Andrew Granville , Alexander P. Mangerel

Let $\mathcal{A}$ be a finite subset of $\mathbb{N}$ including $0$ and $f_\mathcal{A}(n)$ be the number of ways to write $n=\sum_{i=0}^{\infty}\epsilon_i2^i$, where $\epsilon_i\in\mathcal{A}$. We consider asymptotics of the summatory…

Number Theory · Mathematics 2015-09-07 Katie Anders
‹ Prev 1 8 9 10 Next ›