scientific article

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Gröbner bases Petri nets polynomial ideals algorithmic construction

Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Ideals and multiplicative ideal theory in commutative rings (13A15)

Related Items (only showing first 100 items - show all)

A solution of the Cauchy problem for multidimensional discrete linear shift-invariant systems ⋮ A cubic system with eight small-amplitude limit cycles ⋮ On the complexity of computing Gröbner bases in characteristic 2 ⋮ An introduction to commutative and noncommutative Gröbner bases ⋮ Syzygies probing scattering amplitudes ⋮ Comments on the evaluation of massless scattering ⋮ Primeness of multivariate polynomial matrices ⋮ Buchberger's algorithm: The term rewriter's point of view ⋮ Deriving some new conditions on the existence of eight limit cycles for a cubic system ⋮ A note on linear Sperner families ⋮ Sets of convergent power series given by differential conditions ⋮ Computation of Hilbert-Poincaré series ⋮ Bounds for the postulation numbers of Hilbert functions ⋮ Gröbner bases and involutive methods for algebraic and differential equations ⋮ Review of symbolic software for Lie symmetry analysis ⋮ Gröbner bases of powers of ideals of maximal minors ⋮ A Gröbner basis criterion for birational equivalence of affine varieties ⋮ 2D systems feedback compensation: An approach based on commutative linear transformations ⋮ A refutational approach to geometry theorem proving ⋮ Survey on the theory and applications of \(\mu\)-bases for rational curves and surfaces ⋮ A novel method for analyzing enzyme kinetic systems ⋮ A Levenberg-Marquardt method for solving semi-symmetric tensor equations ⋮ A formal theory of matrix primeness ⋮ Implementation of the Painlevé test for ordinary differential systems ⋮ Indexed types ⋮ On the walk ⋮ Modular algorithms for computing Gröbner bases. ⋮ An algorithm for computing invariants of linear actions of algebraic groups up to a given degree. ⋮ Involutive bases of polynomial ideals ⋮ Minimal involutive bases ⋮ Application of Gröbner bases theory to derive rate equations for enzyme catalysed reactions with two or more substrates or products ⋮ A complete algorithm for counting real solutions of polynomial systems of equations and inequalities. ⋮ Limits of theory sequences over algebraically closed fields and applications. ⋮ The term orderings which are compatible with composition. II. ⋮ A holonomic systems approach to special functions identities ⋮ On superG-bases ⋮ Algebraic varieties characterizing matroids and oriented matroids ⋮ Some examples of the use of distances as coordinates for euclidean geometry ⋮ Computational algebraic geometry of projective configurations ⋮ On the number of term orders ⋮ Equations for the projective closure and effective Nullstellensatz ⋮ The membership problem for unmixed polynomial ideals is solvable in single exponential time ⋮ A new method for solving algebraic systems of positive dimension ⋮ Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring ⋮ Computing combinatorial decompositions of rings ⋮ A Gröbner basis criterion for isomorphisms of algebraic varieties ⋮ Algorithms for the Quillen-Suslin theorem ⋮ A computational model for algebraic power series ⋮ Application of ordered standard bases to catastrophe theory ⋮ A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic \(n\)-roots ⋮ Standard bases for general coefficient rings and a new constructive proof of Hilbert's basis theorem ⋮ A new notion of reduction: Generating universal Gröbner bases of ideals in \(K[x,y\)] ⋮ Symbolic parametrization of curves ⋮ Mechanical manipulation for a class of differential systems ⋮ The inverse of an automorphism in polynomial time ⋮ An algorithm for solving parametric linear systems ⋮ Three new algorithms for multivariate polynomial GCD ⋮ Algorithm for implicitizing rational parametric surfaces ⋮ Banded matrices with banded inverses ⋮ Irreducible decomposition of algebraic varieties via characteristic sets and Gröbner bases ⋮ Nonlinear reduction for solving deficient polynomial systems by continuation methods ⋮ On the reconstruction of polynomial automorphisms from their face polynomials ⋮ On the derivation and reduction of \(C^ 1\) trigonometric basis functions using Maple\(^{TM}\) ⋮ Comprehensive Gröbner bases ⋮ Computation of Hilbert functions ⋮ An approach to the zero recognition problem by Buchberger algorithm ⋮ Using Gröbner bases for detecting polynomial identities: A case study on Fermat's ideal ⋮ Solutions of systems of algebraic equations and linear maps on residue class rings ⋮ Analysis of approximate factorization algorithm. I ⋮ Automorphisms from face polynomials via two Gröbner bases ⋮ Implicitization of rational parametric equations ⋮ Gröbner bases and primary decomposition of modules ⋮ Notes on Gröbner bases ⋮ A note on observability tests for general polynomial and simple Wiener-Hammerstein systems ⋮ Minimum lag descriptions and minimal Gröbner bases ⋮ Examples of using dynamic constructible closure. ⋮ Homogeneity of integrability conditions for multi-parametric families of polynomial-nonlinear evolution equations. ⋮ Floating point Gröbner bases. ⋮ Computational ideal theory in finitely generated extension rings ⋮ Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey ⋮ A new efficient algorithm for computing Gröbner bases \((F_4)\) ⋮ A categorical critical-pair completion algorithm ⋮ A computational method for determining strong stabilizability of \(n\)-D systems ⋮ Computer algebra and algebraic geometry -- achievements and perspectives ⋮ On normal affine semigroups ⋮ Multivariate spline and algebraic geometry ⋮ Computing ideals of points ⋮ Automated resolution of singularities for hypersurfaces ⋮ A fast algorithm for Gröbner basis conversion and its applications ⋮ Global methods for solving systems of nonlinear algebraic equations ⋮ A new approach for finding all zeros for systems of nonlinear functions ⋮ An algorithm to obtain laws of families of filiform Lie algebras ⋮ Continuously parameterized symmetries and Buchberger's algorithm ⋮ Regular Gröbner bases ⋮ A new algorithm for discussing Gröbner bases with parameters. ⋮ Symmetry in planar dynamical systems ⋮ Computation of the solutions of nonlinear polynomial systems ⋮ Output feedback stabilizability and stabilization algorithms for 2D systems ⋮ Hilbert series of group representations and Gröbner bases for generic modules ⋮ Traveling wave solutions for nonlinear equations using symbolic computation

This page was built for publication: