Results 21 to 30 of about 94,460 (146)
Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach [PDF]
, 2014 We present a new algorithm for the computation of the irreducible factors of degree at most $d$, with multiplicity, of multivariate lacunary polynomials over fields of characteristic zero.
Grenet, Bruno
core +4 more sources
On the irreducibility of Hecke polynomials [PDF]
Mathematics of Computation, 2008 Summary: Let \(T_{n,k}(X)\) be the characteristic polynomial of the \(n\)th Hecke operator acting on the space of cusp forms of weight \(k\) for the full modular group. We record a simple criterion which can be used to check the irreducibility of the polynomials \(T_{n,k}(X)\).
openaire +2 more sources
Akar-akar Polinomial Separable sebagai Pembentuk Perluasan Normal pada Ring Modulo
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2012 One of the most important uses of the ring and field theory is an extension of a broader field so that a polynomial can be found to have roots. In this study researchers took modulo a prima as follows indeterminate coeffcients to search for his roots ...
Saropah Saropah
doaj +1 more source
, 2020 The problem of computing \emph{the exponent lattice} which consists of all the multiplicative relations between the roots of a univariate polynomial has drawn much attention in the field of computer algebra.
AJ van der Poorten +18 more
core +1 more source
A new class of irreducible polynomials [PDF]
Communications in Algebra, 2021 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 integers.
Jitender Singh, Sanjeev Kumar
openaire +2 more sources
On the Irreducibility of the Krawtchouck Polynomials
, 2022 The Krawtchouck polynomials arise naturally in both coding theory and probability theory and have been studied extensively from these points of view. However, very little is known about their irreducibility and Galois properties. Just like many classical families of orthogonal polynomials (e.g.
openaire +3 more sources
On the irreducible factors of a polynomial II [PDF]
Journal of Algebra, 2020 We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].
Anuj Jakhar, Kotyada Srinivas
openaire +3 more sources
The radical factors of f(x)−f(y) over finite fields
International Journal of Mathematics and Mathematical Sciences, 1997 Let F denote the finite field of order q For f(x) in F[x], let f*(x,y) denote the substitution polynomial f(x)−f(y). The polynomial f*(x,y) has frequently been used in questions on the values set of f(x) In this paper we consider the irreducible factors ...
Javier Gomez-Calderon
doaj +1 more source
Modified Cyclotomic Polynomial and Its Irreducibility
Mathematics, 2020 Finding irreducible polynomials over Q (or over Z ) is not always easy. However, it is well-known that the mth cyclotomic polynomials are irreducible over Q .
Ki-Suk Lee, Sung-Mo Yang, Soon-Mo Jung
doaj +1 more source
A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial Problem
Abstract and Applied Analysis, 2013 Let be a real-valued polynomial function of the form , with degree of in An irreducible real-valued polynomial function and a nonnegative integer are given to find a polynomial function satisfying the following expression: for some constant .
Yi-Chou Chen, Hang-Chin Lai
doaj +1 more source