English
Related papers

Related papers: Explicit bounds for small prime nonresidues

200 papers

In this paper we obtain a new fully explicit constant for the P\'olya-Vinogradov inequality for primitive characters. Given a primitive character $\chi$ modulo $q$, we prove the following upper bound \begin{align*} \left| \sum_{1 \le n\le…

Number Theory · Mathematics 2020-01-16 Matteo Bordignon

We give a short proof for an explicit upper bound on the proportion of permutations of a given prime order $p$, acting on a finite set of given size $n$, which is sharp for certain $n$ and $p$. Namely, we prove that if $n\equiv k\pmod{p}$…

Combinatorics · Mathematics 2022-10-28 Cheryl E. Praeger , Enoch Suleiman

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

Fix a prime $p$ and define $T_p(n)$ to be the number of nonzero residues in the $n$th row of pascal's triangle mod $p$, and define $\phi_p(n)$ to be the number of nonzero residues in the first $n$ rows of pascal's triangle mod $p$. We…

Number Theory · Mathematics 2023-10-13 Connor Lane

We study number theoretic properties of the map $x \mapsto x^{x} \mod{p}$, where $x \in \{1,2,\ldots,p-1\}$, and improve on some recent upper bounds, due to Kurlberg, Luca, and Shparlinski, on the number of primes $p < N$ for which the map…

Number Theory · Mathematics 2017-07-05 Adam Tyler Felix , Pär Kurlberg

For a prime number $p$ and integer $x$ with $\gcd(x,p)=1$ let $\overline{x}$ denote the multiplicative inverse of $x$ modulo $p.$ In the present paper we are interested in the problem of distribution modulo $p$ of the sequence $$…

Number Theory · Mathematics 2023-04-18 Moubariz Z. Garaev , Igor E. Shparlinski

In this paper we obtain a new fully explicit constant for the P\'olya-Vinogradov inequality for squarefree modulus. Given a primitive character $\chi$ to squarefree modulus $q$, we prove the following upper bound \begin{align*} \left|…

Number Theory · Mathematics 2019-09-04 Matteo Bordignon , Bryce Kerr

Let $\chi$ denote a primitive, non-quadratic Dirichlet character with conductor $q$, and let $L(s, \chi)$ denote its associated Dirichlet $L$-function. We show that $|L(1, \chi)| \geq 1/(9.12255 \log(q/\pi))$ for sufficiently large $q$, and…

Number Theory · Mathematics 2021-07-21 Michael J. Mossinghoff , Valeriia V. Starichkova , Timothy S. Trudgian

Let $\psi$ be a real primitive character modulo $D$. If the $L$-function $L(s,\psi)$ has a real zero close to $s=1$, known as a Landau-Siegel zero, then we say the character $\psi$ is exceptional. Under the hypothesis that such exceptional…

Number Theory · Mathematics 2020-12-11 H. M. Bui , Kyle Pratt , Alexandru Zaharescu

We prove in particular that for any sufficiently large prime $p$ there is $1\le a<p$ such that all partial quotients of $a/p$ are bounded by $O(\log p/\log \log p)$. For composite denominators a similar result is obtained. This improves the…

Number Theory · Mathematics 2023-01-02 Nikolay Moshchevitin , Brendan Murphy , Ilya Shkredov

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

Let $p$ be a prime such that $p \geq 5$. Let $G$ be a finite $p$-solvable group and let $p^a$ be the largest power of $p$ dividing $\chi(1)$ for an irreducible character $\chi$ of $G$, we show that $|G:F(G)|_p \leq p^{5.5a}$. Let $G$ be a…

Group Theory · Mathematics 2015-01-15 Yong Yang

We show that any subset of $\mathbb{Z}_p^n$ ($p$ an odd prime) without $3$-term arithmetic progression has size $O(p^{cn})$, where $c:=1-\frac{1}{18\log p}<1$. In particular, we find an upper bound of $O(2.84^n)$ on the maximum size of an…

Combinatorics · Mathematics 2016-06-02 Dion Gijswijt

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

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

Number Theory · Mathematics 2025-06-17 Matt Visser

Let $\pi$ be a fixed Hecke--Maass cusp form for $\mathrm{SL}(3,\mathbb{Z})$ and $\chi$ be a primitive Dirichlet character modulo $M$, which we assume to be a prime. Let $L(s,\pi\otimes \chi)$ be the $L$-function associated to $\pi\otimes…

Number Theory · Mathematics 2020-04-28 Yongxiao Lin

The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…

Combinatorics · Mathematics 2023-10-24 Herbert Edelsbrunner , János Pach

We consider the problem of $\Omega$ bounds for the partial sums of a modified character, \textit{i.e.}, a completely multiplicative function $f$ such that $f(p)=\chi(p)$ for all but a finite number of primes $p$, where $\chi$ is a primitive…

Number Theory · Mathematics 2023-04-26 Marco Aymone

Let p be any prime, and $p^(\nu_p(n!))$ the maximal power of $p$ dividing $n!$. It is proved that there exists a positive integer $n_0$, which depends only on $p$, such that $q^(\nu_q(n!)) < p^(\nu_p(n!))$ for all $n \ge n_0$ and all primes…

Number Theory · Mathematics 2026-04-28 Dan Levy

Let $G$ be a finite group and $p$ be a prime number dividing the order of $G$. An irreducible character $\chi$ of $G$ is called a quasi $p$-Steinberg character if $\chi(g)$ is nonzero for every $p$-regular element $g$ in $G$. In this paper,…

Representation Theory · Mathematics 2022-07-05 Ashish Mishra , Digjoy Paul , Pooja Singla