( ℓ , 0 ) -Carter partitions, their crystal-theoretic behavior and generating function. Berg, Chris, Vazirani, Monica (2008) The Electronic Journal of Combinatorics [electronic only]
A bijective proof of the hook-content formula for super Schur functions and a modified jeu de taquin. Krattenthaler, C. (1996) The Electronic Journal of Combinatorics [electronic only]
A characterization for all interval doubling schemes of the lattice of permutations. Caspard, Nathalie (1999) Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
A class of projective representations of hyperoctahedral groups and Schur Q-functions Tadeusz Józefiak (1990) Banach Center Publications
A color-to-spin domino Schensted algorithm. Shimozono, Mark, White, Dennis E. (2001) The Electronic Journal of Combinatorics [electronic only]
A combinatorial approach to evaluation of reliability of the receiver output for BPSK modulation with spatial diversity. Bliudze, S., Krob, D. (2006) The Electronic Journal of Combinatorics [electronic only]
A combinatorial bijection between standard Young tableaux and reduced words of Grassmannian permutations. Winkel, Rudolf (1996) Séminaire Lotharingien de Combinatoire [electronic only]
A combinatorial formula for orthogonal idempotents in the 0-Hecke algebra of the symmetric group. Denton, Tom (2011) The Electronic Journal of Combinatorics [electronic only]
A combinatorial formula for the Hilbert series of bigraded S n -modules. Yoo, Meesue (2010) The Electronic Journal of Combinatorics [electronic only]
A combinatorial interpretation for the coefficients in the Kronecker product s ( n - p , p ) * s λ . Ballantine, Cristina M., Orellana, Rosa C. (2005) Séminaire Lotharingien de Combinatoire [electronic only]
A decomposition of Schur functions and an analogue of the Robinson-Schensted-Knuth algorithm. Mason, Sarah (2006) Séminaire Lotharingien de Combinatoire [electronic only]
A derivation of Kohnert's algorithm from Monk's rule. Winkel, Rudolf (2002) Séminaire Lotharingien de Combinatoire [electronic only]
A direct bijective proof of the hook-length formula. Novelli, Jean-Christophe, Pak, Igor, Stoyanovskii, Alexander V. (1997) Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
A Frobenius formula for the characters of the Hecke algebras. Arun Ram (1991) Inventiones mathematicae
A generalized major index statistic. Assaf, Sami H. (2008) Séminaire Lotharingien de Combinatoire [electronic only]
A geometric version of the Kerov-Kirillov-Reshetikhin construction. (Une version géométrique de la construction de Kerov-Kirilov-Reshetikhin.) Han, Guo-Niu (1993) Séminaire Lotharingien de Combinatoire [electronic only]
A Littlewood-Richardson rule for evaluation representations of U q ( 𝔰𝔩 ^ n ) . Leclerc, Bernard (2003) Séminaire Lotharingien de Combinatoire [electronic only]
A Macdonald vertex operator and standard tableaux statistics for the two-column ( q , t ) -Kosta coefficients. Zabrocki, Mike (1998) The Electronic Journal of Combinatorics [electronic only]
A `nice' bijection for a content formula for skew semistandard Young tableaux. Rubey, Martin (2002) The Electronic Journal of Combinatorics [electronic only]