Strong Gröbner bases and linear algebra in multivariate polynomial rings over Euclidean domains
From MaRDI portal
Publication:6656077
DOI10.1016/J.EXMATH.2024.125627MaRDI QIDQ6656077
Publication date: 2 January 2025
Published in: Expositiones Mathematicae (Search for Journal in Brave)
Cites Work
- 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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Effective computation of strong Gröbner bases over Euclidean domains
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- On the D-bases of polynomial ideals over principal ideal domains
- Finiteness of the odd perfect and primitive abundant numbers with \(n\) distinct prime factors.
- On a problem of formal logic.
- Dickson's lemma, Higman's theorem and beyond: a survey of some basic results in order theory
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Applications of strong Grobner bases over Euclidean domains
- Transfinitely valued Euclidean domains have arbitrary indecomposable order type
This page was built for publication: Strong Gröbner bases and linear algebra in multivariate polynomial rings over Euclidean domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6656077)