Indecomposability of polynomials via Jacobian matrix

Indecomposable polynomials are a special class of absolutely irreducible polynomials. Some improvements of important effective results on absolute irreducibility have recently appeared using Ruppert's matrix. In a similar way, we show in this paper that the use of a Jacobian matrix gives sharp bounds for the indecomposability problem.