2017
DOI: 10.1016/j.jsc.2016.11.018
|View full text |Cite
|
Sign up to set email alerts
|

Formal solutions of completely integrable Pfaffian systems with normal crossings

Abstract: In this paper, we present an algorithm for computing a fundamental matrix of formal solutions of completely integrable Pfaffian systems with normal crossings in several variables. This algorithm is a generalization of a method developed for the bivariate case based on a combination of several reduction techniques and is partially 1 implemented in the computer algebra system Maple.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
0
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 18 publications
0
0
0
Order By: Relevance
“…The existence of a normal form of a logarithmic connection is well-known [23,Proposition 5.4]. Working at the level of Pfaffian matrices, normal form can be found via the standard Moser reduction algorithms of [70,71], which we review in appendix B.…”
Section: Jhep11(2023)202mentioning
confidence: 99%
See 1 more Smart Citation
“…The existence of a normal form of a logarithmic connection is well-known [23,Proposition 5.4]. Working at the level of Pfaffian matrices, normal form can be found via the standard Moser reduction algorithms of [70,71], which we review in appendix B.…”
Section: Jhep11(2023)202mentioning
confidence: 99%
“…ISOLDE [96] and Fuchsia [97]. For the reader's convenience, in this section we review Moser reduction, largely following [70].…”
Section: B Normal Form By Moser Reductionmentioning
confidence: 99%