Counting decomposable multivariate polynomials

DOI10.1007/s00200-011-0141-9zbMath1288.68298arXiv0811.4726OpenAlexW1987263318MaRDI QIDQ429753

Joachim von zur Gathen

Publication date: 20 June 2012

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0811.4726

zbMATH Keywords

computer algebramultivariate polynomialspolynomial decompositionfinite fields.

Mathematics Subject Classification ID

Related Items (4)

Counting decomposable polynomials with integer coefficients ⋮ Counting Decomposable Univariate Polynomials ⋮ Normal form for Ritt's second theorem ⋮ A recombination algorithm for the decomposition of multivariate rational functions

Cites Work

• Unnamed Item
• Functional decomposition of polynomials: the tame case
• Counting reducible and singular bivariate polynomials
• Multivariate polynomial decomposition
• A rational function decomposition algorithm by near-separated polynomials
• Algebraic closure of a rational function
• The distribution of irreducible polynomials in several indeterminates
• Composition collisions and projective polynomials
• Unirational fields of transcendence degree one and functional decomposition
• Indecomposable polynomials and their spectrum
• The Distribution of Irreducible Polynomials in Several Indeterminates II
• The distribution of irreducible polynomials in several indeterminates over a finite field
• Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields

This page was built for publication: Counting decomposable multivariate polynomials