中文
相关论文

相关论文: Distribution of mixed character sums and extremal …

200 篇论文

We consider sums of the form $$F_\chi(\alpha,\beta;\theta) := \sum_{\alpha p<n\le\beta p}\chi(n)e(n\theta),$$ where $\chi$ is a non-principal Dirichlet character modulo a prime number $p$. We prove that $$ \sqrt p \log \log p \ll \max_{0…

数论 · 数学 2026-05-14 Néo Tardy

We give $L^1$-norm estimates for exponential sums of a finite sets $A$ consisting of integers or lattice points. Under the assumption that $A$ possesses sufficient multidimensional structure, our estimates are stronger than those of…

数论 · 数学 2020-06-19 Brandon Hanson

For any given integer $k\geq 2$ we prove the existence of infinitely many $q$ and characters $ \chi\pmod q$ of order $k$, such that $|L(1,\chi)|\geq (e^{\gamma}+o(1))\log\log q$. We believe this bound to be best possible. When the order $k$…

数论 · 数学 2019-02-20 Youness Lamzouri

Let $\chi=\chi_q$ be a primitive character mod $q$ and fix $\Delta>0$. In 1989 Graham and Ringrose gave strong bounds on character sums $\sum_{M<n\leq M+N} \chi(n)$ in intervals of length $N=q^\Delta$ whenever $q$ is squarefree and is…

数论 · 数学 2026-01-19 Todd Cochrane , Andrew Granville , Junren Zheng

We prove that the average size of a mixed character sum $$\sum_{1\le n \le x} \chi(n) e(n\theta) w(n/x)$$ (for a suitable smooth function $w$) is on the order of $\sqrt{x}$ for all irrational real $\theta$ satisfying a weak Diophantine…

数论 · 数学 2026-01-28 Victor Y. Wang , Max Wenqiang Xu

In recent years the question of maximizing GCD sums regained interest due to its firm link with large values of $L$-functions. In the present paper we initiate the study of minimizing for positive weights~$w$ of normalized $L^1$- norm the…

数论 · 数学 2019-07-02 Régis de la Bretèche , Marc Munsch

For integer $q$, let $\chi$ be a primitive multiplicative character$\pmod q.$ For integer $a$ coprime to $q$, we obtain a new bound for the sums $$\sum_{n\le N}\Lambda(n)\chi(n+a),$$ where $\Lambda(n)$ is the von Mangoldt function. This…

数论 · 数学 2013-09-25 Bryce Kerr

Let $X,X_1,...,X_n$ be independent identically distributed random variables. In this paper we study the behavior of the concentration functions of the weighted sums $\sum\limits_{k=1}^{n}a_k X_k$ with respect to the arithmetic structure of…

概率论 · 数学 2015-05-12 Yulia S. Eliseeva , Friedrich Götze , Andrei Yu. Zaitsev

In the present note, we prove new lower bounds on large values of character sums $\Delta(x,q):=\max_{\chi \neq \chi_0} \vert \sum_{n\leq x} \chi(n)\vert$ in certain ranges of $x$. Employing an implementation of the resonance method…

数论 · 数学 2018-05-21 Marc Munsch

This paper proves Burgess bounds for short mixed character sums in multi-dimensional settings. The mixed character sums we consider involve both an exponential evaluated at a real-valued multivariate polynomial, and a product of…

数论 · 数学 2016-01-19 L. B. Pierce

In this paper, we give a direct quantitative estimate of $L^1$norms of non-harmonic trigonometric polynomials over large enough intervals. This extends the result by Konyagin and Mc Gehee, Pigno, Smith to the settingof trigonometric…

经典分析与常微分方程 · 数学 2023-12-12 Philippe Jaming , Karim Kellay , Chadi Saba

We calculate the E-polynomials of certain twisted GL(n,C)-character varieties M_n of Riemann surfaces by counting points over finite fields using the character table of the finite group of Lie-type GL(n,F_q) and a theorem proved in the…

代数几何 · 数学 2008-05-07 Tamas Hausel , Fernando Rodriguez-Villegas

In this paper, we study the distribution of difference of multiplicative and additive characters modulo $p$ at consecutive polynomial values. More precisely, for an interval $I$ over finite field and $0<m<1$, we investigate the following…

数论 · 数学 2026-01-30 Nilanjan Bag , Dwaipayan Mazumder

We estimate mixed character sums of polynomial values over elements of a finite field $\mathbb F_{q^r}$ with sparse representations in a fixed ordered basis over the subfield $\mathbb F_q$. First we use a combination of the…

数论 · 数学 2022-11-17 László Mérai , Igor E. Shparlinski , Arne Winterhof

Let $\chi$ be a primitive character modulo $q$, and let $\delta > 0$. Assuming that $\chi$ has large order $d$, for any $d$th root of unity $\alpha$ we obtain non-trivial upper bounds for the number of $n \leq x$ such that $\chi(n) =…

数论 · 数学 2024-05-02 Alexander P. Mangerel , Yichen You

Following the methods used by Derksen-Weyman in \cite{DW11} and Chindris in \cite{Chi08}, we use quiver theory to represent the generalized Littlewood-Richardson coefficients for the branching rule for the diagonal embedding of $\gl(n)$ as…

表示论 · 数学 2018-11-16 Brett Collins

Consider a random sum $\eta_1 v_1 + ... + \eta_n v_n$, where $\eta_1,...,\eta_n$ are i.i.d. random signs and $v_1,...,v_n$ are integers. The Littlewood-Offord problem asks to maximize concentration probabilities such as $\P(\eta_1 v_1 + ...…

概率论 · 数学 2007-05-23 Terence Tao , Van Vu

In this paper, we investigate the distribution of values of the complete exponential sum $S_{p,\chi}(\theta)=\sum_{n=1}^p \chi(n)e(n\theta)$, where $p$ is a large prime, $\chi$ is a Dirichlet character (mod $p$) of order $d\geq 2$, and…

数论 · 数学 2026-03-13 Amine Iggidr

The Hardy-Littlewood majorant problem has a positive answer only for expo- nents p which are even integers, while there are counterexamples for all p =2 2N. Montgomery conjectured that there exist counterexamples even among idempotent…

偏微分方程分析 · 数学 2016-11-26 Sándor Krenedits

For a primitive Dirichlet character $\chi$ modulo $q$, we define $M(\chi)=\max_{t } |\sum_{n \leq t} \chi(n)|$. In this paper, we study this quantity for characters of a fixed odd order $g\geq 3$. Our main result provides a further…

数论 · 数学 2017-01-09 Youness Lamzouri , Alexander P. Mangerel
‹ 上一页 1 2 3 10 下一页 ›