Linear algebra to compute Syzygies and Gröbner bases

Daniel Cabarcas*, Jintai Ding

*Corresponding author for this work

Research output: Chapter in Book or Report/Conference proceedingConference Proceedingpeer-review

8 Citations (Scopus)

Abstract

In this paper, we introduce a new method to avoid zero reductions in Gröbner basis computation. We call this method LASyz, which stands for Lineal Algebra to compute Syzygies. LASyz uses exhaustively the information of both principal syzygies and non-trivial syzygies to avoid zero reductions. All computation is done using linear algebra techniques. LASyz is easy to understand and implement. The method does not require to compute Gröbner bases of subsequences of generators incrementally and it imposes no restrictions on the reductions allowed. We provide a complete theoretical foundation for the LASyz method and we describe an algorithm to compute Gröbner bases for zero dimensional ideals based on this foundation. A qualitative comparison with similar algorithms is provided and the performance of the algorithm is illustrated with experimental data.

Original languageEnglish
Title of host publicationISSAC 2011 - Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation
Pages67-74
Number of pages8
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event36th International Symposium on Symbolic and Algebraic Computation, ISSAC 2011 - San Jose, CA, United States
Duration: 8 Jun 201111 Jun 2011

Publication series

NameProceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Conference

Conference36th International Symposium on Symbolic and Algebraic Computation, ISSAC 2011
Country/TerritoryUnited States
CitySan Jose, CA
Period8/06/1111/06/11

Keywords

  • Gröbner bases
  • linear algebra
  • syzygy

Fingerprint

Dive into the research topics of 'Linear algebra to compute Syzygies and Gröbner bases'. Together they form a unique fingerprint.

Cite this