English
Related papers

Related papers: Negative values of truncations to $L(1,\chi)$

200 papers

We calculate a Ricci curvature lower bound for some classical examples of random walks, namely, a chain on a slice of the n-dimensional discrete cube (the so-called Bernoulli-Laplace model) and the random transposition shuffle of the…

Probability · Mathematics 2014-10-01 Matthias Erbar , Jan Maas , Prasad Tetali

Let $L(s,\pi)=\sum_{n=1}^{\infty}\lambda_{\pi}(n)n^{-s}$ be an $L$-function that satisfies a weak form of the generalized Ramanujan conjecture. We prove that large partial sums of $\lambda_{\pi}(n)$ strongly repel the low-lying zeros of…

Number Theory · Mathematics 2024-08-08 Bryce Kerr , Oleksiy Klurman , Jesse Thorner

Let $\pi$ be a $SL(3,\mathbb Z)$ Hecke-Maass cusp form, and let $\chi$ be a primitive Dirichlet character modulo $M$, which we assume to be prime. In this note we revisit the subconvexity problem addressed in `The circle method and bounds…

Number Theory · Mathematics 2016-04-28 Ritabrata Munshi

We discuss a problem posed by Ronald Graham about the minimum number, over all 2-colorings of $[1,n]$, of monochromatic $\{x,y,x+ay\}$ triples for $a \geq 1$. We give a new proof of the original case of $a=1$. We show that the minimum…

Combinatorics · Mathematics 2016-09-29 Thotsaporn "Aek" Thanatipanonda

We consider extremal values of sum-Balaban index among graphs on $n$ vertices. We determine that the upper bound for the minimum value of the sum-Balaban index is at most $4.47934$ when $n$ goes to infinity. For small values of $n$ we…

Combinatorics · Mathematics 2017-01-11 Martin Knor , Jaka Kranjc , Riste Škrekovski , Aleksandra Tepeh

Let $\mathcal{A}$ be a sequence of $rk$ terms which is made up of $k$ distinct integers each appearing exactly $r$ times in $\mathcal{A}$. The sum of all terms of a subsequence of $\mathcal{A}$ is called a subsequence sum of $\mathcal{A}$.…

Number Theory · Mathematics 2022-11-24 Jagannath Bhanja , Ram Krishna Pandey

We consider the problem of bounding away from 0 the minimum value m taken by a polynomial P of Z[X_1,...,X_k] over the standard simplex, assuming that m>0. Recent algorithmic developments in real algebraic geometry enable us to obtain a…

Symbolic Computation · Computer Science 2009-02-20 Saugata Basu , Richard Leroy , Marie-Francoise Roy

In a recent work arXiv:2004.14450, it has been shown that $L$-functions associated with arbitrary non-zero cusp forms take large values at the central critical point. The goal of this note is to derive analogous results for twists of…

Number Theory · Mathematics 2024-05-07 Sanoli Gun , Rashi Lunia

For a character $\chi$ of a finite group $G$, the number cod$(\chi):=|G:\mathrm{ker}(\chi)|/\chi(1)$ is called the codegree of $\chi$.In this paper, we give a solvability criterion for a finite group $G$ depending on the minimum of the…

Group Theory · Mathematics 2022-08-17 Dongfang Yang , Yu Zeng , Heng Lv

Let $S_{\mathfrak{z}}(k,r)$ be the least positive integer such that for any $r$-coloring $\chi : \{1,2,\dots,S_{\mathfrak{z}}(k,r)\} \longrightarrow \{1, 2, \dots, r\}$, there is a sequence $x_1, x_2, \dots, x_k$ such that $\sum_{i=1}^{k-1}…

Combinatorics · Mathematics 2018-08-14 Erik Metz

The digraph chromatic number of a directed graph $D$, denoted $\chi_A(D)$, is the minimum positive integer $k$ such that there exists a partition of the vertices of $D$ into $k$ disjoint sets, each of which induces an acyclic subgraph. For…

Combinatorics · Mathematics 2018-12-05 Noah Golowich

We give lower bounds on the case of worst inhomogeneous approximation.

Number Theory · Mathematics 2016-03-22 Chris Pinner

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$…

Number Theory · Mathematics 2026-03-17 Aritro Pathak

To recover a low rank structure from a noisy matrix, truncated singular value decomposition has been extensively used and studied. Recent studies suggested that the signal can be better estimated by shrinking the singular values. We pursue…

Methodology · Statistics 2014-11-25 Julie Josse , Sylvain Sardy

Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…

Combinatorics · Mathematics 2025-06-06 Vladimir Chubenko , Sascha Kurz

Let P_nk(x) denote the sum of the lowest k+1 terms in the expansion of (1+x)^n. We investigate the irreducibility of P_nk(x) and more general univariate polynomials related to it. Polynomials P_nk(x) naturally arise in Schubert calculus,…

Number Theory · Mathematics 2007-06-13 Michael Filaseta , Angel Kumchev , Dmitrii V. Pasechnik

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve…

Number Theory · Mathematics 2015-10-21 Kostadinka Lapkova

Let $g \geq 3$ be fixed and odd, and for large $q$ let $\chi$ be a primitive Dirichlet character modulo $q$ of order $g$. Conditionally on GRH we improve the existing upper bounds in the P\'{o}lya-Vinogradov inequality for $\chi$, showing…

Number Theory · Mathematics 2025-06-23 Alexander P. Mangerel

We derive exact and sharp lower bounds for the number of monochromatic generalized Schur triples $(x,y,x+ay)$ whose entries are from the set $\{1,\dots,n\}$, subject to a coloring with two different colors. Previously, only asymptotic…

Combinatorics · Mathematics 2020-10-13 Christoph Koutschan , Elaine Wong

We establish a new bound for short character sums in finite fields, particularly over two-dimensional grids in $\mathbb{F}_{p^3}$ and higher-dimensional lattices in $\mathbb{F}_{p^d}$, extending an earlier work of Mei-Chu Chang on Burgess…

Number Theory · Mathematics 2025-11-11 Aishik Chattopadhyay