Effective Noether irreducibility forms and applications

@article{Kaltofen1991EffectiveNI,
  title={Effective Noether irreducibility forms and applications},
  author={Erich L. Kaltofen},
  journal={J. Comput. Syst. Sci.},
  year={1991},
  volume={50},
  pages={274-295}
}
  • E. Kaltofen
  • Published 1991
  • Mathematics
  • J. Comput. Syst. Sci.
An absolutely irreducible multivariate polynomial is a polynomial that cannot be factored even if the coefficients of the factors can Yle in any field above the original coefficient field. For example, an absolutely irreducible polyn~ mial with rational number coefficients does not factor over the field of complex numbers. We consider algorithms that factor a multivariate polynomial into absolutely irreducible polynomials. Our contributions are essentially threefold. First, we estimate the blt… 
Factoring multivariate polynomials via partial differential equations
A new method is presented for factorization of bivariate polynomials over any field of characteristic zero or of relatively large characteristic. It is based on a simple partial differential equation
Factoring Rational Polynomials Over the Complex Numbers
TLDR
After reducing to the two-variable, square-free case, the classical algebraic geometry fact that the absolute irreducible factors of P(z_1 ,z_2 ) = 0) correspond to the connected components of the real surface (or complex curve) minus its singular points is applied.
Exact polynomial factorization by approximate high degree algebraic numbers
TLDR
This paper overcome the problem arising in Hulst and Lenstra's algorithm and proposes a new polynomial time algorithm for factoring bivariate polynomials with rational coefficients and proves that this algorithm saves a (log2(mn)2+ε factor in bit-complexity comparing with the algorithm presented by HulSt and Lenstro.
Approximate Factorization of Polynomials in Many Variables and Other Problems in Approximate Algebra via Singular Value Decomposition Methods
TLDR
A method to find a lower bound on the distance to the nearest polynomial that factors, which can be applied to functional decomposition of univariate polynomials, and a general theory of low rank approximation to extend bounds results to many differentPolynomial norms is given.
On approximate irreducibility of polynomials in several variables
TLDR
Using an absolute irreducibility criterion due to Ruppert, this work is able to find useful separation bounds, in several norms, for bivariate polynomials, and derive new, more effective Noether forms for polynmials of arbitrarily many variables.
Noether's forms for the study of non-composite rational functions and their spectrum
In this paper, the spectrum and the decomposability of a multivariate rational function are studied by means of the effective Noether's irreducibility theorem given by Ruppert. With this approach,
Solving Degenerate Sparse Polynomial Systems Faster
TLDR
A fast method to find a point in every irreducible component of the zero set Z of F, a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic is presented.
Absolute Irreducibility of Polynomials via Newton Polytopes
Abstract A multivariable polynomial is associated with a polytope, called its Newton polytope. A polynomial is absolutely irreducible if its Newton polytope is indecomposable in the sense of
...
...

References

SHOWING 1-10 OF 47 REFERENCES
Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
TLDR
An algorithm is presented which reduces the problem of finding the irreducible factors of f in polynomial-time in the total degree of f and the coefficient lengths of f to factoring a univariate integral polynomials, which implies the following theorem.
Fast Parallel Absolute Irreducibility Testing
  • E. Kaltofen
  • Mathematics, Computer Science
    J. Symb. Comput.
  • 1985
Irreducibility of Multivariate Polynomials
  • J. Gathen
  • Mathematics, Computer Science
    J. Comput. Syst. Sci.
  • 1985
Factoring rational polynomials over the complexes
TLDR
NC algorithms for determining the number and degrees of the absolute factors (factors irreducible over the complex numbers C) of a multi-variate polynomial with rational coefficients and a method for obtaining an approximation to the coefficients of each factor whose running time is polynomials in the size of the original (dense).
Factorization of Polynomials Given by Straight-Line Programs
  • E. Kaltofen
  • Computer Science, Mathematics
    Adv. Comput. Res.
  • 1989
TLDR
This paper can probabilistically determine all those sparse irreducible factors of a polynomial given by a straight-line program that have less than a given number of monomials.
Effective procedures in field theory
  • A. Fröhlich, J. Shepherdson
  • Mathematics, Computer Science
    Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences
  • 1956
TLDR
This paper sharpen van der Waerden’s result on the non-existence of a general splitting algorithm by constructing a particular explicitly given field which has no splitting algorithm and shows that the results on the existence of a splitting algorithm for a finite extension field does not hold for inseparable extensions.
Factorization over finitely generated fields
TLDR
This paper first describes the current methods of factoring polynomials over the integers, and extends them to the integers mod p, and shows that, for a properly specified finitely generated extension of the rationals or the integersmod p, the problem is soluble.
Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
TLDR
This algorithm yields the first efficient deterministic polynomial time algorithm (and moreover boolean $NC-algorithm) for interpolating t-sparse polynomials over finite fields and should be contrasted with the fact that efficient interpolation using a black box that only evaluates the polynometric at points in $GF[q]$ is not possible.
Parallel algorithms for algebraic problems
  • J. Gathen
  • Mathematics, Computer Science
    STOC
  • 1983
TLDR
The present paper presents a “theory package for parallel algebraic computations”, and fast parallel solutions to the following algebraic problems are given: computing all entries of the Extended Euclidean Scheme of two polynomials over an arbitrary field, gcd and lcm of many polynOMials, factoring polynomers over finite fields, and the squarefree decomposition of polynmials over fields of characteristic zero and over finite field.
On Euclid's Algorithm and the Theory of Subresultants
TLDR
An elementary treatment of the theory of subresultants is presented, and the relationship of the sub resultants of a given pair of polynomials to their polynomial remainder sequence as determined by Euclid's algorithm is examined.
...
...