Michela Ceria
ABSTRACT
In this paper, we describe a new variation of the interpolation algorithm by Möller, proposed in a way that completely avoids Gröbner bases and does not need a term order, but only a well order on terms. This algorithm takes a set of functionals describing a Macaulay chain, namely, roughly speaking, the functionals are chosen and ordered in such a way that the first functional defines a zero-dimensional ideal and all the sets one gets by adding the functionals one after the other define zero-dimensional ideals as well. Starting from this set, the algorithm describes the zero-dimensional ideals of the Macaulay chain via a basis of the quotient algebra and Auzinger-Stetter matrices.
Our algorithm shows how Degroebnerization can give symmetric representations to design ideals, a crucial feature for Algebraic Statistics, showing also that such feature can always be attained without using Gröbner bases and Buchberger reduction.
The paper further investigates the potential applications of our new algorithm to describe design ideals into non-commutative algebraic settings.
- John Abbott, A Bigatti, Martin Kreuzer, and Lorenzo Robbiano. 2000. Computing ideals of points. Journal of Symbolic Computation, Vol. 30, 4 (2000), 341--356. https://doi.org/10.1006/jsco.2000.0411Google Scholar
Digital Library
- Boo Barkee, Deh Cac Can, Julia Ecks, Theo Moriarty, and RF Ree. 1994. Why you cannot even hope to use Gröbner bases in public key cryptography: an open letter to a scientist who failed and a challenge to those who have not yet failed. Journal of Symbolic Computation, Vol. 18, 6 (1994), 497--501. https://doi.org/10.1006/jsco.1994.1061Google ScholarDigital Library
- Boo Barkee, Michela Ceria, Theo Moriarty, and Andrea Visconti. 2020. Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures. Applicable Algebra in Engineering, Communication and Computing, Vol. 31, 3 (2020), 235--252.Google ScholarDigital Library
- Bruno Buchberger. 1998. Introduction to Gröbner bases. London Mathematical Society Lecture Note Series (1998), 3--31.Google ScholarCross Ref
- Michela Ceria, Samuel Lundqvist, and Teo Mora. 2021 a. Degroebnerization: a political manifesto. https://sites.google.com/view/michela-ceria-home-page/publications Retrieved April 28, 2022 fromGoogle Scholar
- Michela Ceria, Teo Mora, and Andrea Visconti. 2021 b. Why you cannot even hope to use Ore algebras in Cryptography. Applicable Algebra in Engineering, Communication and Computing, Vol. 32, 3 (2021), 229--244. https://doi.org/10.1007/s00200-020-00428-wGoogle ScholarDigital Library
- Jean-Charles Faugère. 1999. A new efficient algorithm for computing Gröbner bases (F4). Journal of pure and applied algebra, Vol. 139, 1--3 (1999), 61--88. https://doi.org/10.1016/S0022--4049(99)00005--5Google ScholarCross Ref
- Jean-Charles Faugère. 2002. A new efficient algorithm for computing Gröbner bases without reduction to zero (F5). (July 2002), 75--83. https://doi.org/10.1145/780506.780516Google ScholarDigital Library
- Vladimir P. Gerdt and Yuri A. Blinkov. 1998 a. Involutive bases of Polynomial Ideals. Math. Comp. Sim., Vol. 45 (1998), 519--541. https://doi.org/10.1016/S0378--4754(97)00127--4Google ScholarCross Ref
- Vladimir P. Gerdt and Yuri A. Blinkov. 1998 b. Minimal involutive bases. Math. Comp. Sim., Vol. 45 (1998), 543--560. https://doi.org/10.1016/S0378--4754(97)00128--6Google ScholarCross Ref
- Reinhard Laubenbacher and Brandilyn Stigler. 2004. A computational algebra approach to the reverse engineering of gene regulatory networks. Journal of theoretical biology, Vol. 229, 4 (2004), 523--537. https://doi.org/10.1016/j.jtbi.2004.04.037Google ScholarCross Ref
- Reinhard Lauenbacher and Brandilyn Stigler. 2008. Design of experiments and biochemical network inference. Algebraic and Geometric Methods in Statistics. Eds: Gibilisco, Riccomagno, Rogantin, Wynn (2008), 175--185.Google Scholar
- Samuel Lundqvist. 2010. Vector space bases associated to vanishing ideals of points. Journal of Pure and Applied Algebra, Vol. 214, 4 (2010), 309--321. https://doi.org/10.1016/j.jpaa.2009.05.013Google ScholarCross Ref
- Maria Grazia Marinari, H. Michael Moeller, and Teo Mora. 1993. Gröbner bases of ideals defined by functionals with an application to ideals of projective points. Applicable Algebra in Engineering, Communication and Computing, Vol. 4, 2 (1993), 103--145. https://doi.org/10.1007/BF01386834Google ScholarDigital Library
- Teo Mora Michela Ceria and Andrea Visconti. 2022. Degroebnerization and its applications: A new approach for data modelling. https://sites.google.com/view/michela-ceria-home-page/publications Retrieved April 20, 2022 fromGoogle Scholar
- Teo Mora. 2005. Solving Polynomial Equation Systems II Macaulay's Paradigm and Gröbner Technology. Encyclopedia of Mathematics and its Applications, Vol. 99. Cambridge University Press. https://doi.org/10.1017/CBO9781107340954 (book).Google Scholar
- Teo Mora. 2012. https://www.dima.unige.it/ morafe/SLIDES/TR8.pdf Retrieved November 22, 2021 fromGoogle Scholar
- Teo Mora. 2015. Solving Polynomial Equation Systems III Algebraic Solving. Encyclopedia of Mathematics and its Applications, Vol. 157. Cambridge University Press. https://doi.org/10.1017/CBO9781139015998 (book).Google Scholar
- Teo Mora. 2018a. An FGLM-like algorithm for computing the radical of a zero-dimensional ideal. Journal of Algebra and its Applications, Vol. 17, 01 (2018), 1850002. https://doi.org/10.1142/S0219498818500020Google ScholarCross Ref
- Teo Mora. 2018b. Solving and bonding 0-dimensional ideals: Moeller Algorithm and Macaulay Bases. https://www.dima.unige.it/ morafe/SLIDES/SantiagoMacaulay.pdf Retrieved November 22, 2021 fromGoogle Scholar
- Teo Mora. 2019. Bonding 0-dimensional ideals: Moeller Algorithm, Macaulay Bases, Bar Code, Cerlineco-Mureddu correspondence. https://www.dima.unige.it/ morafe/SLIDES/BondingUMI.pdf Retrieved November 22, 2021 fromGoogle Scholar
- Teo Mora and Lorenzo Robbiano. 1993. Points in affine and projective spaces. In Computational Algebraic Geometry and Commutative Algebra, Cortona-91 (Cortona), Vol. 34. Cambridge University Press, UK, 106--150.Google Scholar
- Bernard Mourrain. 1999. A new criterion for normal form algorithms. In International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes. Springer, Germany, 430--442. https://doi.org/10.1007/3--540--46796--3_41Google ScholarCross Ref
- Bernard Mourrain. 2005. Bezoutian and quotient ring structure. Journal of Symbolic Computation, Vol. 39 (2005), 397--415. https://doi.org/10.1016/j.jsc.2004.11.010Google ScholarDigital Library
- Bernard Mourrain and Philippe Trebuchet. 2000. Solving projective complete intersection faster. In Proceedings of the 2000 international symposium on Symbolic and algebraic computation (St. Andrews, Scotland). Association for Computing Machinery, New York, NY, USA, 234--241. https://doi.org/10.1145/345542.345642Google ScholarDigital Library
- Giuseppe Pistone, Eva Riccomagno, and Maria Piera Rogantin. 2009. Methods in algebraic statistics for the design of experiments. In Optimal Design and Related Areas in Optimization and Statistics, L. Pronzato and A. Zhigljavsky (Eds.). Vol. 28. Springer, NY, USA, 97--132. https://doi.org/10.1007/978-0--387--79936-0_5Google Scholar
- Lorenzo Robbiano. 1998. Gröbner bases and statistics. London Mathematical Society Lecture Note Series, Vol. 251 (1998), 179--204.Google Scholar
- Fabrice Rouillier. 1999. Solving zero-dimensional systems through the rational univariate representation. Applicable Algebra in Engineering, Communication and Computing, Vol. 9, 5 (1999), 433--461. https://doi.org/10.1007/s002000050114Google ScholarCross Ref
- Dov Tamari. 1948. On a certain classification of rings and semigroups. Bull. Amer. Math. Soc., Vol. 54, 2 (1948), 153--158. https://doi.org/10.1090/S0002--9904--1948-08972--8Google ScholarCross Ref
Index Terms
- A Degroebnerization Approach to Algebraic Statistics
Recommendations
Gröbner bases of toric ideals and their application
ISSAC '14: Proceedings of the 39th International Symposium on Symbolic and Algebraic ComputationThe theory of Gröbner bases has a lot of application in many research areas, and is implemented in various mathematical software; see, e.g., [2, 3]. Among their application, this tutorial will focus on basic and recent developments in the theory of ...
The algebraic approach II: dioids, quantales and monads
RelMiCS'08/AKA'08: Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebraThe algebraic approach to formal language and automata theory is a continuation of the earliest traditions in these fields which had sought to represent languages, translations and other computations as expressions (e.g. regular expressions) in suitably-...
On decomposable semigroups and applications
In this work we develop a framework to decrease the time complexity of well-known algorithms to compute the generator sets of a semigroup ideal by using the Hermite normal form. We introduce idea of decomposable semigroups, which fulfills that the ...
Comments