{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T04:23:49Z","timestamp":1773980629041,"version":"3.50.1"},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012282","name":"Beijing Innovation Center for Future Chip","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012282","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Beijing Natural Science Foundation","doi-asserted-by":"publisher","award":["1262015"],"award-info":[{"award-number":["1262015"]}],"id":[{"id":"10.13039\/501100004826","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":[[2026,9]]},"DOI":"10.1016\/j.jsc.2026.102553","type":"journal-article","created":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T17:09:21Z","timestamp":1768324161000},"page":"102553","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Sum-and-quotient characteristic decomposition of polynomial ideals"],"prefix":"10.1016","volume":"136","author":[{"given":"Dongming","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-2834-3200","authenticated-orcid":false,"given":"Linpeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.jsc.2026.102553_br0010","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1006\/jsco.1999.0269","article-title":"On the theories of triangular sets","volume":"28","author":"Aubry","year":"1999","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2026.102553_br0020","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1006\/jsco.1999.0270","article-title":"Triangular sets for solving polynomial systems: a comparative implementation of four methods","volume":"28","author":"Aubry","year":"1999","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2026.102553_br0030","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.jco.2006.04.003","article-title":"A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set","volume":"22","author":"Bates","year":"2006","journal-title":"J. Complex."},{"key":"10.1016\/j.jsc.2026.102553_br0040","series-title":"Multidimensional Systems Theory and Applications","first-page":"89","article-title":"Gr\u00f6bner bases: an algorithmic method in polynomial ideal theory","author":"Buchberger","year":"1995"},{"key":"10.1016\/j.jsc.2026.102553_br0050","series-title":"Proceedings of the International Workshop on Computer Algebra in Scientific Computing 2007","first-page":"73","article-title":"Comprehensive triangular decomposition","author":"Chen","year":"2007"},{"key":"10.1016\/j.jsc.2026.102553_br0060","doi-asserted-by":"crossref","first-page":"1320","DOI":"10.1007\/s11424-014-2017-0","article-title":"Multiplicity-preserving triangular set decomposition of two polynomials","volume":"27","author":"Cheng","year":"2014","journal-title":"J. Syst. Sci. Complex."},{"key":"10.1016\/j.jsc.2026.102553_br0070","series-title":"Proceedings of the International Conference on Automated Deduction 1990","first-page":"207","article-title":"Ritt-Wu's decomposition algorithm and geometry theorem proving","author":"Chou","year":"1990"},{"key":"10.1016\/j.jsc.2026.102553_br0080","series-title":"Using Algebraic Geometry","author":"Cox","year":"2005"},{"key":"10.1016\/j.jsc.2026.102553_br0090","series-title":"Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra","author":"Cox","year":"2015"},{"key":"10.1016\/j.jsc.2026.102553_br0100","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.2026.102553_br0110","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.jsc.2020.06.012","article-title":"Computing strong regular characteristic pairs with Gr\u00f6bner bases","volume":"104","author":"Dong","year":"2021","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2026.102553_br0120","series-title":"Commutative Algebra: With a View Toward Algebraic Geometry","author":"Eisenbud","year":"1995"},{"key":"10.1016\/j.jsc.2026.102553_br0130","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\u00e9re","year":"1999","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/j.jsc.2026.102553_br0140","series-title":"Intersection Theory","author":"Fulton","year":"1984"},{"key":"10.1016\/j.jsc.2026.102553_br0150","series-title":"Proceedings of the International Symposium on Symbolic and Algebraic Computation 1992","first-page":"335","article-title":"Solving parametric algebraic systems","author":"Gao","year":"1992"},{"key":"10.1016\/j.jsc.2026.102553_br0160","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.2026.102553_br0170","series-title":"Algebraic Geometry","author":"Hartshorne","year":"1977"},{"key":"10.1016\/j.jsc.2026.102553_br0180","series-title":"Proceedings of the International Conference on Symbolic and Numerical Scientific Computation","first-page":"1","article-title":"Notes on triangular sets and triangulation-decomposition algorithms I: polynomial systems","author":"Hubert","year":"2003"},{"key":"10.1016\/j.jsc.2026.102553_br0190","series-title":"Three Contributions to Elimination Theory","author":"Kalkbrener","year":"1991"},{"key":"10.1016\/j.jsc.2026.102553_br0200","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.2026.102553_br0210","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.2026.102553_br0220","author":"Lazard"},{"key":"10.1016\/j.jsc.2026.102553_br0230","series-title":"Proceedings of the International Symposium on Symbolic and Algebraic Computation 2008","first-page":"207","article-title":"When does (T) equal sat(T)?","author":"Lemaire","year":"2008"},{"key":"10.1016\/j.jsc.2026.102553_br0240","first-page":"98","article-title":"A method to solve algebraic equations up to multiplicities via Ritt-Wu's characteristic sets","volume":"5","author":"Li","year":"2003","journal-title":"Acta Anal. Funct. Appl."},{"key":"10.1016\/j.jsc.2026.102553_br0250","first-page":"1491","article-title":"Zero decomposition with multiplicity of zero-dimensional polynomial systems","volume":"30","author":"Li","year":"2010","journal-title":"J. Syst. Sci. Math. Sci."},{"key":"10.1016\/j.jsc.2026.102553_br0260","series-title":"Proceedings of the International Workshop on Computer Algebra in Scientific Computing 2021","first-page":"232","article-title":"Towards extending Fulton's algorithm for computing intersection multiplicities beyond the bivariate case","author":"Moreno Maza","year":"2021"},{"key":"10.1016\/j.jsc.2026.102553_br0270","series-title":"Differential Algebra, vol. 33","author":"Ritt","year":"1950"},{"key":"10.1016\/j.jsc.2026.102553_br0280","series-title":"On the Minimal Number of Elements Generating an Algebraic Set","author":"\u015eahin","year":"2002"},{"key":"10.1016\/j.jsc.2026.102553_br0290","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/S0747-7171(03)00095-6","article-title":"Complexity results for triangular sets","volume":"36","author":"Schost","year":"2003","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2026.102553_br0300","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1006\/jsco.1996.0052","article-title":"Localization and primary decomposition of polynomial ideals","volume":"22","author":"Shimoyama","year":"1996","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2026.102553_br0310","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.2026.102553_br0320","series-title":"Elimination Methods","author":"Wang","year":"2001"},{"key":"10.1016\/j.jsc.2026.102553_br0330","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s11786-016-0279-8","article-title":"On the connection between Ritt characteristic sets and Buchberger\u2013Gr\u00f6bner bases","volume":"10","author":"Wang","year":"2016","journal-title":"Math. Comput. Sci."},{"key":"10.1016\/j.jsc.2026.102553_br0340","doi-asserted-by":"crossref","first-page":"1993","DOI":"10.1090\/mcom\/3504","article-title":"Decomposition of polynomial sets into characteristic pairs","volume":"89","author":"Wang","year":"2020","journal-title":"Math. Comput."},{"key":"10.1016\/j.jsc.2026.102553_br0350","series-title":"Proceedings of the International Symposium on Symbolic and Algebraic Computation 2024","first-page":"244","article-title":"Decomposition of polynomial ideals into triangular regular sequences","author":"Wang","year":"2024"},{"key":"10.1016\/j.jsc.2026.102553_br0360","article-title":"Simple characteristic decomposition of polynomial sets","author":"Wang","year":"2024","journal-title":"J. Syst. Sci. Complex."},{"key":"10.1016\/j.jsc.2026.102553_br0370","first-page":"1","article-title":"On zeros of algebraic equations\u2014an application of Ritt principle","volume":"31","author":"Wu","year":"1986","journal-title":"Chin. Sci. Bull."},{"key":"10.1016\/j.jsc.2026.102553_br0380","doi-asserted-by":"crossref","DOI":"10.1016\/j.jsc.2023.102273","article-title":"Squarefree normal representation of zeros of zero-dimensional polynomial systems","volume":"122","author":"Xu","year":"2024","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2026.102553_br0390","series-title":"Artificial Intelligence in Mathematics","first-page":"147","article-title":"Searching dependency between algebraic equations: an algorithm applied to automated reasoning","author":"Yang","year":"1994"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717126000015?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717126000015?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T03:16:19Z","timestamp":1773976579000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717126000015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":39,"alternative-id":["S0747717126000015"],"URL":"https:\/\/doi.org\/10.1016\/j.jsc.2026.102553","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Sum-and-quotient characteristic decomposition of polynomial ideals","name":"articletitle","label":"Article Title"},{"value":"Journal of Symbolic Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jsc.2026.102553","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102553"}}