Newton polytope
Definition
Let be a field and let be a Laurent polynomial in over , where and only finitely many are nonzero. The support of is . The Newton polytope of is the convex hull
Remarks
The Newton polytope is a lattice polytope: its vertices lie in , and each vertex is the exponent of a monomial of . For nonzero , one has , the Minkowski sum.
Example: for the support is and is the unit square. Indeed , and the unit square is the Minkowski sum of the segments and .
Non-example: for , the support is , not . The Newton polytope uses the monomials that remain after simplification, so is the single point and not the segment .
In one variable, the Newton polytope of is the segment from the lowest to the highest exponent.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Convex hull concept
- Field concept
- Polynomials in several variables concept
- Newton polytope definition
Further reading
About this page
| Tag | SXS38FWHEN |
|---|---|
| URI | m2://SXS38FWHEN |
| Kind | definition |
| Writing | W0 stub |
| MSC | 14M25, 52B20, 14T10 |
| Defines | Newton polytope |
| Uses | Convex hull, Polynomials in several variables, Field |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.