Indecomposability of polynomials via Jacobian matrix
From MaRDI portal
Publication:984987
DOI10.1016/j.jalgebra.2010.01.007zbMath1202.13014OpenAlexW2062228305MaRDI QIDQ984987
Publication date: 20 July 2010
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgebra.2010.01.007
Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials, factorization in commutative rings (13P05)
Related Items (2)
Specializations of indecomposable polynomials ⋮ A recombination algorithm for the decomposition of multivariate rational functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Zero testing of algebraic functions
- The total reducibility order of a polynomial in two variables
- Functional decomposition of polynomials: the tame case
- Le formalisme du résultant. (The formalism of resultant)
- Reducibility of polynomials \(f(x,y)\) modulo \(p\)
- Irreducibility of polynomials modulo \(p\) via Newton polytopes.
- Effective Noether irreducibility forms and applications
- Lifting and recombination techniques for absolute factorization
- Computation of unirational fields
- Improved dense multivariate polynomial factorization algorithms
- On the invariance of chains of fields
- Unirational fields of transcendence degree one and functional decomposition
- Indecomposable polynomials and their spectrum
- Reduzibilität ebener Kurven.
- Sur les polynomes f(X,Y) tels que K[f est integralement ferme dans K[X,Y]]
- Factoring multivariate polynomials via partial differential equations
This page was built for publication: Indecomposability of polynomials via Jacobian matrix