Article

Free access

“One sugar cube, please” or selection strategies in the Buchberger algorithm

Authors:

Carlo TraversoAuthors Info & Claims

ISSAC '91: Proceedings of the 1991 international symposium on Symbolic and algebraic computation

Pages 49 - 54

https://doi.org/10.1145/120694.120701

Published: 01 June 1991 Publication History

PDF eReader

References

[1]

Attardi, G., Traverso, C., A network implementation of Buchberger algorithm, Technical report, Pisa 1991.

Google Scholar

[2]

Bayer, D., Stillman, M., Stillman, M.:, "Macaulay User Manual," 1989.

Google Scholar

[3]

Bayer, D., Stillman, M.:, Macaulay: A system for computation in algebraic geometry and commutative algebra, Source and object code available for Unix and Macintosh computers. Contact the authors, or ftp 128.103.1.107, Name: ftp, Password: any, cd Macaulay, binary, get M3.tar, quit, tar xf M3.tar.

Google Scholar

[4]

Boege, W., Gebauer, R., Kredel, H., Some examples for solving systems of algebraic equations by calculating Grb'bner bases, J. of Symbolic Computation 2 (1986), 83-98.

Digital Library

Google Scholar

[5]

Bj6rck, G., Functions on modulus on Zn whose Fourier transforms have constant modulus, and "cyclic n-roots", in "Recent advances in fourier analysis and its applications," J. S. Byrnes, J. F. Byrnes ed., NATO Adv. Sci. Inst. Ser. C: Math. Phis. Sci. 315, Kluwer, pp. 131-140.

Google Scholar

[6]

Buchberger, B., A Criterion for Detecting Unnecessary Reductions in the Construction of GrSbner Bases, in "EUROSAM 1979," Lecture Notes in Computer Science 72, Springer Verlag, Berlin-Heidelberg-New York, 1979, pp. 3-21.

Digital Library

Google Scholar

[7]

Conti, P., Traverso, C., Buchberger algorithm and integer programming, 1991, (submitted to AAECC-7).

Digital Library

Google Scholar

[8]

Faug~re, J.C., Gianni, P., Lazard, D., Morn, T., Efficient Computation of Zero-dimensional Grb'bner Bases by Change of Ordering, (submitted), J. Symb. Comp. (1989). Technical Report LITP 89-52

Google Scholar

[9]

Gebauer, R., M611er, H. M., An installation of Buchberger's algorithm, J. of Symbolic Computation 6, 275-286.

Digital Library

Google Scholar

[10]

Gerdt, V. P., Zharkov, A. Y., Computer genera. tion of necessary integrability conditions for polynomial.nonlinear evolution systems, in "ISSAC 1990," Proceedings, ACM, pp. 250-254.

Digital Library

Google Scholar

[11]

Giovini, A., Niesi, G., CoCoA: a user-friendly system for commutative algebra, in "DISCO-90," Lecture Notes in Computer Science 429, Springer Verlag, Berlin-Heidelberg-New York, 1990, pp. 20-29.

Digital Library

Google Scholar

[12]

Giovini, A., Niesi, CI., "CoCoA User Manual," Manual and code obtainable by anonymous ftp on ~auss. din. unipi, it, 1990.

Google Scholar

[13]

Pottier, L., Minimal solutions of linear diophantine systems: bounds and algorithms. 1991, to appear

Google Scholar

[14]

Traverso, C., Donati, L., A1PI source code for MuLISP and COMMON-LISP, obtainable by anonymous ftp on gauss, din. unipi, it.

Google Scholar

[15]

Traverso, C., Donati, L., Experimenting the Gr6bnvr basis algorithm with the A1PI system, in "ISSAC 89," A. C. M., 1989.

Digital Library

Google Scholar

Cited By

View all

Verron T(2024)On the computation of Gröbner bases for matrix-weighted homogeneous systemsJournal of Symbolic Computation10.1016/j.jsc.2024.102327125:COnline publication date: 1-Nov-2024
https://dl.acm.org/doi/10.1016/j.jsc.2024.102327
Pickering Ldel Río Almajano TEngland MCohen K(2024)Explainable AI Insights for Symbolic Computation: A case study on selecting the variable ordering for cylindrical algebraic decompositionJournal of Symbolic Computation10.1016/j.jsc.2023.102276123(102276)Online publication date: Jul-2024
https://doi.org/10.1016/j.jsc.2023.102276
Morrow MNagel U(2024)Computing Gröbner bases and free resolutions of OI-modulesJournal of Algebra10.1016/j.jalgebra.2024.08.009Online publication date: Aug-2024
https://doi.org/10.1016/j.jalgebra.2024.08.009
Show More Cited By

Index Terms

“One sugar cube, please” or selection strategies in the Buchberger algorithm
1. Computing methodologies
  1. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
      1. Algebraic algorithms
2. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Computations on polynomials

Recommendations

Exploring the Dynamic Buchberger Algorithm
ISSAC '17: Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation

Abstract "Static" Buchberger algorithms to compute a Gröbner basis require as input both a set of polynomials and a term ordering. "Dynamic" Buchberger algorithms do not require an ordering as input, but compute instead a Gröbner basis with respect to a "...
Applying IsRewritten criterion on Buchberger algorithm

Faugere's F"5 algorithm is one of the fastest algorithms to compute Grobner bases. It uses two criteria namely the F"5 criterion and the IsRewritten criterion to detect the useless critical pairs (see Faugere (2002) [8]). The IsRewritten criterion has ...
Learning selection strategies in Buchberger's algorithm
ICML'20: Proceedings of the 37th International Conference on Machine Learning

Studying the set of exact solutions of a system of polynomial equations largely depends on a single iterative algorithm, known as Buchberger's algorithm. Optimized versions of this algorithm are crucial for many computer algebra systems (e.g., Mathematica,...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ISSAC '91: Proceedings of the 1991 international symposium on Symbolic and algebraic computation

June 1991

468 pages

ISBN:0897914376

DOI:10.1145/120694

Editor:
Stephen M. Watt

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ISSAC 91

Sponsor:

German Comp Soc
GMD
SIGSAM

ISSAC 91: International Symposium on Symbolic Algebraic Computation

July 15 - 17, 1991

Bonn, West Germany

Acceptance Rates

Overall Acceptance Rate 395 of 838 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

77
Total Citations
View Citations
903
Total Downloads

Downloads (Last 12 months)115
Downloads (Last 6 weeks)21

Reflects downloads up to 18 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Verron T(2024)On the computation of Gröbner bases for matrix-weighted homogeneous systemsJournal of Symbolic Computation10.1016/j.jsc.2024.102327125:COnline publication date: 1-Nov-2024
https://dl.acm.org/doi/10.1016/j.jsc.2024.102327
Pickering Ldel Río Almajano TEngland MCohen K(2024)Explainable AI Insights for Symbolic Computation: A case study on selecting the variable ordering for cylindrical algebraic decompositionJournal of Symbolic Computation10.1016/j.jsc.2023.102276123(102276)Online publication date: Jul-2024
https://doi.org/10.1016/j.jsc.2023.102276
Morrow MNagel U(2024)Computing Gröbner bases and free resolutions of OI-modulesJournal of Algebra10.1016/j.jalgebra.2024.08.009Online publication date: Aug-2024
https://doi.org/10.1016/j.jalgebra.2024.08.009
Hartanto AOhara K(2024)Computing Gröbner Bases on the Weyl Algebras over Fields with ValuationsJournal of Algebra10.1016/j.jalgebra.2024.07.023Online publication date: Jul-2024
https://doi.org/10.1016/j.jalgebra.2024.07.023
del Río TEngland M(2024)Lessons on Datasets and Paradigms in Machine Learning for Symbolic Computation: A Case Study on CADMathematics in Computer Science10.1007/s11786-024-00591-018:3Online publication date: 11-Sep-2024
https://doi.org/10.1007/s11786-024-00591-0
Berušková JJureček MJurečková O(2024)Reducing overdefined systems of polynomial equations derived from small scale variants of the AES via data mining methodsJournal of Computer Virology and Hacking Techniques10.1007/s11416-024-00540-220:4(885-900)Online publication date: 30-Sep-2024
https://doi.org/10.1007/s11416-024-00540-2
Hashemi AMichael Möller H(2022)A new algorithm for computing staggered linear basesJournal of Symbolic Computation10.1016/j.jsc.2022.11.003Online publication date: Nov-2022
https://doi.org/10.1016/j.jsc.2022.11.003
Peifer DStillman MHalpern-Leistner DDaumé HSingh A(2020)Learning selection strategies in Buchberger's algorithmProceedings of the 37th International Conference on Machine Learning10.5555/3524938.3525640(7575-7585)Online publication date: 13-Jul-2020
https://dl.acm.org/doi/10.5555/3524938.3525640
Langeloh G(2020)A comparison of unrestricted dynamic Gröbner Basis algorithmsApplicable Algebra in Engineering, Communication and Computing10.1007/s00200-020-00449-5Online publication date: 13-Jul-2020
https://doi.org/10.1007/s00200-020-00449-5
Barkee BCeria MMoriarty TVisconti A(2020)Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failuresApplicable Algebra in Engineering, Communication and Computing10.1007/s00200-020-00428-wOnline publication date: 17-Apr-2020
https://doi.org/10.1007/s00200-020-00428-w
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Exploring the Dynamic Buchberger Algorithm

Applying IsRewritten criterion on Buchberger algorithm

Learning selection strategies in Buchberger's algorithm