English
Related papers

Related papers: Split absolutely irreducible integer-valued polyno…

200 papers

As an extension of the classical irreducibility result of Dumas, a factorization result for polynomials over any valued field with a Krull valuation of arbitrary rank is proved. Further, a lower degree factor bound on factors of a given…

Number Theory · Mathematics 2025-11-27 Rishu Garg , Jitender Singh

We classify and construct irreducible completely splittable representations of affine and finite Hecke-Clifford algebras over an algebraically closed field of characteristic not equal to 2.

Representation Theory · Mathematics 2010-12-03 Jinkui Wan

We present the formula for the number of monic irreducible polynomials of degree $n$ over the finite field $\mathbb F_q$ where the coefficients of $x^{n-1}$ and $x$ vanish for $n\ge3$. In particular, we give a relation between rational…

Number Theory · Mathematics 2020-05-20 Yağmur Çakıroğlu , Oğuz Yayla , Emrah Sercan Yılmaz

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Number Theory · Mathematics 2022-09-12 Arghya Datta

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

Let $\mathbb{F}_q$ be a finite field with $q$ elements. M. Gerstenhaber and Irving Reiner has given two different methods to show the number of matrices with a given characteristic polynomial. In this talk, we will give another proof for…

Commutative Algebra · Mathematics 2014-02-13 Tovohery Hajatiana Randrianarisoa

We consider absolutely irreducible polynomials $f \in Z[x,y]$ with $\deg_x(f)=m$, $\deg_y(f)=n$ and height $H$. We show that for any prime $p$ with $p>c_{mn} H^{2mn+n-1}$ the reduction $f \bmod p$ is also absolutely irreducible. Furthermore…

Number Theory · Mathematics 2007-05-23 Wolfgang M. Ruppert

In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…

Symbolic Computation · Computer Science 2008-10-29 Laurent Busé , Bernard Mourrain

A subset $S$ of an integral domain $R$ is called a semidomain if the pairs $(S,+)$ and $(S, \cdot)$ are semigroups with identities; additionally, we say that $S$ is additively reduced provided that $S$ contains no additive inverses. Given…

Commutative Algebra · Mathematics 2023-07-04 Scott T. Chapman , Harold Polo

We give a classification of all irreducible completely pointed $U_q(\mathfrak{sl}_{n+1})$ modules over a characteristic zero field in which $q$ is not a root of unity. This generalizes the classification result of Benkart, Britten and…

Representation Theory · Mathematics 2020-06-09 V. Futorny , J. Hartwig , E. Wilson

The set of mxn singular matrix pencils with normal rank at most r is an algebraic set with r+1 irreducible components. These components are the closure of the orbits (under strict equivalence) of r+1 matrix pencils which are in Kronecker…

Algebraic Geometry · Mathematics 2016-06-09 Fernando De Terán , Froilán M. Dopico , J. M. Landsberg

To work more accurately with elements of the semigroup of the Stone Cech compactification of the discrete semigroup of natural numbers N under multiplication. We divided these elements into ultrafilters which are on finite levels and…

General Topology · Mathematics 2022-08-19 Salahddeen Khalifa

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

Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.

Group Theory · Mathematics 2011-12-21 Robert Guralnick , Gunter Malle

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

Number Theory · Mathematics 2018-07-09 Fusun Akman

For an element $a$ of an integral domain D under an equivalence relation \tau, the \tau-factorization of a is defined as \lambda a_1 a_2... a_k, where \lambda is a unit in D and a_i \tau a_j for all i, j. An irreducible element has no…

Number Theory · Mathematics 2012-10-11 James Lanterman

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

Computational Complexity · Computer Science 2017-02-03 Vishwas Bhargava , Gábor Ivanyos , Rajat Mittal , Nitin Saxena

Let $D$ be a domain with fraction field $K$, and let $M_n(D)$ be the ring of $n \times n$ matrices with entries in $D$. The ring of integer-valued polynomials on the matrix ring $M_n(D)$, denoted ${\rm Int}_K(M_n(D))$, consists of those…

Rings and Algebras · Mathematics 2018-09-26 Giulio Peruginelli , Nicholas J. Werner

For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…

Rings and Algebras · Mathematics 2017-03-22 Jason K. C. Polak

In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…

Number Theory · Mathematics 2020-08-26 Gohar M. Kyureghyan , Melsik K. Kyureghyan
‹ Prev 1 3 4 5 6 7 10 Next ›