2006
DOI: 10.1016/j.jcta.2006.01.003
|View full text |Cite
|
Sign up to set email alerts
|

New fermionic formula for unrestricted Kostka polynomials

Abstract: A new fermionic formula for the unrestricted Kostka polynomials of type $A_{n-1}^{(1)}$ is presented. This formula is different from the one given by Hatayama et al. and is valid for all crystal paths based on Kirillov-Reshetihkin modules, not just for the symmetric and anti-symmetric case. The fermionic formula can be interpreted in terms of a new set of unrestricted rigged configurations. For the proof a statistics preserving bijection from this new set of unrestricted rigged configurations to the set of unr… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
108
0

Year Published

2006
2006
2020
2020

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 40 publications
(109 citation statements)
references
References 23 publications
(77 reference statements)
1
108
0
Order By: Relevance
“…Let W (r) s be a U q (g) Kirillov-Reshetikhin module, where we shall consider the case g = A (1) n . The module W (r) s is indexed by a Dynkin node r ∈ {1, 2, .…”
Section: Preliminaries 21 Kirillov-reshetikhin Crystalmentioning
confidence: 99%
See 2 more Smart Citations
“…Let W (r) s be a U q (g) Kirillov-Reshetikhin module, where we shall consider the case g = A (1) n . The module W (r) s is indexed by a Dynkin node r ∈ {1, 2, .…”
Section: Preliminaries 21 Kirillov-reshetikhin Crystalmentioning
confidence: 99%
“…Recently, the original KSS bijection was extended to include non-highest weight elements [23,1]. The combinatorial procedures for φ and φ −1 are the formal extension of the original ones.…”
Section: A3 Several Facts About Kss Bijectionmentioning
confidence: 99%
See 1 more Smart Citation
“…In order to generalize Kostka polynomials, there exist other combinatorial ways (with unrestricted rigged configurations recently introduced by L. Deka and A. Schilling in [1]) and algebraic ways (using the theory of crystal bases for quantum groups of type A n ) to generalize Kostka polynomials. Other generalizations are given by M. Zabrocki using creation operators in [16] and by L. Lapointe and J. Morse introducing a t-deformation of k-Schur functions in [9].…”
Section: Symmetric Functions and Kostka Polynomialsmentioning
confidence: 99%
“…combinat::skewRiggings L. Deka and A. Schilling introduced in [1] a new kind of rigged configurations, namely the unrestricted ones. They were implemented as an independent C++ program (file: FromOneCrystalPath.cc, headers: FromOneCrystalPath.h).…”
mentioning
confidence: 99%