Counting the integer points of parametric polytopes: a Maple implementation
From MaRDI portal
Publication:6660327
DOI10.1007/978-3-031-69070-9_9MaRDI QIDQ6660327
Rui-Juan Jing, Marc Moreno Maza, Yuzhuo Lei, Christopher F. S. Maligec
Publication date: 10 January 2025
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formal Laurent series in several variables
- The unreasonable ubiquitousness of quasi-polynomials
- Counting integer points in parametric polytopes using Barvinok's rational functions
- Formulas of Brion, Lawrence, and Varchenko on rational generating functions for cones.
- Computing the integer points of a polyhedron. I: Algorithm
- Recent advances on determining the number of real roots of parametric polynomials
- Reverse search for enumeration
- On solving parametric polynomial systems
- On parametric linear system solving
- Maximal periods of (Ehrhart) quasi-polynomials
- Solving parametric polynomial systems
- Effective lattice point counting in rational convex polytopes
- Points entiers dans les polyèdres convexes
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Lifting techniques for triangular decompositions
- Convexity recognition of the union of polyhedra
- An invitation to formal power series
This page was built for publication: Counting the integer points of parametric polytopes: a Maple implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660327)
