English
Related papers

Related papers: Newly reducible polynomial iterates

200 papers

We examine the question of when a quadratic polynomial f(x) defined over a number field K can have a newly reducible nth iterate, that is, f^n(x) irreducible over K but f^{n+1}(x) reducible over K, where f^n denotes the nth iterate of f.…

For a field $K$, and a root $\alpha$ of an irreducible polynomial over $K$ (in some algebraic closure) the number of roots of $f(x)$ lying in $K(\alpha)$ is studied here. Given such an $f(x)$ of degree $n$ for which $r$ of the roots are i n…

Number Theory · Mathematics 2024-03-27 M Krithika , P Vanchinathan

In this paper, we classify, up to three possible exceptions, all monic, post-critically finite quadratic polynomials $f(x)\in \mathbb{Z}[x]$ with an iterate reducible module every prime, but all of whose iterates are irreducible over…

Number Theory · Mathematics 2019-07-09 Vefa Goksel

We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property,…

Number Theory · Mathematics 2012-09-11 Rafe Jones

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Commutative Algebra · Mathematics 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

Number Theory · Mathematics 2024-09-09 Jonathan W. Bober , Lara Du , Dan Fretwell , Gene S. Kopp , Trevor D. Wooley

A conjecture of Odoni stated over Hilbertian fields $K$ of characteristic zero asserts that for every positive integer $d$, there exists a polynomial $f\in K[x]$ of degree $d$ such that for every positive integer $n$, each iterate $f^{\circ…

Number Theory · Mathematics 2023-05-11 Sushma Palimar

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

Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided…

Rings and Algebras · Mathematics 2018-10-03 Giulio Peruginelli

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Number Theory · Mathematics 2022-09-12 Arghya Datta

Let $\mathbb{F}_q$ be the field with $q$ elements and of characteristic $p$. For $a\in\mathbb{F}_p$ consider the set \begin{equation*} S_a(n)=\{f\in\mathbb{F}_q[x]\mid\operatorname{deg}(f)=n,~f\text{ irreducible, monic and}…

Number Theory · Mathematics 2023-12-29 Max Schulz

Say a trinomial $x^n+A x^m+B \in \Q[x]$ has reducibility type $(n_1,n_2,...,n_k)$ if there exists a factorization of the trinomial into irreducible polynomials in $\Q[x]$ of degrees $n_1$, $n_2$,...,$n_k$, ordered so that $n_1 \leq n_2 \leq…

Number Theory · Mathematics 2011-12-20 Andrew Bremner , Maciej Ulas

Let $S \subset R$ be an arbitrary subset of a unique factorization domain $R$ and $\K$ be the field of fractions of $R$. The ring of integer-valued polynomials over $S$ is the set $\mathrm{Int}(S,R)= \{ f \in \mathbb{K}[x]: f(a) \in R\…

Commutative Algebra · Mathematics 2021-05-14 Devendra Prasad

We prove a quantitative version of Hilbert's irreducibility theorem for function fields: If $f(T_1,\ldots, T_n,X)$ is an irreducible polynomial over the field of rational functions over a finite field $\mathbb{F}_q$ of characteristic $p$,…

Number Theory · Mathematics 2019-12-12 Lior Bary-Soroker , Alexei Entin

We present the formula for the number of monic irreducible polynomials of degree $n$ over the finite field $\mathbb F_q$ where the coefficients of $x^{n-1}$ and $x$ vanish for $n\ge3$. In particular, we give a relation between rational…

Number Theory · Mathematics 2020-05-20 Yağmur Çakıroğlu , Oğuz Yayla , Emrah Sercan Yılmaz

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

Number Theory · Mathematics 2019-08-15 Sam Porritt

Jakhar shown that for $f(x)=a_nx^n + a_{n-1}x^{n-1}+\cdot+ a_0$ ($a_0\neq 0$) is a polynomial with rational coefficients, if there exists a prime integer $p$ satisfying $\nu_p(a_n)=0$ and $n\nu_p(a_i)\ge (n-i)\nu_p(a_0)> 0$ for every $0\le…

Number Theory · Mathematics 2020-07-16 Lhoussain El Fadil

Given a global field K and a polynomial f defined over K of degree at least two, Morton and Silverman conjectured in 1994 that the number of K-rational preperiodic points of f is bounded in terms of only the degree of K and the degree of f.…

Number Theory · Mathematics 2007-05-23 Robert L. Benedetto

Given a prime power $q$ and positive integers $m,t,e$ with $e > mt/2$, we determine the number of all monic irreducible polynomials $f(x)$ of degree $m$ with coefficients in $\mathbb{F}_q$ such that $f(x^t)$ contains an irreducible factor…

Group Theory · Mathematics 2019-03-27 Sabina B. Pannek

In 2014, Juul, Kurlberg, Madhu and Tucker asked the following: given $K$ a number field and $f$ a rational function with coefficients in $K$, if $f_\mathfrak{p}$ denotes the reduction of $f$ modulo a prime ideal $\mathfrak{p}$ in the ring…

Number Theory · Mathematics 2026-03-24 Santiago Radi
‹ Prev 1 2 3 10 Next ›