𝔖 Bobbio Scriptorium
✦   LIBER   ✦

MILNOR Number of Complete Intersections and NEWTON Polygons

✍ Scribed by Bernd Martin; Gerhard Pfister

Publisher
John Wiley and Sons
Year
1983
Tongue
English
Weight
744 KB
Volume
110
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

✦ Synopsis

The main result of this 1)aper will he a formula to compute the Milnor number of an isolated complete intersection singulaFity using the Newton polygon. We were inspired by the articles of KOUCHNIRENKO [4], who gave such a formula for hyl)ersurfaces, anti GREUEL and HAMM [2], who proved a similar result for cl";~Yihornogetieous complete intersections with slightly different methods. N' e use the filtrations of KOUCHNIRENKO to generalize the methods of GREUEL and HAMM.

Let K he an alge1)raicelly closed field of characteristic 0, fi, . . . , f,.CA: = K ( X i ,

πŸ“œ SIMILAR VOLUMES

Intersection number and capacities of gr
Intersection number and capacities of graphs
✍ J. KΓΆrner πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 955 KB

For an arbitrary graph G we determine the asymptotics of the intersection number (edgeclique covering number) of the categorical (or weak) product of G and the complete graph K,, asymptotically in n. The result follows from a more general theorem on graph capacities which generalizes an earlier resu

The 2-intersection number of paths and b
The 2-intersection number of paths and bounded-degree trees
✍ Michael S. Jacobson; AndrΓ© E. KΓ©zdy; Douglas B. West πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 416 KB πŸ‘ 1 views

## Abstract We represent a graph by assigning each vertex a finite set such that vertices are adjacent if and only if the corresponding sets have at least two common elements. The __2‐intersection number__ ΞΈ~2~(__G__) of a graph __G__ is the minimum size of the union of sets in such a representatio