Finite determination of regular (a,b)-modules

Mathematics – Complex Variables

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

The concept of (a,b)-module comes from the study the Gauss-Manin lattices of an isolated singularity of a germ of an holomorphic function. It is a very simple ''abstract algebraic structure'', but very rich, whose prototype is the formal completion of the Brieskorn-module of an isolated singularity. The aim of this article is to prove a very basic theorem on regular (a,b)-modules showing that a given regular (a,b)-module is completely characterized by some ''finite order jet'' of its structure. Moreover a very simple bound for such a sufficient order is given in term of the rank and of two very simple invariants : the regularity order which count the number of times you need to apply \ $b^{-1}.a \simeq \partial_z.z$ in order to reach a simple pole (a,b)-module. The second invariant is the ''width'' which corresponds, in the simple pole case, to the maximal integral difference between to eigenvalues of $b^{-1}.a$ (the logarithm of the monodromy). In the computation of examples this theorem is quite helpfull because it tells you at which power of $b$ in the expansions you may stop without loosing any information.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Finite determination of regular (a,b)-modules does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finite determination of regular (a,b)-modules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite determination of regular (a,b)-modules will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-195227

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.