English
Related papers

Related papers: Explicit upper bounds on the least primitive root

200 papers

We obtain an asymptotic upper bound for the smallest number of generators for a finite direct sum of matrix algebras with entries in a finite field. This produces an upper bound for a similar quantity for integer matrix rings. We also…

Rings and Algebras · Mathematics 2007-10-16 R. V. Kravchenko , B. V. Petrenko

We improve the unconditional explicit bounds for the error term in the prime counting function $\psi(x)$. In particular, we prove that, for all $x>2$, we have \[ \left| \psi(x)-x \right| < 9.22106 \, x \, (\log x)^{3/2}…

Number Theory · Mathematics 2023-05-18 Andrew Fiori , Habiba Kadiri , Joshua Swidinsky

Sturm obtained the bounds for the number of the first Fourier coefficients of elliptic modular form $f$ to determine vanishing of $f$ modulo a prime $p$. In this paper, we study analogues of Sturm's bound for Siegel modular forms of genus…

Number Theory · Mathematics 2011-03-07 Dohoon Choi , YoungJu Choie , Toshiyuki Kikuta

Let $D(n)$ be the maximal determinant for $n \times n$ $\{\pm 1\}$-matrices, and ${\mathcal R}(n) = D(n)/n^{n/2}$ be the ratio of $D(n)$ to the Hadamard upper bound. We give several new lower bounds on ${\mathcal R}(n)$ in terms of $d$,…

Combinatorics · Mathematics 2016-10-26 Richard P. Brent , Judy-anne H. Osborn , Warren D. Smith

Let $p \geq 5$ be a prime. Let $k = b + c(p-1)$ be an integer in $[2p+2, p^2 - p +3]$, where $b \in [2,p]$ and $c \in [2, p-1]$. We prove local constancy in the weight space of the mod $p$ reduction of certain two-dimensional crystalline…

Number Theory · Mathematics 2024-06-25 Abhik Ganguli , Suneel Kumar

A famous conjecture of Artin asserts that any integer $a$ that is neither $-1$ nor a square should be a primitive root (mod $p$) for a positive proportion of primes $p$. Moreover, using a heuristic argument, Artin guessed an explicit…

Number Theory · Mathematics 2025-02-28 Leo Goldmakher , Greg Martin , Paul Péringuey

In this paper, we introduce and study a variant of Kummer's notion of (ir)regularity of primes which we call G-irregularity. It is based on Genocchi numbers $G_n$, rather than Bernoulli number $B_n.$ We say that an odd prime $p$ is…

Number Theory · Mathematics 2019-05-08 Su Hu , Min-Soo Kim , Pieter Moree , Min Sha

We give upper bounds on the size of the gap between the constant term and the next non-zero Fourier coefficient of an entire modular form of given weight for \Gamma_0(2). Numerical evidence indicates that a sharper bound holds for the…

Number Theory · Mathematics 2007-05-23 Barry Brent

We investigate the distribution of $\alpha p$ modulo one in imaginary quadratic number fields $\mathbb{K}\subset\mathbb{C}$ with class number one, where $p$ is restricted to prime elements in the ring of integers $\mathcal{O} =…

Number Theory · Mathematics 2021-03-24 Stephan Baier , Marc Technau

We generalize the idea of a multiplier in two different ways and generalize a recent result of Geiss, Montomery-Smith and Saksman. First of all, we consider multipliers in the form of a vector acting on a scalar function. Using this…

Classical Analysis and ODEs · Mathematics 2011-10-26 Nicholas Boros , Alexander Volberg

We present lower bounds on the Higgs boson mass in the Standard Model with three and four fermion generations SM(3,4), as well as upper bounds on the lightest Higgs boson mass in the minimal supersymmetric extension of the SM with three and…

High Energy Physics - Phenomenology · Physics 2009-10-30 David Dooling , Kyungsik Kang , Sin Kyu Kang

In this paper we partially settle our conjecture from [1] (math.SP/0701143) on roots of eigenpolynomials for degenerate exactly-solvable operators. Namely, for any such operator, we establish a lower bound (which supports our conjecture)…

Spectral Theory · Mathematics 2007-05-23 Tanja Bergkvist , Jan-Erik Bjork

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

Combinatorics · Mathematics 2013-01-08 Abderrahim Boussaïri , Pierre Ille

Let $p$ be an odd prime, let $N$ be a prime with $N \equiv 1 \pmod{p}$, and let $\zeta_p$ be a primitive $p$-th root of unity. We study the $p$-rank of the class group of $\mathbb{Q}(\zeta_p, N^{1/p})$ using Galois cohomological methods and…

Number Theory · Mathematics 2024-08-09 Ufuoma Asarhasa , Rusiru Gambheera , Debanjana Kundu , Enrique Nunez Lon-wo , Arshay Sheth

We investigate the existence of primes $p > 5$ for which the residues of $2!$, $3!$, \dots, $(p-1)!$ modulo $p$ are all distinct. We describe the connection between this problem and Kurepa's left factorial function, and report that there…

Number Theory · Mathematics 2018-05-22 Vladica Andrejić , Milos Tatarevic

We study root separation of reducible monic integer polynomials of odd degree. Let h(P) be the naive height, sep(P) the minimal distance between two distinct roots of an integer polynomial P(x) and sep(P)=h(P)^{-e(P)}. Let…

Number Theory · Mathematics 2017-09-19 Andrej Dujella , Tomislav Pejkovic

Conceptually, a rough number is a positive integer with no small prime factors. Formally, for real numbers $x$ and $y$, let $\Phi(x,y)$ denote the number of positive integers at most $x$ with no prime factors less than $y$. In this paper we…

Number Theory · Mathematics 2017-05-17 J. Z. Schroeder

The Hardy--Littlewood inequality for complex homogeneous polynomials asserts that given positive integers $m\geq2$ and $n\geq1$, if $P$ is a complex homogeneous polynomial of degree $m$ on $\ell_{p}^{n}$ with $2m\leq p\leq\infty$ given by…

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

Let $K\geq 2$ be a natural number and $a_i,b_i\in\mathbb{Z}$ for $i=1,\ldots,K-1$. We use the large sieve to derive explicit upper bounds for the number of prime $k$-tuplets, i.e., for the number of primes $p\leq x$ for which all $a_ip+b_i$…

Number Theory · Mathematics 2024-09-09 Thomas Dubbe

We show that the minimal base size $b(G)$ of a finite primitive permutation group $G$ of degree $n$ is at most $2 (\log |G|/\log n) + 24$. This bound is asymptotically best possible since there exists a sequence of primitive permutation…

Group Theory · Mathematics 2018-02-21 Zoltan Halasi , Martin W. Liebeck , Attila Maroti