A lattice formulation of the noncommutative F4 procedure
From MaRDI portal
Publication:4629508
DOI10.1142/S0218196718500613zbMath1417.06006MaRDI QIDQ4629508
Publication date: 27 March 2019
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Finite generation, finite presentability, normal forms (diamond lemma, term-rewriting) (16S15) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects of associative rings (general theory) (16Z05) Lattices (06B99) Software, source code, etc. for problems pertaining to ordered structures (06-04)
Related Items (1)
Cites Work
- Computing inhomogeneous Gröbner bases
- The diamond lemma for ring theory
- Confluence and Koszulity
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- An introduction to commutative and noncommutative Gröbner bases
- Computing Gröbner bases by FGLM techniques in a non-commutative setting
- Convergent presentations and polygraphic resolutions of associative algebras
- Projective resolutions of associative algebras and ambiguities.
- Reduction operators and completion of rewriting systems
- Efficiently computing minimal sets of critical pairs
- On the Homology of Associative Algebras
- Gröbner bases of associative algebras and the Hochschild cohomology
- Koszul Resolutions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A lattice formulation of the noncommutative F4 procedure
