Rational polynomials of simple type: a combinatorial proof
classification
🧮 math.AG
keywords
polynomialsproofrationalsimpletypeclassificationcombinatorialdetermine
read the original abstract
We determine the Newton trees of the rational polynomials of simple type, thus filling a gap in the proof of the classification of these polynomials given by Neumann and Norbury.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.