Computing Gröbner bases by FGLM techniques in a non-commutative setting

DOI10.1006/JSCO.1999.0415MaRDI QIDQ1588032zbMATHOpenAlexFDO

Authors Miguel Angel Borges-Trenard, Mijail Borges-Quintana, Ferdinando Mora

Publication date 17 July 2002

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/4758341533318ea4e6a0f285197443f18c7ca073

zbMATH Keywords

algorithmsfinitely generated free algebrastwisted semigroup ringsGröbner bases

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) Ideals in associative algebras (16D25) Ordinary and skew polynomial rings and semigroup rings (16S36) Computational aspects of associative rings (general theory) (16Z05) Associative rings determined by universal properties (free algebras, coproducts, adjunction of inverses, etc.) (16S10)

Recommendations

• scientific article; zbMATH DE number 4077463
• scientific article; zbMATH DE number 5055021
• An introduction to commutative and noncommutative Gröbner bases
• Modular techniques for noncommutative Gröbner bases
• One-sided noncommutative Gröbner bases with applications to computing Green's relations

Cites work

• scientific article; zbMATH DE number 4132308 (Why is no real title available?)
• scientific article; zbMATH DE number 1241621 (Why is no real title available?)
• scientific article; zbMATH DE number 1262445 (Why is no real title available?)
• scientific article; zbMATH DE number 1120551 (Why is no real title available?)
• scientific article; zbMATH DE number 1163421 (Why is no real title available?)
• scientific article; zbMATH DE number 1163430 (Why is no real title available?)
• scientific article; zbMATH DE number 1163442 (Why is no real title available?)
• scientific article; zbMATH DE number 939821 (Why is no real title available?)
• An algorithm for the construction of matrix representations for finitely presented non-commutative algebras
• An introduction to commutative and noncommutative Gröbner bases
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points
• Non-commutative Gröbner bases in algebras of solvable type
• Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings

Cited in

(16)

• Computing Gröbner bases associated with lattices
• Degröbnerization: a political manifesto
• scientific article; zbMATH DE number 1241625 (Why is no real title available?)
• The Big Mother of all Dualities: Möller Algorithm
• A lattice formulation of the noncommutative \(F_4\) procedure
• Gröbner bases and combinatorics for binary codes
• Gröbner basis techniques in the computation of two-sided syzygies.
• Complexity of Gröbner basis detection and border basis detection
• The symmetric group given by a Gröbner basis
• Non-commutative computer algebra and molecular computing
• On FGLM algorithms with tropical Gröbner bases
• On a Gröbner bases structure associated to linear codes
• FGb: A Library for Computing Gröbner Bases
• One-sided noncommutative Gröbner bases with applications to computing Green's relations
• PROPERTIES OF COMMUTATIVE ASSOCIATION SCHEMES DERIVED BY FGLM TECHNIQUES
• Finite Gröbner bases in infinite dimensional polynomial rings and applications

This page was built for publication: Computing Gröbner bases by FGLM techniques in a non-commutative setting

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