Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): Algorithms and complexity

Journal of Symbolic Computation

Volumn 46, Issue 4, 2011, Pages 406-437

  Faugère, Jean Charles ^a   Safey El Din, Mohab ^b   Spaenlehauer, Pierre Jean ^c  

^a INRIA   (France)

^b CNRS   (France)

^c SORBONNE UNIVERSITÉ   (France)

Author keywords

Algorithms; Bihomogeneous ideals; Complexity; Gr bner bases

Indexed keywords

EID: 78951487086     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2010.10.014     Document Type: Article

References (29)

1. Atiyah M., MacDonald I. Introduction to Commutative Algebra. Series in Mathematics 1969, Addison-Wesley.
2. Bardet, M., 2004. Étude des systèmes algébriques surdéterminés. applications aux codes correcteurs et à la cryptographie. Ph.D. Thesis, Université Paris 6.
3. Bardet, M., Faugère, J.-C., Salvy, B., Yang, B., 2005. Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems. In: Proceedings of Effective Methods in Algebraic Geometry (MEGA).
4. Bernstein D., Zelevinsky A. Combinatorics of maximal minors. Journal of Algebraic Combinatorics 1993, 2(2):111-121.
5. Bruns W., Conca A. Gröbner bases and determinantal ideals. Commutative Algebra, Singularities and Computer Algebra 2003, 9-66. J. Herzog, V. Vuletescu (Eds.).
6. Buchberger B. An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Journal of Symbolic Computation 2006, 41(3-4):475-511.
7. Cox D., Dickenstein A., Schenck H. A case study in bigraded commutative algebra. Lecture Notes in Pure and Applied Mathematics 2007, CRC Press. I. Peeva (Ed.).
8. Cox D., Little J., O'Shea D. Ideals, Varieties, and Algorithms 2007, Springer.
9. Dickenstein A., Emiris I. Multihomogeneous resultant formulae by means of complexes. Journal of Symbolic Computation 2003, 36(3-4):317-342.
10. Eisenbud D. Commutative algebra with a view toward algebraic geometry. Graduate Texts in Mathematics 1995, vol. 150. Springer-Verlag.
11. Emiris I.Z., Mantzaflaris A. Multihomogeneous resultant formulae for systems with scaled support. Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation 2009, 143-150. ACM.
12. Faugère J.-C. A new efficient algorithm for computing Gröbner bases (F4). Journal of Pure and Applied Algebra 1999, 139:61-88.
13. Faugère J.-C. A new efficient algorithm for computing Gröbner bases without reduction to zero (F5). Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation 2002, 75-83. ACM, New York, NY, USA.
14. Faugère J.-C., Levy-Dit-Vehel F., Perret L. Cryptanalysis of MinRank. Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology 2008, 280-296. Springer.
15. Faugère J.-C., Rahmany S. Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases. Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation 2009, 151-158. ACM.
16. Faugère, J.-C., Safey El Din, M., Spaenlehauer, P.-J., 2010. Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology. In: Watt, S.M. (Ed.), Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC 2010. pp. 257-264.
17. Jeronimo G., Sabia J. Computing multihomogeneous resultants using straight-line programs. Journal of Symbolic Computation 2007, 42(1-2):218-235.
18. Kreuzer, M., Robbiano, L., Herzog, J., Vulutescu, V., 2002. Basic tools for computing in multigraded rings. In: Commutative Algebra, Singularities and Computer Algebra, Proc. Conf. Sinaia. pp. 197-216.
19. Lazard, D., 1983. Gröbner bases, gaussian elimination and resolution of systems of algebraic equations. In: EUROCAL. pp. 146-156.
20. McCoy N. On the resultant of a system of forms homogeneous in each of several sets of variables. Transactions of the American Mathematical Society 1933, 215-233.
21. Morgan A., Sommese A. A homotopy for solving general polynomial systems that respects m-homogeneous structures. Applied Mathematics and Computation 1987, 24(2):101-113.
22. Ourivski A., Johansson T. New technique for decoding codes in the rank metric and its cryptography applications. Problems of Information Transmission 2002, 38(3):237-246.
23. Rémond G. Elimination multihomogène. Lect. Notes in Math 2001, vol. 1752:53-81.
24. Rémond G. Géométrie diophantienne multiprojective. Lecture Notes in Math 2001, vol. 1752:95-131.
25. Safey El Din M., Schost E. Polar varieties and computation of one point in each connected component of a smooth real algebraic set. Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation 2003, 224-231. ACM, New York, NY, USA.
26. Safey El Din, M., Trébuchet, P., 2006. Strong bi-homogeneous Bézout theorem and its use in effective real algebraic geometry. Arxiv preprint http://cs/0610051.
27. Shafarevich I. Basic Algebraic Geometry 1 1977, Springer Verlag.
28. Sturmfels B., Zelevinsky A. Maximal minors and their leading terms. Advances in Mathematics 1993, 98(1):65-112.
29. Van der Waerden B.L. On Hilbert's Function, Series of Composition of Ideals and a generalization of the Theorem of Bezout. Proceedings Roy. Acad. Amsterdam 1929, vol. 31:749-770.