• 検索結果がありません。

Equality Of Multiplicity Free Skew Characters

N/A
N/A
Protected

Academic year: 2022

シェア "Equality Of Multiplicity Free Skew Characters"

Copied!
30
0
0

読み込み中.... (全文を見る)

全文

(1)

Equality Of Multiplicity Free Skew Characters

Christian Gutschwager

23.02.2009

(2)

Outline

1 Introduction

2 Results

(3)

Partitions

Diagram

λ= (42,3,1) µ= (3,2)

λ= =⇒λ/µ=

(4)

Partitions

Skew-diagram

λ= (42,3,1) µ= (3,2)

λ= =⇒λ/µ=

(5)

Littlewood-Richardson Coefficients

Semistandard (weakly increasing among rows from left to right, strictly increasing among collumns from top to bottom) Tableauwordw is a lattice permutations.

Semistandard

semistandard: not semistandard:

1 1 1 2 2 3 3 4 4 4 4

1 1 1 2 2 1 1 2 2

(6)

Littlewood-Richardson Coefficients

Semistandard (weakly increasing among rows from left to right, strictly increasing among collumns from top to bottom) Tableauwordw is a lattice permutations.

Lattice permutation 1 1 3 3 2 2

1 1 1 2 2 2

w = (112233) w = (112221)

lattice permutation no lattice permutation

(7)

Littlewood-Richardson Coefficients

Semistandard (weakly increasing among rows from left to right, strictly increasing among collumns from top to bottom) Tableauwordw is a lattice permutations.

Definition

LR-coeffizient c(λ;µ, ν) equals the number of tableaus of shape λ/µ with contentν = (ν1, ν2, ν3, . . .) satisfying the above conditions.

(8)

Skew characters

Skew characters

[λ/µ] =X

ν

c(λ;µ, ν)[ν]

(9)

Skew characters

Skew characters

[λ/µ] =X

ν

c(λ;µ, ν)[ν]

Example λ= (3,3,1), µ = (2,1):

1 1 2 1

1 1 2 2

1 1 2 3

(10)

Skew characters

Skew characters

[λ/µ] =X

ν

c(λ;µ, ν)[ν]

Example λ= (3,3,1), µ = (2,1):

1 1 2 1

1 1 2 2

1 1 2 3

[(3,3,1)/(2,1)] = [3,1] + [2,2] + [2,1,1]

(11)

Skew characters

Skew characters

[λ/µ] =X

ν

c(λ;µ, ν)[ν]

Example λ= (3,3,1), µ = (2,1):

1 1 2 1

1 1 2 2

1 1 2 3

[(3,3,1)/(2,1)] = [3,1] + [2,2] + [2,1,1]

Skew Schur functions

sλ/µ =X

ν

c(λ;µ, ν)sν

(12)

Multiplicity free skew characters [λ/µ]

For fixed λ, µallc(λ;µ, ν)∈ {0,1}.

(13)

Multiplicity free skew characters [λ/µ]

Multiplicity free skew characters [λ/µ]

1.

(14)

Multiplicity free skew characters [λ/µ]

Multiplicity free skew characters [λ/µ]

1. 2. sin= 1

(15)

Multiplicity free skew characters [λ/µ]

Multiplicity free skew characters [λ/µ]

1. 2. sin= 1

3. sin= 2

(16)

Multiplicity free skew characters [λ/µ]

Multiplicity free skew characters [λ/µ]

1. 2. sin= 1

3. sin= 2 4. sout = 1

(17)

Equality of skew characters

Trivial: Translation of the skew diagram Trivial: Rotation of the skew diagram Nontrivial results by

Billera, Thomas, van Willigenburg Reiner, Shaw, van Willigenburg McNamara, van Willigenburg

Example

Staircase partition λ= (l,l−1,l −2, . . . ,2,1),µ arbitrary.

[λ/µ] = [(λ/µ)conjugate]

(18)

Equality of skew characters

Trivial: Translation of the skew diagram Trivial: Rotation of the skew diagram Nontrivial results by

Billera, Thomas, van Willigenburg Reiner, Shaw, van Willigenburg McNamara, van Willigenburg

Example

Staircase partition λ= (l,l−1,l −2, . . . ,2,1),µ arbitrary.

[λ/µ] = [(λ/µ)conjugate]

(19)

Equality of skew characters

Trivial: Translation of the skew diagram Trivial: Rotation of the skew diagram Nontrivial results by

Billera, Thomas, van Willigenburg Reiner, Shaw, van Willigenburg McNamara, van Willigenburg

Example

Staircase partition λ= (l,l−1,l −2, . . . ,2,1),µ arbitrary.

[λ/µ] = [(λ/µ)conjugate]

(20)

Equality of skew characters

Trivial: Translation of the skew diagram Trivial: Rotation of the skew diagram Nontrivial results by

Billera, Thomas, van Willigenburg Reiner, Shaw, van Willigenburg McNamara, van Willigenburg

Example

Staircase partition λ= (l,l−1,l −2, . . . ,2,1),µ arbitrary.

[λ/µ] = [(λ/µ)conjugate]

(21)

Results

Theorem

Let [λ/µ] = [α/β] be multiplicity free.

Then up to rotation and/or translation λ/µ=α/β or

λ=α= (l,l−1,l−2, . . .) andµ=βconjugate

(22)

Theorem

Let [A1] = [A2]withA1 being an arbitrary skew diagram A1=λ/µ having a partλ1 and a height l(λ).

Then A1 =A2 or A1= (A2)rotated.

A1:

l(λ)

λ1 µ

Proof

The corresponding product of Schubert classes is in this case a product of Schur functions.

(23)

Theorem

Let [A1] = [A2]withA1 being an arbitrary skew diagram A1=λ/µ having a partλ1 and a height l(λ).

Then A1 =A2 or A1= (A2)rotated.

A1:

l(λ)

λ1 µ

Proof

The corresponding product of Schubert classes is in this case a product of Schur functions.

(24)

Bijection

Take an arbitrary LR-Tableau which contains in every column a box filled with the entry 1.

Removing all boxes filled with the entry 1 and replacing afterwards every entry i (i >1) byi−1 yields another LR-Tableau.

Bijection

This gives a bijection between the characters [ν]∈[λ/µ] with maximal first part and arbitrary characters [ξ]∈[ˆλ/µ] with ˆλ/µ the skew diagram obtained by removing the top boxes in every column of λ/µ.

Theorem

[λ/µ] = [α/β]⇒[ˆλ/µ] = [ˆα/β]

(25)

Bijection

Take an arbitrary LR-Tableau which contains in every column a box filled with the entry 1.

Removing all boxes filled with the entry 1 and replacing afterwards every entry i (i >1) byi−1 yields another LR-Tableau.

Bijection

This gives a bijection between the characters [ν]∈[λ/µ] with maximal first part and arbitrary characters [ξ]∈[ˆλ/µ] with ˆλ/µ the skew diagram obtained by removing the top boxes in every column of λ/µ.

Theorem

[λ/µ] = [α/β]⇒[ˆλ/µ] = [ˆα/β]

(26)

Bijection

Take an arbitrary LR-Tableau which contains in every column a box filled with the entry 1.

Removing all boxes filled with the entry 1 and replacing afterwards every entry i (i >1) byi−1 yields another LR-Tableau.

Bijection

This gives a bijection between the characters [ν]∈[λ/µ] with maximal first part and arbitrary characters [ξ]∈[ˆλ/µ] with ˆλ/µ the skew diagram obtained by removing the top boxes in every column of λ/µ.

Theorem

[λ/µ] = [α/β]⇒[ˆλ/µ] = [ˆα/β]

(27)

Example λ/µ = (λ

a1

, λ

b2

)/(µ

m1

)

Theorem

Let λ/µ= (λa1, λb2)/(µm1 ) and[λ/µ] = [α/β].

Then λ/µ=α/β or λ/µ=α/βrotated.

(28)

Example λ/µ = (λ

a1

, λ

b2

)/(µ

m1

)

Proof: λ/µ=α/β or λ/µ=α/βrotated

λ/µ:

(29)

Example λ/µ = (λ

a1

, λ

b2

)/(µ

m1

)

Proof: λ/µ=α/β or λ/µ=α/βrotated

λ/µ:

λ/µ: α/β :

(30)

Example λ/µ = (λ

a1

, λ

b2

)/(µ

m1

)

Proof: λ/µ=α/β or λ/µ=α/βrotated

λ/µ:

λ/µ: α/β :

参照

関連したドキュメント

As expected, by a row-strict (respectively column-strict) reverse plane partition of shape λ/µ we mean a filling of the cells of λ/µ with entries from some ordered alphabet such

In this section we prove that the functional J defined in (1.5), where g and its primitive G satisfy the conditions in (A1)–(A5), satisfies the (PS) c condition provided that c 6=

This paper deals with some extensions of Hardy-Hilbert’s inequality with the best constant factors by introducing two parameters λ and α and using the Beta functionJ. The

From here they obtained a combinatorial in- terpretation for the Kronecker coefficients when λ is a product of homogeneous symmetric functions, and µ and ν are arbitrary skew

(This construction of the classical linking number was later generalized by U Kaiser [16] to the case of arbitrary submanifolds of the linking dimension that are homologous into

In order to prove Theorem 1.10 it is sufficient to construct a noise, extending the white noise, such that for every λ ∈ R \ { 0 } the extension obtained by the drift λ is

standard Young tableau (SYT) : Obtained by filling in the boxes of the Young diagram with distinct entries 1 to n such that the entries in each row and each column are increasing.. f

Soit p un nombre premier et K un corps, complet pour une valuation discr` ete, ` a corps r´ esiduel de caract´ eritique positive p. When k is finite, generalizing the theory of