Irreducibility of a sum of polynomials depending on disjoint sets of variables
Abstract
In this article, we give two different sufficient conditions for the irreducibility of a polynomial of more than one variable, over the field of complex numbers, that can be written as a sum of two polynomials which depend on mutually disjoint sets of variables. These conditions are derived from analyzing the Newton polytope of such a polynomial and then applying the `Irreducibility criterion' introduced by Gao.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.