Say I have a family of linear spaces, and that I can solve all Schuber problems of that family (that is, how many members of the family pass through a set $S$ of linear spaces, where we consider all possible $S$). How can I go from these solutions to the cycle class of the family in the corresponding Grassmanian. I would appreciate any reference in literature. A computer program is even better.
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
1
|
||||||||||
|
|
1
|
For simplicity, I am supposing your family is a pure-dimensional (though not necessarily irreducible) subvariety $V$ in the Grassmannian. As you probably know, given a fixed $i$, the classes $[X_\lambda]$ of Schubert subvarieties $X_\lambda$, where $\lambda$ is a partition which has $i$ boxes and fits inside a $k \times n-k$ rectangle, form a basis of $H^{2i}(G_{k,n})$. (The Chow ring and cohomology ring are the same for Grassmannians over $\mathbb{C}$.) (I am assuming a particular indexing convention for Schubert varieties; with a different indexing convention, $\lambda$ should have $k(n-k)-i$ boxes.) Under the intersection pairing $\langle \cdot, \cdot\rangle$ between $H^{2i}$ and $H^{2[k(n-k)-i]}$, the Schubert bases are dual to each other. To be precise,
$\langle[X_\lambda],[X_\mu]\rangle = 1$ if $\lambda^*=\mu$ and $\langle[X_\lambda],[X_\mu]\rangle=0$ if This means that the class $[V]$ is given by $$[V]=\sum_{\lambda} \langle [V], [S_{\lambda^*}]\rangle [S_\lambda],$$ where the sum is over all partitions $\lambda$ fitting inside a $k\times n-k$ rectangle with $\mathrm{codim} V$ boxes. There cannot be any easier method because it takes $d$ pieces of information to determine an element in a vector space of dimension $d$. |
||
|
|

