English
Related papers

Related papers: On the irreducibility of multivariate polynomials

200 papers

An algorithm for factoring polynomials over finite fields is given by Berlekamp in 1967. The main tool was the matrix Q corresponding to each polynomial. This paper studies the degrees of polynomials over binary field that associated with…

Number Theory · Mathematics 2017-04-13 Yaotsu Chang , Chong-Dao Lee , Chia-an Liu

The aim of the paper is to produce new families of irreducible polynomials, generalizing previous results in the area. One example of our general result is that for a near-separated polynomial, i.e., polynomials of the form…

Symbolic Computation · Computer Science 2019-03-21 Jaime Gutierrez , Jorge Jimenez Urroz

Let $S$ be a domain and $R=S[t;\sigma,\delta]$ a skew polynomial ring, where $\sigma$ is an injective endomorphism of $S$ and $\delta$ a left $\sigma$ -derivation. We give criteria for skew polynomials $f\in R$ of degree less or equal to…

Rings and Algebras · Mathematics 2021-04-22 Christian Brown , Susanne Pumpluen

We study irreducible specializations, in particular when group-preserving specializations may not exist. We obtain a criterion in terms of embedding problems. We include several applications to analogs of Schinzel's hypothesis H and to the…

Number Theory · Mathematics 2010-09-23 Lior Bary-Soroker

In this note, we prove an irreducibility criterion for the polynomial of the form $f(x) = a_{n}x^{n} + a_{n-1}x^{n-1} + \cdots + a_{m}x^{m} + p^{u} \in \mathbb{Z}[x]$, where $p$ is a prime number, $u \geqslant 1$, $\gcd(u, m) = 1$, $p \nmid…

Number Theory · Mathematics 2023-03-08 Zhang Weilin , Yuan Pingzhi

In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003)…

Number Theory · Mathematics 2014-07-02 Won-Ho Ri , Gum-Chol Myong , Ryul Kim , Chang-Il Rim

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

A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number…

Commutative Algebra · Mathematics 2009-07-02 Joachim von zur Gathen

We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.

Number Theory · Mathematics 2015-08-13 Samuel H. Dalalyan

We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…

Number Theory · Mathematics 2008-11-26 Xiang-dong Hou , Gary L. Mullen

In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|a_0|$ is a prime. We show that these polynomials have a cyclotomic factor whenever…

Number Theory · Mathematics 2020-06-09 Biswajit Koley , A. Satyanarayana Reddy

We give a criterion whether given Eisenstein polynomials over a local field K define the same extension over K in terms of a certain non-Archimedean metric on the set of polynomials. The criterion and its proof depend on ramification…

Number Theory · Mathematics 2011-09-06 Manabu Yoshida

This paper investigates whether or not polynomials that are irreducible over $\mathbb{Q}$ and $\mathbb{Z}$ can remain irreducible under substitution by all quadratic polynomials. It answers this question in the negative in the degree 2 and…

Number Theory · Mathematics 2025-06-18 Lara Du

In this paper we give a detailed analysis of deterministic and randomized algorithms that enumerate any number of irreducible polynomials of degree $n$ over a finite field and their roots in the extension field in quasilinear where $N=n^2$…

Discrete Mathematics · Computer Science 2016-08-12 Nader H. Bshouty , Nuha Diab , Shada R. Kawar , Robert J. Shahla

C. F. Gauss discovered a beautiful formula for the number of irreducible polynomials of a given degree over a finite field. Assuming just a few elementary facts in field theory and the exclusion-inclusion formula, we show how one see the…

History and Overview · Mathematics 2011-03-17 Sunil K. Chebolu , Jan Minac

Let $V$ be a vector space over a finite field $k$. We give a condition on a subset $A \subset V$ that allows for a local criterion for checking when a function $f:A \to k$ is a restriction of a polynomial function of degree $<m$ on $V$. In…

Combinatorics · Mathematics 2018-12-05 David Kazhdan , Tamar Ziegler

Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose…

Commutative Algebra · Mathematics 2022-03-16 Sophie Frisch , Sarah Nakato , Roswitha Rissner

Let $\iota:K\hookrightarrow L\cong K(x)$ be a simple transcendental extension of valued fields, where $K$ is equipped with a valuation $\nu$ of rank 1. That is, we assume given a rank 1 valuation $\nu$ of $K$ and its extension $\nu'$ to…

Algebraic Geometry · Mathematics 2022-06-30 F. J. Herrera Govantes , W. Mahboub , M. A. Olalla Acosta , M. Spivakovsky

In this paper, we present a criterion for $(K,v)$ to be henselian and defectless in terms of finite complete sequences of key polynomials. For this, we use the theory of Mac Lane-Vaqui\'e chains and abstract key polynomials. We then prove…

Commutative Algebra · Mathematics 2025-01-13 Caio Henrique Silva de Souza

We introduce an interesting and rather large class of monoid homomorphisms, on arbitrary integral domain $R$, that we call Dumas valuations. Then we formulate a conjecture addressing the question asking when a polynomial $f\in R[X]$ cannot…

Number Theory · Mathematics 2024-05-21 Boris Širola