Papers › A genetic algorithm to search the space of Ehrhart h^*-vectors
A genetic algorithm to search the space of Ehrhart h^*-vectors
Gabriele Balletti
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We describe a genetic algorithm to find candidates for h^*-vectors satisfying given properties in the space of integers vectors of finite length. We use an implementation of such algorithm to find a 52-dimensional lattice polytope having a non-unimodal h^*-vector which is the Cartesian product of two lattice polytopes having unimodal h^*-vectors. This counterexample answers negatively to a question by Ferroni and Higashitani.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections