Spiders and multiplicity sequences (Q2855887)

The spider principle was originated in a previous paper of the same authors [Am. J. Math. 133, No. 6, 1713--1732 (2011; Zbl 1232.13012)], which the reader should have at his side. This principle says that if a point in the support of a two variable power series does not lie on its Newton polygon, then it cannot get in after a quadratic transformation.NEWLINENEWLINE In this work, they use the spider principle for establishing a multiplicity formula for finite quadratic transformation sequences, in general, they follow the terminology of books and papers of the first author. Let \(R\) be a two-dimensional regular local domain, \(S\) be a finite quadratic transformation sequence of \(R\), and \(t(S)\) be its translation index, in the case of \(t(S)> 0\), they introduce an invariant of \(S\), which they call its multiplicity sequence, \(m(S)= m_j(S)_{0\leq j\leq t(S)-1}\) with integers \(m_0(s)\geq\cdots\geq m_{t(S)-1}(S)\). Important properties of these sequences are proved.