April 5, 2005
Similar papers 4
April 1, 2020
In this article, we consider polynomials of the form $f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x],$ where $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|a_0|\nmid |a_{n_1}a_{n_r}|$. We will show that under the strict inequality these polynomials are irreducible for certain values of $n_1$. In the case of equality, apart from its cyclotomic factors, they have exactly one irreducible non-reciprocal factor.
May 3, 2015
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.
March 3, 2017
Let $p$ and $q$ be polynomials with degree $2$ over an arbitrary field $\mathbb{F}$. In the first part of this article, we characterize the matrices that can be decomposed as $A+B$ for some pair $(A,B)$ of square matrices such that $p(A)=0$ and $q(B)=0$. The case when both polynomials $p$ and $q$ are split was already known. In the first half of this article, we complete the study by tackling the case when at least one of the polynomials $p$ and $q$ is irreducible over $\ma...
October 14, 2020
This paper is concerned with factor left prime factorization problems for multivariate polynomial matrices without full row rank. We propose a necessary and sufficient condition for the existence of factor left prime factorizations of a class of multivariate polynomial matrices, and then design an algorithm to compute all factor left prime factorizations if they exist. We implement the algorithm on the computer algebra system Maple, and two examples are given to illustrate th...
January 9, 2019
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 over $\mathbb F_q$. Our main results provide generalizations of recent works on the factorization of binomials $x^n-1$. As an application, we provide an explicit formula for the number of irreducible factors of $f(x^n)$ under some generic cond...
July 7, 2019
A quasi-ordinary polynomial is a monic polynomial with coefficients in the power series ring such that its discriminant equals a monomial up to unit. In this paper we study higher derivatives of quasi-ordinary polynomials, also called higher order polars. We find factorizations of these polars. Our research in this paper goes in two directions. We generalize the results of Casas-Alvero and our previous results on higher order polars in the plane to irreducible quasi-ordinary ...
August 17, 2017
We continue the first and second authors' study of $q$-commutative power series rings $R=k_q[[x_1,\ldots,x_n]]$ and Laurent series rings $L=k_q[[x^{\pm 1}_1,\ldots,x^{\pm 1}_n]]$, specializing to the case in which the commutation parameters $q_{ij}$ are all roots of unity. In this setting, $R$ is a PI algebra, and we can apply results of De Concini, Kac, and Procesi to show that $L$ is an Azumaya algebra whose degree can be inferred from the $q_{ij}$. Our main result establis...
September 24, 2024
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 3 cases and provides families of examples in both the affirmative and the negative categories in the degree 4 case. Finally this paper explores what happens in higher degree cases, providing a family of examples in the negative category and...
September 16, 2017
The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.
October 29, 2021
Let $\zeta$ be a fixed nonzero element in a finite field $\mathbb F_q$ with $q$ elements. In this article, we count the number of pairs $(A,B)$ of $n\times n$ matrices over $\mathbb F_q$ satisfying $AB=\zeta BA$ by giving a generating function. This generalizes a generating function of Feit and Fine that counts pairs of commuting matrices. Our result can be also viewed as the point count of the variety of modules over the quantum plane $xy=\zeta yx$, whose geometry was descri...