Parallel Algorithms for Rational Cones and Affine Monoids

Please use this identifier to cite or link to this item:
Open Access logo originally created by the Public Library of Science (PLoS)
Title: Parallel Algorithms for Rational Cones and Affine Monoids
Other Titles: Parallele Algorithmen für rationale Kegel und affine Monoide
Authors: Söger, Christof
Thesis advisor: Prof. Dr. Winfried Bruns
Thesis referee: Prof. Dr. Michael Joswig
Abstract: This thesis presents parallel algorithms for rational cones and affine monoids which pursue two main computational goals: finding the Hilbert basis, a minimal generating system of the monoid of lattice points of a cone; and counting elements degree-wise in a generating function, the Hilbert series.
Subject Keywords: affine monoid; rational cone; normalization; convex geometry; Hilbert basis; Hilbert series
Issue Date: 22-Apr-2014
License name: Namensnennung 4.0 International
License url:
Type of publication: Dissertation oder Habilitation [doctoralThesis]
Appears in Collections:FB06 - E-Dissertationen

Files in This Item:
File Description SizeFormat 
thesis_soeger.pdfPräsentationsformat527,66 kBAdobe PDF

This item is licensed under a Creative Commons License Creative Commons