arXiv subjects

Matthias Seiss

Publications and source records attributed to Matthias Seiss.

11 recordsLinked to original sources

arXiv2025

On the Direct Problem in Differential Galois Theory for the Classical Groups

Let $G$ be a classical group of Lie rank $l$ and let $C$ be an algebraically closed field of characteristic zero. For $l$ differential indeterminates $\boldsymbol{v}=(v_1,\dots,v_l)$ over $C$ we constructed in a previous paper a general Picard-Vessiot extension $\mathcal{E}$ of the differential field $C\langle \boldsymbol{s}(\boldsymbol{v})\rangle$ having differential Galois group $G(C)$. Here $ \boldsymbol{s}(\boldsymbol{v})=(s_1(\boldsymbol{v}),\dots,s_l(\boldsymbol{v}))$ are certain differential polynomials in $C\{\boldsymbol{v} \}$ which are differentially algebraically independent over $C$. The linear differential equation defining $\mathcal{E}$ is defined by the normal form matrix $A_{G}( \boldsymbol{s}(\boldsymbol{v}))$ lying in the Lie algebra of $G$. In the first part of this paper we analyze the structure of $\mathcal{E}$ induced by the action of the standard parabolic subgroups of $G(C)$ on $\mathcal{E}$. In the second part we consider specializations $A_{G}(\boldsymbol{s}(\boldsymbol{v})) \to A_{G}(\overline{\boldsymbol{s}})$ with $\overline{\boldsymbol{s}} \in C(z)^l$ of the normal form matrix for $G$ of type $A_l$, $B_l$, $C_l$ or $\mathrm{G}_2$ (here $l=2$). We show how one can combine the results of the first part with known algorithms for the computation of the differential Galois group and its Lie algebra to determine the differential Galois group of certain specialized equations $\partial(\boldsymbol{y}) = A_{G}(\overline{\boldsymbol{s}})\boldsymbol{y}$ over $C(z)$ with $C$ a computable algebraically closed field of characteristic zero.

math.RT↗

arXiv2025

Iterated and Generalized Iterated Integrals

For a differential field $F$ having an algebraically closed field of constants, we analyze the structure of Picard-Vessiot extensions of $F$ whose differential Galois groups are unipotent algebraic groups and apply these results to study stability problems in integration in finite terms and the inverse problem in differential Galois theory for unipotent algebraic groups.

math.AC↗

arXiv2023

On the Numerical Integration of Singular Initial and Boundary Value Problems for Generalised Lane-Emden and Thomas-Fermi Equations

We propose a geometric approach for the numerical integration of singular initial value problems for (systems of) quasi-linear differential equations. It transforms the original problem into the problem of computing the unstable manifold at a stationary point of an associated vector field and thus into one which can be solved in an efficient and robust manner. Using the shooting method, our approach also works well for boundary value problems. As examples, we treat some (generalised) Lane-Emden equations and the Thomas-Fermi equation.

math.NA↗

arXiv2023

Identifying Markov chain models from time-to-event data: an algebraic approach

Many biological and medical questions can be modeled using time-to-event data in finite-state Markov chains, with the phase-type distribution describing intervals between events. We solve the inverse problem: given a phase-type distribution, can we identify the transition rate parameters of the underlying Markov chain? For a specific class of solvable Markov models, we show this problem has a unique solution up to finite symmetry transformations, and we outline a recursive method for computing symbolic solutions for these models across any number of states. Using the Thomas decomposition technique from computer algebra, we further provide symbolic solutions for any model. Interestingly, different models with the same state count but distinct transition graphs can yield identical phase-type distributions. To distinguish among these, we propose additional properties beyond just the time to the next event. We demonstrate the method's applicability by inferring transcriptional regulation models from single-cell transcription imaging data.

math.DS↗

arXiv2022

Normal Forms in Differential Galois Theory for the Classical Groups

Let $G$ be a classical group of dimension $d$ and let $\boldsymbol{a}=(a_1,\dots,a_d)$ be differential indeterminates over a differential field $F$ of characteristic zero with algebraically closed field of constants $C$. Further let $A(\boldsymbol{a})$ be a generic element in the Lie algebra $\mathfrak{g}(F\langle \boldsymbol{a} \rangle)$ of $G$ obtained from parametrizing a basis of $\mathfrak{g}$ with the indeterminates $\boldsymbol{a}$. It is known (cf. work by Juan) that the differential Galois group of $\boldsymbol{y}'=A(\boldsymbol{a})\boldsymbol{y}$ over $F\langle \boldsymbol{a} \rangle$ is $G(C)$. In this paper we construct a differential field extension $\mathcal{L}$ of $F\langle \boldsymbol{a} \rangle$ such that the field of constants of $\mathcal{L}$ is $C$, the differential Galois group of $\boldsymbol{y}'=A(\boldsymbol{a})\boldsymbol{y}$ over $\mathcal{L}$ is still the full group $G(C)$ and $A(\boldsymbol{a})$ is gauge equivalent over $\mathcal{L}$ to a matrix in normal form which we introduced in work by Seiss. We also consider specializations of the coefficients of $A(\boldsymbol{a})$.

math.AC↗

arXiv2021

Singularities of Algebraic Differential Equations

There exists a well established differential topological theory of singularities of ordinary differential equations. It has mainly studied scalar equations of low order. We propose an extension of the key concepts to arbitrary systems of ordinary or partial differential equations. Furthermore, we show how a combination of this geometric theory with (differential) algebraic tools allows us to make parts of the theory algorithmic. Our three main results are firstly a proof that even in the case of partial differential equations regular points are generic. Secondly, we present an algorithm for the effective detection of all singularities at a given order or, more precisely, for the determination of a regularity decomposition. Finally, we give a rigorous definition of a regular differential equation, a notoriously difficult notion ubiquitous in the geometric theory of differential equations, and show that our algorithm extracts from each prime component a regular differential equation. Our main tools are on the one hand the algebraic resp. differential Thomas decomposition and on the other hand the Vessiot theory of differential equations.

math.AC↗

arXiv2020

On General Extension Fields for the Classical Groups in Differential Galois Theory

Let $G$ be one of the classical groups of Lie rank $l$. We make a similar construction of a general extension field in differential Galois theory for $G$ as E. Noether did in classical Galois theory for finite groups. More precisely, we build a differential field $E$ of differential transcendence degree $l$ over the constants on which the group $G$ acts and show that it is a Picard-Vessiot extension of the field of invariants $E^G$. The field $E^G$ is differentially generated by $l$ differential polynomials which are differentially algebraically independent over the constants. They are the coefficients of the defining equation of the extension. Finally we show that our construction satisfies generic properties for a specific kind of $G$-primitive Picard-Vessiot extensions.

math.AC↗

arXiv2020

Singular Initial Value Problems for Scalar Quasi-Linear Ordinary Differential Equations

We discuss existence, non-uniqueness and regularity of one- and two-sided solutions of initial value problems for scalar quasi-linear ordinary differential equations where the initial condition corresponds to an impasse point of the equation. With a differential geometric approach, we reduce the problem to questions in dynamical systems theory. As an application, we discuss in detail second-order equations of the form $g(x)u''=f(x,u,u')$ with an initial condition imposed at a simple zero of $g$. This generalises results by Liang and also makes them more transparent via our geometric approach.

math.DS↗

arXiv2020

No Chaos in Dixon's System

The so-called Dixon system is often cited as an example of a two-dimensional (continuous) dynamical system that exhibits chaotic behaviour, if its two parameters take their value in a certain domain. We provide first a rigorous proof that there is no chaos in Dixon's system. Then we perform a complete bifurcation analysis of the system showing that the parameter space can be decomposed into sixteen different regions in each of which the system exhibits qualitatively the same behaviour. In particular, we prove that in some regions two elliptic sectors with infinitely many homoclinic orbits exist.

math.DS↗

arXiv2020

On the Numerical Analysis and Visualisation of Implicit Ordinary Differential Equations

We discuss how the geometric theory of differential equations can be used for the numerical integration and visualisation of implicit ordinary differential equations, in particular around singularities of the equation. The Vessiot theory automatically transforms an implicit differential equation into a vector field distribution on a manifold and thus reduces its analysis to standard problems in dynamical systems theory like the integration of a vector field and the determination of invariant manifolds. For the visualisation of low-dimensional situations we adapt the streamlines algorithm of Jobard and Lefer to 2.5 and 3 dimensions. A concrete implementation in Matlab is discussed and some concrete examples are presented.

math.DS↗

arXiv2020

A Logic Based Approach to Finding Real Singularities of Implicit Ordinary Differential Equations

We discuss the effective computation of geometric singularities of implicit ordinary differential equations over the real numbers using methods from logic. Via the Vessiot theory of differential equations, geometric singularities can be characterised as points where the behaviour of a certain linear system of equations changes. These points can be discovered using a specifically adapted parametric generalisation of Gaussian elimination combined with heuristic simplification techniques and real quantifier elimination methods. We demonstrate the relevance and applicability of our approach with computational experiments using a prototypical implementation in Reduce.

math.LO↗