Indecomposability of polynomials via Jacobian matrix

DOI10.1016/J.JALGEBRA.2010.01.007zbMATH Open1202.13014OpenAlexW2062228305MaRDI QIDQ984987FDOQ984987

Authors: Guillaume Chèze, Salah Najib 

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

Recommendations

• Integral and homothetic indecomposability with applications to irreducibility of polynomials
• Absolute irreducibility of bivariate polynomials via polytope method
• Specializations of indecomposable polynomials
• Indecomposable polynomials and their spectrum
• Decomposition of polytopes and polynomials

zbMATH Keywords

Noether's theoremBertini's theoremNewton's polygonindecomposable polynomialsOstrowski's theorem

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials, factorization in commutative rings (13P05)

Cites Work

• Title not available (Why is that?)
• Reducibility of polynomials \(f(x,y)\) modulo \(p\)
• Zero testing of algebraic functions
• Title not available (Why is that?)
• Irreducibility of polynomials modulo \(p\) via Newton polytopes.
• Effective Noether irreducibility forms and applications
• Indecomposable polynomials and their spectrum
• Reduzibilität ebener Kurven.
• Factoring multivariate polynomials via partial differential equations
• 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)
• Unirational fields of transcendence degree one and functional decomposition
• On the invariance of chains of fields
• Lifting and recombination techniques for absolute factorization
• Improved dense multivariate polynomial factorization algorithms
• Sur les polynomes f(X,Y) tels que K[f] est integralement ferme dans K[X,Y]
• Title not available (Why is that?)
• On the complexity of counting irreducible components and computing Betti numbers of algebraic varieties
• Computation of unirational fields

Cited In (3)

• A recombination algorithm for the decomposition of multivariate rational functions
• Specializations of indecomposable polynomials
• On the Indecomposability of Polynomials*

This page was built for publication: Indecomposability of polynomials via Jacobian matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q984987)