中文
相关论文

相关论文: An irreducibility criterion for polynomials over i…

200 篇论文

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…

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

数论 · 数学 2007-05-23 Anca Iuliana Bonciocat , Alexandru Zaharescu

For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set…

数论 · 数学 2020-09-25 László Mérai , Alina Ostafe , Igor E. Shparlinski

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

数论 · 数学 2018-09-05 Fusun Akman

We give a criterion for a quasi-ordinary polynomial to be irreducible. The criterion is based on the notion of approximate roots and that of generalized Newton polygons.

代数几何 · 数学 2009-04-29 Abdallah Assi

In this paper we investigate the factorization behaviour of the binomial polynomials $\binom{x}{n} = \frac{x(x-1)\cdots (x-n+1)}{n!}$ and their powers in the ring of integer-valued polynomials $\operatorname{Int}(\mathbb{Z})$. While it is…

交换代数 · 数学 2022-02-09 Roswitha Rissner , Daniel Windisch

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

数论 · 数学 2024-01-17 Jitender Singh , Rishu Garg

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 establish necessary and sufficient conditions for a quadratic polynomial to be irreducible in the ring $Z[[x]]$ of formal power series with integer coefficients. For $n,m\ge 1$ and $p$ prime, we show that $p^n+p^m\beta x+\alpha x^2$ is…

交换代数 · 数学 2023-10-24 Daniel Birmajer , Juan Gil , Michael Weiner

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…

数论 · 数学 2011-12-20 Andrew Bremner , Maciej Ulas

We establish necessary and sufficient conditions for a polynomial to be divisible by a cyclotomic polynomials and derive new formulas involving Ramanujan sums as an application of our results. Additionally, we provide new insights into the…

数论 · 数学 2025-08-06 Laura De Carli , Maurizio Laporta

We consider the question of certifying that a polynomial in ${\mathbb Z}[x]$ or ${\mathbb Q}[x]$ is irreducible. Knowing that a polynomial is irreducible lets us recognise that a quotient ring is actually a field extension (equiv.~that a…

交换代数 · 数学 2020-05-12 John Abbott

In this article, we give two different sufficient conditions for the irreducibility of a polynomial of more than one variable, over the field of complex numbers, that can be written as a sum of two polynomials which depend on mutually…

交换代数 · 数学 2021-07-08 Vikramjeet Singh Chandel , Uma Dayal

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

数论 · 数学 2025-12-24 Rishu Garg , Jitender Singh

Let $f(t_1, \ldots, t_r, X)\in \mathbb{Z}[t_1, \ldots, t_r,X]$ be irreducible and let $a_1, \ldots, a_r\in \mathbb{Z} \smallsetminus \{0,\pm 1\}$. Under a necessary ramification assumption on $f$, and conditionally on the Generalized…

数论 · 数学 2024-05-08 Lior Bary-Soroker , Daniele Garzoni , Vlad Matei

In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…

数论 · 数学 2019-08-23 Jitender Singh , Sanjeev Kumar

Let $f(x)\in \mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $\nu_p(q-1)\ge \nu_{p}(e)+\nu_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine…

数论 · 数学 2015-12-01 F. E. Brochero Martínez , Lucas Reis

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…

数论 · 数学 2019-01-11 F. E. Brochero Martínez , Lucas Reis , Lays Silva

Let $p$ be a prime and $b(x)$ be an irreducible polynomial of degree $k$ over $\mathbb{F}_p$. Let $d\geq 1$ be an integer. Consider the following question: Is $b(x^d)$ irreducible? We derive necessary conditions for $b(x^d)$ to be…

数论 · 数学 2016-04-29 Palash Sarkar , Shashank Singh

This paper addresses the factorization of polynomials of the form $F(x) = f_{0}(x) + f_{1}(x) x^{n} + \cdots + f_{r-1}(x) x^{(r-1)n} + f_{r}(x) x^{rn}$ where $r$ is a fixed positive integer and the $f_{j}(x)$ are fixed polynomials in…

数论 · 数学 2022-07-26 Michael Filaseta