A lattice formulation of the noncommutative F₄ procedure
DOI10.1142/S0218196718500613zbMATH Open1417.06006MaRDI QIDQ4629508FDOQ4629508
Authors: Cyrille Chenavier 
Publication date: 27 March 2019
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Recommendations
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects of associative rings (general theory) (16Z05) Finite generation, finite presentability, normal forms (diamond lemma, term-rewriting) (16S15) Lattices (06B99) Software, source code, etc. for problems pertaining to ordered structures (06-04)
Cites Work
- Title not available (Why is that?)
- An introduction to commutative and noncommutative Gröbner bases
- On the Homology of Associative Algebras
- The diamond lemma for ring theory
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Title not available (Why is that?)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Confluence and Koszulity
- Koszul Resolutions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing Gröbner bases by FGLM techniques in a non-commutative setting
- Reduction operators and completion of rewriting systems
- Efficiently computing minimal sets of critical pairs
- Computing inhomogeneous Gröbner bases
- Projective resolutions of associative algebras and ambiguities.
- Gröbner bases of associative algebras and the Hochschild cohomology
- Convergent presentations and polygraphic resolutions of associative algebras
Cited In (1)
This page was built for publication: A lattice formulation of the noncommutative \(F_4\) procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629508)
