The power of pyramid decomposition in Normaliz
From MaRDI portal
Publication:898277
DOI10.1016/j.jsc.2015.09.003zbMath1332.68298arXiv1206.1916OpenAlexW1931520163MaRDI QIDQ898277
Winfried Bruns, Christof Söger, Bogdan Ichim
Publication date: 8 December 2015
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.1916
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) Social choice (91B14)
Related Items
Polytope volume by descent in the face lattice and applications in social choice, Antichain Simplices, Polyhedral omega: a new algorithm for solving linear Diophantine systems, Algebraic Polytopes in Normaliz, \texttt{mplrs}: a scalable parallel vertex/facet enumeration code, Numerical semigroups, polyhedra, and posets I: the group cone, Characterizing affine \(\mathcal{C}\)-semigroups, Algorithmic Aspects of Units in Group Rings, Normaliz 2013–2016, Computing convex hulls and counting integer points with \texttt{polymake}, On the score sheets of a round-robin football tournament, Machine learning post-Minkowskian integrals, New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem, Numerical semigroups, polyhedra, and posets. III: Minimal presentations and face dimension, Polytope volume in Normaliz, pySecDec: a toolbox for the numerical evaluation of multi-scale integrals, An effective solution to convex 1-body \(N\)-representability, The computation of factorization invariants for affine semigroups, The computation of generalized Ehrhart series in normaliz, The Status of the Zassenhaus Conjecture for Small Groups, HeLP: a GAP package for torsion units in integral group rings, On lattice-free orbit polytopes, Computations of volumes and Ehrhart series in four candidates elections, The Subdivision of Large Simplicial Cones in Normaliz, How to compute the Stanley depth of a module, 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, On the prime graph question for almost simple groups with an alternating socle
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Implicitization of curves and (hyper)surfaces using predicted support
- The computation of generalized Ehrhart series in normaliz
- The Hilbert basis method for \(D\)-flat directions and the superpotential
- Total dual integrality and integer polyhedra
- Normaliz: Algorithms for affine monoids and rational cones
- A polynomial oracle-time algorithm for convex integer minimization
- Non-standard approaches to integer programming
- Triangulations. Structures for algorithms and applications
- Computing parametric rational generating functions with a primal Barvinok algorithm
- Convex integer maximization via Graver bases
- Linear Diophantine equations and local cohomology
- Polynômes arithmétiques et méthode des polyedres en combinatoire
- Combinatorics and commutative algebra.
- Commutative algebra of statistical ranking
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems
- Exploiting polyhedral symmetries in social choice
- Moduli of McKay quiver representations. II: Gröbner basis techniques
- Cyclotomic polytopes and growth series of cyclotomic lattices
- Small Chvátal rank
- Polymake and Lattice Polytopes
- Computing the Continuous Discretely
- Polytopes, Rings, and K-Theory
- A counterexample to an integer analogue of Carathéodory's theorem
- Challenging Computations of Hilbert Bases of Cones Associated with Algebraic Statistics
- Integer Polynomial Optimization in Fixed Dimension
