Computing the Newton polygon of the implicit equation

DOI10.1007/S11786-010-0046-1MaRDI QIDQ626973zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ioannis Z. Emiris, Christos Konaxis, Leonidas Palios

Publication date 19 February 2011

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0811.0103

zbMATH Keywords

Newton polygonimplicitizationmixed subdivisionCayley tricksparse (toric) resultant

Mathematics Subject Classification ID

Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Plane and space curves (14H50)

Abstract: 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.

Recommendations

• The Newton polygon of a rational plane curve
• On parametrized curves and Newton polygons
• Sparse implicitization via interpolation
• Parametrization of algebraic curves defined by sparse equations
• Implicitization of parametric curves and surfaces by using multidimensional Newton formulae

Cites work

• scientific article; zbMATH DE number 575960 (Why is no real title available?)
• scientific article; zbMATH DE number 671748 (Why is no real title available?)
• scientific article; zbMATH DE number 2079841 (Why is no real title available?)
• scientific article; zbMATH DE number 6154260 (Why is no real title available?)
• scientific article; zbMATH DE number 2223039 (Why is no real title available?)
• An output-sensitive algorithm for computing projections of resultant polytopes
• Approximate implicitization
• Computation of the degree of rational maps between curves
• Computing the Newton polygon of the implicit equation
• Elimination theory and Newton polytopes
• Enumerating regular mixed-cell configurations
• Improperly parametrized rational curves
• Newton polytopes of the classical resultant and discriminant
• On the Newton polytope of the resultant
• Rational parametrizations, intersection theory, and Newton polytopes
• The Newton polygon of a rational plane curve
• The Newton polytope of the implicit equation
• The moving line ideal basis of planar rational curves
• Tropical discriminants

Cited in

(11)

• Computing the Newton polygon of the implicit equation
• The Newton polygon of a rational plane curve
• Implicitization of curves and (hyper)surfaces using predicted support
• On parametrized curves and Newton polygons
• Projections of tropical varieties and their self-intersections
• Newton polytopes and witness sets
• Computer Algebra and Geometric Algebra with Applications
• Computing tropical resultants
• Sparse implicitization via interpolation
• Curve valuations and mixed volumes in the implicitization of rational varieties
• Computing the Newtonian graph

Describes a project that uses

Uses Software

• TrIm

This page was built for publication: Computing the Newton polygon of the implicit equation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626973)