The power of pyramid decomposition in Normaliz
From MaRDI portal
Publication:898277
DOI10.1016/J.JSC.2015.09.003zbMATH Open1332.68298arXiv1206.1916OpenAlexW1931520163MaRDI QIDQ898277FDOQ898277
Authors: Winfried Bruns, Bogdan Ichim, Christof Söger 
Publication date: 8 December 2015
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Abstract: We describe the use of pyramid decomposition in Normaliz, a software tool for the computation of Hilbert bases and enumerative data of rational cones and affine monoids. Pyramid decomposition in connection with efficient parallelization and streamlined evaluation of simplicial cones has enabled Normaliz to process triangulations of size that arise in the computation of Hilbert series related to combinatorial voting theory.
Full work available at URL: https://arxiv.org/abs/1206.1916
Recommendations
Social choice (91B14) Symbolic computation and algebraic computation (68W30) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40)
Cites Work
- Polymake and Lattice Polytopes
- Title not available (Why is that?)
- Computing the Continuous Discretely
- Polytopes, Rings, and K-Theory
- Normaliz: Algorithms for affine monoids and rational cones
- Triangulations. Structures for algorithms and applications
- Combinatorics and commutative algebra.
- Title not available (Why is that?)
- Toric varieties
- Title not available (Why is that?)
- A polynomial oracle-time algorithm for convex integer minimization
- Linear Diophantine equations and local cohomology
- Title not available (Why is that?)
- Implicitization of curves and (hyper)surfaces using predicted support
- Integer Polynomial Optimization in Fixed Dimension
- Polynômes arithmétiques et méthode des polyedres en combinatoire
- A counterexample to an integer analogue of Carathéodory's theorem
- Moduli of McKay quiver representations. II: Gröbner basis techniques
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems
- Challenging computations of Hilbert bases of cones associated with algebraic statistics
- Cyclotomic polytopes and growth series of cyclotomic lattices
- Commutative algebra of statistical ranking
- Computing parametric rational generating functions with a primal Barvinok algorithm
- Exploiting polyhedral symmetries in social choice
- The computation of generalized Ehrhart series in normaliz
- The Hilbert basis method for \(D\)-flat directions and the superpotential
- Convex integer maximization via Graver bases
- Non-standard approaches to integer programming
- Total dual integrality and integer polyhedra
- Small Chvátal rank
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (31)
- Polytope volume by descent in the face lattice and applications in social choice
- Computations of volumes and Ehrhart series in four candidates elections
- Polytope volume in Normaliz
- Algorithmic aspects of units in group rings
- pySecDec: a toolbox for the numerical evaluation of multi-scale integrals
- Algorithm: Pyramid decomposition for cones (Normaliz)
- The subdivision of large simplicial cones in Normaliz
- On lattice-free orbit polytopes
- Facets of random symmetric edge polytopes, degree sequences, and clustering
- How to compute the Stanley depth of a module
- On the score sheets of a round-robin football tournament
- Computing convex hulls and counting integer points with \texttt{polymake}
- Algebraic polytopes in Normaliz
- Characterizing affine \(\mathcal{C}\)-semigroups
- Introduction to Normaliz 2.5
- An effective solution to convex 1-body \(N\)-representability
- Numerical semigroups, polyhedra, and posets. III: Minimal presentations and face dimension
- The computation of generalized Ehrhart series in normaliz
- The status of the Zassenhaus conjecture for small groups
- Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations
- From examples to methods: Two cases from the study of units in integral group rings
- Numerical semigroups, polyhedra, and posets. I: The group cone
- Polyhedral omega: a new algorithm for solving linear Diophantine systems
- The computation of factorization invariants for affine semigroups
- On the prime graph question for almost simple groups with an alternating socle
- Antichain Simplices
- Machine learning post-Minkowskian integrals
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
- HeLP: a GAP package for torsion units in integral group rings
- New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem
- Normaliz 2013--2016
Uses Software
This page was built for publication: The power of pyramid decomposition in Normaliz
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898277)
