{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T09:14:03Z","timestamp":1775726043479,"version":"3.50.1"},"reference-count":97,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,11,5]],"date-time":"2022-11-05T00:00:00Z","timestamp":1667606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,11,5]],"date-time":"2022-11-05T00:00:00Z","timestamp":1667606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s00200-022-00586-z","type":"journal-article","created":{"date-parts":[[2022,11,5]],"date-time":"2022-11-05T13:02:47Z","timestamp":1667653367000},"page":"675-723","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Degr\u00f6bnerization: a political manifesto"],"prefix":"10.1007","volume":"33","author":[{"given":"Michela","family":"Ceria","sequence":"first","affiliation":[]},{"given":"Samuel","family":"Lundqvist","sequence":"additional","affiliation":[]},{"given":"Teo","family":"Mora","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,5]]},"reference":[{"key":"586_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jsc.2019.07.022","volume":"100","author":"J Abbott","year":"2020","unstructured":"Abbott, J., Bigatti, A., Palezzato, E., Robbiano, L.: Computing and using minimal polynomials. J. Symb. Comput. 100, 137\u2013163 (2020)","journal-title":"J. Symb. Comput."},{"key":"586_CR2","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1006\/jsco.2000.0411","volume":"30","author":"J Abbott","year":"2000","unstructured":"Abbott, J., Bigatti, A., Kreuzer, M., Robbiano, L.: Computing ideals of points. J. Symb. Comput. 30, 341\u2013356 (2000)","journal-title":"J. Symb. Comput."},{"key":"586_CR3","first-page":"1","volume":"143","author":"ME Alonso","year":"1996","unstructured":"Alonso, M.E., Becker, E., Roy, M.-F., W\u00f6rmann, T.: Zeroes, multiplcicities and idempotents for zerodimensional systems. Prog. Math. 143, 1\u201316 (1996)","journal-title":"Prog. Math."},{"key":"586_CR4","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00200-006-0019-4","volume":"17","author":"ME Alonso","year":"2006","unstructured":"Alonso, M.E., Marinari, M.G., Mora, M.T.: The big mother of all the dualities, II: Macaulay bases. J. AAECC 17, 409\u2013451 (2006)","journal-title":"J. AAECC"},{"key":"586_CR5","doi-asserted-by":"crossref","unstructured":"Augot, D., Bardet, M., Faugere, J.C.: Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Gr\u00f6bner bases. In: Proceedings of IEEE International Symposium on Information Theory 2003 (2003)","DOI":"10.1109\/ISIT.2003.1228378"},{"key":"586_CR6","doi-asserted-by":"crossref","unstructured":"Augot, D., Bardet, M., Faugere, J.C.: On formulas for decoding binary cyclic codes. In: Proceedings of IEEE International Symposium on Information Theory 2007 (2007)","DOI":"10.1109\/ISIT.2007.4557618"},{"key":"586_CR7","first-page":"11","volume":"86","author":"W Auzinger","year":"1988","unstructured":"Auzinger, W., Stetter, H.J.: An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations. I.S.N.M. 86, 11\u201330 (1988)","journal-title":"I.S.N.M."},{"key":"586_CR8","unstructured":"Barkee, B.: Gr\u00f6bner bases. The ancient secret mystic power of the algu compubraicus. A revelation whose simplicity will make ladies swoon and grown men cry, Technical Report (1988)"},{"key":"586_CR9","doi-asserted-by":"crossref","unstructured":"Becker, E., Marinari, M.G., Mora, T., Traverso, C.: The shape of the shape lemma. In: Proceedings of ISSAC94, pp. 129-133. ACM (1994)","DOI":"10.1145\/190347.190382"},{"key":"586_CR10","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0021-8693(81)90352-5","volume":"73","author":"D Berman","year":"1981","unstructured":"Berman, D.: The number of generators of a colength N ideal in a power series ring. J. Algebra 73, 156\u2013166 (1981)","journal-title":"J. Algebra"},{"key":"586_CR11","unstructured":"B\u00e9zout, E.: Recherches sur le degr\u00e9 des \u00e9quations r\u00e9sultantes de l\u2019\u00e9vanouissement des inconnues, et sur les moyens qu\u2019il convient d\u2019employer pour trouver ses \u00e9quations. M\u00e9m. Acad. R. Sci. Paris 288\u2014338 (1764)"},{"key":"586_CR12","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1006\/jsco.1999.0415","volume":"30","author":"M Borges-Trenard","year":"2000","unstructured":"Borges-Trenard, M., Borges-Quintana, M., Mora, T.: Computing Gr\u00f6bner bases by FGLM techniques in a noncommutative setting. J. Symb. Comput. 30, 429\u2013449 (2000)","journal-title":"J. Symb. Comput."},{"key":"586_CR13","doi-asserted-by":"crossref","unstructured":"Caboara, M. Mora, T.: The Chen-Reed-Helleseth-Truong , algorithm and the Gianni-Kalkbrenner Gr\u00f6bner shape theorem. Appl. Algebra Eng. Commun. Comput. 13 (2002)","DOI":"10.1007\/s002000200097"},{"key":"586_CR14","unstructured":"Cardinal, J.P.: Dualit\u00e9 et algorithms it\u00e9ratifs pour la r\u00e9solution de syst\u00e9mes polynomiaux. Ph.D. Thesis, Univ. Rennes I (1993)"},{"key":"586_CR15","first-page":"189","volume":"32","author":"JP Cardinal","year":"1999","unstructured":"Cardinal, J.P., Mourrain, B.: Algebraic approach of resisues and applications. Lect. Notes Appl. Math. 32, 189\u2013210 (1999)","journal-title":"Lect. Notes Appl. Math."},{"issue":"6","key":"586_CR16","doi-asserted-by":"publisher","first-page":"3641","DOI":"10.1109\/TIT.2017.2692213","volume":"63","author":"F Caruso","year":"2017","unstructured":"Caruso, F., Orsini, E., Tinnirello, C., Sala, M.: On the shape of the general error locator polynomial for cyclic codes. IEEE Trans. Inform. Theory 63(6), 3641\u20133657 (2017)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"586_CR17","first-page":"366","volume":"I","author":"A Cayley","year":"1857","unstructured":"Cayley, A.: Note sur la m\u00e9thode d\u2019\u00e9limination de Bezout. J. Reine Ang. Math. LII I, 366\u20137 (1857)","journal-title":"J. Reine Ang. Math. LII"},{"key":"586_CR18","first-page":"415","volume":"I","author":"A Cayley","year":"1858","unstructured":"Cayley, A.: A fourth memory upon quantics. Phil. Trans. R. Soc. Lond. CXLVII I, 415\u2013427 (1858)","journal-title":"Phil. Trans. R. Soc. Lond. CXLVII"},{"issue":"3\u20134","key":"586_CR19","first-page":"213","volume":"72","author":"M Ceria","year":"2014","unstructured":"Ceria, M.: A proof of the \u201cAxis of Evil theorem\u2019\u2019 for distinct points. Rend. Semin. Mat. dell\u2019Univ. Politec. Torino 72(3\u20134), 213\u2013233 (2014)","journal-title":"Rend. Semin. Mat. dell\u2019Univ. Politec. Torino"},{"key":"586_CR20","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.jsc.2018.06.012","volume":"91","author":"M Ceria","year":"2019","unstructured":"Ceria, M.: Bar code for monomial ideals. J. Symb. Comput. 91, 30\u201356 (2019). https:\/\/doi.org\/10.1016\/j.jsc.2018.06.012","journal-title":"J. Symb. Comput."},{"key":"586_CR21","doi-asserted-by":"publisher","DOI":"10.1478\/AAPP.1001A2","author":"M Ceria","year":"2022","unstructured":"Ceria, M.: Bar code and Janet-like division. Atti Accad. Peloritana Pericol. Classe Sci. Fis. Mat. Nat. (2022). https:\/\/doi.org\/10.1478\/AAPP.1001A2","journal-title":"Atti Accad. Peloritana Pericol. Classe Sci. Fis. Mat. Nat."},{"issue":"2","key":"586_CR22","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s11786-019-00425-4","volume":"14","author":"M Ceria","year":"2020","unstructured":"Ceria, M.: Bar code: a visual representation for finite set of terms and its applications. Math. Comput. Sci. 14(2), 497\u2013513 (2020). https:\/\/doi.org\/10.1007\/s11786-019-00425-4","journal-title":"Math. Comput. Sci."},{"key":"586_CR23","doi-asserted-by":"publisher","DOI":"10.1478\/AAPP.972A6","author":"M Ceria","year":"2019","unstructured":"Ceria, M.: Bar code vs Janet tree. Atti Accad. Peloritana Pericol. Classe Sci. Fis. Mat. Nat. (2019). https:\/\/doi.org\/10.1478\/AAPP.972A6","journal-title":"Atti Accad. Peloritana Pericol. Classe Sci. Fis. Mat. Nat."},{"key":"586_CR24","unstructured":"Ceria, M.: Half error locator polynomials for efficient decoding of binary cyclic codes, in preparation"},{"key":"586_CR25","unstructured":"Ceria, M., Mora, T.: Towards a Gr\u00f6bner-free approach to Coding, submitted"},{"key":"586_CR26","unstructured":"Ceria M., Mora T.: Combinatorics of ideals of points: a Cerlienco\u2013Mureddu-like approach for an iterative lex game. arXiv:1805.09165 [math.AC]"},{"issue":"3","key":"586_CR27","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00200-020-00427-x","volume":"31","author":"M Ceria","year":"2020","unstructured":"Ceria, M., Mora, T., Sala, M.: HELP: a sparse error locator polynomial for BCH codes. Appl. Algebra Eng. Commun. Comput. 31(3), 215\u2013233 (2020)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"1","key":"586_CR28","first-page":"43","volume":"78","author":"M Ceria","year":"2020","unstructured":"Ceria, M., Mora, T., Sala, M.: Zech tableaux as tools for sparse decoding Rend. Semin. Mat. 78(1), 43\u201356 (2020)","journal-title":"Semin. Mat."},{"key":"586_CR29","doi-asserted-by":"crossref","unstructured":"Ceria, M., Mora, T., Visconti, A.: Efficient computation of squarefree separator polynomials. In: International Congress on Mathematical Software, pp. 98\u2013104. Springer, Cham (2018)","DOI":"10.1007\/978-3-319-96418-8_12"},{"key":"586_CR30","unstructured":"Ceria, M., Mora, T., Visconti, A.: Degr\u00f6bnerization and its applications: a new approach for data modelling, submitted"},{"key":"586_CR31","unstructured":"Ceria, M., Lundqvist, S., Mora, T.: Degr\u00f6bnerization and its applications: reverse engineering of gene regulatory networks 2021, submitted"},{"key":"586_CR32","unstructured":"Cerlienco, L., Mureddu, M.: Algoritmi combinatori per l\u2019interpolazione polinomiale in dimensione \u2265 2, Publ. I.R.M.A. Strasbourg, 461\/S-24 Actes 24e S\u00e9minaire Lotharingien, pp. 39\u201376. M\u00f6ller (1993)"},{"key":"586_CR33","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0012-365X(94)00126-4","volume":"139","author":"L Cerlienco","year":"1995","unstructured":"Cerlienco, L., Mureddu, M.: From algebraic sets to monomial linear bases by means of combinatorial algorithms. Discrete Math. 139, 73\u201387 (1995)","journal-title":"Discrete Math."},{"key":"586_CR34","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1006\/jabr.2001.9061","volume":"251","author":"L Cerlienco","year":"2002","unstructured":"Cerlienco, L., Mureddu, M.: Multivariate interpolation and standard bases for Macaulay modules. J. Algebra 251, 686\u2013726 (2002)","journal-title":"J. Algebra"},{"key":"586_CR35","doi-asserted-by":"publisher","first-page":"1654","DOI":"10.1109\/18.333885","volume":"40","author":"X Chen","year":"1994","unstructured":"Chen, X., Reed, I.S., Helleseth, T., Truong, K.: Use of Gr\u00f6bner bases to decode binary cyclic codes up to the true minimum distance. IEEE Trans. Inform. Theory 40, 1654\u20131661 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"586_CR36","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1109\/18.333886","volume":"40","author":"X Chen","year":"1994","unstructured":"Chen, X., Reed, I.S., Helleseth, T., Truong, K.: General principles for the algebraic decoding of cyclic codes. IEEE Trans. Inform. Theory 40, 1661\u20131663 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"586_CR37","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1090\/conm\/168\/01685","volume":"168","author":"X Chen","year":"1994","unstructured":"Chen, X., Reed, I.S., Helleseth, T., Truong, K.: Algebraic decoding of cyclic codes: a polynomial ideal point of view. Contemp. Math. 168, 15\u201322 (1994)","journal-title":"Contemp. Math."},{"key":"586_CR38","unstructured":"Cooper, A.B.: III, Direct solution of BCH decoding equations. In: Arikan, E. (ed.) Communications, Control and Signal Processing, pp. 281\u2013286. Elsevier, Amsterdam (1990)"},{"key":"586_CR39","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1049\/el:19911294","volume":"27","author":"AB Cooper III","year":"1991","unstructured":"Cooper, A.B., III.: Finding BCH error locator polynomials in one step. Electron. Lett. 27, 2090\u20132091 (1991)","journal-title":"Electron. Lett."},{"key":"586_CR40","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1112\/plms\/s2-6.1.468","volume":"6","author":"AL Dixon","year":"1908","unstructured":"Dixon, A.L.: On a form of the eliminant of two quantics. Proc. Lond. Math. Soc. 6, 468\u201378 (1908)","journal-title":"Proc. Lond. Math. Soc."},{"key":"586_CR41","unstructured":"Dub\u00e9, T., Mishra, B., Yap, C.: Admissible orderings and bounds on Gr\u00f6bner normal form algorithm. NYU Computer Science, Technical Report (1986)"},{"key":"586_CR42","doi-asserted-by":"crossref","first-page":"334","DOI":"10.5486\/PMD.1956.4.3-4.28","volume":"4","author":"J Erd\u00f6s","year":"1956","unstructured":"Erd\u00f6s, J.: On the structure of ordered real vector spaces. Publ. Math. Debr. 4, 334\u2013343 (1956)","journal-title":"Publ. Math. Debr."},{"key":"586_CR43","doi-asserted-by":"crossref","unstructured":"Farr, J.B., Gao, S.: Computing Gr\u00f6bner bases for vanishing ideals of finite sets of points. In: International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, pp. 118\u2013127. Springer, Berlin (2006)","DOI":"10.1007\/11617983_11"},{"key":"586_CR44","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"JC Faugere","year":"1993","unstructured":"Faugere, J.C., Gianni, P., Lazard, D., Mora, T.: Efficient computation of zero-dimensional Gr\u00f6bner bases by change of ordering. J. Symb. Comput. 16, 329\u2013344 (1993)","journal-title":"J. Symb. Comput."},{"issue":"6","key":"586_CR45","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1016\/j.jsc.2005.11.003","volume":"41","author":"B Felszeghy","year":"2006","unstructured":"Felszeghy, B., R\u00e1th, B., R\u00f3nyai, L.: The lex game and some applications. J. Symb. Comput. 41(6), 663\u2013681 (2006)","journal-title":"J. Symb. Comput."},{"key":"586_CR46","unstructured":"Felszeghy, B., R\u00e1nyai, L.: On the lexicographic standard monomials of zero dimensional ideals, pp. 95\u2013105 (2006)"},{"key":"586_CR47","first-page":"247","volume":"356","author":"P Gianni","year":"1987","unstructured":"Gianni, P.: Algebraic solution of systems of polynomial equations using Gr\u00f6bner bases. Comput. Sci. 356, 247\u2013257 (1987)","journal-title":"Comput. Sci."},{"key":"586_CR48","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-51517-8_128","volume":"378","author":"P Gianni","year":"1991","unstructured":"Gianni, P.: Properties of Gr\u00f6bner bases under specialization. Lect. Notes Comput. Sci. 378, 293\u2013297 (1991)","journal-title":"Lect. Notes Comput. Sci."},{"key":"586_CR49","first-page":"240","volume":"1899","author":"P Gordan","year":"1899","unstructured":"Gordan, P.: Neuer Beweis des Hilbertschen Satzes \u00fcber homogene Funktionen. Gott. Nachr. 1899, 240\u2013242 (1899)","journal-title":"Gott. Nachr."},{"key":"586_CR50","first-page":"141","volume":"6","author":"P Gordan","year":"1900","unstructured":"Gordan, P.: Les invariants des formes binaries. J. Math. Pure Appl. 6, 141\u2013156 (1900)","journal-title":"J. Math. Pure Appl."},{"key":"586_CR51","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/BF01208503","volume":"36","author":"D Hilbert","year":"1890","unstructured":"Hilbert, D.: Uber die theorie der algebraicschen formen. Math. Ann. 36, 473\u2013534 (1890)","journal-title":"Math. Ann."},{"issue":"3","key":"586_CR52","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/1279721.1279722","volume":"40","author":"W Just","year":"2006","unstructured":"Just, W., Stigler, B.: Computing Gr\u00f6bner bases of ideals of few points in high dimensions. Commun. Comput. Algebra 40(3), 65\u201396 (2006)","journal-title":"Commun. Comput. Algebra"},{"key":"586_CR53","doi-asserted-by":"crossref","unstructured":"Just, W., Stigler, B.: Efficiently computing Gr\u00f6bner bases of ideals of points. arXiv:0711.3475 (2007)","DOI":"10.1145\/1230898.1230900"},{"key":"586_CR54","first-page":"99","volume":"94","author":"D Kapur","year":"1994","unstructured":"Kapur, D., Saxena, T., Yang, L.: Algebraic and geometric reasoning using dixon resultants. Proc. ISSAC 94, 99\u201336 (1994)","journal-title":"Proc. ISSAC"},{"key":"586_CR55","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1145\/258726.258768","volume":"97","author":"D Kapur","year":"1997","unstructured":"Kapur, D., Saxena, T.: Extraneus factors in the Dixon resultant formulation. Proc. ISSAC 97, 141\u2013148 (1997)","journal-title":"Proc. ISSAC"},{"key":"586_CR56","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/3-540-51517-8_127","volume":"378","author":"M Kalkbrenner","year":"1991","unstructured":"Kalkbrenner, M.: Solving systems of algebraic equations using Gr\u00f6bner bases. Lect. Notes Comput. Sci. 378, 282\u2013292 (1991)","journal-title":"Lect. Notes Comput. Sci."},{"key":"586_CR57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-43601-2","volume-title":"Computational Linear and Commutative Algebra","author":"M Kreuzer","year":"2016","unstructured":"Kreuzer, M., Robbiano, L.: Computational Linear and Commutative Algebra. Springer, Heidelberg (2016)"},{"key":"586_CR58","doi-asserted-by":"crossref","unstructured":"Lakshman, Y.N.: On the complexity of computing Gr\u00f6bner bases for zero-dimensional polynomial ideals. Ph.D. Thesis, RPI, Troy (1990)","DOI":"10.1145\/100216.100294"},{"key":"586_CR59","doi-asserted-by":"crossref","unstructured":"Lakshman, Y.N.: On the complexity of computing a Gr\u00f6bner basis for the radical of a zero dimensional ideal. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing (1990)","DOI":"10.1145\/100216.100294"},{"key":"586_CR60","first-page":"227","volume":"94","author":"YN Lakshman","year":"1990","unstructured":"Lakshman, Y.N.: A single exponential bound on the complexity of computing Gr\u00f6bner bases of zero dimensional ideals. Prog. Math. 94, 227\u2013234 (1990)","journal-title":"Prog. Math."},{"issue":"4","key":"586_CR61","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/j.jtbi.2004.04.037","volume":"229","author":"R Laubenbacher","year":"2004","unstructured":"Laubenbacher, R., Stigler, B.: A computational algebra approach to the reverse engineering of gene regulatory networks. J. Theor. Biol. 229(4), 523\u2013537 (2004)","journal-title":"J. Theor. Biol."},{"key":"586_CR62","doi-asserted-by":"crossref","unstructured":"Laubenbacher, R., Stigler, B.: Design of experiments and biochemical network inference in Algebraic and Geometric Methods in Statistics. Eds: Gibilisco, Riccomagno, Rogantin, Wynn. Cambridge University Press, Cambridge (2008)","DOI":"10.1017\/CBO9780511642401.011"},{"key":"586_CR63","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s002000050084","volume":"8","author":"P Loustaunau","year":"1997","unstructured":"Loustaunau, P., York, E.V.: On the decoding of cyclic codes using Gr\u00f6bner bases. Appl. Algebra Eng. Commun. Comput. 8, 469\u2013483 (1997)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"4","key":"586_CR64","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.jpaa.2009.05.013","volume":"214","author":"S Lundqvist","year":"2010","unstructured":"Lundqvist, S.: Vector space bases associated to vanishing ideals of points. J. Pure Appl. Algebra 214(4), 309\u2013321 (2010)","journal-title":"J. Pure Appl. Algebra"},{"key":"586_CR65","doi-asserted-by":"crossref","unstructured":"Lundqvist, S.: Complexity of comparing monomials and two improvements of the Buchberger\u2013M\u00f6ller algorithm. In: Mathematical Methods in Computer Science, pp. 105\u2013125. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-89994-5_9"},{"issue":"1","key":"586_CR66","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s11786-012-0108-7","volume":"6","author":"S Lundqvist","year":"2012","unstructured":"Lundqvist, S.: Multiplication matrices and ideals of projective dimension zero. Math. Comput. Sci. 6(1), 43\u201359 (2012)","journal-title":"Math. Comput. Sci."},{"key":"586_CR67","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/BF01455345","volume":"74","author":"FS Macaulay","year":"1913","unstructured":"Macaulay, F.S.: On the resolution of a given modular system into primary systems including some properties of Hilbert numbers. Math. Ann. 74, 66\u2013121 (1913)","journal-title":"Math. Ann."},{"key":"586_CR68","doi-asserted-by":"publisher","DOI":"10.3792\/chmm\/1263317740","volume-title":"The Algebraic Theory of Modular Systems","author":"FS Macaulay","year":"1916","unstructured":"Macaulay, F.S.: The Algebraic Theory of Modular Systems. Cambridge University Press, Cambridge (1916)"},{"key":"586_CR69","doi-asserted-by":"crossref","unstructured":"Marinari, M.G., Mora T., M\u00f6ller, H.M.: Gr\u00f6bner bases of ideals given by dual bases. In: Proceedings of ISSAC \u201991, pp. 55\u201363. ACM (1991)","DOI":"10.1145\/120694.120702"},{"issue":"2","key":"586_CR70","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF01386834","volume":"4","author":"MG Marinari","year":"1993","unstructured":"Marinari, M.G., M\u00f6ller, H.M., Mora, T.: Gr\u00f6bner bases of ideals defined by functionals with an application to ideals of projective points. Appl. Algebra Eng. Commun. Comput. 4(2), 103\u2013145 (1993)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"586_CR71","doi-asserted-by":"crossref","unstructured":"M\u00f6ller, H.M., Buchberger, B.: The construction of multivariate polynomials with preassigned zeros. In: European Computer Algebra Conference, pp. 24\u201331. Springer, Berlin (1982)","DOI":"10.1007\/3-540-11607-9_3"},{"key":"586_CR72","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s002110050122","volume":"70","author":"M M\u00f6ller","year":"1995","unstructured":"M\u00f6ller, M., Stetter, H.: Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems. Num. Math. 70, 311\u2013325 (1995)","journal-title":"Num. Math."},{"key":"586_CR73","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-93806-4_3","volume-title":"Gr\u00f6bner bases, coding, and cryptography","author":"T Mora","year":"2009","unstructured":"Mora, T.: The FGLM problem and Moeller\u2019s algorithm on zero-dimensional ideals. In: Sala, M., et al. (eds.) Gr\u00f6bner bases, coding, and cryptography, pp. 27\u201346. Springer, Berlin (2009)"},{"key":"586_CR74","doi-asserted-by":"publisher","unstructured":"Mora , T.: Solving Polynomial Equation Systems 4 Vols. Cambridge University Press, I https:\/\/doi.org\/10.1017\/CBO9780511542831 (2003), II https:\/\/doi.org\/10.1017\/CBO9781107340954 (2005), III https:\/\/doi.org\/10.1017\/CBO9781139015998 (2015), IV https:\/\/doi.org\/10.1017\/CBO9781316271902 (2016)","DOI":"10.1017\/CBO9780511542831 10.1017\/CBO9781107340954 10.1017\/CBO9781139015998 10.1017\/CBO9781316271902"},{"issue":"01","key":"586_CR75","doi-asserted-by":"publisher","first-page":"1850002","DOI":"10.1142\/S0219498818500020","volume":"17","author":"T Mora","year":"2018","unstructured":"Mora, T.: An FGLM-like algorithm for computing the radical of a zero-dimensional ideal. J. Algebra Appl. 17(01), 1850002 (2018)","journal-title":"J. Algebra Appl."},{"key":"586_CR76","first-page":"62","volume-title":"Gr\u00f6bner Bases, Coding, and Cryptography","author":"T Mora","year":"2009","unstructured":"Mora, T., Orsini, E.: Decoding cyclic codes: the cooper philosophy. In: Sala, M., et al. (eds.) Gr\u00f6bner Bases, Coding, and Cryptography, pp. 62\u201392. Springer, Berlin (2009)"},{"key":"586_CR77","unstructured":"Mora, T., Robbiano, L.: Points in affine and projective spaces. In: Computational Algebraic Geometry and Commutative Algebra, Cortona-91, 34, pp. 106\u2013150. Cambridge University Press, Cambridge (1993)"},{"key":"586_CR78","unstructured":"Mora, T.: https:\/\/drive.google.com\/file\/d\/1NlbiEehGGWIbWcbsypYNFY0oknpexpbL\/view?usp=sharing"},{"key":"586_CR79","unstructured":"Mora, T.: https:\/\/drive.google.com\/file\/d\/1ye4P7WrBphbRk1S1ncbdBxgxxPFb1IWw\/view?usp=sharing"},{"key":"586_CR80","unstructured":"Mora, T.: https:\/\/drive.google.com\/file\/d\/1QKobQNLFlvmMtX6n-9ZPyjG382dVKdJ0\/view?usp=sharing"},{"key":"586_CR81","doi-asserted-by":"crossref","unstructured":"Mourrain, B.: A new criterion for normal form algorithms. In: Fossorier, M., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1999. Lecture Notes in Computer Science, vol 1719. Springer, Berlin (1999)","DOI":"10.1007\/3-540-46796-3_41"},{"key":"586_CR82","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.jsc.2004.11.010","volume":"39","author":"B Mourrain","year":"2005","unstructured":"Mourrain, B.: Bezoutian and quotient ring structure. J. Symb. Comput. 39, 397\u2013415 (2005)","journal-title":"J. Symb. Comput."},{"key":"586_CR83","doi-asserted-by":"crossref","unstructured":"Mourrain, B., Trebuchet, P.: Solving projective complete intersection faster. In: Proceedings of ISSAC\u201900, pp. 234\u2013241. ACM (2000)","DOI":"10.1145\/345542.345642"},{"key":"586_CR84","doi-asserted-by":"crossref","unstructured":"Naldi, S., Neiger, V.: A divide-and-conquer algorithm for computing Gr\u00f6bner bases of syzygies in finite dimension. In: Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation (2020)","DOI":"10.1145\/3373207.3404059"},{"key":"586_CR85","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.jpaa.2004.12.027","volume":"200","author":"E Orsini","year":"2005","unstructured":"Orsini, E., Sala, M.: Correcting errors and erasures via the syndrome variety. J. Pure Appl. Algebra 200, 191\u2013226 (2005)","journal-title":"J. Pure Appl. Algebra"},{"key":"586_CR86","unstructured":"Pesch, M.: Gr\u00f6bner bases in skew polynomial rings. Dissertation, Passau (1997)"},{"key":"586_CR87","first-page":"225","volume":"15","author":"M Pesch","year":"1991","unstructured":"Pesch, M.: Two-sided Gr\u00f6bner bases in iterated ore extensions. Prog. Comput. Sci. Appl. Logic 15, 225\u2013243 (1991)","journal-title":"Prog. Comput. Sci. Appl. Logic"},{"issue":"3","key":"586_CR88","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1016\/j.jspi.2007.02.007","volume":"138","author":"G Pistone","year":"2008","unstructured":"Pistone, G., Rogantin, M.P.: Indicator function and complex coding for mixed fractional factorial designs. J. Stat. Plan. Inference 138(3), 787\u2013802 (2008)","journal-title":"J. Stat. Plan. Inference"},{"key":"586_CR89","doi-asserted-by":"crossref","unstructured":"Pistone, G., Riccomagno, E., Rogantin, M.P.: Methods in algebraic statistics for the design of experiments. In: Optimal Design and Related Areas in Optimization and Statistics, pp. 97\u2013132. Springer, Berlin (2009)","DOI":"10.1007\/978-0-387-79936-0_5"},{"key":"586_CR90","doi-asserted-by":"crossref","unstructured":"Robbiano, L.: Term orderings on the polynomial ring. In: Proceedings of EUROCAL\u201985. Lectures Notes in Computer Science, vol. 204, pp. 513\u2013517 (1985)","DOI":"10.1007\/3-540-15984-3_321"},{"key":"586_CR91","doi-asserted-by":"crossref","unstructured":"Robbiano, L.: Gr\u00f6bner bases and statistics. In: Buchberger, B., Winkler, F. (eds) Gr\u00f6bner bases and applications, pp. 179\u2013204. Cambridge University Press, Cambridge (1998)","DOI":"10.1017\/CBO9780511565847.010"},{"key":"586_CR92","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s002000050114","volume":"9","author":"F Rouillier","year":"1999","unstructured":"Rouillier, F.: Solving zero-dimensional systems through the rational univariate representation. J. AAECC 9, 433\u2013461 (1999)","journal-title":"J. AAECC"},{"key":"586_CR93","volume-title":"Lessons Introductory to the Modern Higher Algebra","author":"G Salmon","year":"1885","unstructured":"Salmon, G.: Lessons Introductory to the Modern Higher Algebra, 5th edn. Chelsea Pub. Co., New York (1885)","edition":"5"},{"key":"586_CR94","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717976","volume-title":"Numerical Polynomial Algebra","author":"HJ Stetter","year":"2004","unstructured":"Stetter, H.J.: Numerical Polynomial Algebra. SIAM, Philadelphia (2004)"},{"key":"586_CR95","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1090\/S0002-9904-1948-08972-8","volume":"54","author":"D Tamari","year":"1948","unstructured":"Tamari, D.: On a certain classification of rings and semigroups. Bull. A.M.S 54, 153\u2013158 (1948)","journal-title":"Bull. A.M.S"},{"key":"586_CR96","doi-asserted-by":"publisher","unstructured":"Todd, J.A., Coxeter, H.S.M.: A practical method for enumerating cosets of a finite abstract group. In: Proceedings of the Edinburgh Mathematical Society. Series II, vol. 5, pp. 26\u201334. https:\/\/doi.org\/10.1017\/S0013091500008221 (1936)","DOI":"10.1017\/S0013091500008221"},{"key":"586_CR97","doi-asserted-by":"crossref","unstructured":"Weispfenning, V.: Finite Gr\u00f6bner bases in non-Noetherian skew polynomial rings. In: Proceedings of ISSAC\u201992, pp. 320\u2013332. ACM (1992)","DOI":"10.1145\/143242.143346"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-022-00586-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-022-00586-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-022-00586-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T09:51:55Z","timestamp":1728294715000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-022-00586-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,5]]},"references-count":97,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["586"],"URL":"https:\/\/doi.org\/10.1007\/s00200-022-00586-z","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,5]]},"assertion":[{"value":"30 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}