Please note: The schedule is also available in PDF format.

Wednesday (9th Feb.) Thursday (10th Feb.) Friday (11th Feb.)
Session 4
E. Mansfield
T. Nunes-Goncalves
J. Llibre
(Chair: J.-F. Pommaret)
Session 8
T. Cluzeau
A. Quadrat
J.-F. Pommaret
(Chair: E. Mansfield)
10:00–10:30 Opening Coffee break Coffee break
Session 1
J. Middeke
A. Korporal
M. Rosenkranz
(Chair: F. Winkler)
Session 5
M. Barkatou
C. El Bacha
G. Labahn
(Chair: J. Middeke)
Session 9
F. Schwarz
L. X. C. Ngô
C. G. Raab
(Chair: G. Labahn)
12:00–14:00 Lunch break Lunch break
Session 2
S. Tsarev
A. Levin
E. Shemyakova
(Chair: Z. Li)
Session 6
X.-S. Gao
S. Rueda
Z. Li
(Chair: F. Schwarz)
15:30–16:00 Coffee break Coffee break
Session 3
M. Giesbrecht
V. Levandovskyy
D. Andres
A. Heinle
(Chair: X.-S. Gao)
Session 7
W. Plesken
D. Robertz
F. Antritter
(Chair: A. Levin)

On Thursday evening at 7'o clock we will have a joint banquet at the u\hof.

Session 1

  1. J. Middeke: Adapting the FGLM-algorithm for conversion between Hermite and Popov normal forms of differential operator matrices

    We are working with matrices over a ring K[D,σ,θ] of Ore polynomials over a skew field K. Extending a result of Kojima et al for usual polynomials it is shown that in this setting the Hermite and Popov normal forms correspond to Gröbner bases with respect to certain orders. The FGLM algorithm is adapted to this setting and used for converting Popov forms into Hermite forms and vice versa. The approach works for arbitrary, i.e., not necessarily square matrices where we establish termination criteria to deal with infinitely dimensional factor spaces.

  2. A. Korporal: Generalized LODE Boundary Problems and Green's Operators
  3. M. Rosenkranz: Partial Results for Partial Integro-Differential Operators

    Partial integro-differential operators are created as an algebraic model of Green's operators for linear partial differential equations. Unlike their univariate counterparts, they honor the chain rule and the substitution rule for describing a change of variables (currently restricted to linear transformations). For mastering these rules as well as the univariate ones (Leibniz law and Baxter rule), we propose a new rewrite system that promises to have canonical forms.

(Session chair: F. Winkler)

Session 2

  1. S. Tsarev: Structure of the lattice of right divisors of a LODO
  2. A. Levin: Invariants of Difference Field Extensions
  3. E. Shemyakova: X- And Y-invariants for Linear Partial Differential Operators in the Plane

(Session chair: Z. Li)

Session 3

  1. M. Giesbrecht: Provably Fast Algorithms for Canonical Forms of Matrices of Ore Polynomials
  2. V. Levandovskyy: Constructive D-module theory and applications

    Let R be a commutative ring K[x1,…,xn] over a field K of characteristic 0. Moreover, let D=D(R) be the n-th Weyl algebra, that is an associative K-algebra, generated by {x1,…,xn, 1,…,∂n} subject to relations jxi=xijij ∀ 1≤i,j≤n. Indeed, Weyl algebra is the algebra of linear partial differential operators with polynomial coefficients.

    How to compute a (possibly smallest) system of PDE's with polynomial coefficients, such that f∈R∖K is a solution of such system? Since R is finitely presented D(R)-module with the natural action xi•p=xi⋅p, i•p=[∂p/∂xi], we get the answer by computing (using Gröbner bases) a left ideal AnnD(R)f={a∈D(R)|a•f=0}.

    We can compute the annihilator of fα for any concrete α∈C as before. D-module theory allows us to compute the annihilator of fs for symbolic s and, moreover, s itself appears in the annihilator AnnD(R)[s]fs⊂D(R)[s]=D(R)⊗K[s] polynomially.

    As an application, an algorithm to compute the explicit D(R)-module structure of the localization K[x]F for F={fi|i≥0}⊂R will be demonstrated.

    J. Bernstein proved in 1972, that for a polynomial f∈R there exist an operator P(s)∈D(R)[s] and a monic polynomial b(s)∈K[s], such that for any s the equality


    holds. bf(s) is called the Bernstein-Sato polynomial of f. It has many interesting properties, which will be discussed in the talk. In particular, bf(s) is quite sensitive with respect to singularities of V(f). For instance, if V(f) is smooth, one can easily show that bf(s)=s+1. Otherwise bf(s) might be very nontrivial and its computation very challenging (cf. the talk by Daniel Andres!). We show, how to compute AnnD(R)[s]fs,bf(s) and Pf(s) effectively.

    A very recent development utilizes the central character decomposition for D-modules, arising from fs and leads to an interesting stratification of the hypersurface V(f).

    Some important applications of D-modules will be discussed and accompanied by nontrivial live examples, computed with the Singular:Plural's package for D-modules. In particular, we sketch the construction of a generalization of a Bernstein-Sato polynomial and related data to the case of an affine variety V(f1,…,fm).

  3. D. Andres: Challenging Bernstein-Sato polynomials and B-functions
  4. A. Heinle: New factorization algorithm in the first (q-)Weyl algebra

(Session chair: X.-S. Gao)

Session 4

  1. E. Mansfield: Pseudogroups, their invariants, and Noether’s second theorem
  2. T. Nunes-Goncalves: Symbolic methods for solving SE(3) Symmetric variational problems

    In 1918 Emmy Noether showed that there exists a relationship between symmetries and conservation laws in physics. Recently we proved that Noether’s conservation laws could be written as a divergence of the product of a moving frame and a vector of invariants. We will illustrate how the knowledge of the conservation laws structure of SE(3) symmetric variational problems eases the integration problem.

  3. J. Llibre: Results and open problems on the algebraic limit cycles of polynomial vector fields in R2

    We shall present a survey on some resent results on the algebraic limit cycles of the real planar polynomial fields, and also a list of related open problems.

(Session chair: J.-F. Pommaret)

Session 5

  1. M. Barkatou: Removing Apparent Singularities of Systems of Linear Differential Equations with Rational Function Coefficients

    Let (S) Y'=A(x)Y be a system of first order linear differential equations with rational function coefficients. A singular point x0 of (S) is called an apparent singularity if there is a basis of formal solutions of (S) which are holomorphic in a neighborhood of x0. In this talk we shall present a new algorithm which, given a system of the form (S), detects apparent singularities and constructs an equivalent system (S') with rational coefficients, such that every singularity of (S') is a singularity of (S) that is not apparent. Our method can, in particular, be applied to the companion system of any linear differential equation with arbitrary order n . We thus have an alternative method to the standard methods for removing apparent singularities of linear differential operators. We shall compare our method to the one designed for operators and we shall show some applications and examples of computation.

  2. C. El Bacha: An algorithm for computing simple forms of first-order linear differential systems
  3. G. Labahn: On Simultaneous Row and Column Reduction of Higher-Order Linear Differential Systems

    We define simultaneously row- and column-reduced forms of higher-order linear differential systems with power series coefficients and give two algorithms for their computation. This extends previous work by Barkatou, El Bacha and Pflügel on second-order systems to arbitrary orders. We also show that the algorithm can be used to compute Two-Sided Block-Popov forms. Finally we show how a simultaneously row- and column-reduced form can be used to transform a given higher-order input system into a first-order system.

    Joint work with Barkatou, El Bacha and Pflügel

(Session chair: J. Middeke)

Session 6

  1. X.-S. Gao: Differential Chow Form and Differential Resultant

    The Chow form for an irreducible differential variety is defined and most of the properties of the Chow form in the algebraic case are extended to its differential counterpart. Furthermore, the generalized differential Chow form is defined and its properties are proved. As an application, the sparse differential resultant of n+1 essential differential polynomials in n variables is defined and an algorithm to compute the sparse resultant is presented, which is single exponential in terms of the order, the number of variables, and the size of the differential polynomials.

  2. S. Rueda: Implicitization of linear DPPEs by perturbed differential resultants

    The development of differential elimination techniques similar to the algebraic existing ones (Groebner basis and multivariate resultants) is an active field of research. Given a system P of n linear ordinary differential polynomial parametric equations (linear DPPEs) in n-1 differential parameters, we proved that, if nonzero a differential resultant gives the implicit equation of P. Unfortunately, differential resultants often vanish under specialization. Motivated by Canny's method and its generalizations, we consider now a linear perturbation of P and use it to give an algorithm to decide if the dimension of the implicit ideal of P is n-1 and, in the affirmative case, obtain the implicit equation of P.

  3. Z. Li: On the structure of compatible rational functions

    A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-shift operators. We present a theorem that describes the structure of compatible rational functions. The theorem enables us to decompose a solution of such a system as a product of a rational function, several symbolic powers, a hyperexponential function, a hypergeometric term, and a q-hypergeometric term. We outline an algorithm for computing this product, and discuss how to determine the algebraic dependence of hyperexponential-hypergeometric elements. This is joint work with Shaoshi Chen, Royong Feng, and Guofeng Fu.

(Session chair: F. Schwarz)

Session 7

  1. W. Plesken: Linear differential elimination for analytic functions
  2. D. Robertz: Nonlinear differential elimination for analytic functions
  3. F. Antritter: Computing π-flat outputs of linear control systems with delays

(Session chair: A. Levin)

Session 8

  1. T. Cluzeau: Serre's Reduction of Linear Partial Differential Systems with Holonomic Adjoints
  2. A. Quadrat: Triangularization of general linear systems of partial differential equations based on pure differential modules

    The purpose of the talk is the constructive study of the concept of purity filtration of a differential module introduced in algebraic analysis and the theory of D-modules. The purity filtration is a natural filtration of a differential module defined by its submodules formed by its elements of codimension (or grade) at least r.

    The purity filtration was studied by Björk [Bjork1,Bjork2] using spectral sequences, by Sato and Kashiwara [Kashiwara,Sato] using associated cohomology and, more recently, by Pommaret [Pom1,Pom2] using modified Spencer forms. Moreover, in a recent “tour de force”, Barakat was able to implement the computation of the corresponding spectral sequences [Barakat] in a GAP 4 package called homalg [homalg], which gives one a way to compute the purity filtration of a differential module.

    In this talk, we show how the purity filtration can be simply characterized by means of basic concepts and tools of module theory and homological algebra, which avoids the use of sophisticated homological algebra concepts such as spectral sequences, associated cohomology and Spencer cohomology. Moreover, an effective algorithm for the computation of the purity filtration is explained [Q1,Q2] and illustrated by means of its implementation in the Maple package PurityFiltration built upon OreModules [OreModules]. We also use the computation of the purity filtration of a differential module to show that every linear system of partial differential equations is equivalent to a particular block-triangular linear system of partial equations, which allows an integration of the system in cascade by solving equidimensional homogeneous linear systems [Q1,Q2]. We show that the PurityFiltration package can be used to find closed-form solutions of many over-/under-determined linear systems of partial differential equations which cannot be integrated by Maple. Finally, we explain interesting features of our algorithm using its recent implementation in the AbelianSystems package of homalg, developed for abelian categories in collaboration with Barakat, which allows us to start investigating the purity filtration of linear systems over non-regular Auslander rings appearing, for instance, in algebraic geometry.

    J. E. Bjork, Rings of Differential Operators, North Holland, 1979.
    J. E. Bjork, \emph{Analytic D-modules and Applications}, Kluwer, 1993.
    M. Barakat, “Spectral Filtrations via Generalized Morphisms”, Preprint, arXiv:0904.0240, submitted for publication, \url{}.
    M. Barakat, D. Robertz, “An abstract package for homological algebra”, Journal of Algebra and its Applications, 7 (2008), 299-317, homalg project: \url{}.
    F. Chyzak, A. Quadrat, D. Robertz, “{\sc OreModules}: A symbolic package for the study of multidimensional linear systems”, in Applications of Time-Delay Systems, J. Chiasson and J. -J. Loiseau (Eds.), Lecture Notes in Control and Information Sciences (LNCIS) 352, Springer, 2007, 233-264.
    M. Kashiwara, Algebraic Study of Systems of Partial Differential Equations, Master Thesis, Tokyo Univ. 1970, M\'emoires de la Soci\'et\'e Math\'ematiques de France 63 (1995) (English translation).
    J.-F. Pommaret, Partial Differential Control Theory, Kluwer Academic Publishers, Mathematics and Its Applications, 2001.
    J.-F. Pommaret, “Macaulay inverse systems revisited”, Preprint HAL: hal-00361230, submitted for publication, \url{}.
    A. Quadrat, “An introduction to constructive algebraic analysis and its applications”, Les cours du CIRM, vol. 1, n. 2: Journ\'ees Nationales de Calcul Formel (2010), p. 281-471, INRIA report 7354, HAL: inria-00506104, \url{}.
    A. Quadrat, “Purity filtration of 2-dimensional linear systems”, \emph{Proceedings of the 19th International Symposium on Mathematical Theory of Networks and Systems} (MTNS 2010), Budapest (Hungary), 05-09/07/10, \url{}.
    M. Sato, “Theory of hyperfunctions, I, II”, Journ. Fac. Sci. Univ. Tokyo, Sect. I, 8 (1959), 139-193; ibid. 8 (1960), 387-437.

  3. J.-F. Pommaret: Spencer Operator and Macaulay Inverse System: A New Approach To Control Identifiability and Other Engineering Applications

    Fifty years ago D.C. Spencer invented the first order operator now wearing his name in order to bring the formal study of systems of ordinary differential (OD) or partial differential (PD) equations to that of equivalent first order systems. However, despite its importance, the Spencer operator is rarely used in mathematics today and, up to our knowledge, has never been used in engineering applications.

    We shall first recall briefly its definition, both in the framework of systems of OD/PD equations and in the framework of differential modules, and then provide a series of explicit and striking applications with explicit experiments.

    In a rough way, our main goal is to prove that the use of the Spencer operator constitutes the common secret of the three following famous books published about at the same time in the beginning of the last century, though they do not seem to have anything in common at first sight as they are successively dealing with elasticity theory, commutative algebra, electromagnetism and general relativity:

    1. E. and F. COSSERAT: “Théorie des Corps Déformables”, Hermann, Paris, 1909.
    2. F.S. MACAULAY: “The Algebraic Theory of Modular Systems”, Cambridge, 1916.
    3. H. WEYL: “Space, Time, Matter”, Springer, Berlin, 1918 (1922, 1958; Dover, 1952).

(Session chair: E. Mansfield)

Session 9

  1. F. Schwarz: Solving Linear Inhomogeneous Differential Equations

    The need for solving linear inhomogeneous partial differential equations (pde's) arises when homogeneous equations that are reducible but not completely reducible are solved. To this end a new method for solving linear inhomogeneous pde's is described. Lagrange's variation-of-constants method for solving linear inhomogeneous ordinary differential equations (ode's) is replaced by a method based on the Loewy decomposition of the corresponding homogeneous equation. It uses only properties of the equations and not of its solutions. As a consequence it has the advantage that it may be generalized for pde's. It is applied to equations of second order in two independent variables, and to a certain system of third-order pde's. All possible linear inhomogeneous pde's are covered that may occur when third-order linear homogeneous pde's in two independent variables are solved.

  2. L. X. C. Ngô: Solving some parametrizable ODEs of order 1 by parametrization

    We present a geometric method for computing rational general solutions of an algebraic ODE of order 1, whose corresponding algebraic equation defines a rational surface. Since rationality of algebraic surfaces is preserved under a birational mapping, it makes sense to consider birational mappings which are compatible with the set of rational integral curves. In this sense, parametrizable ODEs of order 1 are related to each other via such a birational transformation. We present an affine linear transformation having this property.

  3. C. G. Raab: Integration of Liouvillian Functions

    A decision algorithm for finding elementary integrals of transcendental Liouvillian functions will be outlined. Parameters that are linearly involved in the integrand can also be solved for, which can be used to find linear relations for definite parameter integrals. Examples of indefinite and definite integrals which can be handled will be given.

(Session chair: G. Labahn)