Polymake and Lattice Polytopes
Michael Joswig, Benjamin M\"uller, Andreas Paffenholz
TL;DR
This paper discusses a new implementation of a lattice polytope subclass in the polymake software, enhancing its capabilities for geometric combinatorics through recent core updates.
Contribution
It introduces a novel lattice polytope subclass in polymake, leveraging recent core modifications to improve geometric combinatorics computations.
Findings
Enhanced polymake features for lattice polytopes
Successful integration of new subclass in polymake
Improved computational capabilities for convex polytopes
Abstract
The polymake software system deals with convex polytopes and related objects from geometric combinatorics. This note reports on a new implementation of a subclass for lattice polytopes. The features displayed are enabled by recent changes to the polymake core, which will be discussed briefly.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.