English
Related papers

Related papers: Inverse questions for the large sieve

200 papers

We prove new cases of the inverse Galois problem by considering the residual Galois representations arising from a fixed newform. Specific choices of weight $3$ newforms will show that there are Galois extensions of $\mathbb{Q}$ with Galois…

Number Theory · Mathematics 2015-09-01 David Zywina

Let $p\equiv1\pmod 4$ be a prime. In this paper, with the help of Jacobsthal sums, we study some permutation problems involving biquadratic residues modulo $p$.

Number Theory · Mathematics 2025-03-04 Hai-Liang Wu , Yue-Feng She

The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…

Combinatorics · Mathematics 2019-09-17 Peter Bernstein , Cashous Bortner , Samuel Coskey , Shuni Li , Connor Simpson

Let $Q(x,y)$ be a quadratic form with discriminant $D\neq 0$. We obtain non trivial upper bound estimates for the number of solutions of the congruence $Q(x,y)\equiv\lambda \pmod{p}$, where $p$ is a prime and $x,y$ lie in certain intervals…

Number Theory · Mathematics 2011-02-08 Ana Zumalacárregui

We show that for every finite set of prime numbers S, there are at most finitely many singular moduli that are S-units. The key new ingredient is that for every prime number p, singular moduli are p-adically disperse. We prove analogous…

Number Theory · Mathematics 2023-09-07 Sebastián Herrero , Ricardo Menares , Juan Rivera-Letelier

Applying E. Kowalski's recent generalization of the large sieve we prove that certain properties expected to be typical (irreducibility of the characteristic polynomial, absence of squares among the matrix coefficients...) are indeed…

Number Theory · Mathematics 2008-11-13 Florent Jouve

A prime sieve is an algorithm that finds the primes up to a bound $n$. We say that a prime sieve is incremental, if it can quickly determine if $n+1$ is prime after having found all primes up to $n$. We say a sieve is compact if it uses…

Data Structures and Algorithms · Computer Science 2019-02-20 Jonathan P. Sorenson

Let $M$ be a square matrix and let $p(t)$ be a monic polynomial of degree $n$. Let $Z$ be a set of $n\times n$ matrices. The multiplicative inverse eigenvalue problem asks for the construction of a matrix in $Z$ such that the product matrix…

Rings and Algebras · Mathematics 2007-05-23 Joachim Rosenthal , Xiaochang Wang

Given a real quadratic integer $u=A+B\sqrt{D}$ with cubic norm, we identify all the classes in a related form class group that represent primes $p$ for which $u$ is a cubic residue mod $p$. A special case of this result was conjectured in a…

Number Theory · Mathematics 2025-11-18 Ron Evans , Mark Van Veen

It is well known that when a prime $p$ is congruent to 1 modulo 4, the sum of the quadratic residues equals the sum of the quadratic nonresidues. In this note we give analogous results for the case where $p$ is congruent to 3 modulo 4.

Number Theory · Mathematics 2015-12-04 Christian Aebi , Grant Cairns

We improve Irving's method of the double-sieve by using the DHR sieve. By extending the upper and lower sieve functions into their respective non-elementary ranges, we are able to make improvements on the previous records on the number of…

Number Theory · Mathematics 2016-06-14 Pin-Hung Kao

We generalize current known distribution results on Shanks--R\'enyi prime number races to the case where arbitrarily many residue classes are involved. Our method handles both the classical case that goes back to Chebyshev and function…

Number Theory · Mathematics 2020-04-20 Lucile Devin

This paper describes a new kind of inverse for elements in associative ring, that is the complete inverse, as the unique solution of a certain set of equations. This inverse exists for an element $a$ if and only if the Drazin inverse of $a$…

Rings and Algebras · Mathematics 2020-07-22 Mohammed Mouçouf

We derive, for all prime moduli p except those in a very thin set, an upper bound for the least prime primitive root (mod p) of order of magnitude a constant power of log p. The improvement over previous results, where the upper bound was…

Number Theory · Mathematics 2007-05-23 Greg Martin

We study the reverse mathematics of countable analogues of several maximality principles that are equivalent to the axiom of choice in set theory. Among these are the principle asserting that every family of sets has a $\subseteq$-maximal…

Logic · Mathematics 2010-10-01 Damir D. Dzhafarov , Carl Mummert

Let $r \ge 2$ be an integer and let $A$ be a finite, nonempty set of nonzero integers. We will obtain a lower bound for the number of squarefree integers $n$, up to $x$, for which the products $\prod_{p \mid n} (p+a)$ (over primes $p$) are…

Number Theory · Mathematics 2010-08-16 Tristan Freiberg

Let f be a cubic polynomial. Then there are infinitely many primes p such that f(p) is square-free.

Number Theory · Mathematics 2007-06-12 Harald Andres Helfgott

For infinitely many primes $p=4k+1$ we give a slightly improved upper bound for the maximal cardinality of a set $B\subset \ZZ_p$ such that the difference set $B-B$ contains only quadratic residues. Namely, instead of the "trivial" bound…

Combinatorics · Mathematics 2013-05-06 Christine Bachoc , Imre Z. Ruzsa , Mate Matolcsi

We show that for each positive integer $a$ there exist only finitely many prime numbers $p$ such that $a$ appears an odd number of times in the period of continued fraction of $\sqrt{p}$ or $\sqrt{2p}$. We also prove that if $p$ is a prime…

Number Theory · Mathematics 2023-09-04 Vítězslav Kala , Piotr Miska

We prove that the set of large values of the trigonometric polynomial over a subset of density of the primes has some additive structure, similarly to what happens for subsets of densities in $\mathbb{Z}/{N}\mathbb{Z}$ but in a weaker form.…

Number Theory · Mathematics 2025-01-10 Olivier Ramaré