Computing coupled border bases

DOI10.1007/S11786-020-00452-6MaRDI QIDQ2183743zbMATH OpenOpenAlexFDO

Authors Amir Hashemi, Martin Kreuzer, Samira Pourkhajouei

Publication date 27 May 2020

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11786-020-00452-6

zbMATH Keywords

polynomial ringborder basisorder idealterm orderingsyzygy moduleGröbner basis

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)

Recommendations

• Computing border bases
• Computing border bases without using a term ordering
• Toric border basis
• Computing border bases using mutant strategies
• Characterizations of border bases

Cites work

• scientific article; zbMATH DE number 3649988 (Why is no real title available?)
• scientific article; zbMATH DE number 4076472 (Why is no real title available?)
• scientific article; zbMATH DE number 1273641 (Why is no real title available?)
• scientific article; zbMATH DE number 1504686 (Why is no real title available?)
• scientific article; zbMATH DE number 1515218 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• scientific article; zbMATH DE number 2206382 (Why is no real title available?)
• scientific article; zbMATH DE number 5052246 (Why is no real title available?)
• A Polyhedral Characterization of Border Bases
• A new framework for computing Gröbner bases
• A new incremental algorithm for computing Groebner bases
• A signature-based algorithm for computing Gröbner bases in solvable polynomial algebras
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• An elementary construction of the multigraded Hilbert scheme of points
• Approximate commutative algebra
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• Characterizations of border bases
• Computing border bases
• Computing border bases without using a term ordering
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
• Generalized normal forms and polynomial system solving
• Gröbner bases for syzygy modules of border bases
• Numerical Polynomial Algebra
• On the last fall degree of zero-dimensional Weil descent systems
• Stable normal forms for polynomial system solving
• Using Algebraic Geometry

Cited in

(6)

• Computing border bases without using a term ordering
• Computing border bases using mutant strategies
• A Polyhedral Characterization of Border Bases
• Computing border bases
• CoupledBorderBases.mpl
• Computing subschemes of the border basis scheme

Describes a project that uses

Uses Software

• ClassicBorderBases.mpl
• F5C
• ApCoCoA
• Maple
• CoCoA

This page was built for publication: Computing coupled border bases

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