The Cayley trick and triangulations of products of simplices
Francisco Santos

TL;DR
This paper uses the Cayley Trick to analyze triangulations of products of simplices, revealing their growth rates, connections to lozenge tilings, and the connectedness of their flip graph, with exact counts for small cases.
Contribution
It establishes growth rates of triangulations, relates them to lozenge tilings for l=2, and proves the connectivity of the triangulation flip graph, with explicit enumeration for small cases.
Findings
Number of regular triangulations grows as k^{Theta(k)}.
Number of non-regular triangulations grows as 2^{Omega(k^2)}.
The set of all triangulations is connected under bistellar flips.
Abstract
We use the Cayley Trick to study polyhedral subdivisions of the product of two simplices. For arbitrary (fixed) , we show that the numbers of regular and non-regular triangulations of grow, respectively, as and . For the special case of , we relate triangulations to certain class of lozenge tilings. This allows us to compute the exact number of triangulations up to , show that the number grows as where and prove that the set of all triangulations is connected under geometric bistellar flips. The latter has as a corollary that the toric Hilbert scheme of the determinantal ideal of minors of a matrix is connected, for every . We include ``Cayley Trick pictures'' of all the triangulations of and $\Delta^2\times…
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
Topicsgraph theory and CDMA systems · Advanced Topics in Algebra · Mathematics and Applications
