Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings
From MaRDI portal
(Redirected from Publication:1275014)
Recommendations
Cites work
- scientific article; zbMATH DE number 4132298 (Why is no real title available?)
- scientific article; zbMATH DE number 988810 (Why is no real title available?)
- scientific article; zbMATH DE number 4077463 (Why is no real title available?)
- scientific article; zbMATH DE number 3654376 (Why is no real title available?)
- scientific article; zbMATH DE number 67424 (Why is no real title available?)
- scientific article; zbMATH DE number 194089 (Why is no real title available?)
- scientific article; zbMATH DE number 3563392 (Why is no real title available?)
- scientific article; zbMATH DE number 3574107 (Why is no real title available?)
- scientific article; zbMATH DE number 1241626 (Why is no real title available?)
- scientific article; zbMATH DE number 1263328 (Why is no real title available?)
- scientific article; zbMATH DE number 1263406 (Why is no real title available?)
- scientific article; zbMATH DE number 534859 (Why is no real title available?)
- scientific article; zbMATH DE number 1051238 (Why is no real title available?)
- scientific article; zbMATH DE number 789389 (Why is no real title available?)
- scientific article; zbMATH DE number 4196114 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- A finite Thue system with decidable word problem and without equivalent finite canonical system
- A generalization of Gröbner basis algorithms to nilpotent group rings
- A generalization of Gröbner basis algorithms to polycyclic group rings
- A note on a special one-rule semi-Thue system
- About the descriptive power of certain classes of finite string-rewriting systems
- An algorithm for constructing Gröbner and free Schreier bases in free group algebras
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- An introduction to commutative and noncommutative Gröbner bases
- Analogs of Gröbner bases in polynomial rings over a ring
- Computing presentations for subgroups of polycyclic groups and of context-free groups
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Non-commutative Gröbner bases in algebras of solvable type
- On a special monoid with a single defining relation
- Prefix-rewriting on context-free groups
- Presentations of groups and monoids
- Undecidable questions related to Church-Rosser Thue systems
- Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence
- Word problems and a homological finiteness condition for monoids
Cited in
(13)- Reduction relations for monoid semirings
- Regular Gröbner bases
- NONCOMMUTATIVE GRÖBNER BASES FOR THE COMMUTATOR IDEAL
- Gröbner-Shirshov bases for some braid groups.
- Geometric intersections of loops on surfaces
- Free operated monoids and rewriting systems
- Weight ideals associated to regular and log-linear arrays.
- Gröbner bases of associative algebras and the Hochschild cohomology
- For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide
- The Mal'cev lemma and rewriting on semirings
- Gröbner basis cryptosystems
- Rewriting as a special case of non-commutative Gröbner basis theory
- Computing Gröbner bases by FGLM techniques in a non-commutative setting
This page was built for publication: Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1275014)
