{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T03:55:09Z","timestamp":1776138909735,"version":"3.50.1"},"reference-count":45,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T00:00:00Z","timestamp":1774828800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.jsc.2026.102581","type":"journal-article","created":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T15:56:25Z","timestamp":1774972585000},"page":"102581","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Modular algorithms for computing Gr\u00f6bner bases in free algebras"],"prefix":"10.1016","volume":"137","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3025-0604","authenticated-orcid":false,"given":"Clemens","family":"Hofstadler","sequence":"first","affiliation":[]},{"given":"Viktor","family":"Levandovskyy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jsc.2026.102581_br0010","series-title":"An Introduction to Gr\u00f6bner Bases","author":"Adams","year":"1994"},{"issue":"4","key":"10.1016\/j.jsc.2026.102581_br0020","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0747-7171(02)00140-2","article-title":"Modular algorithms for computing Gr\u00f6bner bases","volume":"35","author":"Arnold","year":"2003","journal-title":"J. Symb. Comput."},{"issue":"2","key":"10.1016\/j.jsc.2026.102581_br0030","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/0001-8708(78)90010-5","article-title":"The diamond lemma for ring theory","volume":"29","author":"Bergman","year":"1978","journal-title":"Adv. Math."},{"key":"10.1016\/j.jsc.2026.102581_br0040","series-title":"Proceedings of ISSAC 2021","first-page":"51","article-title":"msolve: a library for solving polynomial systems","author":"Berthomieu","year":"2021"},{"key":"10.1016\/j.jsc.2026.102581_br0050","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1090\/conm\/421\/08026","article-title":"Computation of two-sided syzygies over non-commutative rings","volume":"421","author":"Bluhm","year":"2007","journal-title":"Contemp. Math."},{"issue":"296","key":"10.1016\/j.jsc.2026.102581_br0060","doi-asserted-by":"crossref","first-page":"3013","DOI":"10.1090\/mcom\/2951","article-title":"The use of bad primes in rational reconstruction","volume":"84","author":"B\u00f6hm","year":"2015","journal-title":"Math. Comput."},{"key":"10.1016\/j.jsc.2026.102581_br0070","series-title":"Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal","author":"Buchberger","year":"1965"},{"key":"10.1016\/j.jsc.2026.102581_br0080","series-title":"Proceedings of ISSAC 2020","first-page":"83","article-title":"Compatible rewriting of noncommutative polynomials for proving operator identities","author":"Chenavier","year":"2020"},{"issue":"1","key":"10.1016\/j.jsc.2026.102581_br0090","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s11786-019-00412-9","article-title":"Modular techniques for noncommutative Gr\u00f6bner bases","volume":"14","author":"Decker","year":"2020","journal-title":"Math. Comput. Sci."},{"issue":"2","key":"10.1016\/j.jsc.2026.102581_br0100","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/1089330.1089336","article-title":"Some comments on the modular approach to Gr\u00f6bner-bases","volume":"17","author":"Ebert","year":"1983","journal-title":"SIGSAM Bull."},{"key":"10.1016\/j.jsc.2026.102581_br0110","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.2026.102581_br0120","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."},{"issue":"1\u20133","key":"10.1016\/j.jsc.2026.102581_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\u00e8re","year":"1999","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/j.jsc.2026.102581_br0140","series-title":"Proceedings of ISSAC 2002","first-page":"75","article-title":"A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5)","author":"Faug\u00e8re","year":"2002"},{"key":"10.1016\/j.jsc.2026.102581_br0150","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1090\/mcom\/2969","article-title":"A new framework for computing Gr\u00f6bner bases","volume":"85","author":"Gao","year":"2016","journal-title":"Math. Comput."},{"key":"10.1016\/j.jsc.2026.102581_br0160","series-title":"Proceedings of CASC 2025","first-page":"79","article-title":"f4ncgb: high performance Gr\u00f6bner basis computations in free algebras","author":"Heisinger","year":"2025"},{"issue":"3","key":"10.1016\/j.jsc.2026.102581_br0170","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/9.661584","article-title":"Computer simplification of formulas in linear systems theory","volume":"43","author":"Helton","year":"1998","journal-title":"IEEE Trans. Autom. Control"},{"key":"10.1016\/j.jsc.2026.102581_br0180","series-title":"Nonselfadjoint Operators and Related Topics","first-page":"325","article-title":"Rules for computer simplification of the formulas in operator model theory and linear systems","author":"Helton","year":"1994"},{"key":"10.1016\/j.jsc.2026.102581_br0190","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1006\/jabr.2001.8801","article-title":"One-sided noncommutative Gr\u00f6bner bases with applications to computing Green's relations","volume":"242","author":"Heyworth","year":"2001","journal-title":"J. Algebra"},{"key":"10.1016\/j.jsc.2026.102581_br0200","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","article-title":"Ordering by divisibility in abstract algebras","volume":"3","author":"Higman","year":"1952","journal-title":"Proc. Lond. Math. Soc."},{"key":"10.1016\/j.jsc.2026.102581_br0210","series-title":"Noncommutative Gr\u00f6bner bases and automated proofs of operator statements","author":"Hofstadler","year":"2023"},{"key":"10.1016\/j.jsc.2026.102581_br0220","doi-asserted-by":"crossref","DOI":"10.1016\/j.jpaa.2026.108221","article-title":"Universal truth of operator statements via ideal membership","volume":"230","author":"Hofstadler","year":"2026","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/j.jsc.2026.102581_br0230","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.jsc.2022.04.001","article-title":"Signature Gr\u00f6bner bases, bases of syzygies and cofactor reconstruction in the free algebra","volume":"113","author":"Hofstadler","year":"2022","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2026.102581_br0240","series-title":"Proceedings of ISSAC 2023","first-page":"298","article-title":"Signature Gr\u00f6bner bases in free algebras over rings","author":"Hofstadler","year":"2023"},{"key":"10.1016\/j.jsc.2026.102581_br0250","doi-asserted-by":"crossref","DOI":"10.1016\/j.jsc.2024.102325","article-title":"Short proofs of ideal membership","volume":"125","author":"Hofstadler","year":"2024","journal-title":"J. Symb. Comput."},{"issue":"6","key":"10.1016\/j.jsc.2026.102581_br0260","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1016\/j.jsc.2011.01.003","article-title":"Parallelization of modular algorithms","volume":"46","author":"Idrees","year":"2011","journal-title":"J. Symb. Comput."},{"issue":"1","key":"10.1016\/j.jsc.2026.102581_br0270","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0747-7171(08)80003-X","article-title":"Non-commutative Gr\u00f6bner bases in algebras of solvable type","volume":"9","author":"Kandri-Rody","year":"1990","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2026.102581_br0280","series-title":"Algorithms and Orders for Finding Noncommutative Gr\u00f6bner bases","author":"Keller","year":"1997"},{"key":"10.1016\/j.jsc.2026.102581_br0290","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.jsc.2014.01.006","article-title":"A non-commutative F5 algorithm with an application to the computation of Loewy layers","volume":"65","author":"King","year":"2014","journal-title":"J. Symb. Comput."},{"issue":"1","key":"10.1016\/j.jsc.2026.102581_br0300","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01937322","article-title":"Mapping integers and Hensel codes onto Farey fractions","volume":"23","author":"Kornerup","year":"1983","journal-title":"BIT Numer. Math."},{"issue":"10","key":"10.1016\/j.jsc.2026.102581_br0310","doi-asserted-by":"crossref","first-page":"1374","DOI":"10.1016\/j.jsc.2009.03.002","article-title":"Letterplace ideals and non-commutative Gr\u00f6bner bases","volume":"44","author":"La Scala","year":"2009","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2026.102581_br0320","doi-asserted-by":"crossref","DOI":"10.1016\/j.jsc.2023.102275","article-title":"Axioms for a theory of signature bases","volume":"123","author":"Lairez","year":"2024","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2026.102581_br0330","series-title":"Non\u2013commutative computer algebra for polynomial algebras: Gr\u00f6bner bases, applications and implementation","author":"Levandovskyy","year":"2005"},{"key":"10.1016\/j.jsc.2026.102581_br0340","series-title":"Proceedings of ISSAC 2022","first-page":"311","article-title":"Existence of quantum symmetries for graphs on up to seven vertices: a computer based approach","author":"Levandovskyy","year":"2022"},{"key":"10.1016\/j.jsc.2026.102581_br0360","series-title":"Proceedings of ISSAC 2004","first-page":"243","article-title":"Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction","author":"Monagan","year":"2004"},{"key":"10.1016\/j.jsc.2026.102581_br0370","series-title":"International Conference on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes","first-page":"353","article-title":"Gr\u00f6bner bases for non-commutative polynomial rings","author":"Mora","year":"1985"},{"key":"10.1016\/j.jsc.2026.102581_br0380","series-title":"Solving Polynomial Equation Systems IV: Volume 4, Buchberger Theory and Beyond","author":"Mora","year":"2016"},{"key":"10.1016\/j.jsc.2026.102581_br0390","doi-asserted-by":"crossref","DOI":"10.1016\/j.jpaa.2020.106564","article-title":"Formal proofs of operator identities by a single formal computation","volume":"225","author":"Raab","year":"2021","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/j.jsc.2026.102581_br0400","series-title":"International Conference on Intelligent Computer Mathematics","first-page":"222","article-title":"Formally verifying proofs for algebraic identities of matrices","author":"Schmitz","year":"2020"},{"key":"10.1016\/j.jsc.2026.102581_br0410","author":"The SymbolicData Project"},{"key":"10.1016\/j.jsc.2026.102581_br0420","series-title":"Proceedings of ISSAC 1988","first-page":"125","article-title":"Gr\u00f6bner trace algorithms","author":"Traverso","year":"1988"},{"issue":"1","key":"10.1016\/j.jsc.2026.102581_br0430","first-page":"133","article-title":"On the cancellation rule in the homogenization","volume":"46","author":"Ufnarovski","year":"2008","journal-title":"Comput. Sci. J. Mold."},{"issue":"6","key":"10.1016\/j.jsc.2026.102581_br0440","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1080\/00029890.1960.11989541","article-title":"Fibonacci series modulo m","volume":"67","author":"Wall","year":"1960","journal-title":"Am. Math. Mon."},{"issue":"2","key":"10.1016\/j.jsc.2026.102581_br0450","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1089292.1089293","article-title":"P-adic reconstruction of rational numbers","volume":"16","author":"Wang","year":"1982","journal-title":"ACM SIGSAM Bull."},{"key":"10.1016\/j.jsc.2026.102581_br0460","series-title":"Proceedings of ISSAC 2023","first-page":"545","article-title":"A characterization of perfect strategies for mirror games","author":"Yan","year":"2023"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717126000295?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717126000295?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T03:10:53Z","timestamp":1776136253000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717126000295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":45,"alternative-id":["S0747717126000295"],"URL":"https:\/\/doi.org\/10.1016\/j.jsc.2026.102581","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Modular algorithms for computing Gr\u00f6bner bases in free algebras","name":"articletitle","label":"Article Title"},{"value":"Journal of Symbolic Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jsc.2026.102581","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"102581"}}