{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T11:44:26Z","timestamp":1762775066421,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","funder":[{"name":"National Key R&D Program of China","award":["2020YFA0712300"],"award-info":[{"award-number":["2020YFA0712300"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171469 and 12201210"],"award-info":[{"award-number":["12171469 and 12201210"]}],"id":[{"id":"10.13039\/501100001809","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.3747554","type":"proceedings-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T10:51:17Z","timestamp":1762771877000},"page":"123-131","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Completing Parametric Unimodular Rows to Unimodular Matrices"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-2677-2465","authenticated-orcid":false,"given":"Ligeng","family":"Fan","sequence":"first","affiliation":[{"name":"State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China and School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5844-1277","authenticated-orcid":false,"given":"Dingkang","family":"Wang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China and School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7833-3727","authenticated-orcid":false,"given":"Fanghui","family":"Xiao","sequence":"additional","affiliation":[{"name":"MOE-LCSM, School of Mathematics and Statistics, Hunan Normal University, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5484-7552","authenticated-orcid":false,"given":"Xiaopeng","family":"Zheng","sequence":"additional","affiliation":[{"name":"College of Mathematics and Computer Science, Shantou University, Shantou, China"}]}],"member":"320","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3208976.3209014"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0913-3"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/11615798_3"},{"key":"e_1_3_3_1_5_2","volume-title":"Symbolic and numerical computation for artificial intelligence","author":"Donald Bruce\u00a0R","year":"1992","unstructured":"Bruce\u00a0R Donald, Deepak Kapur, and Joseph\u00a0L Mundy. 1992. Symbolic and numerical computation for artificial intelligence. Academic Press Harcourt Jovanovich."},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1515\/9783110909746.23"},{"key":"e_1_3_3_1_7_2","unstructured":"Ruyong Feng and Ziming Li. 2016. Computational Algebraic Geometry. Lecture notes. Accessed: http:\/\/www.mmrc.iss.ac.cn\/\u00a0ryfeng\/papers\/Notes.pdf."},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"crossref","unstructured":"Michael Kalkbrener. 1997. On the stability of Gr\u00f6bner bases under specializations. Journal of Symbolic Computation 24 1 (1997) 51\u201358.","DOI":"10.1006\/jsco.1997.0113"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3208976.3208980"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"crossref","unstructured":"Deepak Kapur Dong Lu Michael Monagan Yao Sun and Dingkang Wang. 2021. Algorithms for computing greatest common divisors of parametric multivariate polynomials. Journal of Symbolic Computation 102 (2021) 3\u201320.","DOI":"10.1016\/j.jsc.2019.10.006"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1837934.1837946"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"crossref","unstructured":"Deepak Kapur Yao Sun and Dingkang Wang. 2013. An efficient algorithm for computing a comprehensive Gr\u00f6bner system of a parametric polynomial system. Journal of Symbolic Computation 49 (2013) 27\u201344.","DOI":"10.1016\/j.jsc.2011.12.015"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"crossref","unstructured":"Taro Kawazoe and Masayuki Noro. 2011. Algorithms for computing a primary ideal decomposition without producing intermediate redundant components. Journal of Symbolic Computation 46 10 (2011) 1158\u20131172.","DOI":"10.1016\/j.jsc.2011.06.001"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-34575-6"},{"key":"e_1_3_3_1_15_2","volume-title":"Algebra","author":"Lang Serge","year":"2012","unstructured":"Serge Lang. 2012. Algebra. Vol.\u00a0211. Springer Science & Business Media."},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"crossref","unstructured":"Alessandro Logar and Bernd Sturmfels. 1992. Algorithms for the Quillen-Suslin theorem. Journal of Algebra 145 1 (1992) 231\u2013239.","DOI":"10.1016\/0021-8693(92)90189-S"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"crossref","unstructured":"Antonio Montes. 2002. A new algorithm for discussing Gr\u00f6bner bases with parameters. Journal of Symbolic Computation 33 2 (2002) 183\u2013208.","DOI":"10.1006\/jsco.2001.0504"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77356-6_8"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/1277548.1277589"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"crossref","unstructured":"Daniel Quillen. 1976. Projective modules over polynomial rings. Inventiones mathematicae 36 1 (1976) 167\u2013171.","DOI":"10.1007\/BF01390008"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"crossref","unstructured":"Moshe Roitman. 1975. On Serre\u2019s problem on projective modules. Proc. Amer. Math. Soc. 50 1 (1975) 45\u201352.","DOI":"10.2307\/2040511"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"crossref","unstructured":"Jean-Pierre Serre. 1955. Faisceaux alg\u00e9briques coh\u00e9rents. Annals of Mathematics (1955) 197\u2013278.","DOI":"10.2307\/1969915"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"crossref","unstructured":"Takeshi Shimoyama and Kazuhiro Yokoyama. 1996. Localization and primary decomposition of polynomial ideals. Journal of Symbolic Computation 22 3 (1996) 247\u2013277.","DOI":"10.1006\/jsco.1996.0052"},{"key":"e_1_3_3_1_24_2","first-page":"1160","volume-title":"Soviet mathematics-Doklady","author":"Suslin Andrei","year":"1976","unstructured":"Andrei Suslin. 1976. Projective modules over polynomial rings are free. In Soviet mathematics-Doklady , Vol.\u00a017. 1160\u20131165."},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/1145768.1145821"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3373207.3404019"},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"crossref","unstructured":"Volker Weispfenning. 1992. Comprehensive gr\u00f6bner bases. Journal of symbolic computation 14 1 (1992) 1\u201329.","DOI":"10.1016\/0747-7171(92)90023-W"},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"crossref","unstructured":"Ihsen Yengui. 2015. Constructive commutative algebra. Lecture Notes in Mathematics 2138 (2015).","DOI":"10.1007\/978-3-319-19494-3"},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"crossref","unstructured":"D Youla and P Pickel. 1984. The Quillen-Suslin theorem and the structure of n-dimensional elementary polynomial matrices. IEEE transactions on circuits and systems 31 6 (1984) 513\u2013518.","DOI":"10.1109\/TCS.1984.1085545"}],"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.3747554","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T11:39:46Z","timestamp":1762774786000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3747199.3747554"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,28]]},"references-count":28,"alternative-id":["10.1145\/3747199.3747554","10.1145\/3747199"],"URL":"https:\/\/doi.org\/10.1145\/3747199.3747554","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"}}]}}