Maurice Janet's algorithms on systems of linear partial differential equations release_2xg4dyjgb5flpeywu4dkizzxua

by Kenji Iohara, Philippe Malbos

Released as a article .

2020  

Abstract

This article presents the emergence of formal methods in theory of partial differential equations (PDE) in the french school of mathematics through Janet's work in the period 1913-1930. In his thesis and in a series of articles published during this period, M. Janet introduced an original formal approach to deal with the solvability of the problem of initial conditions for finite linear PDE systems. His constructions implicitly used an interpretation of a monomial PDE system as a generating family of a multiplicative set of monomials. He introduced an algorithmic method on multiplicative sets to compute compatibility conditions, and to study the problem of the existence and the unicity of a solution to a linear PDE system with given initial conditions. The compatibility conditions are formulated using a refinement of the division operation on monomials defined with respect to a partition of the set of variables into multiplicative and non-multiplicative variables. M. Janet was a pioneer in the development of these algorithmic methods, and the completion procedure that he introduced on polynomials was the first one in a long and rich series of works on completion methods which appeared independently throughout the 20th century in various algebraic contexts.
In text/plain format

Archived Files and Locations

application/pdf  357.8 kB
file_v3ctikmd2fap7nxfxtquq7vafa
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2020-08-30
Version   v2
Language   en ?
arXiv  1911.09703v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 53b69d87-2138-47e0-b0ae-5fa89e22d3da
API URL: JSON