On Polynomial Decompositions

@article{Klners1999OnPD,
  title={On Polynomial Decompositions},
  author={J. Kl{\"u}ners},
  journal={J. Symb. Comput.},
  year={1999},
  volume={27},
  pages={261-269}
}
  • J. Klüners
  • Published 1999
  • Computer Science, Mathematics
  • J. Symb. Comput.
We present a new polynomial decomposition which generalizes the functional and homogeneous bivariate decomposition of irreducible monic polynomials in one variable over the rationals. With these decompositions it is possible to calculate the roots of an imprimitive polynomial by solving polynomial equations of lower degree. 
On Multivariate Polynomial Decomposition
TLDR
A polynomial time algorithm for decomposing multivariate polynomials over an arbitrary field and the possible definitions of decomposable/indecomposable polynomes are presented. Expand
Multivariate Polynomial Decomposition
TLDR
Several notions of decomposition for multivariate polynomials are discussed, focussing on the relation with Lüroth's theorem in field theory, and the finiteness and uniqueness of decompositions. Expand
Decomposition of ordinary difference polynomials
TLDR
An algorithm to decompose ordinary non-linear difference polynomials with rational functions as coefficients is presented and Experimental results show that the algorithm is quite effective and can be used to decomposing difference polysmials with thousands of terms. Expand
Decomposition of ordinary differential polynomials
  • X. Gao, Mingbo Zhang
  • Mathematics, Computer Science
  • Applicable Algebra in Engineering, Communication and Computing
  • 2008
TLDR
The algorithm provides an efficient reduction of the problem to the factorization of LODOs over the same coefficient field and can be used to decompose differential polynomials with thousands of terms effectively. Expand
Formal Power Series and Some Theorems of J. F. Rittin Arbitrary Characteristic
Abstract. We study composition of power series and polynomials over algebraically closed fields of arbitrary characteristic. The so-called Boettcher function of a power series is introduced andExpand
On Ritt's decomposition theorem in the case of finite fields
TLDR
This paper presents the conclusions about the generalization of Ritt's theorem in the case of finite coefficient fields when the tameness condition is dropped. Expand
Counting Decomposable Univariate Polynomials
  • J. Gathen
  • Mathematics, Computer Science
  • Comb. Probab. Comput.
  • 2015
TLDR
An approximation to the number of decomposables over a finite field is determined by studying the composition f = g ○ h of two polynomials g and h whose degree is at least 2. Expand
Lower bounds for decomposable univariate wild polynomials
  • J. Gathen
  • Computer Science, Mathematics
  • J. Symb. Comput.
  • 2013
TLDR
This work presents an efficient algorithm for the wild case of univariate polynomial f over a field that computes a decomposition, if one exists, and provides a reasonable lower bound on the number of decomposable polynomials over a finite field. Expand
Survey on Counting Special Types of Polynomials
TLDR
This survey presents counting results for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the powerful ones (divisible by the \(s\)th power of a nonconstant polynomial), the relatively irreducable ones (irreducible but reducible over an extension field), the decomposable ones, and also for reducible space curves. Expand
A recombination algorithm for the decomposition of multivariate rational functions
TLDR
This paper shows how it can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy using the used of Darboux polynomials and deduces a decomposition algorithm in the sparse bivariate case. Expand
...
1
2
...

References

SHOWING 1-10 OF 17 REFERENCES
Algebraic factoring and rational function integration
  • B. Trager
  • Mathematics, Computer Science
  • SYMSAC '76
  • 1976
TLDR
A new, simple, and efficient algorithm for factoring polynomials in several variables over an algebraic number field is presented and a constructive procedure is given for finding the least degree extension field in which the integral can be expressed. Expand
Homogeneous Bivariate Decompositions
TLDR
A Structure Theorem relating these decompositions to certain block decomposition of the roots of f, decomposition algorithms, and a classification of all constellations of degrees for which "almost all" polynomials f have such a decomposition is given. Expand
Polynomial Decomposition Algorithms
TLDR
The question of when a polynomial f over a commutative ring has a nontrivial functional decomposition f=g^o h is examined and a new structure theorem is given that leads to necessary and sufficient algebraic conditions for decomposibility over any field. Expand
Computing subfields: Reverse of the primitive element problem
We describe an algorithm which computes all subfields of an effectively given finite algebraic extension. Although the base field can be arbitrary, we focus our attention on the rationals.
Factoring polynomials with rational coefficients
In this paper we present a polynomial-time algorithm to solve the following problem: given a non-zero polynomial fe Q(X) in one variable with rational coefficients, find the decomposition of f intoExpand
Block Systems of a Galois Group
  • A. Hulpke
  • Mathematics, Computer Science
  • Exp. Math.
  • 1995
TLDR
An algorithm to compute subfields of an algebraic number field as block systems of its Galois group as well as symbolic computations and avoids numerical approximations is described. Expand
Ideal Decompositions and Subfields
TLDR
An algorithm which determines gandh∈Q[x] forming non-trivial decompositions, so thatf|g○h, when such exist, is described. Expand
On Computing Subfields
TLDR
All subfields Q(β) of fixed degree of a given algebraic number field Q(α) are determined by determining each subfield by a pair of polynomials such thatg is the minimal polynomial of β = h(α). Expand
Computing GCDs of Polynomials over Algebraic Number Fields
TLDR
The gcd algorithm of Langemyr and McCallum can be applied directly to polynomials that are not necessarily represented in terms of an algebraic integer, and an algorithm for reconstructing a rational number from its modular residue so that the denominator bound need not be explicitly computed. Expand
Factoring Polynomials Over Algebraic Number Fields
TLDR
This algorithm has the advantage of factoring nonmonic polynomials without inordinately increasing the amount of work, essentially by allowing denominators in the coefficients of the polynomial and its factors. Expand
...
1
2
...