Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
From MaRDI portal
Publication:2457345
DOI10.1016/j.jsc.2005.09.007zbMath1158.01307OpenAlexW2004746351MaRDI QIDQ2457345
Publication date: 23 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2005.09.007
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Collected or selected works; reprintings or translations of classics (01A75) History of computer science (68-03)
Related Items (only showing first 100 items - show all)
CONSTRUCTING FULL BLOCK TRIANGULAR REPRESENTATIONS OF ALGEBRAS ⋮ Methods of constructive category theory ⋮ Unnamed Item ⋮ الگوریتمی برای محاسبه ی ایده آل های مرتب نقاط و کاربردهای آن در مدل های زیست شناسی ⋮ Monomial bases for the primitive complex Shephard groups of rank three ⋮ Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography ⋮ Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism ⋮ On the May spectral sequence at the prime 2 ⋮ Universal Analytic Gröbner Bases and Tropical Geometry ⋮ From Polynomial Invariants to Linear Loops ⋮ Gröbner bases plugged into graphical skills to solve a set of multiple bifurcation equations in structural compound stability problems ⋮ Gröbner–Shirshov bases for Temperley–Lieb algebras of types B and D ⋮ Algebraic computation of genetic patterns related to three-dimensional evolution algebras ⋮ Some reflections about the success and bibliographic impact of the dynamic geometry system \textit{GeoGebra} ⋮ Learning a performance metric of Buchberger's algorithm ⋮ An efficient method of finding new symplectic schemes for Hamiltonian mechanics problems with the aid of parametric Gröbner bases ⋮ Two-sided noncommutative Gröbner basis on quiver algebras ⋮ Axioms for a theory of signature bases ⋮ Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition ⋮ Can I bring my calculator to the exam? Some reflections on the abstraction level of computer algebra systems ⋮ A new algorithm for computing staggered linear bases ⋮ Feynman integral reduction using Gröbner bases ⋮ On the complexity of solving generic overdetermined bilinear systems ⋮ Counting solutions of a polynomial system locally and exactly ⋮ Automated triangle constructions in hyperbolic geometry ⋮ The pro-supersolvable topology on a free group: deciding denseness ⋮ Effective Algebraic Analysis Approach to Linear Systems over Ore Algebras ⋮ The Number of Gröbner Bases in Finite Fields (Research) ⋮ On rings of differential Rota–Baxter operators ⋮ homalg – A META-PACKAGE FOR HOMOLOGICAL ALGEBRA ⋮ Algebraic Modelling of Covering Arrays ⋮ Reduced Gröbner bases and Macaulay-Buchberger basis theorem over Noetherian rings ⋮ Computing all border bases for ideals of points ⋮ Aligator: A Mathematica Package for Invariant Generation (System Description) ⋮ Semi-ring Based Gröbner–Shirshov Bases over a Noetherian Valuation Ring ⋮ From Analytical Mechanics Problems to Rewriting Theory Through M. Janet’s Work ⋮ Noncommutative Gröbner Bases: Applications and Generalizations ⋮ AN AXIOMATIC SETUP FOR ALGORITHMIC HOMOLOGICAL ALGEBRA AND AN ALTERNATIVE APPROACH TO LOCALIZATION ⋮ Graphs of relations and Hilbert series. ⋮ Computation of bases of free modules over the Weyl algebras. ⋮ Gröbner bases and the number of Latin squares related to autotopisms of order \(\leq 7\) ⋮ Minimal polynomial systems for parametric matrices ⋮ On the construction of staggered linear bases ⋮ Gröbner bases for syzygy modules of border bases ⋮ Unnamed Item ⋮ Numerical Instability of Resultant Methods for Multidimensional Rootfinding ⋮ The syzygy theorem for Bézout rings ⋮ Normal forms in braid groups with respect to some Gröbner–Shirshov basis ⋮ Computing H-bases via minimal bases for syzygy modules ⋮ Standard monomials for the Weyl group F4 ⋮ $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation ⋮ Need Polynomial Systems Be Doubly-Exponential? ⋮ Improved Computation of Involutive Bases ⋮ The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree ⋮ A Note on Dynamic Gröbner Bases Computation ⋮ A computational algebraic geometry approach to enumerate Malcev magma algebras over finite fields ⋮ An algebraic study of multivariable integration and linear substitution ⋮ G-expected utility maximization with ambiguous equicorrelation ⋮ Gröbner-Shirshov Bases for Exceptional Lie Superalgebras ⋮ The Cyclicity of a Cubic System ⋮ APPLYING BUCHBERGER'S CRITERIA FOR COMPUTING GRÖBNER BASES OVER FINITE-CHAIN RINGS ⋮ AN APPLICATION OF REGULAR CHAIN THEORY TO THE STUDY OF LIMIT CYCLES ⋮ On a Lyapunov equation for polynomial continuous-time systems ⋮ On polynomial vector fields having a given affine variety as attractive and invariant set: application to robotics ⋮ Rewriting modulo isotopies in pivotal linear \((2,2)\)-categories ⋮ Random sampling in computational algebra: Helly numbers and violator spaces ⋮ Estimating the number of tetrahedra determined by volume, circumradius and four face areas using Groebner basis ⋮ Gröbner systems conversion ⋮ Noether normalization guided by monomial cone decompositions ⋮ Letterplace ideals and non-commutative Gröbner bases. ⋮ Efficient computation of dual space and directional multiplicity of an isolated point ⋮ Gröbner bases and cocyclic Hadamard matrices ⋮ On evaluation codes coming from a tower of function fields ⋮ Infinite orders and non-\(D\)-finite property of 3-dimensional lattice walks ⋮ A Groebner bases-based approach to backward reasoning in rule based expert systems ⋮ Recent progress in an algebraic analysis approach to linear systems ⋮ Certified numerical real root isolation for bivariate nonlinear systems ⋮ Some enumeration problems on central configurations at the bifurcation points ⋮ Parameter identifiability for nonlinear LPV models ⋮ Geometric intersections of loops on surfaces ⋮ Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic ⋮ Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm ⋮ Generating semi-algebraic invariants for non-autonomous polynomial hybrid systems ⋮ Finding multiple Nash equilibria via machine learning-supported Gröbner bases ⋮ Grade filtration of linear functional systems. ⋮ Computing coupled border bases ⋮ A signature based border basis algorithm ⋮ A Gröbner bases-based rule based expert system for fibromyalgia diagnosis ⋮ Resultant elimination via implicit equation interpolation ⋮ Transforming problems from analysis to algebra: a case study in linear boundary problems ⋮ On the relation between the MXL family of algorithms and Gröbner basis algorithms ⋮ A logic approach to decision taking in a railway interlocking system using Maple ⋮ A new algebraic model for implementing expert systems represented under the `concept-attribute-value' paradigm ⋮ Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity ⋮ Cyclotomic Hecke algebras of \(G(r,p,n)\). ⋮ Triangularizing kinematic constraint equations using Gröbner bases for real-time dynamic simulation ⋮ Standard bases over Euclidean domains ⋮ The F\(_{4}\)-algorithm for Euclidean rings ⋮ Solving a binary puzzle ⋮ Shattering-extremal set systems of small VC-dimension
Cites Work
This page was built for publication: Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
