English
Related papers

Related papers: Bounds for the first several prime character nonre…

200 papers

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Number Theory · Mathematics 2026-05-19 Jitender Singh

Given a graph G, a subset M of V (G) is a module of G if for each v \in V (G) \diagdownM, v is adjacent to all the elements of M or to none of them. For instance, V(G), \varnothing and {v} (v \in V(G)) are modules of G called trivial. Given…

Combinatorics · Mathematics 2011-10-14 Abderrahim Boussaïri , Pierre Ille

Given a non-principal Dirichlet character chi mod q, an important problem in number theory is to obtain good estimates for the size of L(1,chi). In this paper we focus on sharpening the upper bounds known for |L(1,chi)|; in particular, we…

Number Theory · Mathematics 2007-05-23 Andrew Granville , Kannan Soundararajan

This note discusses the existence of prime numbers in short intervals. An unconditional elementary argument seems to prove the existence of primes in the short intervals [x, x + y], where y >= x^(1/2)(log x)^e, e > 0, and a sufficiently…

General Mathematics · Mathematics 2009-01-07 N. A. Carella

We prove a generalization of the author's work to show that any subset of the primes which is `well-distributed' in arithmetic progressions contains many primes which are close together. Moreover, our bounds hold with some uniformity in the…

Number Theory · Mathematics 2014-12-17 James Maynard

Fix $a \in \mathbb{Z}$, $a\notin \{0,\pm 1\}$. A simple argument shows that for each $\epsilon > 0$, and almost all (asymptotically 100% of) primes $p$, the multiplicative order of $a$ modulo $p$ exceeds $p^{\frac12-\epsilon}$. It is an…

Number Theory · Mathematics 2020-06-30 Komal Agrawal , Paul Pollack

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

In recent years, many connections have been made between minimal codes, a classical object in coding theory, and other remarkable structures in finite geometry and combinatorics. One of the main problems related to minimal codes is to give…

Information Theory · Computer Science 2023-02-13 Martin Scotti

Let $\sigma(n)$ to be the sum of the positive divisors of $n$. A number is non-deficient if $\sigma(n) \geq 2n$. We establish new lower bounds for the number of distinct prime factors of an odd non-deficient number in terms of its second…

Number Theory · Mathematics 2022-11-15 Joshua Zelinsky

We show that for integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the normal order of the number of prime factors is $C \log \log n$, where $C=(1-e^{-\gamma})^{-1} = 2.280...$ and $\gamma$ is…

Number Theory · Mathematics 2021-11-15 Andreas Weingartner

Following both Ernvall-Mets\"{a}nkyl\"{a} and Ellenberg-Jain-Venkatesh, we study the density of the number of zeroes (i.e. the cyclotomic $\lambda$-invariant) for the $p$-adic zeta-function twisted by a Dirichlet character $\chi$ of any…

Number Theory · Mathematics 2023-11-23 Daniel Delbourgo , Heiko Knospe

Let $p>3$ be a prime, and let $(\frac{\cdot}p)$ be the Legendre symbol. Let $b\in\mathbb Z$ and $\varepsilon\in\{\pm 1\}$. We mainly prove that $$\left|\left\{N_p(a,b):\ 1<a<p\ \text{and}\ \left(\frac…

Number Theory · Mathematics 2022-10-07 Qing-Hu Hou , Hao Pan , Zhi-Wei Sun

We prove that for positive integers $m \geq 1, n \geq 1$ and a prime number $p \neq 2,3$ there are finitely many finite $m$-generated Moufang loops of exponent $p^n$.

Rings and Algebras · Mathematics 2020-05-26 Alexander Grishkov , Liudmila Sabinina , Efim Zelmanov

Given an integer $m\geq2$, the Hardy--Littlewood inequality (for real scalars) says that for all $2m\leq p\leq\infty$, there exists a constant $C_{m,p}% ^{\mathbb{R}}\geq1$ such that, for all continuous $m$--linear forms…

Functional Analysis · Mathematics 2015-10-06 Gustavo Araujo , Daniel Pellegrino

For distinct unitary cuspidal automorphic representations $\pi_1$ and $\pi_2$ for $\mathrm{GL}(2)$ over a number field $F$ and any $\alpha\in\Bbb{R}$, let $\mathcal{S}_{\alpha}$ be the set of primes $v$ of $F$ for which…

Number Theory · Mathematics 2022-03-22 Peng-Jie Wong

We use character sum estimates to give a bound on the least square-full primitive root modulo a prime. Specifically, we show that there is a square-full primitive root mod $p$ less than $p^{2/3 + 3/(4 \sqrt{e})+ \epsilon}$, and we give some…

Number Theory · Mathematics 2017-03-16 Marc Munsch , Tim Trudgian

Let $\kappa$,$\lambda$ be regular uncountable cardinals such that $\lambda > \kappa^+$ is not a successor of a singular cardinal of low cofinality. We construct a generic extension with $s(\kappa) = \lambda$ starting from a ground model in…

Logic · Mathematics 2015-08-18 Omer Ben-Neria , Moti Gitik

Let $\kappa_e(\overline{M}_{g,n})$ denote the kappa ring of $\overline{M}_{g,n}$ in codimension $e$. For $g,e\geq 0$ fixed, as the number $n$ of the markings grows large we show that the rank of $\kappa_e(\overline{M}_{g,n})$ is asymptotic…

Algebraic Geometry · Mathematics 2013-11-05 Eaman Eftekhary , Iman Setayesh

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 study the properties of the product, which runs over the primes, $$\mathfrak{p}_n = \prod_{s_p(n) \, \geq \, p} p \quad (n \geq 1),$$ where $s_p(n)$ denotes the sum of the base-$p$ digits of $n$. One important property is the fact that…

Number Theory · Mathematics 2017-10-16 Bernd C. Kellner
‹ Prev 1 8 9 10 Next ›