English
Related papers

Related papers: On polynomials with roots modulo almost all primes

200 papers

A famous conjecture of Artin states that there are infinitely many prime numbers for which a fixed integer $g$ is a primitive root, provided $g \neq -1$ and $g$ is not a perfect square. Thanks to work of Hooley, we know that this conjecture…

Number Theory · Mathematics 2015-04-16 Lee Troupe

We give two elementary proofs, at a level understandable by students with only pre-calculus knowledge of Algebra, of the well known fact that an irreducible irrational n-th root of a positive rational number cannot be solution of a…

History and Overview · Mathematics 2009-08-04 S. A. Belbas

Let T^{N,chi}_{p,k}(x) be the characteristic polynomial of the Hecke operator T_p acting on the space of cusp forms S_k(N,chi). We describe the factorization of T^{N,chi}_{p,k}(x) mod l as k varies, and we explicitly calculate those…

Number Theory · Mathematics 2016-09-07 J. Brian Conrey , David W. Farmer , Peter Jake Wallace

Many interesting questions in arithmetic dynamics revolve, in one way or another, around the (local and/or global) reducibility behavior of iterates of a polynomial. We show that for very general families of integer polynomials $f$ (and,…

Number Theory · Mathematics 2025-10-16 Joachim König

In this paper we present and analyse a construction of irreducible polynomials over odd prime fields via the transforms which take any polynomial $f \in \mathbf{F}_p[x]$ of positive degree $n$ to $\left(\frac{x}{k} \right)^n \cdot…

Number Theory · Mathematics 2015-03-13 Simone Ugolini

It is known that random monic integral polynomials of bounded degree $d$ and integral coefficients distributed uniformly and independently in $[-H,H]$ are irreducible over $\mathbb{Z}$ with probability tending to $1$ as $H\to \infty$. In…

Number Theory · Mathematics 2021-07-21 Huy Tuan Pham , Max Wenqiang Xu

We say that a monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and \[\{1,\theta,\theta^2,\ldots, \theta^{N-1}\}\] is a basis for the ring of integers of ${\mathbb Q}(\theta)$,…

Number Theory · Mathematics 2022-11-29 Lenny Jones

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

Number Theory · Mathematics 2018-11-21 Domingo Gómez-Pérez , László Mérai , Igor E. Shparlinski

Let $K$ be a global field and $n > 1$ an integer. We show $n$ is composite if and only if there is an irreducible polynomial $f(x) \in K[x]$ of degree $n$ which is reducible $q$-adically for all the primes $q$ of $K$.

Number Theory · Mathematics 2007-05-23 R. Guralnick , M. Schacher , J. Sonn

A polynomial $p\in\mathbb{R}[x]$ is a divisor of some polynomial $0\neq f\in\mathbb{R}[x]$ with non-negative coefficients if and only if $p$ does not have a positive real root. The lowest possible degree of such $f$ for a given $p$ is known…

Optimization and Control · Mathematics 2012-10-26 Tomáš Kepka , Miroslav Korbelář

Let n be a positive integer and let p be a prime. We calculate the probability that a random monic polynomial of degree n with coefficients in the ring Z_p of p-adic integers splits over Z_p into linear factors.

Number Theory · Mathematics 2007-05-23 Joe Buhler , Daniel Goldstein , David Moews , Joel Rosenberg

We find all unitary perfect polynomials over the prime field $\F_2$ with less than five distinct prime factors.

Number Theory · Mathematics 2010-03-30 Luis H. Gallardo , Olivier Rahavandrainy

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

Classical Analysis and ODEs · Mathematics 2008-03-11 Steve Fisk

A polynomial with coefficients in the ring of integers $\mathcal{O}_{K}$ of a global field $K$ is called intersective if it has a root modulo every finite-indexed subgroup of $\mathcal{O}_{K}$. We prove two criteria for a polynomial…

Number Theory · Mathematics 2022-07-19 Bhawesh Mishra

Let n be a square-free polynomial over F_q, where q is an odd prime power. In this paper, we determine which irreducible polynomials p in F_q[x] can be represented in the form X^2+nY^2 with X, Y in F_q[x]. We restrict ourselves to the case…

Number Theory · Mathematics 2011-03-18 Piotr Maciak

We give a criterion when a polynomial $x^n-g$ is irreducible over a pseudofinite field. As an application we give an explicit description of algebraic closure of some pseudofinite fields of zero characteristic.

Logic · Mathematics 2021-09-30 Jakub Gismatullin , Katarzyna Tarasek

An intersective polynomial is a monic polynomial in one variable with rational integer coefficients, with no rational root and having a root modulo $m$ for all positive integers $m$. Let $G$ be a finite noncyclic group and let $r(G)$ be the…

Group Theory · Mathematics 2015-07-31 D. Bubboloni , J. Sonn

The behaviour of Hecke polynomials modulo p has been the subject of some study. In this note we show that, if p is a prime, the set of integers N such that the Hecke polynomials T^{N,\chi}_{l,k} for all primes l, all weights k>1 and all…

Number Theory · Mathematics 2009-05-28 L. J. P. Kilford , Gabor Wiese

We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices,…

Classical Analysis and ODEs · Mathematics 2008-08-14 Steve Fisk

To every integer monic polynomial of degree m can be associated m integer sequences having interesting properties to the roots of the polynomial. These sequences can be used to find the real roots of any integer monic polynomial by using…

General Mathematics · Mathematics 2007-05-23 Ashok Kumar Gupta , Ashok Kumar Mittal
‹ Prev 1 8 9 10 Next ›