2006
DOI: 10.1007/s10801-006-0044-1
|View full text |Cite
|
Sign up to set email alerts
|

Bijective proofs of shifted tableau and alternating sign matrix identities

Abstract: We give a bijective proof of an identity relating primed shifted gl(n)-standard tableaux to the product of a gl(n) character in the form of a Schur function and 1≤i< j≤n (x i + y j ). This result generalises a number of well-known results due to Robbins and Rumsey, Chapman, Tokuyama, Okada and Macdonald. An analogous result is then obtained in the case of primed shifted sp(2n)-standard tableaux which are bijectively related to the product of a t-deformed sp(2n) character and 1≤i< j≤n (x i + t 2 x −1 i + y j + … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
32
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(33 citation statements)
references
References 19 publications
1
32
0
Order By: Relevance
“…In order to prove the symmetry property of s Γ λ we will use an instance of (2) with △ = 0. We thus obtain a new proof of Tokuyama's formula and of Corollary 5.1 in Hamel and King [12], which is our Theorem 11. A second instance of the startriangle relation solves the same problem for the analogously defined s ∆ λ , and a third instance shows directly, without using the above evaluations, that s Γ λ = s ∆ λ .…”
Section: October 23 2018mentioning
confidence: 68%
“…In order to prove the symmetry property of s Γ λ we will use an instance of (2) with △ = 0. We thus obtain a new proof of Tokuyama's formula and of Corollary 5.1 in Hamel and King [12], which is our Theorem 11. A second instance of the startriangle relation solves the same problem for the analogously defined s ∆ λ , and a third instance shows directly, without using the above evaluations, that s Γ λ = s ∆ λ .…”
Section: October 23 2018mentioning
confidence: 68%
“…, n; A5 n i=1 a ij = 1 if j = λ k for some k and 0 otherwise. These too are in bijective correspondence with strict GTPs G ∈ G λ with the correspondence defined by [23] 1 if j = m and the mth diagonal of S contains i; 1 if j < m and the jth diagonal of S contains i but (j + 1)th does not; −1 if j < m and the (j + 1)th diagonal of S contains i but jth does not; 0 otherwise, (49) As emphasised elsewhere [14], to each ASM we can associate both a CPM and an SIC of the 6-vertex model. We define the CPMs C ∈ C λ corresponding to A ∈ A λ to be those matrices obtained by mapping the entries 1 and −1 in A to WE and NS, respectively, and mapping an entry 0 in A to one or other of NE, SE, NW or SW in accordance with the compass point arrangements of the nearest non-zero neighbours of the 0, as specified in the tabulation (50).…”
Section: Corollariesmentioning
confidence: 99%
“…See [24,25,26,27,28] for examples for the relation with the wavefunctions and the Felderhof model with other boundary conditions.…”
Section: Resultsmentioning
confidence: 99%