id,summary,reporter,owner,description,type,status,priority,milestone,component,version,resolution,keywords,cc 172,Announcement: new library decomp.lib,gorzel,hannes," For the next release I will provide {{{ LIBRARY: decomp.lib Functional Decomposition of Polynomials AUTHOR: Christian Gorzel, University of Muenster email: gorzelc@math.uni-muenster.de OVERVIEW: Implements functional decomposition of multivariate polynomials. D. Kozen, S. Landau: Polynomial Decomposition Algorithms, J. Symb. Comp. (1989), 7, 445-456 J. von zu Gathen: Functional Decomposition of Polynomials: the Tame Case, J. Symb. Comp. (1990), 9, 281-299 PROCEDURES: decompose(f[,1]); [complete] functional decomposition of poly f is_composite(f); predicate, is f a composite polynomial? chebyshev(n); the nth Chebyshev polynomial of the first kind compose(I); compose entries of ideal Decomposes, if possible, multivariate polynomials as f = h o g, where h is univariate and g is multivariate }}} //--------------------------------------------------------- Applications: * alg.number theory: intermediate fields k < k(f) * simplified solving of univariate polynomial equations * polynomial mapping: affine Stein factorization //---------------------------------------------------------- The implementation is much faster than Maple's compoly or MUPAD's polylib::decompose //--------------------------------------------------------- ",proposed feature,closed,minor,3-1-5 and higher,singular-libs,3-1-4,fixed,,