中文
相关论文

相关论文: Polynomials which are locally reducible

200 篇论文

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…

数论 · 数学 2019-07-09 Vefa Goksel

We provide an alternative exposition of a result due to Schinzel. Fix an integer $k \ge 2$. For almost all choices of positive integers $n_{1} < \cdots < n_{k}$, we show that the polynomial $F(x) = 1 + x^{n_{1}} + \cdots + x^{n_{k}}$,…

数论 · 数学 2025-08-19 Michael Filaseta , Alexandros Kalogirou

Let $f_{1}, \ldots, f_{k}$ be polynomials defining an algebraic set in affine $n$-space over a finite field. Suppose $k>n$. We prove that there exists a system of polynomials $g_{1}, \ldots, g_{n}$, each being a linear combination with…

代数几何 · 数学 2022-04-26 Stefan Barańczuk

We prove that, over a field of characteristic $0$, the degrees of factors of a binomial $t^n-\alpha$ are divisible by the least such degree. As a consequence, we deduce that for relatively prime natural numbers $m,n$, a polynomial has the…

数论 · 数学 2026-02-03 Matthew Bolan , Ben Williams

We show that for a monic polynomial $f(x)$ over a number field $K$ containing a global permutation polynomial of degree $>1$ as its composition factor, the Newton Polygon of $f\mod\mathfrak p$ does not converge for $\mathfrak p$ passing…

数论 · 数学 2015-10-28 Yi Ouyang , Jinbang Yang

We prove the irreducibility of integer polynomials $f(X)$ whose roots lie inside an Apollonius circle associated to two points on the real axis with integer abscisae $a$ and $b$, with ratio of the distances to these points depending on the…

Let $f(x)=x^n+ax^2+bx+c \in \Z[x]$ be an irreducible polynomial with $b^2=4ac$ and let $K=\Q(\theta)$ be an algebraic number field defined by a complex root $\theta$ of $f(x)$. Let $\Z_K$ deonote the ring of algebraic integers of $K$. The…

数论 · 数学 2023-03-07 Anuj Jakhar , Sumandeep Kaur , Surender Kumar

A non-zero constant Jacobian polynomial maps $F=(P,Q)$ of $\mathbb{C}^2$ is invertible if $P$ and $Q$ are rational polynomials.

代数几何 · 数学 2017-09-13 Nguyen Van Chau

L. Bary-Soroker and R. Shmueli (2026) have given an asymptotic formula for the number of irreducible polynomials over the finite fields $\mathbb F_q$ of $q$ elements, such that their coefficients are perfect squares in $\mathbb F_q$ and…

数论 · 数学 2026-01-21 Alina Ostafe , Igor E. Shparlinski

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…

数论 · 数学 2020-05-20 Yağmur Çakıroğlu , Oğuz Yayla , Emrah Sercan Yılmaz

Let f and g be nonconstant polynomials over an arbitrary field K. In this paper we study the intersection of the polynomial rings K[f] and K[g], and in particular we ask whether this intersection is larger than K. We completely resolve this…

代数几何 · 数学 2013-10-08 Robert M. Beals , Joseph L. Wetherell , Michael E. Zieve

A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. In order to count the decomposables, one wants to know, under a suitable normalization, the number of equal-degree collisions of…

交换代数 · 数学 2013-11-12 Raoul Blankertz , Joachim von zur Gathen , Konstantin Ziegler

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

代数几何 · 数学 2009-10-12 Arnaud Bodin

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\…

交换代数 · 数学 2021-05-14 Devendra Prasad

Let q be a prime power and N_n count degree-n monic irreducible polynomials in F_q[x]. We show that prod_{n=1}^{\infty} (1 -z^n)^N_n = 1 - qz for small |z|.

数论 · 数学 2007-05-23 Barry Brent

Let R be an integral domain and let f(X) be a nonzero polynomial in R[X]. The content of f is the ideal c(f) generated by the coefficients of f. The polynomial f(X) is called Gaussian if c(fg)=c(f)c(g) for all g(X) in R[X]. It is well known…

交换代数 · 数学 2007-05-23 K. Alan Loper , Moshe Roitman

For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a…

环与代数 · 数学 2014-09-04 Sophie Frisch

We prove that an irreducible polynomial derivation in positive characteristic is a Jacobian derivation if and only if there exists an n-1-element p-basis of its ring of constants. In the case of two variables we characterize these…

交换代数 · 数学 2013-06-21 Piotr Jedrzejewicz

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,…

数论 · 数学 2025-10-16 Joachim König

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…

数论 · 数学 2023-05-11 Sushma Palimar