𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Method of Computing Formal Moduli

✍ Scribed by Arvid Siqveland


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
228 KB
Volume
241
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

✦ Synopsis


In this paper we consider a method given earlier for computing the formal moduli of modules. We start with a short resume of the method, then we explain how this method can be implemented using a standard basis computation. We list the formal moduli with versal families for all torsionfree rank 1 modules over the curve singularity E . Finally we discuss the degeneracy properties of these mod-6 ules, proving that the normalization deforms to all the other torsionfree rank 1 modules. These examples are computed by implementing the algorithm in the Singular language. The program source is not included in this paper for obvious Ε½ reasons, but can be found in previous work by the author 1997, Implementing the algorithm for computing formal moduli, Preprint Series, Institute of Mathematics, . University of Oslo .


πŸ“œ SIMILAR VOLUMES


Computing with words in formal methods
✍ Tuan D. Pham πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 108 KB πŸ‘ 1 views
An Algorithm Computing the Regular Forma
✍ Moulay Barkatou; Eckhard PflΓΌgel πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 367 KB

We propose a method for computing the regular singular formal solutions of a linear differential system in the neighbourhood of a singular point. This algorithm avoids the use of cyclic vectors and has been implemented † in the computer algebra system Maple.

A realistic involvement of formal method
✍ D. BΓ©gay; A. Rauzy πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 159 KB πŸ‘ 1 views