Macaulay2 » Documentation
Packages » Schubert2 :: schubertCycle'
next | previous | forward | backward | up | index | toc

schubertCycle' -- compute Schubert Cycles on a Grassmannian, Grothendieck-style

Synopsis

Description

i1 : base(0, Bundle=>(A, n=8, a))

o1 = a variety

o1 : an abstract variety of dimension 0
i2 : F = flagBundle ({5,q=3},A)

o2 = F

o2 : a flag bundle with subquotient ranks {5, 3}
i3 : CH = intersectionRing F;
i4 : F_(1,3,5)

              2      3
o4 = H   H   H    - H
      2,1 2,2 2,3    2,3

o4 : CH
i5 : {n-q+0-1,n-q+1-3,n-q+2-5}

o5 = {4, 3, 2}

o5 : List
i6 : F_oo

              2      3
o6 = H   H   H    - H
      2,1 2,2 2,3    2,3

o6 : CH

Ways to use schubertCycle' :

For the programmer

The object schubertCycle' is a method function.