On the quantum cohomology of the plane, old and new
نویسنده
چکیده
On the quantum cohomology of the plane, old and new Z. Ran Abstract We describe a method for counting maps of curves of given genus (and variable moduli) to P 2 , essentially by splitting the P 2 in two; then specialising to the case of genus 0 we show that the method of quantum cohomology may be viewed as the 'mirror' of the former method where one splits the P 1 rather than the P 2 , and we indicate a proof of the associativity of quantum multiplication based on this idea. Recent work on Mirror Symmetry and Quantum Cohomology has contributed to a revival of interest in problems of a classical nature in Enumerative Geometry (cf. [F] and references therein). These problems involve (holomorphic) maps (1) f : C → X where X is a fixed variety and C is a compact Riemann surface whose moduli are sometimes fixed ('Gromov-Witten') but here will not be, unless otherwise stated. While the case dim X = 1 is not entirely without interest (cf. [D]), the problem begins in earnest with dim X = 2 and naturally the simplest such X is P 2. Here the problem specifically is to count the images f (C) of maps (1) where C has genus g, f (C) has degree d and passes through 3d + g − 1 fixed points in P 2. This problem has already, in essence, been solved in the author's earlier paper [R] by means of a recursive method (we note however that the formula in [R], (3c.1), (3c.3) is trivially misstated and the factor c(˜ K 1 , ˜ K 2) should not be present). Our purpose here is twofold. In Sect.1 we give a partial exposition of the method of [R] and illustrate it on a couple of new examples, namely the curves of degree d and genus g = (d−1)(d−2) 2 − 2 (i.e. with 2 nodes); and the rational quartics. We recover classical formulae due, respectively, to Roberts [Ro] and Zeuthen [Z]. Hopefully, this will help make the method of [R] more accessible. In Sect.2 we show that the method of Kontsevich et al., at least as exposed in [F], may be viewed as none other than the 'dual' of that of [R] for the case of rational curves, 'dual'
منابع مشابه
A note on the new basis in the mod 2 Steenrod algebra
The Mod $2$ Steenrod algebra is a Hopf algebra that consists of the primary cohomology operations, denoted by $Sq^n$, between the cohomology groups with $mathbb{Z}_2$ coefficients of any topological space. Regarding to its vector space structure over $mathbb{Z}_2$, it has many base systems and some of the base systems can also be restricted to its sub algebras. On the contrary, in ...
متن کاملFirst non-abelian cohomology of topological groups II
In this paper we introduce a new definition of the first non-abelian cohomology of topological groups. We relate the cohomology of a normal subgroup $N$ of a topological group $G$ and the quotient $G/N$ to the cohomology of $G$. We get the inflation-restriction exact sequence. Also, we obtain a seven-term exact cohomology sequence up to dimension 2. We give an interpretation of the first non-a...
متن کاملOn continuous cohomology of locally compact Abelian groups and bilinear maps
Let $A$ be an abelian topological group and $B$ a trivial topological $A$-module. In this paper we define the second bilinear cohomology with a trivial coefficient. We show that every abelian group can be embedded in a central extension of abelian groups with bilinear cocycle. Also we show that in the category of locally compact abelian groups a central extension with a continuous section can b...
متن کاملCounting Curves on Surfaces: a Guide to New Techniques and Results
1.1. Abstract and summary. A series of recent results solving classical enumerative problems for curves on rational surfaces is described. Impulse to the subject came from recent ideas from quantum field theory leading to the definition of quantum cohomology. As a by-product, formulas enumerating rational curves on certain varieties were derived from the properties of certain generating functio...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995