Search results
Results from the WOW.Com Content Network
There is an approach to intersection number, introduced by Snapper in 1959-60 and developed later by Cartier and Kleiman, that defines an intersection number as an Euler characteristic. Let X be a scheme over a scheme S , Pic( X ) the Picard group of X and G the Grothendieck group of the category of coherent sheaves on X whose support is proper ...
As well as being called the intersection number, the minimum number of these cliques has been called the R-content, [7] edge clique cover number, [4] or clique cover number. [8] The problem of computing the intersection number has been called the intersection number problem , [ 9 ] the intersection graph basis problem , [ 10 ] covering by ...
The intersection (red) of two disks (white and red with black boundaries). The circle (black) intersects the line (purple) in two points (red). The disk (yellow) intersects the line in the line segment between the two red points. The intersection of D and E is shown in grayish purple. The intersection of A with any of B, C, D, or E is the empty ...
K) is a Chern number and the self-intersection number of the canonical class K, and e = c 2 is the topological Euler characteristic. It can be used to replace the term χ(0) in the Riemann–Roch theorem with topological terms; this gives the Hirzebruch–Riemann–Roch theorem for surfaces.
A key example of self-intersection numbers is the exceptional curve of a blow-up, which is a central operation in birational geometry. Given an algebraic surface S, blowing up at a point creates a curve C. This curve C is recognisable by its genus, which is 0, and its self-intersection number, which is −1. (This is not obvious.)
This category contains articles about classes of graphs defined or characterized by intersection representations. See graph families for information on more classes of graphs. Pages in category "Intersection classes of graphs"
What links here; Related changes; Upload file; Special pages; Permanent link; Page information; Cite this page; Get shortened URL; Download QR code
This version is not a direct consequence of the general case, because it is possible to have a finite number of intersection points in the affine space, with infinitely many intersection points at infinity. The above statement is a special case of a more general statement, which is the result that Masser and Wüstholz proved.