{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T11:40:52Z","timestamp":1762774852455,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,28]]},"DOI":"10.1145\/3747199.3747563","type":"proceedings-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T10:51:17Z","timestamp":1762771877000},"page":"206-214","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving bihomogeneous polynomial systems with a zero-dimensional projection"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9341-287X","authenticated-orcid":false,"given":"Mat\u00edas","family":"Bender","sequence":"first","affiliation":[{"name":"Inria & CMAP, CNRS, Ecole Polytechnique, Pallasieu, France"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-6528-7027","authenticated-orcid":false,"given":"Laurent","family":"Bus\u00e9","sequence":"additional","affiliation":[{"name":"Universit\u00e9 C\u00f4te d'Azur, Inria, Sophia Antipolis, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3477-8876","authenticated-orcid":false,"given":"Carles","family":"Checa","sequence":"additional","affiliation":[{"name":"University of Copenhagen, Copenhagen, Denmark"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5015-3988","authenticated-orcid":false,"given":"Elias","family":"Tsigaridas","sequence":"additional","affiliation":[{"name":"IMJ-PRG, Inria Paris & IMJ-PRG, Sorbonne Universit\u00e9, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"crossref","unstructured":"John Abbott Anna\u00a0Maria Bigatti Elisa Palezzato and Lorenzo Robbiano. 2020. Computing and using minimal polynomials. Journal of Symbolic Computation 100 (2020) 137\u2013163. Symbolic Computation and Satisfiability Checking.","DOI":"10.1016\/j.jsc.2019.07.022"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"crossref","unstructured":"Annetta Aramova Kristina Crona and Emanuela De\u00a0Negri. 2000. Bigeneric initial ideals diagonal subalgebras and bigraded Hilbert functions. Journal of Pure and Applied Algebra 150 3 (2000) 215\u2013235.","DOI":"10.1016\/S0022-4049(99)00100-0"},{"key":"e_1_3_3_1_4_2","volume-title":"Introduction to Commutative Algebra","author":"Atiyah M.\u00a0F.","year":"1969","unstructured":"M.\u00a0F. Atiyah and J.\u00a0G. MacDonald. 1969. Introduction to Commutative Algebra. Addison-Wesley, Reading, Massachusetts."},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"crossref","unstructured":"Magali Bardet Jean-Charles Faug\u00e8re and Bruno Salvy. 2015. On the complexity of the F5 Gr\u00f6bner basis algorithm. Journal of Symbolic Computation 70 (2015) 49\u201370.","DOI":"10.1016\/j.jsc.2014.09.025"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","unstructured":"David Bayer and Michael Stillman. 1987. A criterion for detecting m-regularity. Inventiones Mathematicae 87 1 (Feb. 1987) 1\u201311. 10.1007\/BF01389151","DOI":"10.1007\/BF01389151"},{"key":"e_1_3_3_1_7_2","unstructured":"Mat\u00edas Bender Laurent Bus\u00e9 Carles Checa and Elias Tsigaridas. 2024. Bigraded Castelnuovo-Mumford regularity and Gr\u00f6bner bases. arxiv:https:\/\/arXiv.org\/abs\/2407.13536\u00a0[math.AC] https:\/\/arxiv.org\/abs\/2407.13536"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","unstructured":"Matias\u00a0R. Bender Jean-Charles Faug\u00e8re and Elias Tsigaridas. 2018. Towards Mixed Gr\u00f6bner Basis Algorithms: the Multihomogeneous and Sparse Case. ISSAC - 43rd Intern. Symp. on Symbolic & Algebraic Computation (2018). 10.1145\/3208976.3209018","DOI":"10.1145\/3208976.3209018"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","unstructured":"Mat\u00edas\u00a0R. Bender and Simon Telen. 2022. Toric eigenvalue methods for solving sparse polynomial systems. Math. Comp. 91 (2022) 2397\u20132429. 10.1090\/mcom\/3744 arXiv:https:\/\/arXiv.org\/abs\/2006.10654","DOI":"10.1090\/mcom\/3744"},{"key":"e_1_3_3_1_10_2","unstructured":"Mat\u00edas\u00a0R. Bender and Simon Telen. 2022. Yet another eigenvalue algorithm for solving polynomial systems. arxiv:https:\/\/arXiv.org\/abs\/2105.08472\u00a0[math.NA] https:\/\/arxiv.org\/abs\/2105.08472"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","unstructured":"Cristina Bertone Francesca Cioffi Paolo Lella and Margherita Roggero. 2013. Upgraded methods for the effective computation of marked schemes on a strongly stable ideal. J. Symbolic Comput. 50 (2013) 263\u2013290. 10.1016\/j.jsc.2012.07.006","DOI":"10.1016\/j.jsc.2012.07.006"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/1576702.1576716"},{"key":"e_1_3_3_1_13_2","unstructured":"Juliette Bruce Lauren\u00a0Cranton Heller and Mahrud Sayrafi. 2021. Characterizing Multigraded Regularity on Products of Projective Spaces. https:\/\/arxiv.org\/abs\/2110.10705"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608681"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"crossref","unstructured":"Laurent Bus\u00e9. 2014. Implicit matrix representations of rational B\u00e9zier curves and surfaces. Computer-Aided Design 46 (2014) 14\u201324.","DOI":"10.1016\/j.cad.2013.08.014"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-24151-2"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","unstructured":"Laurent Bus\u00e9 Marc Chardin and Navid Nemati. 2022. Multigraded Sylvester forms duality and elimination matrices. Journal of Algebra 609 (2022) 514\u2013546. 10.1016\/j.jalgebra.2022.06.022","DOI":"10.1016\/j.jalgebra.2022.06.022"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","unstructured":"Michela Ceria Samuel Lundqvist and Teo Mora. 2022. Degr\u00f6bnerization: a political manifesto. Applicable Algebra in Engineering Communication and Computing 33 (11 2022) 1\u201349. 10.1007\/s00200-022-00586-z","DOI":"10.1007\/s00200-022-00586-z"},{"key":"e_1_3_3_1_19_2","volume-title":"MEGA\u20192013 (Special Issue)","author":"Ceria Michela","year":"2013","unstructured":"Michela Ceria, Teo Mora, and Margherita Roggero. 2013. Term-ordering free involutive bases. In MEGA\u20192013 (Special Issue). Frankfurt am Main, Germany. https:\/\/hal.science\/hal-01022881"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1201\/9781420050912.ch1"},{"key":"e_1_3_3_1_21_2","unstructured":"Marc Chardin and Rafael Holanda. 2022. Multigraded Tor and local cohomology. arxiv:https:\/\/arXiv.org\/abs\/2211.14357\u00a0[math.AC] https:\/\/arxiv.org\/abs\/2211.14357"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","unstructured":"Francesca Cioffi and Margherita Roggero. 2011. Flat families by strongly stable ideals and a generalization of Gr\u00f6bner bases. Journal of Symbolic Computation 46 9 (2011) 1070\u20131084. 10.1016\/j.jsc.2011.05.009","DOI":"10.1016\/j.jsc.2011.05.009"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/b138611"},{"key":"e_1_3_3_1_24_2","unstructured":"Alexander Demin Fabrice Rouillier and Joao Ruiz. 2024. Reading Rational Univariate Representations on lexicographic Groebner bases. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2402.07141 (2024)."},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5350-1"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"publisher","unstructured":"David Eisenbud Freddy Bonnin Cl\u00e9ment Caubel and H Maugendre. 2002. The Geometry of Syzygies - A second course in Commutative Algebra and Algebraic Geometry. (01 2002). 10.1007\/b137572","DOI":"10.1007\/b137572"},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"publisher","unstructured":"David Eisenbud Craig Huneke and Wolmer Vasconcelos. 1992. Direct methods for primary decomposition. Inventiones Mathematicae 110 (12 1992) 207\u2013235. 10.1007\/BF01231331","DOI":"10.1007\/BF01231331"},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"crossref","unstructured":"Jean-Charles Faug\u00e8re and Chenqi Mou. 2017. Sparse FGLM algorithms. Journal of Symbolic Computation 80 (2017) 538\u2013569.","DOI":"10.1016\/j.jsc.2016.07.025"},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"publisher","unstructured":"Jean-Charles Faug\u00e8re Mohab Safey El Din and Pierre-Jean Spaenlehauer. 2011. Gr\u00f6bner bases of bihomogeneous ideals generated by polynomials of bidegree (1 1): Algorithms and complexity. Journal of Symbolic Computation 46 4 (2011) 406\u2013437. 10.1016\/j.jsc.2010.10.014","DOI":"10.1016\/j.jsc.2010.10.014"},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"publisher","unstructured":"Jean-Charles Faug\u00e8re Patrizia Gianni Daniel Lazard and Teo Mora. 1993. Efficient Computation of Zero-dimensional Gr\u00f6bner Bases by Change of Ordering. Journal of Symbolic Computation 16 4 (1993) 329\u2013344. 10.1006\/jsco.1993.1051","DOI":"10.1006\/jsco.1993.1051"},{"key":"e_1_3_3_1_31_2","doi-asserted-by":"crossref","unstructured":"Patrizia Gianni Barry Trager and Gail Zacharias. 1988. Gr\u00f6bner bases and primary decomposition of polynomial ideals. Journal of Symbolic Computation 6 2-3 (1988) 149\u2013167.","DOI":"10.1016\/S0747-7171(88)80040-3"},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"publisher","unstructured":"Isabel Herrero Gabriela Jeronimo and Juan Sabia. 2013. Elimination for Generic Sparse Polynomial Systems. Discrete and Computational Geometry 51 (03 2013). 10.1007\/s00454-014-9571-z","DOI":"10.1007\/s00454-014-9571-z"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"crossref","unstructured":"J.\u00a0van\u00a0der Hoeven and G. Lecerf. 2021. On the complexity exponent of polynomial system solving. Foundations of Comp. Math. 21 (2021) 1\u201357.","DOI":"10.1007\/s10208-020-09453-0"},{"key":"e_1_3_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3452143.3465533"},{"key":"e_1_3_3_1_35_2","doi-asserted-by":"publisher","unstructured":"Huy\u00a0T\u00e0i H\u00e0 and Adam Van Tuyl. 2004. The regularity of points in multi-projective spaces. Journal of Pure and Applied Algebra 187 1 (2004) 153\u2013167. 10.1016\/j.jpaa.2003.07.006","DOI":"10.1016\/j.jpaa.2003.07.006"},{"key":"e_1_3_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/087"},{"key":"e_1_3_3_1_37_2","doi-asserted-by":"publisher","unstructured":"Teresa Krick and Alessandro Logar. 1991. An Algorithm for the Computation of the Radical of an Ideal in the Ring of Polynomials. Lecture Notes in Comput. Sci. 539 195\u2013205. 10.1007\/3-540-54522-0108","DOI":"10.1007\/3-540-54522-0108"},{"key":"e_1_3_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.5555\/646657.700393"},{"key":"e_1_3_3_1_39_2","doi-asserted-by":"publisher","unstructured":"Daniel Lazard and Fabrice Rouillier. 2007. Solving parametric polynomial systems. Journal of Symbolic Computation 42 6 (2007) 636\u2013667. 10.1016\/j.jsc.2007.01.007","DOI":"10.1016\/j.jsc.2007.01.007"},{"key":"e_1_3_3_1_40_2","doi-asserted-by":"crossref","unstructured":"Diane Maclagan and Gregory\u00a0G. Smith. 2004. Multigraded Castelnuovo-Mumford regularity. Journal f\u00fcr die reine und angewandte Mathematik 2004 571 (2004) 179\u2013212. https:\/\/doi.org\/doi:10.1515\/crll.2004.040","DOI":"10.1515\/crll.2004.040"},{"key":"e_1_3_3_1_41_2","doi-asserted-by":"publisher","unstructured":"Maria Marinari Teo Mora and H.\u00a0Micheal Moeller. 1996. Gr\u00f6bner Duality and Multiplicities in Polynomial System Solving. International Symposium on Symbolic and Computation - ISSAC Proceedings (06 1996). 10.1145\/220346.220368","DOI":"10.1145\/220346.220368"},{"key":"e_1_3_3_1_42_2","doi-asserted-by":"publisher","unstructured":"Bernard Mourrain Simon Telen and Marc Van Barel. 2021. Truncated normal forms for solving polynomial systems: Generalized and efficient algorithms. Journal of Symbolic Computation 102 (2021) 63\u201385. 10.1016\/j.jsc.2019.10.009","DOI":"10.1016\/j.jsc.2019.10.009"},{"key":"e_1_3_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/2442829.2442868"},{"key":"e_1_3_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511565892"},{"key":"e_1_3_3_1_45_2","unstructured":"The Stacks Project Authors. 2018. Stacks Project. https:\/\/stacks.math.columbia.edu."},{"key":"e_1_3_3_1_46_2","doi-asserted-by":"publisher","unstructured":"Christof Vermeersch and Bart De\u00a0Moor. 2022. Two Complementary Block Macaulay Matrix Algorithms to Solve Multiparameter Eigenvalue Problems. Linear Algebra Appl. 654 (09 2022). 10.1016\/j.laa.2022.08.014","DOI":"10.1016\/j.laa.2022.08.014"},{"key":"e_1_3_3_1_47_2","doi-asserted-by":"publisher","unstructured":"Christof Vermeersch and Bart De\u00a0Moor. 2022. Two Double Recursive Block Macaulay Matrix Algorithms to Solve Multiparameter Eigenvalue Problems. IEEE Control Systems Letters 7 (01 2022) 1\u20131. 10.1109\/LCSYS.2022.3182632","DOI":"10.1109\/LCSYS.2022.3182632"}],"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.3747563","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T11:39:09Z","timestamp":1762774749000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3747199.3747563"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,28]]},"references-count":46,"alternative-id":["10.1145\/3747199.3747563","10.1145\/3747199"],"URL":"https:\/\/doi.org\/10.1145\/3747199.3747563","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"}}]}}