{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T02:41:46Z","timestamp":1762310506449,"version":"build-2065373602"},"reference-count":55,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"publisher","award":["TRR 195"],"award-info":[{"award-number":["TRR 195"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1016\/j.jsc.2025.102455","type":"journal-article","created":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T11:21:43Z","timestamp":1745925703000},"page":"102455","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A syzygial method for equidimensional decomposition"],"prefix":"10.1016","volume":"131","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-9869-7122","authenticated-orcid":false,"given":"Rafael","family":"Mohr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.jsc.2025.102455_br0010","unstructured":"Asadi, M., Brandt, A., Chen, C., Covanov, S., Kazemi, M., Mansouri, F., Mohajerani, D., Moir, R.H.C., Moreno Maza, M., Talaashrafi, D., Wang, L., Xie, N., Xie, Y., 2021. Basic Polynomial Algebra Subprograms (BPAS) (version 1.791)."},{"key":"10.1016\/j.jsc.2025.102455_br0020","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.jsc.2014.09.025","article-title":"On the complexity of the F5 Gr\u00f6bner basis algorithm","volume":"70","author":"Bardet","year":"2015","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2025.102455_br0030","article-title":"Gr\u00f6bner Bases","volume":"vol. 141","author":"Becker","year":"1993"},{"key":"10.1016\/j.jsc.2025.102455_br0040","series-title":"ISSAC'21","article-title":"Msolve: a library for solving polynomial systems","author":"Berthomieu","year":"2021"},{"author":"Berthomieu","key":"10.1016\/j.jsc.2025.102455_br0050"},{"key":"10.1016\/j.jsc.2025.102455_br0060","first-page":"30","article-title":"3264 conics in a second","volume":"67","author":"Breiding","year":"2020","journal-title":"Not. Am. Math. Soc."},{"year":"1965","series-title":"Ein Algorithmus Zum Auffinden Der Basiselemente Des Restklassenringes Nach Einem Nulldimensionalen Polynomideal","author":"Buchberger","key":"10.1016\/j.jsc.2025.102455_br0070"},{"key":"10.1016\/j.jsc.2025.102455_br0080","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.jsc.2005.09.007","article-title":"Bruno Buchberger's PhD thesis 1965: an algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal","volume":"41","author":"Buchberger","year":"2006","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2025.102455_br0090","series-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","first-page":"39","article-title":"Yet another ideal decomposition algorithm","author":"Caboara","year":"1997"},{"key":"10.1016\/j.jsc.2025.102455_br0100","doi-asserted-by":"crossref","DOI":"10.1142\/S021812741350154X","article-title":"An application of regular chain theory to the study of limit cycles","volume":"23","author":"Chen","year":"2013","journal-title":"Int. J. Bifurc. Chaos"},{"key":"10.1016\/j.jsc.2025.102455_br0110","series-title":"International Conference on Computational Science","first-page":"268","article-title":"Efficient computations of irredundant triangular decompositions with the regularchains library","author":"Chen","year":"2007"},{"key":"10.1016\/j.jsc.2025.102455_br0120","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/j.jsc.2011.12.023","article-title":"Algorithms for computing triangular decomposition of polynomial systems","volume":"47","author":"Chen","year":"2012","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2025.102455_br0130","series-title":"10th International Conference on Automated Deduction","first-page":"207","article-title":"Ritt-Wu's decomposition algorithm and geometry theorem proving","author":"Chou","year":"1990"},{"key":"10.1016\/j.jsc.2025.102455_br0140","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-16721-3","article-title":"Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra","author":"Cox","year":"2015"},{"volume":"vol. 32","year":"2024","series-title":"The Computer Algebra System OSCAR: Algorithms and Examples","key":"10.1016\/j.jsc.2025.102455_br0150"},{"key":"10.1016\/j.jsc.2025.102455_br0160","series-title":"Algorithmic Algebra and Number Theory","first-page":"187","article-title":"Primary decomposition: algorithms and comparisons","author":"Decker","year":"1999"},{"key":"10.1016\/j.jsc.2025.102455_br0170","series-title":"Research Contributions from the European Conference on Computer Algebra-Volume 2","first-page":"289","article-title":"About a new method for computing in algebraic number fields","author":"Della Dora","year":"1985"},{"author":"Draisma","key":"10.1016\/j.jsc.2025.102455_br0180"},{"key":"10.1016\/j.jsc.2025.102455_br0190","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1016\/j.jsc.2016.07.031","article-title":"A survey on signature-based algorithms for computing Gr\u00f6bner bases","volume":"80","author":"Eder","year":"2017","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2025.102455_br0200","series-title":"Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation","first-page":"260","article-title":"A direttissimo algorithm for equidimensional decomposition","author":"Eder","year":"2023"},{"key":"10.1016\/j.jsc.2025.102455_br0210","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jsc.2023.02.001","article-title":"A signature-based algorithm for computing the nondegenerate locus of a polynomial system","volume":"119","author":"Eder","year":"2023","journal-title":"J. Symb. Comput."},{"year":"1995","series-title":"Commutative Algebra: With a View Toward Algebraic Geometry","author":"Eisenbud","key":"10.1016\/j.jsc.2025.102455_br0220"},{"key":"10.1016\/j.jsc.2025.102455_br0230","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01231331","article-title":"Direct methods for primary decomposition","volume":"110","author":"Eisenbud","year":"1992","journal-title":"Invent. Math."},{"key":"10.1016\/j.jsc.2025.102455_br0240","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","article-title":"A new efficient algorithm for computing Gr\u00f6bner bases (F4)","volume":"139","author":"Faug\u00e8re","year":"1999","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/j.jsc.2025.102455_br0250","series-title":"Effective Methods in Algebraic Geometry","first-page":"119","article-title":"Efficient algorithms and bounds for Wu-Ritt characteristic sets","author":"Gallo","year":"1991"},{"key":"10.1016\/j.jsc.2025.102455_br0260","series-title":"Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation","first-page":"13","article-title":"A new incremental algorithm for computing Gr\u00f6bner bases","author":"Gao","year":"2010"},{"key":"10.1016\/j.jsc.2025.102455_br0270","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1007\/s11263-021-01567-4","article-title":"Singularity analysis for the perspective-four and five-line problems","volume":"130","author":"Garc\u00eda Font\u00e1n","year":"2022","journal-title":"Int. J. Comput. Vis."},{"key":"10.1016\/j.jsc.2025.102455_br0280","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0747-7171(88)80040-3","article-title":"Gr\u00f6bner bases and primary decomposition of polynomial ideals","volume":"6","author":"Gianni","year":"1988","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2025.102455_br0290","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1006\/jcom.2000.0571","article-title":"A Gr\u00f6bner free alternative for polynomial system solving","volume":"17","author":"Giusti","year":"2001","journal-title":"J. Complex."},{"key":"10.1016\/j.jsc.2025.102455_br0300","series-title":"Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation","first-page":"189","article-title":"Dimension-dependent upper bounds for Gr\u00f6bner bases","author":"Hashemi","year":"2017"},{"author":"Helmer","key":"10.1016\/j.jsc.2025.102455_br0310"},{"key":"10.1016\/j.jsc.2025.102455_br0320","series-title":"Symbolic and Numerical Scientific Computation","first-page":"1","article-title":"Notes on triangular sets and triangulation-decomposition algorithms I","author":"Hubert","year":"2003"},{"key":"10.1016\/j.jsc.2025.102455_br0330","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0022-4049(01)00083-4","article-title":"Effective equidimensional decomposition of affine varieties","volume":"169","author":"Jeronimo","year":"2002","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/j.jsc.2025.102455_br0340","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1006\/jsco.1993.1011","article-title":"A generalized Euclidean algorithm for computing triangular representations of algebraic varieties","volume":"15","author":"Kalkbrener","year":"1993","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2025.102455_br0350","series-title":"Computer Algebra","first-page":"146","article-title":"Gr\u00f6bner bases, Gaussian elimination and resolution of systems of algebraic equations","author":"Lazard","year":"1983"},{"key":"10.1016\/j.jsc.2025.102455_br0360","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0166-218X(91)90113-B","article-title":"A new method for solving algebraic systems of positive dimension","volume":"33","author":"Lazard","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.jsc.2025.102455_br0370","series-title":"ISSAC'00","first-page":"209","article-title":"Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions","author":"Lecerf","year":"2000"},{"key":"10.1016\/j.jsc.2025.102455_br0380","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/S0885-064X(03)00031-1","article-title":"Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers","volume":"19","author":"Lecerf","year":"2003","journal-title":"J. Complex."},{"key":"10.1016\/j.jsc.2025.102455_br0390","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/1113439.1113456","article-title":"The RegularChains library in MAPLE","volume":"39","author":"Lemaire","year":"2005","journal-title":"ACM SIGSAM Bull."},{"key":"10.1016\/j.jsc.2025.102455_br0400","unstructured":"Lu, Y., Jingzhong, Z., 1994. Searching dependency between algebraic equations: an algorithm applied to automated reasoning."},{"key":"10.1016\/j.jsc.2025.102455_br0410","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139171762","article-title":"Commutative Ring Theory","author":"Matsumura","year":"1987"},{"key":"10.1016\/j.jsc.2025.102455_br0420","series-title":"Computer Mathematics","first-page":"263","article-title":"Regular decompositions","author":"Moroz","year":"2008"},{"key":"10.1016\/j.jsc.2025.102455_br0430","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1007\/s11263-020-01420-0","article-title":"Complete singularity analysis for the perspective-four-point problem","volume":"129","author":"Pascual-Escudero","year":"2021","journal-title":"Int. J. Comput. Vis."},{"author":"Pr\u00e9bet","key":"10.1016\/j.jsc.2025.102455_br0440"},{"key":"10.1016\/j.jsc.2025.102455_br0450","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1007\/BF01782361","article-title":"Zum Hilbertschen Nullstellensatz","volume":"102","author":"Rabinowitsch","year":"1930","journal-title":"Math. Ann."},{"year":"1950","series-title":"Differential Algebra","author":"Ritt","key":"10.1016\/j.jsc.2025.102455_br0460"},{"key":"10.1016\/j.jsc.2025.102455_br0470","first-page":"417","article-title":"Properness defects of projections and computation of at LeastOne point in each connected component of a real algebraic set","volume":"32","author":"Safey El Din","year":"2004","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.jsc.2025.102455_br0480","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s00200-002-0109-x","article-title":"Computing parametric geometric resolutions","volume":"13","author":"Schost","year":"2003","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"author":"Sun","key":"10.1016\/j.jsc.2025.102455_br0490"},{"key":"10.1016\/j.jsc.2025.102455_br0500","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0021-8693(67)90086-5","article-title":"Ideals generated by R-sequences","volume":"6","author":"Vasconcelos","year":"1967","journal-title":"J. Algebra"},{"key":"10.1016\/j.jsc.2025.102455_br0510","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1006\/jsco.1993.1035","article-title":"An elimination method for polynomial systems","volume":"16","author":"Wang","year":"1993","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2025.102455_br0520","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-7091-6202-6","article-title":"Elimination Methods","author":"Wang","year":"2001"},{"key":"10.1016\/j.jsc.2025.102455_br0530","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11704-007-0001-8","article-title":"Mathematics mechanization and applications after thirty years","volume":"1","author":"Wu","year":"2007","journal-title":"Front. Comput. Sci. China"},{"key":"10.1016\/j.jsc.2025.102455_br0540","first-page":"221","article-title":"Basic principles of mechanical theorem proving in elementary geometries","volume":"2","author":"Wu","year":"1986"},{"key":"10.1016\/j.jsc.2025.102455_br0550","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02713938","article-title":"A complete algorithm for automated discovering of a class of inequality-type theorems","volume":"44","author":"Yang","year":"2001","journal-title":"Sci. China, Ser. F, Inf. Sci."}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717125000379?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717125000379?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T02:37:42Z","timestamp":1762310262000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717125000379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":55,"alternative-id":["S0747717125000379"],"URL":"https:\/\/doi.org\/10.1016\/j.jsc.2025.102455","relation":{},"ISSN":["0747-7171"],"issn-type":[{"type":"print","value":"0747-7171"}],"subject":[],"published":{"date-parts":[[2025,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A syzygial method for equidimensional decomposition","name":"articletitle","label":"Article Title"},{"value":"Journal of Symbolic Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jsc.2025.102455","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102455"}}