• Keine Ergebnisse gefunden

Massachusetts Institute of Technology

N/A
N/A
Protected

Academic year: 2022

Aktie "Massachusetts Institute of Technology"

Copied!
82
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

A quotient of the ring of symmetric functions generalizing quantum cohomology

Darij Grinberg

7 December 2018

Massachusetts Institute of Technology, Cambridge, MA slides: http:

//www.cip.ifi.lmu.de/~grinberg/algebra/mit2018.pdf paper: http:

//www.cip.ifi.lmu.de/~grinberg/algebra/basisquot.pdf

(2)

What is this about?

From a modern point of view, Schubert calculus is about two cohomology rings:

H

 Gr (k,n)

| {z }

Grassmannian

 and H

 Fl (n)

| {z }

flag variety

(both varieties over C).

In this talk, we are concerned with the first.

Classical result: as rings, H(Gr (k,n))

∼= (symmetric polynomials inx1,x2, . . . ,xk overZ) (hn−k+1,hn−k+2, . . . ,hn)ideal

(where the hi are complete homogeneous symmetric polynomials).

(3)

What is this about?

From a modern point of view, Schubert calculus is about two cohomology rings:

H

 Gr (k,n)

| {z }

Grassmannian

 and H

 Fl (n)

| {z }

flag variety

(both varieties over C).

In this talk, we are concerned with the first.

Classical result: as rings, H(Gr (k,n))

∼= (symmetric polynomials inx1,x2, . . . ,xk overZ) (hn−k+1,hn−k+2, . . . ,hn)ideal

(where the hi are complete homogeneous symmetric polynomials).

(4)

What is this about?

From a modern point of view, Schubert calculus is about two cohomology rings:

H

 Gr (k,n)

| {z }

Grassmannian

 and H

 Fl (n)

| {z }

flag variety

(both varieties over C).

In this talk, we are concerned with the first.

Classical result: as rings, H(Gr (k,n))

∼= (symmetric polynomials inx1,x2, . . . ,xk overZ) (hn−k+1,hn−k+2, . . . ,hn)ideal

(where the hi are complete homogeneous symmetric polynomials).

(5)

Quantum cohomology of Gr(k,n)

(Small)Quantum cohomology is a deformation of

cohomology from the 1980–90s. For the Grassmannian, it is QH(Gr (k,n))

∼= (symmetric polynomials in x1,x2, . . . ,xk overZ[q])

hn−k+1,hn−k+2, . . . ,hn−1,hn+ (−1)kq

ideal.

Many properties of classical cohomology still hold here. In particular: QH(Gr (k,n)) has a Z[q]-module basis (sλ)λ∈P

k,n

of (projected) Schur polynomials, with λranging over all partitions with ≤k parts and each part≤n−k. The structure constants are theGromov–Witten invariants. References:

Aaron Bertram, Ionut Ciocan-Fontanine, William Fulton, Quantum multiplication of Schur polynomials, 1999. Alexander Postnikov, Affine approach to quantum Schubert calculus, 2005.

(6)

Quantum cohomology of Gr(k,n)

For comparison, the classical cohomology of the Grassmannian is

H(Gr (k,n))

∼= (symmetric polynomials inx1,x2, . . . ,xk overZ) (hn−k+1,hn−k+2, . . . ,hn)ideal

(where the hi are complete homogeneous symmetric polynomials).

Many properties of classical cohomology still hold here. In particular: QH(Gr (k,n)) has a Z[q]-module basis (sλ)λ∈P

k,n

of (projected) Schur polynomials, with λranging over all partitions with ≤k parts and each part≤n−k. The structure constants are theGromov–Witten invariants.

References:

Aaron Bertram, Ionut Ciocan-Fontanine, William Fulton, Quantum multiplication of Schur polynomials, 1999.

Alexander Postnikov, Affine approach to quantum

3 / 24

(7)

Quantum cohomology of Gr(k,n)

(Small)Quantum cohomology is a deformation of

cohomology from the 1980–90s. For the Grassmannian, it is QH(Gr (k,n))

∼= (symmetric polynomials in x1,x2, . . . ,xk overZ[q])

hn−k+1,hn−k+2, . . . ,hn−1,hn+ (−1)kq

ideal. Many properties of classical cohomology still hold here. In particular: QH(Gr (k,n)) has a Z[q]-module basis (sλ)λ∈P

k,n

of (projected) Schur polynomials, with λranging over all partitions with ≤k parts and each part≤n−k. The structure constants are theGromov–Witten invariants.

References:

Aaron Bertram, Ionut Ciocan-Fontanine, William Fulton, Quantum multiplication of Schur polynomials, 1999.

Alexander Postnikov, Affine approach to quantum Schubert calculus, 2005.

(8)

A more general setting: P and S

We will now deform H(Gr (k,n)) using k parameters instead of one, generalizing QH(Gr (k,n)).

Let kbe a commutative ring. LetN={0,1,2, . . .}. Let n ≥k ≥0 be integers.

Let P =k[x1,x2, . . . ,xk].

For eachα∈Nk and each i ∈ {1,2, . . . ,k}, letαi be the i-th entry of α. Same for infinite sequences (like partitions). For eachα∈Nk, letxα be the monomial x1α1x2α2· · ·xkαk, and let |α|be the degreeα12+· · ·+αk of this monomial. Let S denote the ring of symmetricpolynomials inP. Theorem (Artin ≤1944): TheS-moduleP is free with basis

(xα)α∈Nk;αi<i for eachi.

(9)

A more general setting: P and S

We will now deform H(Gr (k,n)) using k parameters instead of one, generalizing QH(Gr (k,n)).

Let kbe a commutative ring. LetN={0,1,2, . . .}. Let n ≥k ≥0 be integers.

Let P =k[x1,x2, . . . ,xk].

For eachα∈Nk and each i ∈ {1,2, . . . ,k}, letαi be the i-th entry of α. Same for infinite sequences (like partitions). For eachα∈Nk, letxα be the monomial x1α1x2α2· · ·xkαk, and let |α|be the degreeα12+· · ·+αk of this monomial. Let S denote the ring of symmetricpolynomials inP. Theorem (Artin ≤1944): TheS-moduleP is free with basis

(xα)α∈Nk;αi<i for eachi.

(10)

A more general setting: P and S

We will now deform H(Gr (k,n)) using k parameters instead of one, generalizing QH(Gr (k,n)).

Let kbe a commutative ring. LetN={0,1,2, . . .}. Let n ≥k ≥0 be integers.

Let P =k[x1,x2, . . . ,xk].

For eachα∈Nk and eachi ∈ {1,2, . . . ,k}, letαi be the i-th entry of α. Same for infinite sequences (like partitions).

For eachα∈Nk, letxα be the monomial x1α1x2α2· · ·xkαk, and let |α|be the degreeα12+· · ·+αk of this monomial. Let S denote the ring of symmetricpolynomials inP. Theorem (Artin ≤1944): TheS-moduleP is free with basis

(xα)α∈Nk;αi<i for eachi.

(11)

A more general setting: P and S

We will now deform H(Gr (k,n)) using k parameters instead of one, generalizing QH(Gr (k,n)).

Let kbe a commutative ring. LetN={0,1,2, . . .}. Let n ≥k ≥0 be integers.

Let P =k[x1,x2, . . . ,xk].

For eachα∈Nk and eachi ∈ {1,2, . . . ,k}, letαi be the i-th entry of α. Same for infinite sequences (like partitions).

For eachα∈Nk, let xα be the monomial x1α1x2α2· · ·xkαk, and let |α|be the degreeα12+· · ·+αk of this monomial.

Let S denote the ring of symmetricpolynomials inP. Theorem (Artin ≤1944): TheS-moduleP is free with basis

(xα)α∈Nk;αi<i for eachi.

(12)

A more general setting: P and S

We will now deform H(Gr (k,n)) using k parameters instead of one, generalizing QH(Gr (k,n)).

Let kbe a commutative ring. LetN={0,1,2, . . .}. Let n ≥k ≥0 be integers.

Let P =k[x1,x2, . . . ,xk].

For eachα∈Nk and eachi ∈ {1,2, . . . ,k}, letαi be the i-th entry of α. Same for infinite sequences (like partitions).

For eachα∈Nk, let xα be the monomial x1α1x2α2· · ·xkαk, and let |α|be the degreeα12+· · ·+αk of this monomial.

Let S denote the ring of symmetricpolynomials inP.

Theorem (Artin ≤1944): TheS-moduleP is free with basis (xα)α∈Nk;αi<i for eachi.

(13)

A more general setting: P and S

We will now deform H(Gr (k,n)) using k parameters instead of one, generalizing QH(Gr (k,n)).

Let kbe a commutative ring. LetN={0,1,2, . . .}. Let n ≥k ≥0 be integers.

Let P =k[x1,x2, . . . ,xk].

For eachα∈Nk and eachi ∈ {1,2, . . . ,k}, letαi be the i-th entry of α. Same for infinite sequences (like partitions).

For eachα∈Nk, let xα be the monomial x1α1x2α2· · ·xkαk, and let |α|be the degreeα12+· · ·+αk of this monomial.

Let S denote the ring of symmetricpolynomials inP. Theorem (Artin ≤1944): TheS-moduleP is free with basis

(xα)α∈Nk;αi<i for eachi.

(14)

A more general setting: P and S

We will now deform H(Gr (k,n)) using k parameters instead of one, generalizing QH(Gr (k,n)).

Let kbe a commutative ring. LetN={0,1,2, . . .}. Let n ≥k ≥0 be integers.

Let P =k[x1,x2, . . . ,xk].

For eachα∈Nk and eachi ∈ {1,2, . . . ,k}, letαi be the i-th entry of α. Same for infinite sequences (like partitions).

For eachα∈Nk, let xα be the monomial x1α1x2α2· · ·xkαk, and let |α|be the degreeα12+· · ·+αk of this monomial.

Let S denote the ring of symmetricpolynomials inP. Theorem (Artin ≤1944): TheS-moduleP is free with basis

(xα)α∈Nk;αi<i for eachi.

(15)

Reminders on symmetric polynomials

The ring S of symmetric polynomials inP =k[x1,x2, . . . ,xk] has several bases, usually indexed by certain sets of (integer) partitions.

We need the following ones:

(16)

Reminders on symmetric polynomials: the e-basis

For eachm∈Z, we letem denote them-thelementary symmetric polynomial:

em= X

1≤i1<i2<···<im≤k

xi1xi2· · ·xim = X

α∈{0,1}k;

|α|=m

xα ∈ S.

(Thus, e0 = 1, and em= 0 when m<0.)

For eachν = (ν1, ν2, . . . , ν`)∈Z` (e.g., a partition), set eν =eν1eν2· · ·eν` ∈ S.

Then, (eλ)λis a partition withλ1≤k is a basis of the k-moduleS. (Gauss’s theorem.)

Note thatem= 0 when m>k.

(17)

Reminders on symmetric polynomials: the e-basis

For eachm∈Z, we letem denote them-thelementary symmetric polynomial:

em= X

1≤i1<i2<···<im≤k

xi1xi2· · ·xim = X

α∈{0,1}k;

|α|=m

xα ∈ S.

(Thus, e0 = 1, and em= 0 when m<0.)

For eachν = (ν1, ν2, . . . , ν`)∈Z` (e.g., a partition), set eν =eν1eν2· · ·eν` ∈ S.

Then, (eλ)λis a partition withλ1≤k is a basis of the k-moduleS. (Gauss’s theorem.)

Note thatem= 0 when m>k.

(18)

Reminders on symmetric polynomials: the e-basis

For eachm∈Z, we letem denote them-thelementary symmetric polynomial:

em= X

1≤i1<i2<···<im≤k

xi1xi2· · ·xim = X

α∈{0,1}k;

|α|=m

xα ∈ S.

(Thus, e0 = 1, and em= 0 when m<0.)

For eachν = (ν1, ν2, . . . , ν`)∈Z` (e.g., a partition), set eν =eν1eν2· · ·eν` ∈ S.

Then, (eλ)λis a partition withλ1≤k is a basis of the k-moduleS. (Gauss’s theorem.)

Note thatem= 0 when m>k.

(19)

Reminders on symmetric polynomials: the e-basis

For eachm∈Z, we letem denote them-thelementary symmetric polynomial:

em= X

1≤i1<i2<···<im≤k

xi1xi2· · ·xim = X

α∈{0,1}k;

|α|=m

xα ∈ S.

(Thus, e0 = 1, and em= 0 when m<0.)

For eachν = (ν1, ν2, . . . , ν`)∈Z` (e.g., a partition), set eν =eν1eν2· · ·eν` ∈ S.

Then, (eλ)λis a partition withλ1≤k is a basis of the k-moduleS. (Gauss’s theorem.)

Note thatem= 0 when m>k.

(20)

Reminders on symmetric polynomials: the h-bases

For eachm∈Z, we lethm denote them-thcomplete homogeneous symmetric polynomial:

hm = X

1≤i1≤i2≤···≤im≤k

xi1xi2· · ·xim= X

α∈Nk;

|α|=m

xα∈ S.

(Thus, h0 = 1, and hm = 0 whenm<0.)

For eachν = (ν1, ν2, . . . , ν`)∈Z` (e.g., a partition), set hν =hν1hν2· · ·hν` ∈ S.

Then, (hλ)λis a partition withλ1≤k is a basis of the k-module S. Also, (hλ)λis a partition with`(λ)≤k is a basis of the k-module S. Here, `(λ) is the length of λ, that is, the number of parts (= nonzero entries) of λ.

(21)

Reminders on symmetric polynomials: the h-bases

For eachm∈Z, we lethm denote them-thcomplete homogeneous symmetric polynomial:

hm = X

1≤i1≤i2≤···≤im≤k

xi1xi2· · ·xim= X

α∈Nk;

|α|=m

xα∈ S.

(Thus, h0 = 1, and hm = 0 whenm<0.)

For eachν = (ν1, ν2, . . . , ν`)∈Z` (e.g., a partition), set hν =hν1hν2· · ·hν` ∈ S.

Then, (hλ)λis a partition withλ1≤k is a basis of the k-module S.

Also, (hλ)λis a partition with`(λ)≤k is a basis of the k-module S. Here, `(λ) is the length of λ, that is, the number of parts (= nonzero entries) of λ.

(22)

Reminders on symmetric polynomials: the h-bases

For eachm∈Z, we lethm denote them-thcomplete homogeneous symmetric polynomial:

hm = X

1≤i1≤i2≤···≤im≤k

xi1xi2· · ·xim= X

α∈Nk;

|α|=m

xα∈ S.

(Thus, h0 = 1, and hm = 0 whenm<0.)

For eachν = (ν1, ν2, . . . , ν`)∈Z` (e.g., a partition), set hν =hν1hν2· · ·hν` ∈ S.

Then, (hλ)λis a partition withλ1≤k is a basis of the k-module S.

Also, (hλ)λis a partition with`(λ)≤k is a basis of the k-module S.

Here, `(λ) is the length of λ, that is, the number of parts (=

nonzero entries) of λ.

(23)

Reminders on symmetric polynomials: the h-bases

For eachm∈Z, we lethm denote them-thcomplete homogeneous symmetric polynomial:

hm = X

1≤i1≤i2≤···≤im≤k

xi1xi2· · ·xim= X

α∈Nk;

|α|=m

xα∈ S.

(Thus, h0 = 1, and hm = 0 whenm<0.)

For eachν = (ν1, ν2, . . . , ν`)∈Z` (e.g., a partition), set hν =hν1hν2· · ·hν` ∈ S.

Then, (hλ)λis a partition withλ1≤k is a basis of the k-module S.

Also, (hλ)λis a partition with`(λ)≤k is a basis of the k-module S.

Here, `(λ) is the length of λ, that is, the number of parts (=

nonzero entries) of λ.

(24)

Reminders on symmetric polynomials: the s-basis

For each partitionλ= (λ1, λ2, λ3, . . .), we letsλ be the λ-th Schur polynomial:

sλ= X

T is a semistandard tableau of shapeλwith entries 1,2,...,k

k

Y

i=1

xi(number ofi’s inT)

= det

(hλi−i+j)1≤i≤`(λ),1≤j≤`(λ)

(Jacobi-Trudi). If`(λ)>k, then sλ = 0.

If`(λ)≤k, then

sλ = det

xiλj+k−j

1≤i≤k,1≤j≤k

det

xik−j

1≤i≤k,1≤j≤k

(alternant formula).

Now, (sλ)λis a partition with`(λ)≤k is a basis of the k-moduleS.

(25)

Reminders on symmetric polynomials: the s-basis

For each partitionλ= (λ1, λ2, λ3, . . .), we letsλ be the λ-th Schur polynomial:

sλ= X

T is a semistandard tableau of shapeλwith entries 1,2,...,k

k

Y

i=1

xi(number ofi’s inT)

= det

(hλi−i+j)1≤i≤`(λ),1≤j≤`(λ)

(Jacobi-Trudi). If`(λ)>k, then sλ = 0.

If`(λ)≤k, then

sλ = det

xiλj+k−j

1≤i≤k,1≤j≤k

det

xik−j

1≤i≤k,1≤j≤k

(alternant formula).

Now, (sλ)λis a partition with`(λ)≤k is a basis of the k-module S.

(26)

Reminders on symmetric polynomials: the s-basis

For each partitionλ= (λ1, λ2, λ3, . . .), we letsλ be the λ-th Schur polynomial:

sλ= X

T is a semistandard tableau of shapeλwith entries 1,2,...,k

k

Y

i=1

xi(number ofi’s inT)

= det

(hλi−i+j)1≤i≤`(λ),1≤j≤`(λ)

(Jacobi-Trudi). If`(λ)>k, then sλ = 0.

If`(λ)≤k, then

sλ = det

xiλj+k−j

1≤i≤k,1≤j≤k

det

xik−j

1≤i≤k,1≤j≤k

(alternant formula).

Now, (sλ)λis a partition with`(λ)≤k is a basis of the k-module S.

(27)

A more general setting: a1,a2, . . . ,ak and J

Let a1,a2, . . . ,ak ∈ P such that degai <n−k+i for all i. (For example, this holds if ai ∈k.)

Let J be the ideal ofP generated by thek differences hn−k+1−a1, hn−k+2−a2, . . . , hn−ak.

Theorem (G.): The k-module PJ is free with basis (xα)α∈

Nk;αi<n−k+i for eachi,

where the overline means “projection” onto whatever quotient we need (here: from P ontoPJ).

(This basis has n(n−1)· · ·(n−k+ 1) elements.)

(28)

A more general setting: a1,a2, . . . ,ak and J

Let a1,a2, . . . ,ak ∈ P such that degai <n−k+i for all i. (For example, this holds if ai ∈k.)

Let J be the ideal ofP generated by thek differences hn−k+1−a1, hn−k+2−a2, . . . , hn−ak.

Theorem (G.): The k-module PJ is free with basis (xα)α∈

Nk;αi<n−k+i for eachi,

where the overline means “projection” onto whatever quotient we need (here: from P ontoPJ).

(This basis has n(n−1)· · ·(n−k+ 1) elements.)

(29)

A more general setting: a1,a2, . . . ,ak and J

Let a1,a2, . . . ,ak ∈ P such that degai <n−k+i for all i. (For example, this holds if ai ∈k.)

Let J be the ideal ofP generated by thek differences hn−k+1−a1, hn−k+2−a2, . . . , hn−ak. Theorem (G.): The k-module PJ is free with basis

(xα)α∈

Nk;αi<n−k+i for eachi,

where the overline means “projection” onto whatever quotient we need (here: from P ontoPJ).

(This basis has n(n−1)· · ·(n−k+ 1) elements.)

(30)

A slightly less general setting: symmetric a1,a2, . . . ,ak and J

FROM NOW ON, assume that a1,a2, . . . ,ak ∈ S.

Let I be the ideal ofS generated by the k differences hn−k+1−a1, hn−k+2−a2, . . . , hn−ak. (Same differences as forJ, but we are generating an ideal of S now.)

For each partitionλ, let sλ∈ S be the corresponding Schur polynomial.

Let

Pk,n={λis a partition | λ1≤n−k and `(λ)≤k}

={partitionsλ⊆ω}, where ω= (n−k,n−k, . . . ,n−k)

| {z }

k entries

.

Theorem (G.): The k-module SI is free with basis (sλ)λ∈P

k,n.

(31)

A slightly less general setting: symmetric a1,a2, . . . ,ak and J

FROM NOW ON, assume that a1,a2, . . . ,ak ∈ S.

Let I be the ideal ofS generated by the k differences hn−k+1−a1, hn−k+2−a2, . . . , hn−ak. (Same differences as forJ, but we are generating an ideal of S now.)

For each partitionλ, letsλ∈ S be the corresponding Schur polynomial.

Let

Pk,n={λis a partition | λ1≤n−k and `(λ)≤k}

={partitionsλ⊆ω}, where ω= (n−k,n−k, . . . ,n−k)

| {z }

k entries

.

Theorem (G.): The k-module SI is free with basis (sλ)λ∈P

k,n.

(32)

A slightly less general setting: symmetric a1,a2, . . . ,ak and J

FROM NOW ON, assume that a1,a2, . . . ,ak ∈ S.

Let I be the ideal ofS generated by the k differences hn−k+1−a1, hn−k+2−a2, . . . , hn−ak. (Same differences as forJ, but we are generating an ideal of S now.)

For each partitionλ, letsλ∈ S be the corresponding Schur polynomial.

Let

Pk,n ={λis a partition | λ1≤n−k and`(λ)≤k}

={partitionsλ⊆ω}, whereω = (n−k,n−k, . . . ,n−k)

| {z }

k entries

.

Theorem (G.): The k-module SI is free with basis (sλ)λ∈P

k,n.

(33)

A slightly less general setting: symmetric a1,a2, . . . ,ak and J

FROM NOW ON, assume that a1,a2, . . . ,ak ∈ S.

Let I be the ideal ofS generated by the k differences hn−k+1−a1, hn−k+2−a2, . . . , hn−ak. (Same differences as forJ, but we are generating an ideal of S now.)

For each partitionλ, letsλ∈ S be the corresponding Schur polynomial.

Let

Pk,n ={λis a partition | λ1≤n−k and`(λ)≤k}

={partitionsλ⊆ω}, whereω = (n−k,n−k, . . . ,n−k)

| {z }

k entries

.

Theorem (G.): The k-module SI is free with basis (sλ)λ∈P

k,n.

(34)

A slightly less general setting: symmetric a1,a2, . . . ,ak and J

FROM NOW ON, assume that a1,a2, . . . ,ak ∈ S.

Let I be the ideal ofS generated by the k differences hn−k+1−a1, hn−k+2−a2, . . . , hn−ak. (Same differences as forJ, but we are generating an ideal of S now.)

For each partitionλ, letsλ∈ S be the corresponding Schur polynomial.

Let

Pk,n ={λis a partition | λ1≤n−k and`(λ)≤k}

={partitionsλ⊆ω}, whereω = (n−k,n−k, . . . ,n−k)

| {z }

k entries

.

Theorem (G.): The k-module SI is free with basis (sλ)λ∈P

k,n.

(35)

An even less general setting: constant a1,a2, . . . ,ak

FROM NOW ON, assume that a1,a2, . . . ,ak ∈k.

This setting still is general enough to encompass several that we know:

Ifk=Z anda1=a2=· · ·=ak = 0, thenSI becomes the cohomology ring H(Gr (k,n)); the basis (sλ)λ∈P

k,n

corresponds to the Schubert classes.

Ifk=Z[q] anda1 =a2 =· · ·=ak−1= 0 and ak =−(−1)kq, then SI becomes the quantum cohomology ring QH(Gr (k,n)).

The above theorem lets us work in these rings (and more generally) without relying on geometry.

(36)

An even less general setting: constant a1,a2, . . . ,ak

FROM NOW ON, assume that a1,a2, . . . ,ak ∈k.

This setting still is general enough to encompass several that we know:

Ifk=Z anda1=a2=· · ·=ak = 0, thenSI becomes the cohomology ring H(Gr (k,n)); the basis (sλ)λ∈P

k,n

corresponds to the Schubert classes.

Ifk=Z[q] anda1 =a2 =· · ·=ak−1= 0 and ak =−(−1)kq, then SI becomes the quantum cohomology ring QH(Gr (k,n)).

The above theorem lets us work in these rings (and more generally) without relying on geometry.

(37)

An even less general setting: constant a1,a2, . . . ,ak

FROM NOW ON, assume that a1,a2, . . . ,ak ∈k.

This setting still is general enough to encompass several that we know:

Ifk=Z anda1=a2=· · ·=ak = 0, thenSI becomes the cohomology ring H(Gr (k,n)); the basis (sλ)λ∈P

k,n

corresponds to the Schubert classes.

Ifk=Z[q] anda1 =a2 =· · ·=ak−1= 0 and ak =−(−1)kq, then SI becomes the quantum cohomology ring QH(Gr (k,n)).

The above theorem lets us work in these rings (and more generally) without relying on geometry.

(38)

S3-symmetry of the Gromov–Witten invariants Recall that (sλ)λ∈P

k,n is a basis of the k-moduleSI.

For each µ∈Pk,n, let coeffµ:SI →ksend each element to its sµ-coordinate wrt this basis.

For every partition ν= (ν1, ν2, . . . , νk)∈Pk,n, we define ν:= (n−k−νk,n−k−νk−1, . . . ,n−k−ν1)∈Pk,n. This partition ν is called the complement ofν.

For any three partitions α, β, γ∈Pk,n, let gα,β,γ:= coeffγ(sαsβ)∈k.

These generalize the Littlewood–Richardson numbers and (3-point) Gromov–Witten invariants.

Theorem (G.): For anyα, β, γ∈Pk,n, we have

gα,β,γ =gα,γ,β=gβ,α,γ =gβ,γ,α=gγ,α,β=gγ,β,α

= coeffω(sαsβsγ).

Equivalent restatement: Each ν∈Pk,n andf ∈ SI satisfy coeffω(sνf) = coeffν(f).

(39)

S3-symmetry of the Gromov–Witten invariants Recall that (sλ)λ∈P

k,n is a basis of the k-moduleSI.

For each µ∈Pk,n, let coeffµ:SI →ksend each element to its sµ-coordinate wrt this basis.

For every partition ν= (ν1, ν2, . . . , νk)∈Pk,n, we define ν:= (n−k−νk,n−k−νk−1, . . . ,n−k−ν1)∈Pk,n. This partition ν is called the complement ofν.

For any three partitions α, β, γ∈Pk,n, let gα,β,γ:= coeffγ(sαsβ)∈k.

These generalize the Littlewood–Richardson numbers and (3-point) Gromov–Witten invariants.

Theorem (G.): For anyα, β, γ∈Pk,n, we have

gα,β,γ =gα,γ,β=gβ,α,γ =gβ,γ,α=gγ,α,β=gγ,β,α

= coeffω(sαsβsγ).

Equivalent restatement: Each ν∈Pk,n andf ∈ SI satisfy coeffω(sνf) = coeffν(f).

(40)

S3-symmetry of the Gromov–Witten invariants Recall that (sλ)λ∈P

k,n is a basis of the k-moduleSI.

For each µ∈Pk,n, let coeffµ:SI →ksend each element to its sµ-coordinate wrt this basis.

For every partition ν= (ν1, ν2, . . . , νk)∈Pk,n, we define ν:= (n−k−νk,n−k−νk−1, . . . ,n−k−ν1)∈Pk,n. This partition ν is called the complement ofν.

For any three partitions α, β, γ∈Pk,n, let gα,β,γ:= coeffγ(sαsβ)∈k.

These generalize the Littlewood–Richardson numbers and (3-point) Gromov–Witten invariants.

Theorem (G.): For anyα, β, γ∈Pk,n, we have

gα,β,γ =gα,γ,β=gβ,α,γ =gβ,γ,α=gγ,α,β=gγ,β,α

= coeffω(sαsβsγ).

Equivalent restatement: Each ν∈Pk,n andf ∈ SI satisfy coeffω(sνf) = coeffν(f).

(41)

S3-symmetry of the Gromov–Witten invariants Recall that (sλ)λ∈P

k,n is a basis of the k-moduleSI.

For each µ∈Pk,n, let coeffµ:SI →ksend each element to its sµ-coordinate wrt this basis.

For every partition ν= (ν1, ν2, . . . , νk)∈Pk,n, we define ν:= (n−k−νk,n−k−νk−1, . . . ,n−k−ν1)∈Pk,n. This partition ν is called the complement ofν.

For any three partitions α, β, γ∈Pk,n, let gα,β,γ:= coeffγ(sαsβ)∈k.

These generalize the Littlewood–Richardson numbers and (3-point) Gromov–Witten invariants.

Theorem (G.): For anyα, β, γ∈Pk,n, we have

gα,β,γ =gα,γ,β=gβ,α,γ =gβ,γ,α=gγ,α,β=gγ,β,α

= coeffω(sαsβsγ).

Equivalent restatement: Each ν∈Pk,n andf ∈ SI satisfy coeffω(sνf) = coeffν(f).

(42)

S3-symmetry of the Gromov–Witten invariants Recall that (sλ)λ∈P

k,n is a basis of the k-moduleSI.

For each µ∈Pk,n, let coeffµ:SI →ksend each element to its sµ-coordinate wrt this basis.

For every partition ν= (ν1, ν2, . . . , νk)∈Pk,n, we define ν:= (n−k−νk,n−k−νk−1, . . . ,n−k−ν1)∈Pk,n. This partition ν is called the complement ofν.

For any three partitions α, β, γ∈Pk,n, let gα,β,γ:= coeffγ(sαsβ)∈k.

These generalize the Littlewood–Richardson numbers and (3-point) Gromov–Witten invariants.

Theorem (G.): For anyα, β, γ∈Pk,n, we have

gα,β,γ =gα,γ,β=gβ,α,γ =gβ,γ,α=gγ,α,β=gγ,β,α

= coeffω(sαsβsγ).

Equivalent restatement: Each ν∈Pk,n andf ∈ SI satisfy coeffω(sνf) = coeffν(f).

(43)

S3-symmetry of the Gromov–Witten invariants Recall that (sλ)λ∈P

k,n is a basis of the k-moduleSI.

For each µ∈Pk,n, let coeffµ:SI →ksend each element to its sµ-coordinate wrt this basis.

For every partition ν= (ν1, ν2, . . . , νk)∈Pk,n, we define ν:= (n−k−νk,n−k−νk−1, . . . ,n−k−ν1)∈Pk,n. This partition ν is called the complement ofν.

For any three partitions α, β, γ∈Pk,n, let gα,β,γ:= coeffγ(sαsβ)∈k.

These generalize the Littlewood–Richardson numbers and (3-point) Gromov–Witten invariants.

Theorem (G.): For anyα, β, γ∈Pk,n, we have

gα,β,γ =gα,γ,β=gβ,α,γ =gβ,γ,α=gγ,α,β=gγ,β,α

= coeffω(sαsβsγ).

Equivalent restatement: Each ν∈Pk,n andf ∈ SI satisfy coeffω(sνf) = coeffν(f).

(44)

Theh-basis

Theorem (G.): The k-module SI is free with basis hλ

λ∈Pk,n.

The transfer matrix between the two bases (sλ)λ∈P

k,n and hλ

λ∈Pk,n is unitriangular wrt the “size-then-anti-dominance”

order, but seems hard to describe.

Proposition (G.): Letm be a positive integer. Then, hn+m=

k−1

X

j=0

(−1)jak−js(m,1j),

where m,1j

:= (m,1,1, . . . ,1

| {z }

j ones

) (a hook-shaped partition).

(45)

Theh-basis

Theorem (G.): The k-module SI is free with basis hλ

λ∈Pk,n.

The transfer matrix between the two bases (sλ)λ∈P

k,n and hλ

λ∈Pk,n is unitriangular wrt the “size-then-anti-dominance”

order, but seems hard to describe.

Proposition (G.): Letm be a positive integer. Then,

hn+m=

k−1

X

j=0

(−1)jak−js(m,1j),

where m,1j

:= (m,1,1, . . . ,1

| {z }

jones

) (a hook-shaped partition).

(46)

Theh-basis

Theorem (G.): The k-module SI is free with basis hλ

λ∈Pk,n.

The transfer matrix between the two bases (sλ)λ∈P

k,n and hλ

λ∈Pk,n is unitriangular wrt the “size-then-anti-dominance”

order, but seems hard to describe.

Proposition (G.): Letm be a positive integer. Then, hn+m=

k−1

X

j=0

(−1)jak−js(m,1j),

where m,1j

:= (m,1,1, . . . ,1

| {z }

jones

) (a hook-shaped partition).

(47)

A Pieri rule

Theorem (G.): Let λ∈Pk,n. Letj ∈ {0,1, . . . ,n−k}.

Then,

sλhj = X

µ∈Pk,n; µλis a horizontalj-strip

sµ

k

X

i=1

(−1)iaiX

ν⊆λ

c(n−k−jλ +1,1i−1),νsν,

wherecα,βγ are the usual Littlewood–Richardson coefficients.

This generalizes the Bertram/Ciocan-Fontanine/Fulton Pieri rule, but note that c(n−kλ −j+1,1i−1),ν may be>1.

Example:

s(4,3,2)h2 =s(4,4,3)+a1 s(4,2)+s(3,2,1)+s(3,3)

−a2 s(4,1)+s(2,2,1)+s(3,1,1)+ 2s(3,2) +a3 s(2,2)+s(2,1,1)+s(3,1)

. Multiplying by ej appears harder:

s(2,2,1)e2=a1s(2,2)−2a2s(2,1)+a3 s(2)+s(1,1)

+a21s(1)−2a1a2s().

(48)

A Pieri rule

Theorem (G.): Let λ∈Pk,n. Letj ∈ {0,1, . . . ,n−k}.

Then,

sλhj = X

µ∈Pk,n; µλis a horizontalj-strip

sµ

k

X

i=1

(−1)iaiX

ν⊆λ

c(n−k−jλ +1,1i−1),νsν,

wherecα,βγ are the usual Littlewood–Richardson coefficients.

This generalizes the Bertram/Ciocan-Fontanine/Fulton Pieri rule, but note that c(n−kλ −j+1,1i−1),ν may be>1.

Example:

s(4,3,2)h2=s(4,4,3)+a1 s(4,2)+s(3,2,1)+s(3,3)

−a2 s(4,1)+s(2,2,1)+s(3,1,1)+ 2s(3,2) +a3 s(2,2)+s(2,1,1)+s(3,1)

.

Multiplying by ej appears harder:

s(2,2,1)e2=a1s(2,2)−2a2s(2,1)+a3 s(2)+s(1,1)

+a21s(1)−2a1a2s().

(49)

A Pieri rule

Theorem (G.): Let λ∈Pk,n. Letj ∈ {0,1, . . . ,n−k}.

Then,

sλhj = X

µ∈Pk,n; µλis a horizontalj-strip

sµ

k

X

i=1

(−1)iaiX

ν⊆λ

c(n−k−jλ +1,1i−1),νsν,

wherecα,βγ are the usual Littlewood–Richardson coefficients.

This generalizes the Bertram/Ciocan-Fontanine/Fulton Pieri rule, but note that c(n−kλ −j+1,1i−1),ν may be>1.

Example:

s(4,3,2)h2=s(4,4,3)+a1 s(4,2)+s(3,2,1)+s(3,3)

−a2 s(4,1)+s(2,2,1)+s(3,1,1)+ 2s(3,2) +a3 s(2,2)+s(2,1,1)+s(3,1)

. Multiplying by ej appears harder:

s(2,2,1)e2=a1s(2,2)−2a2s(2,1)+a3 s(2)+s(1,1)

+a21s(1)−2a1a2s().

(50)

A Pieri rule

Theorem (G.): Let λ∈Pk,n. Letj ∈ {0,1, . . . ,n−k}.

Then,

sλhj = X

µ∈Pk,n; µλis a horizontalj-strip

sµ

k

X

i=1

(−1)iaiX

ν⊆λ

c(n−k−jλ +1,1i−1),νsν,

wherecα,βγ are the usual Littlewood–Richardson coefficients.

This generalizes the Bertram/Ciocan-Fontanine/Fulton Pieri rule, but note that c(n−kλ −j+1,1i−1),ν may be>1.

Example:

s(4,3,2)h2=s(4,4,3)+a1 s(4,2)+s(3,2,1)+s(3,3)

−a2 s(4,1)+s(2,2,1)+s(3,1,1)+ 2s(3,2) +a3 s(2,2)+s(2,1,1)+s(3,1)

. Multiplying by ej appears harder:

s(2,2,1)e2=a1s(2,2)−2a2s(2,1)+a3 s(2)+s(1,1)

+a21s(1)−2a1a2s().

(51)

Positivity?

Conjecture: Let bi = (−1)n−k−1ai for each i ∈ {1,2, . . . ,k}.

Let λ, µ, ν∈Pk,n. Then, (−1)|λ|+|µ|−|ν|

coeffν(sλsµ) is a polynomial inb1,b2, . . . ,bk with coefficients in N.

Verified for alln ≤7 using SageMath.

This would generalize positivity of Gromov–Witten invariants.

(52)

More questions

Question: DoesSI have a geometric meaning? If not, why does it behave so nicely?

Question: What other bases does SI have? Monomial symmetric? Power-sum?

Question: Do other properties of QH(Gr (k,n)) (such as

“curious duality” and “cyclic hidden symmetry”) generalize to SI?

(The Gr(k,n)Gr(nk,n) duality isomorphism does not exist in general: Ifk=Canda1= 6 anda2= 16, then

(SI)k=2,n=3,a

1=6,a2=16=C[x]/ (x10) (x+ 2)2

, which can never be a (SI)k=1,n=3, since (SI)k=1, n=3=C[x]/ x3a1

.)

Question: Is there an analogous generalization of

QH(Fl (n)) ? Is it connected to Fulton’s “universal Schubert polynomials”?

Question: Is there an equivariant analogue?

Question: “Straightening rules” for sλ whenλ /∈Pk,n, similar to the Bertram/Ciocan-Fontanine/Fulton “rim hook

algorithm”?

(53)

More questions

Question: DoesSI have a geometric meaning? If not, why does it behave so nicely?

Question: What other bases does SI have? Monomial symmetric? Power-sum?

Question: Do other properties of QH(Gr (k,n)) (such as

“curious duality” and “cyclic hidden symmetry”) generalize to SI?

(The Gr(k,n)Gr(nk,n) duality isomorphism does not exist in general: Ifk=Canda1= 6 anda2= 16, then

(SI)k=2,n=3,a

1=6,a2=16=C[x]/ (x10) (x+ 2)2

, which can never be a (SI)k=1,n=3, since (SI)k=1,n=3=C[x]/ x3a1

.)

Question: Is there an analogous generalization of

QH(Fl (n)) ? Is it connected to Fulton’s “universal Schubert polynomials”?

Question: Is there an equivariant analogue?

Question: “Straightening rules” for sλ whenλ /∈Pk,n, similar to the Bertram/Ciocan-Fontanine/Fulton “rim hook

algorithm”?

(54)

More questions

Question: DoesSI have a geometric meaning? If not, why does it behave so nicely?

Question: What other bases does SI have? Monomial symmetric? Power-sum?

Question: Do other properties of QH(Gr (k,n)) (such as

“curious duality” and “cyclic hidden symmetry”) generalize to SI?

(The Gr(k,n)Gr(nk,n) duality isomorphism does not exist in general: Ifk=Canda1= 6 anda2= 16, then

(SI)k=2,n=3,a

1=6,a2=16=C[x]/ (x10) (x+ 2)2

, which can never be a (SI)k=1,n=3, since (SI)k=1,n=3=C[x]/ x3a1

.)

Question: Is there an analogous generalization of

QH(Fl (n)) ? Is it connected to Fulton’s “universal Schubert polynomials”?

Question: Is there an equivariant analogue?

Question: “Straightening rules” for sλ whenλ /∈Pk,n, similar to the Bertram/Ciocan-Fontanine/Fulton “rim hook

algorithm”?

Referenzen

ÄHNLICHE DOKUMENTE

My role in this project was a central one: the publication is based on extensive discussions in the collaboration exploring possibilities for the realization of interesting quantum

III, we derive expressions for spectral correlation functions such as the autocorrelation and the parametric cross-correlation function of the spectral determinant and the spectral

In the paper we study the endomorphim semigroup of a general quantum polynomial ring, its finite groups of automorphisms and homological properties of this ring as a module over

customers Germany customers NRW universities near location customers near location suppliers Germany suppliers NRW universities NRW universities Germany consultants near

We report on the modeling and formal analysis of reliability require- ments in the context of an Airport Surveillance Radar system using SysML and probabilistic model checking1.

Upon receipt of this command from the host, the device sets BSY, saves any updated attribute values to non-volatile memory, sets DRQ, clears BSY, asserts INTRQ, and then

Abstract – The present innovative research continues a series of scientific articles on a) the theory of the firm in the nonlinear dynamic financial and economic systems in

The Gocken Multiplication Technology is a new technology developed at the National Root Crops Research Institute (NRCRI), Umudike, Nigeria, for very rapid multiplication of