Computing Gröbner bases by FGLM techniques in a non-commutative setting
DOI10.1006/JSCO.1999.0415zbMATH Open0996.16033OpenAlexW2095573084MaRDI QIDQ1588032FDOQ1588032
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
Recommendations
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)
Cites Work
- An introduction to commutative and noncommutative Gröbner bases
- Title not available (Why is that?)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- 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
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings
- An algorithm for the construction of matrix representations for finitely presented non-commutative algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (16)
- On FGLM algorithms with tropical Gröbner bases
- One-sided noncommutative Gröbner bases with applications to computing Green's relations
- Title not available (Why is that?)
- Complexity of Gröbner basis detection and border basis detection
- On a Gröbner bases structure associated to linear codes
- The symmetric group given by a Gröbner basis
- Finite Gröbner bases in infinite dimensional polynomial rings and applications
- PROPERTIES OF COMMUTATIVE ASSOCIATION SCHEMES DERIVED BY FGLM TECHNIQUES
- FGb: A Library for Computing Gröbner Bases
- 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.
- Non-commutative computer algebra and molecular computing
- Degröbnerization: a political manifesto
- Computing Gröbner bases associated with lattices
- The Big Mother of all Dualities: Möller Algorithm
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)