Irreducibility of polynomials modulo \(p\) via Newton polytopes.

DOI10.1016/S0022-314X(03)00044-1zbMath1108.13307MaRDI QIDQ1399670

Shuhong Gao, Virgínia M. Rodrigues

Publication date: 30 July 2003

Published in: Journal of Number Theory (Search for Journal in Brave)

zbMATH Keywords

PDE; good reduction; Newton polytopes; absolute irreducibility

Mathematics Subject Classification ID

52B20: Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry)

12E05: Polynomials in general fields (irreducibility, etc.)

13P05: Polynomials, factorization in commutative rings

11R09: Polynomials (irreducibility, etc.)

Related Items

On pseudopoints of algebraic curves, Indecomposability of polynomials via Jacobian matrix, Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem, Zero-patterns of polynomials and Newton polytopes., Lifting and recombination techniques for absolute factorization, Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations

Cites Work

• Fast parallel absolute irreducibility testing
• On multiplication and factorization of polynomials. I: Lexicographic orderings and extreme aggregates of terms
• Equations over finite fields. An elementary approach
• Reducibility of polynomials \(f(x,y)\) modulo \(p\)
• On the reduction modulo \(p\) of an absolutely irreducible polynomial \(f(x,y)\)
• Effective Noether irreducibility forms and applications
• Reduzibilität ebener Kurven.
• Factoring multivariate polynomials via partial differential equations
• Absolute irreducibility of polynomials via Newton polytopes
• Decomposition of polytopes and polynomials