Results 281 to 290 of about 4,447 (309)

Note on Factorable Polynomials

Canadian Mathematical Bulletin, 1969
Let X1, X2,…, Xk, denote k ≥ 2 indeterminates and let f(X1,…, Xk) be a homogeneous polynomial, in GF(pn) [X1,…, Xk], which is irreducible but not absolutely irreducible over GF(pn). Thus f is irreducible in GF(pn)[X1,…, Xk] but reducible in some GF(pnm) [X1,…, Xk], m > 1.
openaire   +2 more sources

Interval Partitions and Polynomial Factorization

Algorithmica, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joachim von zur Gathen, Daniel Panario, L. Bruce Richmond   +2 more
openaire   +1 more source

On factorization of parametric polynomials

COMMENTARII MATHEMATICI UNIVERSITATIS SANCTI PAULI
In the article under review, the author studies the irreducible factorization of parametric bivariate polynomials \(f(x,y,a)\) which depend on a parameter \(a\) over a field \(K\). Letting \(K(a)\) denote the rational function field in \(a\) over \(K\), the author's main result is that if \(f(x,y,a)\) is absolutely irreducible over \(K(a)\), then the ...
openaire   +2 more sources

An interative factorization techniques for polynomials

Communications of the ACM, 1963
An iterative technique is displayed whereby factors of arbitrary degree can be found for polynomials in one variable. Convergence is shown to occur always if a certain Jacobian does not vanish and if the initial approximation to a factor is near enough to an actual factor. The process is simply programmed, and preliminary results indicate it to be well
openaire   +2 more sources

Polynomial equations and factoring polynomials

1999
Solving polynomial equations and systems of polynomial equations is a classical type of problem. Its study received new impetus from the fact that computers can now handle laborious algorithms, using factorization, resultants, and the more recent Buchberger algorithm for calculating Grobner bases. Maple is in the front line of using these developments.
openaire   +1 more source

New remarks on the factorization and equivalence problems for a class of multivariate polynomial matrices

Journal of Symbolic Computation, 2023
Fanghui Xiao, Dingkang Wang
exaly  

Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant

Computers and Mathematics With Applications, 1995
V Y Pan
exaly  

On the Design of FIR Wavelet Filter Banks Using Factorization of a Halfband Polynomial

IEEE Signal Processing Letters, 2008
Bhushan Patil, Pushkar G Patwardhan, Vikram M Gadre   +2 more
exaly  

Improved dense multivariate polynomial factorization algorithms

Journal of Symbolic Computation, 2007
Gregoire Lecerf
exaly  

ON APPROXIMATE FACTORS OF POLYNOMIALS

The Quarterly Journal of Mathematics, 1955
openaire   +1 more source