{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T02:55:54Z","timestamp":1768964154934,"version":"3.49.0"},"reference-count":16,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2025,9]]},"abstract":"<jats:p>\n                    When solving systems of polynomial equations and inequalities, the task of computing their solutions with integer coordinates is a much harder problem than that of computing their real solutions or that of computing all their solutions. In fact, in the presence of non-linear constraints, this task may simply become an undecidable problem [12, 15]. However, studying the integer solutions of linear systems of equations and inequalities is of practical importance in various areas of scientific computing. Two such areas are\n                    <jats:italic toggle=\"yes\">combinatorial optimization<\/jats:italic>\n                    (in particular, integer linear programming) and\n                    <jats:italic toggle=\"yes\">compiler optimization<\/jats:italic>\n                    (in particular, the analysis, transformation, and scheduling of nested loops in computer programs), where a variety of algorithms solve questions related to the points with integer coordinates in a given polyhedron. Another area is at the crossroads of computer algebra and polyhedral geometry, with topics such as toric ideals and Hilbert bases, see [16], as well as the manipulation of Laurent series, see [1].\n                  <\/jats:p>","DOI":"10.1145\/3787957.3787958","type":"journal-article","created":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T14:56:52Z","timestamp":1768921012000},"page":"41-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Integer Hulls, Z-Polyhedra and Presburger Arithmetic in Action"],"prefix":"10.1145","volume":"59","author":[{"given":"Rui-Juan","family":"Jing","sequence":"first","affiliation":[{"name":"School of Mathematical Science, Jiangsu University, Zhenjiang, China"}]},{"given":"Yuzhuo","family":"Lei","sequence":"additional","affiliation":[{"name":"Ontario Research Center for Computer Algebra, University of Western Ontario, London, Ontario, Canada"}]},{"given":"Christopher F. S.","family":"Maligec","sequence":"additional","affiliation":[{"name":"Ontario Research Center for Computer Algebra, University of Western Ontario, London, Ontario, Canada"}]},{"given":"Marc Moreno","family":"Maza","sequence":"additional","affiliation":[{"name":"Ontario Research Center for Computer Algebra, University of Western Ontario, London, Ontario, Canada"}]},{"given":"Chirantan","family":"Mukherjee","sequence":"additional","affiliation":[{"name":"Ontario Research Center for Computer Algebra, University of Western Ontario, London, Ontario, Canada"}]}],"member":"320","published-online":{"date-parts":[[2026,1,20]]},"reference":[{"issue":"4","key":"e_1_2_1_1_1","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1016\/j.exmath.2013.01.004","article-title":"Formal Laurent series in several variables","volume":"31","author":"Aparicio Monforte A.","year":"2013","unstructured":"A. Aparicio Monforte and M. Kauers. Formal Laurent series in several variables. Expositiones Mathematicae, 31(4):350\u2013367, 2013.","journal-title":"Expositiones Mathematicae"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.19.4.769"},{"key":"e_1_2_1_3_1","first-page":"663","volume-title":"Annales scientifiques de l'\u00c9cole normale sup\u00e9rieure","author":"Brion M.","year":"1988","unstructured":"M. Brion. Points entiers dans les polyedres convexes. In Annales scientifiques de l'\u00c9cole normale sup\u00e9rieure, volume 21, pages 653\u2013663, 1988."},{"issue":"8","key":"e_1_2_1_4_1","first-page":"983","article-title":"Symbolic polynomial maximization over convex sets and its application to memory requirement estimation","volume":"17","author":"Clauss P.","year":"2009","unstructured":"P. Clauss, F. J. Fern\u00e1ndez, D. Garbervetsky, and S. Verdoolaege. Symbolic polynomial maximization over convex sets and its application to memory requirement estimation. IEEE Trans., 17(8):983\u2013996, 2009.","journal-title":"IEEE Trans."},{"key":"e_1_2_1_5_1","volume-title":"Sur un probl\u00e8me de g\u00e9om\u00e9trie diophantienne lin\u00e9aire. i. Journal f\u00fcr die reine und angewandte Mathematik, 226:1\u201329","author":"Ehrhart E.","year":"1967","unstructured":"E. Ehrhart. Sur un probl\u00e8me de g\u00e9om\u00e9trie diophantienne lin\u00e9aire. i. Journal f\u00fcr die reine und angewandte Mathematik, 226:1\u201329, 1967."},{"key":"e_1_2_1_6_1","series-title":"International Series of Numerical Mathematics","volume-title":"Polyn\u00f4mes arithm\u00e9tiques et m\u00e9thode des poly\u00e8dres en combinatoire","author":"Ehrhart E.","year":"1977","unstructured":"E. Ehrhart. Polyn\u00f4mes arithm\u00e9tiques et m\u00e9thode des poly\u00e8dres en combinatoire. International Series of Numerical Mathematics, Birkh\u00e4user Verlag, Basel, 35, 1977."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3242953.3242964"},{"key":"e_1_2_1_8_1","series-title":"LNCS","first-page":"160","volume-title":"CASC","author":"Jing R.","year":"2024","unstructured":"R. Jing, Y. Lei, C. F. S. Maligec, and M. Moreno Maza. Counting the integer points of parametric polytopes: A maple implementation. In CASC 2024, Proceedings, volume 14938 of LNCS, pages 140\u2013160. Springer, 2024."},{"key":"e_1_2_1_9_1","volume-title":"ISSAC 2025, Proceedings. ACM","author":"Jing R.","year":"2025","unstructured":"R. Jing, Y. Lei, C. F. S. Maligec, M. Moreno Maza, and C. Mukherjee. Quantifier elimination over the integers. In ISSAC 2025, Proceedings. ACM, 2025. To appear."},{"key":"e_1_2_1_10_1","series-title":"LNCS","first-page":"241","volume-title":"I: algorithm. In CASC","author":"Jing R.","year":"2017","unstructured":"R. Jing and M. Moreno Maza. Computing the integer points of a polyhedron, I: algorithm. In CASC 2017, Proceedings, volume 10490 of LNCS, pages 225\u2013241. Springer, 2017."},{"key":"e_1_2_1_11_1","series-title":"LNCS","first-page":"256","volume-title":"II: complexity estimates. In CASC","author":"Jing R.","year":"2017","unstructured":"R. Jing and M. Moreno Maza. Computing the integer points of a polyhedron, II: complexity estimates. In CASC 2017, Proceedings, volume 10490 of LNCS, pages 242\u2013256. Springer, 2017."},{"key":"e_1_2_1_12_1","first-page":"273","volume-title":"Enumerable sets are diophantine. Mathematical logic in the 20th century","author":"Matiyasevivc Y.","year":"2003","unstructured":"Y. Matiyasevivc. Enumerable sets are diophantine. Mathematical logic in the 20th century, pages 269\u2013273, 2003."},{"key":"e_1_2_1_13_1","first-page":"13","volume-title":"Proceedings Supercomputing","author":"Pugh W. W.","year":"1991","unstructured":"W. W. Pugh. The omega test: a fast and practical integer programming algorithm for dependence analysis. In Proceedings Supercomputing 1991, pages 4\u201313. ACM, 1991."},{"key":"e_1_2_1_14_1","first-page":"134","volume-title":"Proceedings of the ACM SIGPLAN","author":"Pugh W. W.","year":"1994","unstructured":"W. W. Pugh. Counting solutions to presburger formulas: How and why. In Proceedings of the ACM SIGPLAN 1994, pages 121\u2013134. ACM, 1994."},{"issue":"2","key":"e_1_2_1_15_1","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1090\/S0002-9939-1969-0244046-8","article-title":"Unsolvable diophantine problems","volume":"22","author":"Robinson J.","year":"1969","unstructured":"J. Robinson. Unsolvable diophantine problems. Proceedings of the AMS, 22(2):534\u2013538, 1969.","journal-title":"Proceedings of the AMS"},{"key":"e_1_2_1_16_1","first-page":"1634","volume-title":"Encyclopedia of Optimization","author":"Thomas R. R.","unstructured":"R. R. Thomas. Integer programming: Algebraic methods. In Encyclopedia of Optimization, Second Edition, pages 1624\u20131634. Springer, 2009."}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3787957.3787958","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T14:56:59Z","timestamp":1768921019000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3787957.3787958"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["10.1145\/3787957.3787958"],"URL":"https:\/\/doi.org\/10.1145\/3787957.3787958","relation":{},"ISSN":["1932-2232","1932-2240"],"issn-type":[{"value":"1932-2232","type":"print"},{"value":"1932-2240","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9]]},"assertion":[{"value":"2026-01-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}