Involutive bases of polynomial ideals
From MaRDI portal
Publication:1404736
DOI10.1016/S0378-4754(97)00127-4zbMath1017.13500arXivmath/9912027OpenAlexW2051046060WikidataQ56689511 ScholiaQ56689511MaRDI QIDQ1404736
Yu. A. Blinkov, Vladimir P. Gerdt
Publication date: 21 August 2003
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9912027
Gröbner basesComputer algebraBuchberger's chain criterionInvolutive algorithmInvolutive basesInvolutive monomial divisionPolynomial idealsPolynomial reduction
Symbolic computation and algebraic computation (68W30) Computational aspects and applications of commutative rings (13P99)
Related Items
A strongly-consistent difference scheme for 3D nonlinear Navier-Stokes equations, The close relation between border and Pommaret marked bases, Algebraic Theory of Linear Systems: A Survey, Compact representation of polynomials for algorithms for computing Gröbner and involutive bases, Involutive method for computing Gröbner bases over \(\mathbb F_2\), Efficiency estimate for distributed computation of Gröbner bases and involutive bases, Role of involutive criteria in computing Boolean Gröbner bases, Noether normalization guided by monomial cone decompositions, Quasi-stability versus Genericity, Encoding algebraic power series, A Pommaret bases approach to the degree of a polynomial ideal, Gröbner bases and involutive methods for algebraic and differential equations, Sufficient set of integrability conditions of an orthonomic system, Under- and overdetermined systems of differential equations, Quasi-stable ideals and Borel-fixed ideals with a given Hilbert polynomial, Ext groups of Janet systems., De Nugis Groebnerialium 7: Janet, Gerdt, Tamari, Applications of bar code to involutive divisions and a ``greedy algorithm for complete sets, A new algorithm for computing staggered linear bases, Construction of exact partial solutions of nonintegrable systems by means of formal Laurent and Puiseux series, On constructivity of involutive divisions, Generation of difference schemes for the Burgers equation by constructing Gröbner bases, Effectiveness of involutive criteria in computation of polynomial Janet bases, Algorithmic Thomas decomposition of algebraic and differential systems, Thomas Decomposition and Nonlinear Control Systems, Involutive bases algorithm incorporating F\(_5\) criterion, Recursive structures in involutive bases theory, Computing the resolution regularity of bi-homogeneous ideals, On computation of Boolean involutive bases, Computation of involutive and Gröbner bases using the tableau representation of polynomials, Involutive divisions and monomial orderings, On selection of nonmultiplicative prolongations in computation of Janet bases, Algebraically simple involutive differential systems and the Cauchy problem, A general version of standard bases in associative algebras and their universal constructions., From Analytical Mechanics Problems to Rewriting Theory Through M. Janet’s Work, On the free resolution induced by a Pommaret basis, Term-ordering free involutive bases, Detecting unnecessary reductions in an involutive basis computation, Combinatorial decompositions for monomial ideals, On decomposition of algebraic PDE systems into simple subsystems, Effective Genericity, δ-Regularity and Strong Noether Position, Complete involutive rewriting systems, Asymmetric approach to computation of Gröbner bases, Index Concepts for General Systems of Partial Differential Equations, A general framework for Noetherian well ordered polynomial reductions, BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases, Macaulay-like marked bases, Involutive characteristic sets of algebraic partial differential equation systems, An implementation for the algorithm of Janet bases of linear differential ideals in the Maple system, ICS: A package for computing involutive characteristic set of algebraic partial differential equation systems, Parallel modular computation of Gröbner and involutive bases, Involutive directions and new involutive divisions, Flat families by strongly stable ideals and a generalization of Gröbner bases, Toward involutive bases over effective rings, Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals, Parallel computation of Janet and Gröbner bases over rational numbers, Involutive divisions: Slice and pair properties, Degree upper bounds for involutive bases, Differential invariant algebras of Lie pseudo-groups, A novel linear algorithm for \(P5P\) problem, Solving polynomial systems via symbolic-numeric reduction to geometric involutive form, Algebraic transformation of differential characteristic decompositions from one ranking to another, An involutive GVW algorithm and the computation of Pommaret bases, Relative Gröbner and involutive bases for ideals in quotient rings, Involution and Difference Schemes for the Navier–Stokes Equations, Improved Computation of Involutive Bases, Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms, A combinatorial approach to involution and \(\delta \)-regularity. II: Structure analysis of polynomial modules with Pommaret bases, A combinatorial approach to involution and \(\delta \)-regularity. I: Involutive bases in polynomial algebras of solvable type, Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures, Nœther bases and their applications, Multiplicity-preserving triangular set decomposition of two polynomials, Complementary decompositions of monomial ideals and involutive bases, Involutive bases in the Weyl algebra., Involutive bases under composition
Uses Software
Cites Work
