Size of coefficients of lexicographical Gröbner bases: the zero-dimensional, radical and bivariate case

DOI10.1145/1576702.1576721zbMATH Open1237.13003OpenAlexW1967539303MaRDI QIDQ2883808FDOQ2883808

Authors: Xavier Dahan 

Publication date: 13 May 2012

Published in: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1576702.1576721

Recommendations

• On the Bit-Size of Non-radical Triangular Sets
• Nullstellensätze for zero-dimensional Gröbner bases
• scientific article; zbMATH DE number 4069044
• Modular algorithms for computing Gröbner bases.
• Sharper complexity bounds for zero-dimensional Gröbner bases and polynomial system solving

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Software, source code, etc. for problems pertaining to commutative algebra (13-04)

Cited In (5)

• An application of regular chain theory to the study of limit cycles
• On W-characteristic sets of lexicographic Gröbner bases
• p-adic algorithm for bivariate Gröbner bases
• Chinese Remainder Theorem for bivariate lexicographic Gröbner bases
• An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases

Uses Software

• FGb
• RegularChains

This page was built for publication: Size of coefficients of lexicographical Gröbner bases: the zero-dimensional, radical and bivariate case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883808)