Solving polynomial equation systems. Vol. IV. Buchberger theory and beyond
DOI10.1017/CBO9781316271902zbMATH Open1362.12001MaRDI QIDQ3452876FDOQ3452876
Authors: Ferdinando Mora 
Publication date: 19 November 2015
Recommendations
involutive basesOre extensionsfree associative algebrasBuchberger's algorithmMacaulay's theoremSAGBI basescomprehensive Gröbner basesGröbner bases over ringsMöller's lifting theoremparametric polynomial idealspolynomial rings, Gröbner bases
Symbolic computation and algebraic computation (68W30) Computational aspects and applications of commutative rings (13Pxx) Computational aspects in algebraic geometry (14Qxx) Research exposition (monographs, survey articles) pertaining to field theory (12-02)
Cited In (32)
- Effective Buchberger-Zacharias-Weispfenning theory of skew polynomial extensions of subbilateral coherent rings
- De nugis Groebnerialium. IV: Zacharias, Spears, Möller
- Title not available (Why is that?)
- Signature Gröbner bases in free algebras over rings
- Continuously parameterized symmetries and Buchberger's algorithm
- A generalization of Gröbner basis algorithms to nilpotent group rings
- Computing elements of certain form in ideals to prove properties of operators
- Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra
- Review of "Numerically Solving Polynomial Systems with Bertini" by Daniel J. Bates, Jonathan D. Hauenstein, Andrew J. Sommese, and Charles W. Wampler
- Standard bases over Euclidean domains
- The close relation between border and Pommaret marked bases
- Zacharias representation of effective associative rings
- Formal proofs of operator identities by a single formal computation
- Computing free non-commutative Gröbner bases over \(\mathbb{Z}\) with \textsc{Singular:Letterplace}
- An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
- A new algorithm for computing staggered linear bases
- Title not available (Why is that?)
- Recursive structures in involutive bases theory
- Oracle-supported drawing of the Gröbner \textit{escalier}
- HELP: a sparse error locator polynomial for BCH codes
- Bar code and Janet-like division
- Title not available (Why is that?)
- How to Automatise Proofs of Operator Statements: Moore–Penrose Inverse; A Case Study
- On Buchberger's method of solving systems of algebraic equations
- Dynamics in multi-Lane TASEPs coupled with asymmetric lane-changing rates
- Title not available (Why is that?)
- A general framework for Noetherian well ordered polynomial reductions
- Short proofs of ideal membership
- On the construction of staggered linear bases
- Solving polynomial equation systems. Vol. III: Algebraic solving
- Bar code for monomial ideals
- Buchberger-Zacharias theory of multivariate Ore extensions
This page was built for publication: Solving polynomial equation systems. Vol. IV. Buchberger theory and beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452876)
