Abstract
The software Normaliz implements algorithms for rational cones and affine monoids. In this note we present recent developments. They include the support for (unbounded) polyhedra and semi-open cones. Furthermore, we report on improved algorithms and parallelization, which allow us to compute significantly larger examples.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bruns, W., Gubeladze, J.: Polytopes, rings and K-theory. Springer (2009)
Bruns, W., Ichim, B., Römer, T., Söger, C.: Normaliz. Algorithms for rational cones and affine monoids, http://www.math.uos.de/normaliz
Bruns, W., Ichim, B., Söger, C.: The power of pyramid decomposition in normaliz, preprint, arXiv:1206.1916
Bruns, W., Söger, C.: The computation of generalized Ehrhart series in Normaliz. J. Symb. Comput. (to appear), Preprint, arXiv:1211.5178
Köppe, M., Verdoolaege, S.: Computing parametric rational generating functions with a primal Barvinok algorithm. Electr. J. Comb. 15, R16, 1–19 (2008)
Ohsugi, H.: Normality of cut polytopes of graphs is a minor closed property. Discrete Math. 310, 1160–1166 (2010)
Söger, C.: Parallel Algorithms for Rational Cones and Affine Monoids. Dissertation thesis (2014), urn:nbn:de:gbv:700-2014042212422
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bruns, W., Söger, C. (2014). Recent Developments in Normaliz. In: Hong, H., Yap, C. (eds) Mathematical Software – ICMS 2014. ICMS 2014. Lecture Notes in Computer Science, vol 8592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44199-2_99
Download citation
DOI: https://doi.org/10.1007/978-3-662-44199-2_99
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44198-5
Online ISBN: 978-3-662-44199-2
eBook Packages: Computer ScienceComputer Science (R0)