English
Related papers

Related papers: Characterizing absolutely irreducible integer-valu…

200 papers

A domain $R$ is said to have the finite factorization property if every nonzero non-unit element of $R$ has at least one and at most finitely many distinct factorizations up to multiplication of irreducible factors by central units. Let $k$…

Rings and Algebras · Mathematics 2019-03-06 Jason P. Bell , Albert Heinle , Viktor Levandovskyy

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

Let $D$ be a Krull domain admitting a prime element with finite residue field and let $K$ be its quotient field. We show that for all positive integers $k$ and $1 < n_1 \leq \ldots \leq n_k$ there exists an integer-valued polynomial on $D$,…

Commutative Algebra · Mathematics 2023-08-29 Victor Fadinger , Daniel Windisch

We investigate non-unique factorization of polynomials in Z_{p^n}[x] into irreducibles. As a Noetherian ring whose zero-divisors are contained in the Jacobson radical, Z_{p^n}[x] is atomic. We reduce the question of factoring arbitrary…

Number Theory · Mathematics 2011-03-21 Christopher Frei , Sophie Frisch

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…

Number Theory · Mathematics 2015-12-01 F. E. Brochero Martínez , Lucas Reis

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

Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…

Number Theory · Mathematics 2023-11-07 Alp Bassa , Gaetan Bisson , Roger Oyono

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

We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…

Commutative Algebra · Mathematics 2014-06-20 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

An integral domain is atomic if every nonzero nonunit factors into irreducibles. Let $R$ be an integral domain. We say that $R$ is a bounded factorization domain if it is atomic and for every nonzero nonunit $x \in R$, there is a positive…

Commutative Algebra · Mathematics 2020-10-07 David F. Anderson , Felix Gotti

Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…

Commutative Algebra · Mathematics 2008-06-10 Luis F. Caceres , Jose A. Velez-Marulanda

$\DeclareMathOperator{\Int}{Int}\DeclareMathOperator{\IntR}{Int{}^\text{R}}$For a domain $D$, the ring $\Int(D)$ of integer-valued polynomials over $D$ is atomic if $D$ satisfies the ascending chain condition on principal ideals. However,…

Commutative Algebra · Mathematics 2024-07-09 Baian Liu

Given a certain factorization property of a ring $R$, we can ask if this property extends to the polynomial ring over $R$ or vice versa. For example, it is well known that $R$ is a unique factorization domain if and only if $R[X]$ is a…

Commutative Algebra · Mathematics 2019-06-04 D. D. Anderson , Ranthony A. C. Edmonds

We provide an irreducibility test and factoring algorithm (with some qualifications) for formal power series in the unique factorization domain $R[[X]]$, where $R$ is any principal ideal domain. We also classify all integral domains arising…

Commutative Algebra · Mathematics 2012-06-28 Jesse Elliott

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…

Commutative Algebra · Mathematics 2020-05-12 John Abbott

It has been a well-known fact since Euclid's time that there exist infinitely many rational primes. Two natural questions arise: In which other rings, sufficiently similar to the integers, are there infinitely many irreducible elements? Is…

Commutative Algebra · Mathematics 2007-05-23 Fabrizio Zanello

Denote by $\mathfrak{o}$ the valuation ring of a non-Archimedean local field with prime ideal $\mathfrak{p}$ and finite residue field, and let $r\geq 1$ be an integer. We prove that for every smooth affine group scheme $G$ over…

Representation Theory · Mathematics 2024-05-24 Alexander Jackson

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

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

A nonzero element of an integral domain (or commutative cancellative monoid) is called atomic if it can be written as a finite product of irreducible elements (also called atoms). In this paper, we introduce and investigate an unrestricted…

Commutative Algebra · Mathematics 2025-11-04 Jonathan Du , Felix Gotti