Analytic aspects of the shuffle product

There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages. In the search to understand how to extend these natural correspondences, we find that the shuffle product models many key aspects of D-finite generating functions, a class which contains algebraic. We consider several different takes on the shuffle product, shuffle closure, and shuffle grammars, and give explicit generating function consequences. In the process, we define a grammar class that models D-finite generating functions

Galois Theory of Parameterized Differential Equations and Linear Differential Algebraic Groups

We present a Galois theory of parameterized linear differential equations where the Galois groups are linear differential algebraic groups, that is, groups of matrices whose entries are functions of the parameters and satisfy a set of differential equations with respect to these parameters. We present the basic constructions and results, give examples, discuss how isomonodromic families fit into this theory and show how results from the theory of linear differential algebraic groups may be used to classify systems of second order linear differential equations

The theory of the exponential differential equations of semiabelian varieties

The complete first order theories of the exponential differential equations of semiabelian varieties are given. It is shown that these theories also arises from an amalgamation-with-predimension construction in the style of Hrushovski. The theory includes necessary and sufficient conditions for a system of equations to have a solution. The necessary condition generalizes Ax's differential fields version of Schanuel's conjecture to semiabelian varieties. There is a purely algebraic corollary, the "Weak CIT" for semiabelian varieties, which concerns the intersections of algebraic subgroups with algebraic varieties.Comment: 53 pages; v3: Substantial changes, including a completely new introductio

Thomas Decomposition of Algebraic and Differential Systems

In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new algorithm. For algebraic systems simplicity means triangularity, squarefreeness and non-vanishing initials. For differential systems the algorithm provides not only algebraic simplicity but also involutivity. The algorithm has been implemented in Maple

Introduction to the Galois Theory of Linear Differential Equations

This is an expanded version of the 10 lectures given as the 2006 London Mathematical Society Invited Lecture Series at the Heriot-Watt University 31 July - 4 August 2006.Comment: 82 pages; some typos correcte