{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:44:48Z","timestamp":1787319888431,"version":"build-2736575974"},"reference-count":25,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-0301129"],"award-info":[{"award-number":["DMS-0301129"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-0701308"],"award-info":[{"award-number":["DMS-0701308"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1002938"],"award-info":[{"award-number":["DMS-1002938"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and triangulations of simplotopes, including those with interior vertices. We establish that a minimal triangulation of a product of two simplices is given by a vertex triangulation, i.e., one without interior vertices. For products of more than two simplices, we produce bounds for products of segments and triangles. Aside from cubes, these are the first known lower bounds for triangulations of simplotopes with three or more factors, and our techniques suggest extensions to products of other kinds of simplices. We also construct a minimal triangulation of size 10 for the product of a triangle and a square using our lower bound.<\/jats:p>","DOI":"10.1137\/140972020","type":"journal-article","created":{"date-parts":[[2018,1,2]],"date-time":"2018-01-02T14:25:32Z","timestamp":1514903132000},"page":"1-28","source":"Crossref","is-referenced-by-count":2,"title":["A Lower Bound Technique for Triangulations of Simplotopes"],"prefix":"10.1137","volume":"32","author":[{"given":"Tyler","family":"Seacrest","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francis Edward","family":"Su","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,1,2]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2007.02.014"},{"key":"atypb2","doi-asserted-by":"crossref","unstructured":"K. Arroyo Ohori, H. Ledoux, and J. Stoter,\n                      Defining simple nD operations based on prismatic nD objects\n                      , ISPRS Ann. Photogramm. Remote Sens. Spatial Inf. Sci., IV-2\/W1 (2016), pp. 155-162,https:\/\/doi.org\/10.5194\/isprs-annals-IV-2-W1-155-2016,http:\/\/www.isprs-ann-photogramm-remote-sens-spatial-inf-sci.net\/IV-2-W1\/155\/2016\/.","DOI":"10.5194\/isprs-annals-IV-2-W1-155-2016"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009384"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-004-1128-0"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2014.10.009"},{"key":"atypb6","unstructured":"C. E. S. Cortes,\n                      Concerning Triangulations of Products of Simplices\n                      , Ph.D. thesis, Universita\u0308t Leipzig, Leipzig, 2014."},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(82)90185-6"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2009.03.010"},{"key":"atypb9","doi-asserted-by":"crossref","unstructured":"J. A. De Loera, J. Rambau, and F. Santos,\n                      Triangulations: Structures for Algorithms and Applications\n                      , Algorithms Comput. Math. 25, Springer-Verlag, Berlin, 2010,https:\/\/doi.org\/10.1007\/978-3-642-12971-1.","DOI":"10.1007\/978-3-642-12971-1"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1287\/moor.11.1.169"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574690"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(95)00075-8"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-003-2845-5"},{"key":"atypb14","first-page":"330","author":"Rambau J.","year":"2002","journal-title":"Singapore"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(82)90190-X"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-00-00330-1"},{"key":"atypb17","unstructured":"T. Seacrest,\n                      Sage Math Cloud: Simplotope triangulation code\n                      ,https:\/\/cloud.sagemath.com\/projects\/4dd9c3c7-9a3b-4e4c-9989-1f44bdc7d6ca\/files\/Seg-Tri-Lower-Bounds.sagews."},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1006\/eujc.1999.0327"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.2307\/2315353"},{"key":"atypb20","unstructured":"B. Sturmfels,\n                      Gro\u0308bner Bases and Convex Polytopes\n                      , Univ. Lect. Ser. 8, American Mathematical Society, Providence, RI, 1996."},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.2307\/2589747"},{"key":"atypb22","doi-asserted-by":"crossref","unstructured":"F. Takeuchi and H. Imai,\n                      Enumerating triangulations for products of two simplices and for arbitrary configurations of points\n                      , in Computing and Combinatorics. COCOON 1997, Lecture Notes in Comput. Sci. 1276, T. Jiang and D. T. Lee, eds., Springer, Berlin, Heidelberg, 1997,https:\/\/doi.org\/10.1007\/BFb0045114.","DOI":"10.1007\/BFb0045114"},{"key":"atypb23","doi-asserted-by":"crossref","unstructured":"M. J. Todd,\n                      The Computation of Fixed Points and Applications\n                      , Lect. Notes Econ. Math. Syst. 124, Springer-Verlag, Berlin, 1976.","DOI":"10.1007\/978-3-642-50327-6"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1287\/moor.7.1.1"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012993258501"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/140972020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:53:33Z","timestamp":1787316813000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/140972020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/140972020"],"URL":"https:\/\/doi.org\/10.1137\/140972020","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}