English
Related papers

Related papers: Closed and Irreducible Polynomials in Several Vari…

200 papers

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…

Number Theory · Mathematics 2019-08-23 Jitender Singh , Sanjeev Kumar

Let K be a field. For a given valuation on K[x], we determine the structure of its graded algebra and describe its set of key polynomials, in terms of any given key polynomial of minimal degree. We also characterize valuations not admitting…

Algebraic Geometry · Mathematics 2018-03-23 Enric Nart

Let $\mathbb{K}$ be an algebraically closed field of characteristic zero and let $\mathbb{K}_{C}[[x_{1},...,x_{e}]]$ be the ring of formal power series in several variables with exponents in a line free cone $C$. We consider irreducible…

Algebraic Geometry · Mathematics 2021-05-11 Ali Abbas , Abdallah Assi

In different areas of discrete mathematics, a certain type of polynomials, having coefficients in a field K of finite characteristic, has been considered. The form and the degree of these polynomials, here called projective, are simply…

Number Theory · Mathematics 2019-10-08 Alain Lasjaunias

Rings of integer-valued polynomials are known to be atomic, non-factorial rings furnishing examples for both irreducible elements for which all powers factor uniquely (\emph{absolutely irreducibles}) and irreducible elements where some…

Commutative Algebra · Mathematics 2023-07-18 Moritz Hiebler , Sarah Nakato , Roswitha Rissner

We obtain various irreducibility criteria for pairs of polynomials $(f(X),g(X))$ with integer coefficients whose resultant $Res(f,g)$ is a prime number, or is divisible by a sufficiently large prime number, and also for some of their linear…

Number Theory · Mathematics 2025-04-25 Nicolae Ciprian Bonciocat

Let K be a number field, and let lambda(x,t)\in K[x, t] be irreducible over K(t). Using algebraic geometry and group theory, we study the set of alpha\in K for which the specialized polynomial lambda(x,alpha) is K-reducible. We apply this…

Number Theory · Mathematics 2007-05-23 Farshid Hajir , Siman Wong

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

General Mathematics · Mathematics 2019-12-30 Duggirala Meher Krishna , Duggirala Ravi

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…

Algebraic Geometry · Mathematics 2019-11-06 Adrien Poteaux , Martin Weimann

We produce a new family of polynomials f(x) over fields K of characteristic 2 which are exceptional, in the sense that f(x)-f(y) has no absolutely irreducible factors in K[x,y] besides the scalar multiples of x-y; when K is finite, this…

Number Theory · Mathematics 2013-10-08 Robert M. Guralnick , Joel E. Rosenberg , Michael E. Zieve

The ring of integer-valued polynomials over a given subset $S$ of $\Z$ (or $ \mathrm{Int}(S,\Z ))$ is defined as the set of polynomials in $\Q[x]$ which maps $S$ to $\Z$. In factorization theory, it is crucial to check the irreducibility of…

Commutative Algebra · Mathematics 2021-09-28 Devendra Prasad

Let $\mathcal{F}_n$ be the set of unitary polynomials of degree $n \ge 2$ that have their roots in $\mathbb{Z}^*$. We note $$ Q(x) := x^n+a_{1}x^{n-1}+\dots+a_{n}. $$ We show that any two fixed consecutive coefficients $(a_{j},a_{j+1})$ ($j…

Number Theory · Mathematics 2019-11-04 Patrick Letendre

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

A positive integer k is a length of a polynomial if that polynomial factors into a product of k irreducible polynomials. We find the set of lengths of polynomials of the form x^n in R[x], where (R, m) is an Artinian local ring with m^2 = 0.

Commutative Algebra · Mathematics 2016-07-11 Richard Belshoff , Daniel Kline , Mark W. Rogers

Let K be F_q((T)), or more generally any field of characteristic p equipped with a valuation having a finite residue field of q elements. Then a polynomial f(x) in K[x] having k+1 nonzero coefficients has at most q^k distinct zeros in K. We…

Number Theory · Mathematics 2017-04-03 Bjorn Poonen

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

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 D be a Krull domain and Int(D) the ring of integer-valued polynomials on D. For any f in Int(D), we explicitly construct a divisor homomorphism from [f], the divisor-closed submonoid of Int(D) generated by f, to a finite sum of copies…

Number Theory · Mathematics 2016-04-19 Sophie Frisch

The factorizations of the polynomial $X^n-1$ and the cyclotomic polynomial $\Phi_n$ over a finite field $\mathbb F_q$ have been studied for a very long time. Explicit factorizations have been given for the case that $\mathrm{rad}(n)\mid…

Number Theory · Mathematics 2024-02-09 Anna-Maurin Graner

Let $\mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$. Let $(u_1, \dots, u_n)$ be a sequence of $n$ algebraically independent elements in $\mathbb{K}[x_1, \dots, x_n]$. Given a polynomial $f$ in…

Symbolic Computation · Computer Science 2022-06-01 Thi Xuan Vu