The integer point transform as a complete invariant
Sinai Robins

TL;DR
This paper demonstrates that the integer point transform uniquely determines a rational polytope or integer cone with a single algebraic evaluation, establishing it as a complete invariant and linking it to Fourier transforms.
Contribution
It proves that evaluating the integer point transform at one algebraic point suffices to uniquely identify rational polytopes and cones, a significant advancement in geometric invariants.
Findings
Integer point transform is a complete invariant for rational polytopes and cones.
A single algebraic evaluation of the transform determines the polytope or cone.
Finite evaluations of the transform can also uniquely identify the polytope.
Abstract
The integer point transform is an important invariant of a rational polytope , and here we show that it is a complete invariant. We prove that it is only necessary to evaluate at one algebraic point in order to uniquely determine , by employing the Lindemann-Weierstrass theorem. Similarly, we prove that it is only necessary to evaluate the Fourier transform of a rational polytope at a single algebraic point, in order to uniquely determine . We prove that identical uniqueness results also hold for integer cones. In addition, by relating the integer point transform to finite Fourier transforms, we show that a finite number of \emph{integer point evaluations} of suffice in order to uniquely determine . We also give an equivalent condition for central symmetry of…
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.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · Polynomial and algebraic computation · Computational Geometry and Mesh Generation
