{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T11:40:50Z","timestamp":1762774850919,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["101040794"],"award-info":[{"award-number":["101040794"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-22-CE48-0008, ANR-22-CE48-0016"],"award-info":[{"award-number":["ANR-22-CE48-0008, ANR-22-CE48-0016"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,28]]},"DOI":"10.1145\/3747199.3747564","type":"proceedings-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T10:51:17Z","timestamp":1762771877000},"page":"215-223","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Computation of Newton Polytopes of Eliminants"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-9869-7122","authenticated-orcid":false,"given":"Rafael","family":"Mohr","sequence":"first","affiliation":[{"name":"\u00cele-de-France, MATHEXP, Inria Saclay, Palaiseau, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1503-1312","authenticated-orcid":false,"given":"Yulia","family":"Mukhina","sequence":"additional","affiliation":[{"name":"LIX, CNRS, \u00c9cole Polytechnique, Institute Polytechnique de Paris, Palaiseau, France"}]}],"member":"320","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","unstructured":"John Abbott Anna\u00a0Maria Bigatti and Lorenzo Robbiano. 2017. Implicitization of Hypersurfaces. Journal of Symbolic Computation 81 (July 2017) 20\u201340. 10.1016\/j.jsc.2016.11.002","DOI":"10.1016\/j.jsc.2016.11.002"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","unstructured":"Benjamin Assarf Ewgenij Gawrilow Katrin Herr Michael Joswig Benjamin Lorenz Andreas Paffenholz and Thomas Rehn. 2017. Computing Convex Hulls and Counting Integer Points with Polymake. Mathematical Programming Computation 9 1 (March 2017) 1\u201338. 10.1007\/s12532-016-0104-z","DOI":"10.1007\/s12532-016-0104-z"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","unstructured":"D.\u00a0N. Bernshtein. 1975. The Number of Roots of a System of Equations. Functional Analysis and Its Applications 9 3 (July 1975) 183\u2013185. 10.1007\/BF01075595","DOI":"10.1007\/BF01075595"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"crossref","unstructured":"Jeff Bezanson Alan Edelman Stefan Karpinski and Viral\u00a0B Shah. 2017. Julia: A Fresh Approach to Numerical Computing. SIAM review 59 1 (2017) 65\u201398.","DOI":"10.1137\/141000671"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","unstructured":"Louis\u00a0J. Billera and Bernd Sturmfels. 1992. Fiber Polytopes. Annals of Mathematics 135 3 (1992) 527\u2013549. 10.2307\/2946575 jstor:2946575","DOI":"10.2307\/2946575"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","unstructured":"G\u00f6ran Bj\u00f6rck and Ralf Fr\u00f6berg. 1991. A faster way to count the solutions of inhomogeneous systems of algebraic equations with applications to cyclic n-roots. Journal of Symbolic Computation 12 3 (1991) 329\u2013336. 10.1016\/S0747-7171(08)80153-8","DOI":"10.1016\/S0747-7171(08)80153-8"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","unstructured":"W. Boege R. Gebauer and H. Kredel. 1986. Some examples for solving systems of algebraic equations by calculating groebner bases. Journal of Symbolic Computation 2 1 (1986) 83\u201398. 10.1016\/S0747-7171(86)80014-1","DOI":"10.1016\/S0747-7171(86)80014-1"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","unstructured":"Laurent Bus\u00e9 and Marc Chardin. 2005. Implicitizing Rational Hypersurfaces Using Approximation Complexes. Journal of Symbolic Computation 40 4 (Oct. 2005) 1150\u20131168. 10.1016\/j.jsc.2004.04.005","DOI":"10.1016\/j.jsc.2004.04.005"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","unstructured":"Tianran Chen. 2019. Unmixing the Mixed Volume Computation. 10.48550\/arXiv.1703.01684 arxiv:https:\/\/arXiv.org\/abs\/1703.01684\u00a0[math]","DOI":"10.48550\/arXiv.1703.01684"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/b138611"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16721-3"},{"key":"e_1_3_3_2_13_2","volume-title":"Toric varieties","author":"Cox David\u00a0A","year":"2024","unstructured":"David\u00a0A Cox, John\u00a0B Little, and Henry\u00a0K Schenck. 2024. Toric varieties. Vol.\u00a0124. American Mathematical Society."},{"key":"e_1_3_3_2_14_2","series-title":"Algorithms and Computation in Mathematics","volume-title":"The Computer Algebra System OSCAR: Algorithms and Examples (1 ed.)","author":"Decker Wolfram","year":"2024","unstructured":"Wolfram Decker, Christian Eder, Claus Fieker, Max Horn, and Michael Joswig (Eds.). 2024. The Computer Algebra System OSCAR: Algorithms and Examples (1 ed.). Algorithms and Computation in Mathematics, Vol.\u00a032. Springer."},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","unstructured":"Martin Dyer Peter Gritzmann and Alexander Hufnagel. 1998. On The Complexity of Computing Mixed Volumes. SIAM J. Comput. 27 2 (Jan. 1998) 356\u2013400. 10.1137\/S0097539794278384","DOI":"10.1137\/S0097539794278384"},{"key":"e_1_3_3_2_16_2","volume-title":"MEGA","author":"Emiris I.Z.","year":"2007","unstructured":"I.Z. Emiris, C. Konaxis, and L. Palios. 2007. Computing the Newton Polytope of Specialized Resultants. In MEGA. Strobl, Austria."},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/2331684.2331705"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","unstructured":"Ioannis\u00a0Z. Emiris Tatjana Kalinka Christos Konaxis and Thang Luu\u00a0Ba. 2013. Sparse Implicitization by Interpolation: Characterizing Non-Exactness and an Application to Computing Discriminants. Computer-Aided Design 45 2 (Feb. 2013) 252\u2013261. 10.1016\/j.cad.2012.10.008","DOI":"10.1016\/j.cad.2012.10.008"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","unstructured":"Ioannis\u00a0Z. Emiris Christos Konaxis and Leonidas Palios. 2010. Computing the Newton Polygon of the Implicit Equation. Mathematics in Computer Science 4 1 (Nov. 2010) 25\u201344. 10.1007\/s11786-010-0046-1","DOI":"10.1007\/s11786-010-0046-1"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/067\/11"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","unstructured":"A. Esterov and A. Khovanskii. 2008. Elimination Theory and Newton Polytopes. Functional Analysis and Other Mathematics 2 1 (Dec. 2008) 45\u201371. 10.1007\/s11853-008-0015-2","DOI":"10.1007\/s11853-008-0015-2"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"crossref","unstructured":"Tangan Gao and T.\u00a0Y. Li. 2000. Mixed Volume Computation Via Linear Programming. Taiwanese Journal of Mathematics 4 4 (2000) 599\u2013619. jstor:43833227","DOI":"10.11650\/twjm\/1500407294"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4771-1"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0019-9"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","unstructured":"Jonathan\u00a0D. Hauenstein and Frank Sottile. 2014. Newton Polytopes and Witness Sets. Mathematics in Computer Science 8 2 (June 2014) 235\u2013251. 10.1007\/s11786-014-0189-6","DOI":"10.1007\/s11786-014-0189-6"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","unstructured":"Birkett Huber J\u00f6rg Rambau and Francisco Santos. 2000. The Cayley Trick Lifting Subdivisions and the Bohne-Dress Theorem on Zonotopal Tilings. Journal of the European Mathematical Society 2 2 (June 2000) 179\u2013198. 10.1007\/s100970050003","DOI":"10.1007\/s100970050003"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"publisher","unstructured":"Birkett Huber and Bernd Sturmfels. 1995. A Polyhedral Method for Solving Sparse Polynomial Systems. Math. Comp. 64 212 (1995) 1541\u20131555. 10.2307\/2153370 jstor:2153370","DOI":"10.2307\/2153370"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/1183222524"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"publisher","unstructured":"Anders\u00a0Nedergaard Jensen. 2016. Tropical Homotopy Continuation. 10.48550\/arXiv.1601.02818 arxiv:https:\/\/arXiv.org\/abs\/1601.02818\u00a0[math]","DOI":"10.48550\/arXiv.1601.02818"},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"publisher","unstructured":"A.\u00a0G. Khovanskii. 1995. Sums of Finite Sets Orbits of Commutative Semigroups and Hilbert Functions. Functional Analysis and Its Applications 29 2 (April 1995) 102\u2013112. 10.1007\/BF01080008","DOI":"10.1007\/BF01080008"},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"publisher","unstructured":"A.\u00a0G. Kouchnirenko. 1976. Poly\u00e8dres de Newton et nombres de Milnor. Inventiones mathematicae 32 1 (Feb. 1976) 1\u201331. 10.1007\/BF01389769","DOI":"10.1007\/BF01389769"},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/161"},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"publisher","unstructured":"Gregorio Malajovich. 2017. Computing Mixed Volume and All Mixed Cells in Quermassintegral Time. Foundations of Computational Mathematics 17 5 (Oct. 2017) 1293\u20131334. 10.1007\/s10208-016-9320-1","DOI":"10.1007\/s10208-016-9320-1"},{"key":"e_1_3_3_2_34_2","doi-asserted-by":"publisher","unstructured":"Peter McMullen. 2004. Mixed Fibre Polytopes. Discrete & Computational Geometry 32 4 (Nov. 2004) 521\u2013532. 10.1007\/s00454-004-1136-0","DOI":"10.1007\/s00454-004-1136-0"},{"key":"e_1_3_3_2_35_2","doi-asserted-by":"publisher","unstructured":"Tomohiko Mizutani Akiko Takeda and Masakazu Kojima. 2007. Dynamic Enumeration of All Mixed Cells. Discrete & Computational Geometry 37 3 (March 2007) 351\u2013367. 10.1007\/s00454-006-1300-9","DOI":"10.1007\/s00454-006-1300-9"},{"key":"e_1_3_3_2_36_2","doi-asserted-by":"publisher","unstructured":"Yulia Mukhina and Gleb Pogudin. 2025. Projecting Dynamical Systems via a Support Bound. 10.48550\/arXiv.2501.13680 arxiv:https:\/\/arXiv.org\/abs\/2501.13680\u00a0[cs]","DOI":"10.48550\/arXiv.2501.13680"},{"key":"e_1_3_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-62127-7_17"},{"key":"e_1_3_3_2_38_2","doi-asserted-by":"publisher","unstructured":"Bernd Sturmfels and Jenia Tevelev. 2007. Elimination Theory for Tropical Varieties. 10.48550\/arXiv.0704.3471 arxiv:https:\/\/arXiv.org\/abs\/0704.3471\u00a0[math]","DOI":"10.48550\/arXiv.0704.3471"},{"key":"e_1_3_3_2_39_2","doi-asserted-by":"publisher","unstructured":"Bernd Sturmfels Jenia Tevelev and Josephine Yu. 2007. The Newton Polytope of the Implicit Equation. Moscow Mathematical Journal 7 2 (2007) 327\u2013346. 10.17323\/1609-4514-2007-7-2-327-346","DOI":"10.17323\/1609-4514-2007-7-2-327-346"},{"key":"e_1_3_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-78133-47"},{"key":"e_1_3_3_2_41_2","doi-asserted-by":"publisher","unstructured":"Robert\u00a0A. Van\u00a0Gorder. 2013. Triple Mode Alignment In A Canonical Model Of The Blue-Sky Catastrophe. Nonlinear Dynamics 73 1-2 (July 2013). 10.1007\/s11071-013-0794-y","DOI":"10.1007\/s11071-013-0794-y"},{"key":"e_1_3_3_2_42_2","doi-asserted-by":"publisher","unstructured":"N.\u00a0M. VanMeter P. Lougovski D.\u00a0B. Uskov K. Kieling J. Eisert and Jonathan\u00a0P. Dowling. 2007. General linear-optical quantum state generation scheme: Applications to maximally path-entangled states. Phys. Rev. A 76 (Dec 2007) 063808. Issue 6. 10.1103\/PhysRevA.76.063808","DOI":"10.1103\/PhysRevA.76.063808"},{"key":"e_1_3_3_2_43_2","doi-asserted-by":"publisher","unstructured":"J. Verschelde K. Gatermann and R. Cools. 1996. Mixed-Volume Computation by Dynamic Lifting Applied to Polynomial System Solving. Discrete & Computational Geometry 16 1 (Jan. 1996) 69\u2013112. 10.1007\/BF02711134","DOI":"10.1007\/BF02711134"},{"key":"e_1_3_3_2_44_2","doi-asserted-by":"crossref","unstructured":"Peter\u00a0J. Wangersky. 1978. Lotka-Volterra Population Models. Annual Review of Ecology and Systematics 9 (1978) 189\u2013218. jstor:2096748","DOI":"10.1146\/annurev.es.09.110178.001201"},{"key":"e_1_3_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8431-1"}],"event":{"name":"ISSAC '25: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Guanajuato Mexico","acronym":"ISSAC '25"},"container-title":["Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3747199.3747564","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T11:39:05Z","timestamp":1762774745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3747199.3747564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,28]]},"references-count":44,"alternative-id":["10.1145\/3747199.3747564","10.1145\/3747199"],"URL":"https:\/\/doi.org\/10.1145\/3747199.3747564","relation":{},"subject":[],"published":{"date-parts":[[2025,7,28]]},"assertion":[{"value":"2025-11-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}