Completion of Linear Differential Systems to Involution

The article treats the geometrical theory of partial differential equations in the absolute sense, i.e., without any additional structures and especially without any preferred choice of independent and dependent variables. The equations are subject to arbitrary transformations of variables in the widest possible sense. In this preparatory Part 1, the involutivity and the related standard bases are investigated as a technical tool within the framework of commutative algebra. T...

In this paper we present an algorithm for construction of minimal involutive polynomial bases which are Groebner bases of the special form. The most general involutive algorithms are based on the concept of involutive monomial division which leads to partition of variables into multiplicative and non-multiplicative. This partition gives thereby the self-consistent computational procedure for constructing an involutive basis by performing non-multiplicative prolongations and m...

In this paper we consider an algorithmic technique more general than that proposed by Zharkov and Blinkov for the involutive analysis of polynomial ideals. It is based on a new concept of involutive monomial division which is defined for a monomial set. Such a division provides for each monomial the self-consistent separation of the whole set of variables into two disjoint subsets. They are called multiplicative and non-multiplicative. Given an admissible ordering, this separ...

We consider reasoning and minimization in systems of polynomial ordinary differential equations (ode's). The ring of multivariate polynomials is employed as a syntax for denoting system behaviours. We endow this set with a transition system structure based on the concept of Lie-derivative, thus inducing a notion of L-bisimulation. We prove that two states (variables) are L-bisimilar if and only if they correspond to the same solution in the ode's system. We then characterize ...

In this paper, in addition to the earlier introduced involutive divisions, we consider a new class of divisions induced by admissible monomial orderings. We prove that these divisions are noetherian and constructive. Thereby each of them allows one to compute an involutive Groebner basis of a polynomial ideal by sequentially examining multiplicative reductions of nonmultiplicative prolongations. We study dependence of involutive algorithms on the completion ordering. Based on...

The purpose of this paper is twofold. An immediate practical use of the presented algorithm is its applicability to the parametric solution of underdetermined linear ordinary differential equations (ODEs) with coefficients that are arbitrary analytic functions in the independent variable. A second conceptual aim is to present an algorithm that is in some sense dual to the fundamental Euclids algorithm, and thus an alternative to the special case of a Groebner basis algorithm ...

In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain way. In the presented algorithm a reduced Groebner basis is the internally fixed subset of an involutive basis, and having computed the later, the former can be output without any extra computational costs. We also discuss some accounts of e...

In the last chapter of his book "The Algebraic Theory of Modular Systems " published in 1916, F. S. Macaulay developped specific techniques for dealing with " unmixed polynomial ideals " by introducing what he called " inverse systems ". The purpose of this paper is to extend such a point of view to differential modules defined by linear multidimensional systems, that is by linear systems of ordinary differential (OD) or partial differential (PD) equations of any order, with ...

Motivated by the problem of the existence of bounds on degrees and orders in checking primality of radical (partial) differential ideals, the nonstandard methods of van den Dries and Schmidt ["Bounds in the theory of polynomial rings over fields. A nonstandard approach.", Inventionnes Mathematicae, 76:77--91, 1984] are here extended to differential polynomial rings over differential fields. Among the standard consequences of this work are: a partial answer to the primality pr...

We study the interplay between the differential Galois group and the Lie algebra of infinitesimal symmetries of systems of linear differential equations. We show that some symmetries can be seen as solutions of a hierarchy of linear differential systems. We show that the existence of rational symmetries constrains the differential Galois group in the system in a way that depends of the Maclaurin series of the symmetry along the zero solution.