English
Related papers

Related papers: Sharp bounds for maximal sums of odd order Dirichl…

200 papers

Let $\mathscr{H}^2$ denote the Hardy space of Dirichlet series $f(s) = \sum_{n\geq1} a_n n^{-s}$ with square summable coefficients and suppose that $\varphi$ is a symbol generating a composition operator on $\mathscr{H}^2$ by…

Functional Analysis · Mathematics 2017-12-20 Ole Fredrik Brevig

Let $\pi$ be a $SL(3,\mathbb Z)$ Hecke-Maass cusp form satisfying the Ramanujan conjecture and the Selberg-Ramanujan conjecture, and let $\chi$ be a primitive Dirichlet character modulo $M$, which we assume to be prime for simplicity. We…

Number Theory · Mathematics 2014-02-18 Ritabrata Munshi

We obtain a new bound for incomplete Gauss sums modulo primes. Our argument falls under the framework of Vinogradov's method which we use to reduce the problem under consideration to bounding the number of solutions to two distinct systems…

Number Theory · Mathematics 2017-06-20 Bryce Kerr

Let $G$ be a finite group and ${\rm cd}(G)$ will be the set of the degrees of the complex irreducible characters of $G$. Also let ${\rm cod}(G)$ be the set of codegrees of the irreducible characters of $G$. The Taketa problem conjectures if…

Group Theory · Mathematics 2021-07-06 Mahtab Delfani , Mohsen Ghasemi , Somayeh Hekmatara

For any graph $G=(V,E)$ with maximum degree $\Delta$ and without isolated edges, and a positive integer $r$, by $\chi'_{\Sigma,r}(G)$ we denote the $r$-distant sum distinguishing index of $G$. This is the least integer $k$ for which a…

Combinatorics · Mathematics 2017-03-16 Jakub Przybyło

A proper $k$-colouring of a graph $G$ is called $h$-conflict-free if every vertex $v$ has at least $\min\, \{h, {\rm deg}(v)\}$ colours appearing exactly once in its neighbourhood. Let $\chi_{\rm pcf}^h(G)$ denote the minimum $k$ such that…

Combinatorics · Mathematics 2026-02-12 Quentin Chuet , Tianjiao Dai , Qiancheng Ouyang , François Pirot

In Part I we construct the upper bound, in the spirit of $\Gamma$- $\limsup$, achieved by multidimensional profiles, for some general classes of singular perturbation problems, with or without the prescribed differential constraint, taking…

Analysis of PDEs · Mathematics 2013-02-18 Arkady Poliakovsky

Let $L(s,\chi)$ be the Dirichlet $L$-function associated to a non-principal primitive character $\chi$ modulo $q$ with $3\le q \le 400\,000$. We prove a new explicit zero-free region for $L(s,\chi)$: $L(s,\chi)$ does not vanish in the…

Number Theory · Mathematics 2019-03-05 Habiba Kadiri

We prove a subconvexity bound for the central value L(1/2, chi) of a Dirichlet L-function of a character chi to a prime power modulus q=p^n of the form L(1/2, chi)\ll p^r * q^(theta+epsilon) with a fixed r and theta\approx 0.1645 < 1/6,…

Number Theory · Mathematics 2019-02-20 Djordje Milićević

Given a finite group $G$ and an irreducible complex character $\chi$ of $G$, the codegree of $\chi$ is defined as the integer ${\rm cod}(\chi)=|G:\ker\chi|/\chi(1)$. It was conjectured by G. Qian in [13] that, for every element $g$ of $G$,…

Group Theory · Mathematics 2023-06-16 Z. Akhlaghi , E. Pacifici , L. Sanus

We solve the Stechkin problem about approximation of generally speaking unbounded hypersingular integral operators by bounded ones. As a part of the proof, we also solve several related and interesting on their own problems. In particular,…

Functional Analysis · Mathematics 2022-06-06 Vladyslav Babenko , Oleg Kovalenko , Nataliia Parfinovych

The Burgess inequality is the best upper bound we have for the character sum $S_{\chi}(M,N) = \sum_{M<n\le M+N} \chi(n).$ Until recently, no explicit estimates had been given for the inequality. In 2006, Booker gave an explicit estimate for…

Number Theory · Mathematics 2015-03-13 Enrique Treviño

We introduce higher-order Poincar'e constants for compact weighted manifolds and estimate them from above in terms of subsets. These estimates imply upper bounds for eigenvalues of the weighted Laplacian and the first nontrivial eigenvalue…

Differential Geometry · Mathematics 2019-11-18 Kei Funano , Yohei Sakurai

The digirth of a digraph is the length of a shortest directed cycle. The dichromatic number $\vec{\chi}(D)$ of a digraph $D$ is the smallest size of a partition of the vertex-set into subsets inducing acyclic subgraphs. A conjecture by…

Combinatorics · Mathematics 2020-04-07 Raphael Steiner

We establish unconditional sharp upper bounds of the $k$-th moments of the family of quadratic Dirichlet $L$-functions at the central point for $0 \leq k \leq 2$.

Number Theory · Mathematics 2021-01-22 Peng Gao

Let $G$ be a finite group and $p\in \pi(G)$, and let Irr$(G)$ be the set of all irreducible complex characters of $G$. Let $\chi \in {\rm Irr}(G)$, we write ${\rm cod}(\chi)=|G:{\rm ker} \chi|/\chi(1)$, and called it the codegree of the…

Group Theory · Mathematics 2021-04-16 Jiakuan Lu , Yu Li , Boru Zhang

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…

Number Theory · Mathematics 2016-01-19 L. B. Pierce

For each nonprincipal Dirichlet character $\chi$, let $n_\chi$ be the least $n$ with $\chi(n) \notin \{0,1\}$. We show that as the average of $n_\chi$ over all nonprincipal characters $\chi$ modulo $q$ is $\ell(q) + o(1)$, where $\ell(q)$…

Number Theory · Mathematics 2014-02-26 Greg Martin , Paul Pollack

A proof for the lower bound is provided for the smallest eigenvalue of finite element equations with arbitrary conforming simplicial meshes. The bound has a similar form as the one by Graham and McLean [SIAM J. Numer. Anal., 44 (2006), pp.…

Numerical Analysis · Mathematics 2021-06-24 Lennard Kamenski

An explicit formula for the mean value of $\vert L(1,\chi)\vert^2$ is known, where $\chi$ runs over all odd primitive Dirichlet characters of prime conductors $p$. Bounds on the relative class number of the cyclotomic field ${\mathbb…

Number Theory · Mathematics 2023-08-02 Stéphane R. Louboutin , Marc Munsch