Back to search

National and Kapodistrian University of Athens

Αλγεβρικοί αλγόριθμοι για την επίλυση πολυωνυμικών συστημάτων και εφαρμογές

Abstract

dc:description

The main object of study in this dissertation is the sparse resultant. Resultants are defined in the sparse (or toric) context in order to exploit the structure of the polynomials as expressed by their Newton polytopes. We consider sparse elimination theory in order to describe the Newton polytope of the sparse resultant of a given overconstrained algebraic system, by enumerating equivalence classes of mixed subdivisions. In particular, we consider specializations of this resultant to a polynomial in a constant number of variables, typically up to 3. We sketch an algorithm that avoids computing the entire secondary polytope; our goal is that it examines only the silhouette of this polytope with respect to an orthogonal projection. Moreover, since determinantal formulae are not always possible, the most efficient general method for computing resultants is by rational formulae. We propose a single lifting function which yields a simple method for computing Macaulay-type formulae of sparse resultants, in the case of generalized unmixed systems, where all Newton polytopes are scaled copies of each other. As another application of sparse elimination, we consider rationally parameterized plane curves and determine the vertex representation of the implicit equation's Newton polygon.

Degree

thesis:*
Grantor dc:publisher
National and Kapodistrian University of Athens
Year dc:date
2010

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Konaxis, Christos
  • Κοναξής, Χρήστος

Subjects

dc:subject × 18

Rights

Language dc:language
gre

Identifiers

dc:identifier.*
Identifier
10.12681/eadd/23738

Chain of custody

source
Harvested from
Greek National Archive of PhD Theses
Base URL
phdtheses.ekt.gr/eadd_oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Konaxis, Christos; Κοναξής, Χρήστος. Αλγεβρικοί αλγόριθμοι για την επίλυση πολυωνυμικών συστημάτων και εφαρμογές. National and Kapodistrian University of Athens, 2010. http://hdl.handle.net/10442/hedi/23738