An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal

zbMATH Open1245.13020MaRDI QIDQ2902935FDOQ2902935

Publication date: 23 August 2012

Full work available at URL: http://www.risc.jku.at/people/buchberg/papers/1965-00-00-A.pdf

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Cited In (only showing first 100 items - show all)

The geometric spectrum of a graph and associated curvatures
Some examples for solving systems of algebraic equations by calculating Gröbner bases
Gröbner-Shirshov bases for Vinberg-Koszul-Gerstenhaber right-symmetric algebras
Editorial: Symbolic computation and satisfiability checking
On infinite Gröbner bases in free algebras
Gröbner bases and Diophantine analysis
Constructions of standard bases of right \(K\langle A\rangle\)- modules
Boolean ring cryptographic equation solving
Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints
Gröbner bases in function rings -- a guide for introducing reduction relations to algebraic structures
Computing dimension and independent sets for polynomial ideals
Gröbner-Shirshov bases and PBW theorems
Combinatorial dimension theory of algebraic varieties
Testing binomiality of chemical reaction networks using comprehensive Gröbner systems
Extended parallelism in the Gröbner basis algorithm
The concept of Gröbner algebras
On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals
Algebraic theory of linear systems: a survey
A shuffle argument secure in the generic model
Computing the algebraic relations of \(C\)-finite sequences and multisequences
Syzygies probing scattering amplitudes
A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications
Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra
Efficient Gröbner bases computation over principal ideal rings
Involutive method for computing Gröbner bases over \(\mathbb F_2\)
An algebraic attack on rank metric code-based cryptosystems
Computing coupled border bases
Efficiently and effectively recognizing toricity of steady state varieties
Algorithmic reduction of biological networks with multiple time scales
A Gröbner basis algorithm for ideals over zero-dimensional valuation rings
A solution to Kronecker's problem
On the walk
An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
Computing border bases using mutant strategies
On ideal lattices, Gröbner bases and generalized hash functions
Finite complete rewriting systems and the complexity of word problem
A polynomial model for logics with a prime power number of truth values
On the exact values of coefficients of coiflets
Verification of Hybrid Systems
Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings
Gröbner bases of associative algebras and the Hochschild cohomology
Gröbner-Shirshov basis for degenerate Ringel-Hall algebra of type \(D_4\)
Gröbner-Shirshov bases of irreducible modules over the quantum group \(U_q(F_4)\)
Gröbner-Shirshov bases of the generalized Bruck-Reilly \(*\)-extension.
Gröbner-Shirshov bases of some Weyl groups
Methodologies of Symbolic Computation
Cryptanalysis of the extension field cancellation cryptosystem
Maurice Janet's algorithms on systems of linear partial differential equations
Some results on Gröbner bases over commutative rings
A dynamic F4 algorithm to compute Gröbner bases
A Note on Dynamic Gröbner Bases Computation
Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm
Confluence of algebraic rewriting systems
On the computation of generalized standard bases
The big mother of all dualities. 2: Macaulay bases
Gröbner-Shirshov bases for congruence classes of complex reflection groups
History and basic features of the critical-pair/completion procedure
Computing restrictions of ideals in finitely generated \(k\)-algebras by means of Buchberger's algorithm
Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm
Methods for computing in algebraic geometry and commutative algebra
Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
The decision of prime and primary ideal
Markov and Artin Normal Form Theorem for Braid Groups∗
Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures
Ideal-specific elimination orders form a star-shaped region
Simulating Buchberger's algorithm by Knuth-Bendix completion
Buchberger-Zacharias theory of multivariate Ore extensions
A Variant of the F4 Algorithm
Sparsity optimized high order finite element functions for \(H(\mathrm{curl})\) on tetrahedra
Constructions of free commutative integro-differential algebras
Standard bases, critical tropisms and flatness
On an installation of Buchberger's algorithm
Prony's method in several variables
On the Computation of Elimination Ideals of Boolean Polynomial Rings
Efficiently computing minimal sets of critical pairs
The \(\mathfrak {sl}_{3}\) Jones polynomial of the trefoil: a case study of \(q\)-holonomic sequences
Noetherian Properties of Skew Polynomial Rings with Binomial Relations
On an implementation of standard bases and syzygies in SINGULAR
Third order integrability conditions for homogeneous potentials of degree \(-1\)
On the theory of graded structures
Iterative roots of two-dimensional mappings
Gröbner bases of symmetric ideals
Computation of Hilbert functions
A Groebner Bases Based Many-Valued Modal Logic Implementation in Maple
Gröbner bases, H-bases and interpolation
Buchberger's algorithm: a constraint-based completion procedure
Gröbner-Shirshov basis for the braid group in the Birman-Ko-Lee generators.
An analysis of inhomogeneous signature-based Gröbner basis computations
Gröbner-Shirshov bases for some braid groups.
Gröbner-Shirshov basis of the Adyan extension of the Novikov group.
A generalization of reduction rings
Composition-diamond lemma for associative conformal algebras.
Some combinatorial applications of Gröbner bases
Computation of blowing up centers
Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups.
New constructive methods in classical ideal theory
On the relation between the MXL family of algorithms and Gröbner basis algorithms
Dynamical Gröbner bases
\textit{Theorema}: Towards computer-aided mathematical theory exploration
Computational ideal theory in finitely generated extension rings

This page was built for publication: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2902935)