scientific article; zbMATH DE number 217454
From MaRDI portal
Publication:4693774
zbMath0772.13010MaRDI QIDQ4693774
Volker Weispfenning, Thomas M. Becker
Publication date: 27 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Nonlinear algebraic or transcendental equations (65H99) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to commutative algebra (13-01)
Related Items (only showing first 100 items - show all)
Alexander invariants of complex hyperplane arrangements ⋮ Automatic classification of normal forms ⋮ Polynomial selection for computing Gröbner bases ⋮ Symideal Gröbner bases ⋮ On the complexity of the integral closure ⋮ Gröbner bases of associative algebras and the Hochschild cohomology ⋮ The affine sieve ⋮ Gröbner bases of neural ideals ⋮ Buchberger's algorithm: A constraint-based completion procedure ⋮ GRIN: An implementation of Gröbner bases for integer programming ⋮ Group-like small cancellation theory for rings ⋮ The invertibility of rational univariate representations ⋮ A Direttissimo Algorithm for Equidimensional Decomposition ⋮ Effective algebraic independence of values of \(E\)-functions ⋮ Iterative roots of two-dimensional mappings ⋮ A signature-based algorithm for computing the nondegenerate locus of a polynomial system ⋮ What Does Qualitative Spatial Knowledge Tell About Origami Geometric Folds? ⋮ Poisson and symplectic reductions of 4–DOF isotropic oscillators. The van der Waals system as benchmark ⋮ Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties ⋮ A technique to reduce memory usage of M4GB algorithm ⋮ Cup-length of oriented Grassmann manifolds via Gröbner bases ⋮ Axioms for a theory of signature bases ⋮ \textsc{Rings}: an efficient Java/Scala library for polynomial rings ⋮ A model for analyzing phenomena in multicellular organisms with multivariable polynomials: Polynomial life ⋮ On the computation of the Galois group of linear difference equations ⋮ Relative generalized Hamming weights of evaluation codes ⋮ Unnamed Item ⋮ Effective Algebraic Analysis Approach to Linear Systems over Ore Algebras ⋮ Algebraic Modelling of Covering Arrays ⋮ Associated prime ideals over skew PBW extensions ⋮ Skew Poincaré–Birkhoff–Witt extensions over weak compatible rings ⋮ Normal Form Analysis of ℤ2-Equivariant Singularities ⋮ IDEALS OF MINORS DEFINING GENERIC SINGULARITIES AND THEIR GRöBNER BASES ⋮ Basic Module Theory over Non-commutative Rings with Computational Aspects of Operator Algebras ⋮ Time-delay interferometry ⋮ Thurston’s spinning construction and solutions to the hyperbolic gluing equations for closed hyperbolic 3–manifolds ⋮ Monomial bases and pre-Lie structure for free Lie algebras ⋮ Nonlinear Consensus on Networks: Equilibria, Effective Resistance, and Trees of Motifs ⋮ Using Galois ideals for computing relative resolvents ⋮ Counting and Gröbner bases ⋮ An implicitization algorithm for rational surfaces with no base points ⋮ Time-delay interferometry ⋮ Irreducible ideals of finitely generated commutative monoids ⋮ Gröbner bases over Galois rings with an application to decoding alternant codes ⋮ A Gröbner free alternative for polynomial system solving ⋮ Unnamed Item ⋮ Algebraic structure of quasicyclic codes ⋮ Reparameterization of Curves and Surfaces with Respect to Their Convolution ⋮ A general framework to build contextual cover set induction provers ⋮ Recognizing the symmetry type of O. D. E. s ⋮ An Efficient $$F_4$$ -style Based Algorithm to Solve MQ Problems ⋮ On the Complexity of Linear Algebra Operations over Algebraic Extension Fields ⋮ Effective Algorithm for Computing Noetherian Operators of Positive Dimensional Ideals ⋮ Re-filtering and exactness of the Gelfand-Kirillov dimension ⋮ An algorithmic approach to Schmüdgen's Positivstellensatz ⋮ Two applications of analytic functors ⋮ On the complexity of computing Gröbner bases for weighted homogeneous systems ⋮ Cylinders Through Five Points: Complex and Real Enumerative Geometry ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Ideal membership in polynomial rings over the integers ⋮ An algebraic study of multivariable integration and linear substitution ⋮ Effective Set Membership in Computer Algebra and Beyond ⋮ Unnamed Item ⋮ Generalized Integral Dependence Relations ⋮ Z 2 -equivariant standard bases for submodules associated with Z 2 -equivariant singularities ⋮ Polynomial selection of <i>F</i><sub>4</sub> for solving the MQ problem ⋮ Effective approximation of the solutions of algebraic equations ⋮ Polly cracker, revisited ⋮ On the complexity of computing Gröbner bases in characteristic 2 ⋮ Simplification of nested real radicals revisited ⋮ Testing binomiality of chemical reaction networks using comprehensive Gröbner systems ⋮ First order perturbation and local stability of parametrized systems ⋮ Conditions for polynomial Liénard centers ⋮ Role of involutive criteria in computing Boolean Gröbner bases ⋮ Computing generating sets of lattice ideals and Markov bases of lattices ⋮ Decomposition of algebraic sets and applications to weak centers of cubic systems ⋮ Blending implicit interval curves and surfaces ⋮ Computer algebra for guaranteed accuracy. How does it help? ⋮ Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs ⋮ Representing and solving finite-domain constraint problems using systems of polynomials ⋮ Two computational techniques for singularity resolution ⋮ Commutative algebra in the Mizar system ⋮ A new proof for the correctness of the F5 algorithm ⋮ Polynomial equation solving by lifting procedures for ramified fibers ⋮ Maximization principles for frequency-dependent selection. II: The one-locus multiallele case ⋮ Extended \(F_5\) criteria ⋮ Gröbner bases for polynomial systems with parameters ⋮ F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases ⋮ Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases ⋮ On the determination of cusp points of 3-RPR parallel manipulators ⋮ Formal Laurent series in several variables ⋮ An improved algorithm for deciding semi-definite polynomials ⋮ Symbolic powers of planar point configurations. II. ⋮ Isochronicity conditions for some planar polynomial systems ⋮ Artificial discontinuities of single-parametric Gröbner bases ⋮ W-Gröbner basis and monomial ideals under polynomial composition ⋮ Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case ⋮ A note on determine the greatest common subfamily of two NFSRs by Gröbner basis ⋮ Discussion on polynomials having polynomial iterative roots
This page was built for publication: