Computing free non-commutative Gröbner bases over \(\mathbb{Z}\) with \textsc{Singular:Letterplace}
From MaRDI portal
Publication:2674006
DOI10.1016/j.jsc.2022.08.007OpenAlexW4289932428WikidataQ113869791 ScholiaQ113869791MaRDI QIDQ2674006
Viktor Levandovskyy, Karim Abou Zeid, Tobias Metzlaff
Publication date: 22 September 2022
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2022.08.007
Algorithms in computer science (68Wxx) Computational aspects and applications of commutative rings (13Pxx) Computational aspects of associative rings (16Zxx)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Effective computation of strong Gröbner bases over Euclidean domains
- The ideal membership problem in non-commutative polynomial rings
- Letterplace ideals and non-commutative Gröbner bases.
- The diamond lemma for ring theory
- An introduction to commutative and noncommutative Gröbner bases
- Computational ideal theory in finitely generated extension rings
- Skew polynomial rings, Gröbner bases and the letterplace embedding of the free associative algebra.
- Standard bases over Euclidean domains
- Constructive arithmetics in Ore localizations enjoying enough commutativity
- Efficient Gröbner bases computation over principal ideal rings
- Gröbner bases with coefficients in rings
- On noncommutative finite factorization domains
- Enhanced computations of gröbner bases in free algebras as a new application of the letterplace paradigm
- Algebras Defined by Monic Gr\"obner Bases over Rings
- Solving Polynomial Equation Systems
- Parametric Solvable Polynomial Rings and Applications
- Letterplace
- Computation of free non-commutative gröbner bases over Z with Singular:Letterplace
- Extended letterplace correspondence for nongraded noncommutative ideals and related algorithms
