|
D.5.3.5 control_Matrix
Procedure from library equising.lib (see section equising_lib).
- Assume:
L is the output of multsequence(reddevelop(f)).
- Return:
list M of 4 intmat’s:
- Note:
the branches are ordered in such a way that only consecutive branches
can meet at an infinitely near point.
the final rows of the matrices M[1],...,M[3] is (1,1,1,...,1), and
correspond to infinitely near points such that the strict transforms
of the branches are smooth and intersect the exceptional divisor
transversally.
See also:
multsequence.
|