Page 1

Displaying 1 – 12 of 12

Showing per page

Enumeration of real conics and maximal configurations

Erwan Brugallé, Nicolas Puignau (2013)

Journal of the European Mathematical Society

We use floor decompositions of tropical curves to prove that any enumerative problem concerning conics passing through projective-linear subspaces in P n is maximal. That is, there exist generic configurations of real linear spaces such that all complex conics passing through these constraints are actually real.

Enumerative geometry of divisorial families of rational curves

Ziv Ran (2004)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

We compute the number of irreducible rational curves of given degree with 1 tacnode in 2 or 1 node in 3 meeting an appropriate generic collection of points and lines. As a byproduct, we also compute the number of rational plane curves of degree d passing through 3 d - 2 given points and tangent to a given line. The method is ‘classical’, free of Quantum Cohomology.

Estimates of the number of rational mappings from a fixed variety to varieties of general type

Tanya Bandman, Gerd Dethloff (1997)

Annales de l'institut Fourier

First we find effective bounds for the number of dominant rational maps f : X Y between two fixed smooth projective varieties with ample canonical bundles. The bounds are of the type { A · K X n } { B · K X n } 2 , where n = dim X , K X is the canonical bundle of X and A , B are some constants, depending only on n .Then we show that for any variety X there exist numbers c ( X ) and C ( X ) with the following properties:For any threefold Y of general type the number of dominant rational maps f : X Y is bounded above by c ( X ) .The number of threefolds Y , modulo birational...

Even sets of nodes on sextic surfaces

Fabrizio Catanese, Fabio Tonoli (2007)

Journal of the European Mathematical Society

We determine the possible even sets of nodes on sextic surfaces in 3 , showing in particular that their cardinalities are exactly the numbers in the set { 24 , 32 , 40 , 56 } . We also show that all the possible cases admit an explicit description. The methods that we use are an interplay of coding theory and projective geometry on one hand, and of homological and computer algebra on the other. We give a detailed geometric construction for the new case of an even set of 56 nodes, but the ultimate verification of existence...

Currently displaying 1 – 12 of 12

Page 1