Computing the Newton polygon of the implicit equation
| dc.creator | Emiris, Ioannis Z. | |
| dc.creator | Konaxis, Christos | |
| dc.creator | Palios, Leonidas | |
| dc.date | 2008-11-03 | |
| dc.date.accessioned | 2026-07-07T10:14:45Z | |
| dc.date.available | 2026-07-07T10:14:45Z | |
| dc.description | We consider polynomially and rationally parameterized curves, where the polynomials in the parameterization have fixed supports and generic coefficients. We apply sparse (or toric) elimination theory in order to determine the vertex representation of its implicit polygon, i.e. of the implicit equation's Newton polygon. In particular, we consider mixed subdivisions of the input Newton polygons and regular triangulations of point sets defined by Cayley's trick. We distinguish polynomial and rational parameterizations, where the latter may have the same or different denominators; the implicit polygon is shown to have, respectively, up to 4, 5, or 6 vertices. | |
| dc.description | 21 pages, 9 figures | |
| dc.identifier | https://arxiv.org/abs/0811.0103 | |
| dc.identifier | http://arxiv.org/abs/0811.0103 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/172992 | |
| dc.subject | Algebraic Geometry | |
| dc.subject | Combinatorics | |
| dc.subject | 14H50 (Primary) 14Q05, 52B20 (Secondary) | |
| dc.title | Computing the Newton polygon of the implicit equation | |
| dc.type | text |