Solving Polynomial Equation Systems
From MaRDI portal
Publication:3452876
DOI10.1017/CBO9781316271902zbMath1362.12001MaRDI QIDQ3452876
Publication date: 19 November 2015
free associative algebrasBuchberger's algorithmSAGBI basesOre extensionsinvolutive basesGröbner bases over ringsMacaulay's theoremcomprehensive Gröbner basesMöller's lifting theoremparametric polynomial idealspolynomial rings, Gröbner bases
Symbolic computation and algebraic computation (68W30) Computational aspects in algebraic geometry (14Qxx) Computational aspects and applications of commutative rings (13Pxx) Research exposition (monographs, survey articles) pertaining to field theory (12-02)
Related Items (19)
The close relation between border and Pommaret marked bases ⋮ Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra ⋮ Unnamed Item ⋮ Computing free non-commutative Gröbner bases over \(\mathbb{Z}\) with \textsc{Singular:Letterplace} ⋮ Signature Gröbner bases in free algebras over rings ⋮ Computing elements of certain form in ideals to prove properties of operators ⋮ An FGLM-like algorithm for computing the radical of a zero-dimensional ideal ⋮ Dynamics in multi-Lane TASEPs coupled with asymmetric lane-changing rates ⋮ A new algorithm for computing staggered linear bases ⋮ Standard bases over Euclidean domains ⋮ Unnamed Item ⋮ Recursive structures in involutive bases theory ⋮ Formal proofs of operator identities by a single formal computation ⋮ On the construction of staggered linear bases ⋮ Bar code for monomial ideals ⋮ A general framework for Noetherian well ordered polynomial reductions ⋮ Effective Buchberger-Zacharias-Weispfenning theory of skew polynomial extensions of subbilateral coherent rings ⋮ Zacharias representation of effective associative rings ⋮ HELP: a sparse error locator polynomial for BCH codes
This page was built for publication: Solving Polynomial Equation Systems
