Sergey Fomin* and. Minneapolis, MN We consider the partial order on partitions of integers dened by removal of

Size: px
Start display at page:

Download "Sergey Fomin* and. Minneapolis, MN We consider the partial order on partitions of integers dened by removal of"

Transcription

1 Rim Hook Lattices Sergey Fomin* Department of Mathematics, Massachusetts Institute of Technology Cambridge, MA Theory of Algorithms Laboratory St. Petersburg Institute of Informatics Russian Academy of Sciences and Dennis Stanton** School of Mathematics University of Minnesota Minneapolis, MN Abstract We consider the partial order on partitions of integers dened by removal of rim hooks of a given length. The isomorphism between this poset and a product of Young's lattices leads to rim hook versions of Schensted correspondences. Analogous results are given for shifted shapes. 1. Main Results A shape, or Young diagram, is a nite order ideal of the lattice P 2 = f(k; l) : k; l 1g. Each shape = f(i; j) : 1 j i g can be identied with the corresponding partition = ( 1 2 : : : ). Shapes form the Young lattice Y (see, e.g., [St86]). In drawing the shapes, we use the so-called \English notation;" for example, the partition (5; 3; 1; 1) is represented by the shape We denote by # the number of boxes in a shape. The i'th diagonal of a shape is the set f(k; l) : l? k = ig. A rim hook is a contiguous strip of boxes in P 2, which has at most one box on each diagonal. Throughout the paper a positive integer r is xed, and all the rim hooks contain exactly r boxes, with the exception of Denition 3.4(3). *Partially supported by the Mittag-Leer Institute. **Partially supported by the Mittag-Leer Institute and by NSF grant #DMS Mathematics Subject Classication. 05A. Key words and phrases. Young lattice, rim hooks, dierential posets. : Typeset by AMS-T E

2 2 1.1 Denition. Let and be shapes such that? is a rim hook. Then we write m. We write if there exists a sequence of shapes = 0 m 1 m m k =. In other words, means that can be obtained by deleting rim hooks from. If, then is said to be r-decomposable. The poset of all r-decomposable shapes ordered by is denoted by RH r and called the rim hook lattice. (We shall prove that this is indeed a lattice.) The following result is essentially known; however, we could not nd it elsewhere stated in this explicit form. 1.2 Theorem. The rim hook lattice RH r is isomorphic to the cartesian product of r copies of the Young lattice: RH r = Y r : The proof of this theorem is given in Sec.2. Figures 1 and 2 show the lattices RH 2 and RH 3, respectively; on the latter the underlying poset 3P 2 is highlighted. 1.3 Denition. Let P be a graded poset, K a eld of zero characteristic, and KP a vector space with a basis P. Dene the up and down operators U; D 2 End(KP ) by Ux = Dy = y covers x y covers x 1.4 Proposition. [Fo4,St88] The up and down operators in the Young lattice Y satisfy DU? UD = I where I is the identity transformation. Thus Y is a self-dual graph [Fo1] or a dierential poset [St88]. Generally, two graded graphs G 1 and G 2 with a common set of vertices and a common rank function are called r-dual [Fo1,Fo3] if the up operator U 1 in G 1 and the down operator D 2 in G 2 satisfy y ; x : D 2 U 1? U 1 D 2 = ri : It is easy to see [Fo1, Lemma 2.2.3] that if the graphs G 1 and G 2 are r-dual, and the graphs H 1 and H 2 are s-dual, then G 1 H 1 and G 2 H 2 are (r + s)-dual. 1.5 Corollary [SS90, Sec. 9, (9)]. The up and down operators in the rim hook lattice RH r satisfy the relation DU? UD = ri. Thus RH r is an r-self-dual graph, or r-dierential poset. One can therefore apply to RH r any of the enumerative results about such graphs given in [St88, Fo1,

3 3 Ro91, etc.]. Moreover, this will allow us to construct an analogue of the Schensted algorithm for the rim hook lattice, following [Fo2, Fo3]. This algorithm establishes a bijection between pairs of paths in RH r (\standard rim hook tableaux" [SW85]) and r-colored permutations. It is immediate from Theorem 1.2 that this algorithm can be viewed as a \direct product" of r copies of the standard Schensted algorithm (see, e.g., [Sa90]) running in parallel. The resulting algorithm coincides with one of [SW85], where it was originally described in terms of insertion steps. The next two corollaries provide examples of applications of general enumerative theory of r-dierential posets to the rim hook lattice. Let e r () denote the number of saturated chains = 0 m 1 m m n = (i.e., the number of standard rim hook tableaux of shape ). Similarly, we let e r (=) denote the number of \standard skew rim hook tableaux of shape =," i.e., the number of paths = 0 m 1 m m n = in the rim hook lattice. 1.6 Corollary. For 2 RH r, (i) (ii) #=rn #=rn e 2 r () = rn n! ; e r () = #fr-colored involutions in the symmetric group S n g where \r-colored involution" means a symmetric n n-matrix containing exactly one nonzero entry in each row and column; this entry should be one of 1; 2; : : : ; r. Proof. See, e.g., [Fo1, (1.5.19)] and [Fo2, Corollary 3.9.4]. The following result is an analogue of the formulae of [SS90]. 1.7 Corollary. Let ; 2 RH r, # = rk, # = r(k + n? m) (n and m are xed). Then #=r(k+n)e r (=) e r (=) = j r j m j Proof. See [Fo2, Corollary 3.8.3(iv)]. n j j! #=r(k?m+j) e r (=) e r (=) : In Sec. 3 we give the analogues of the above results for the shifted shapes. Acknowledgements. We are grateful to Anders Bjorner who asked whether the approach of [Fo1, Fo2] can be applied to rim hook tableaux. We thank Curtis Greene and Richard Stanley for helpful comments. Figures were produced by Curtis Greene using the Mathematica TM package [GH90]. This paper originally appeared in March 1992 as Report No. 23 of Institut Mittag-Leer.

4 4 2. Fairy Sequences 2.1 Denition. A map f : Z?! Z is called a fairy sequence if the following conditions hold: (i) f(i) f(j) whenever 0 i j ; (ii) f(j) f(i) whenever j i 0 ; (iii) jf(i)? f(i? 1)j 1 for all i ; (iv) f(i) = 0 if jij is suciently large: The following lemmas concerning fairy sequences are fairly straightforward. 2.2 Lemma. There is a bijective correspondence between shapes (Young diagrams) and fairy sequences. This bijection (denoted 7! f ) is given by f (i) = #f boxes on the i'th diagonal of g : 2.3 Lemma. A shape is r-decomposable if and only if the corresponding fairy sequence f = f satises the following condition: (1) ia( mod r) f(i) = ib( mod r) f(i) for any a; b 2 Z: 2.4 Denition. Let f (0), : : :,f (r?1) be fairy sequences. Then will denote the sequence dened by (2) f(i) = f = hf (0) ; : : : ; f (r?1) i r?1 i + k f (k) r k=0 where [: : : ] stands for the integer part. 2.5 Lemma. We have (3) f(i)? f(i? 1) = f (k) i + k r where k = (?i) mod r.? f (k) i + k r? Lemma. For any fairy sequences f (0), : : :,f (r?1), the sequence is fairy and r-decomposable. f = hf (0) ; : : : ; f (r?1) i Proof. The rst property follows from Lemma 2.5, the second one from ia( mod r) f(i) = k j f (k) (j) :

5 5 2.7 Lemma. Any fairy and r-decomposable sequence f can be uniquely represented as f = hf (0) ; : : : ; f (r?1) i, where f (0), : : :,f (r?1) are some fairy sequences. Proof. Given such a sequence f, one can inductively use (2) to nd the values f (k) (j), starting with f (k) (j) = 0 for j 0. The equality (3) guarantees that the resulting sequences satisfy Denition 2.1,(i)-(iii). The condition (1) for b = a? 1 gives, together with (3), the equality and the proof follows. lim j!1 f (k) (j)? lim j!?1 f (k) (j) = 0 ; Proof of Theorem 1.2. We will prove that the bijection (4) f! (f (0) ; : : : ; f (r?1) ) induces an isomorphism between RH r and Y r. According to (2), the following are equivalent: (i) adding 1 to some f (k) (j) ; (ii) adding 1 to each of f(i); f(i + 1); : : : ; f(i + r? 1) for some i. In view of Lemmas , the operations (i) and (ii) either both preserve the \fairyness" or both don't. To complete the proof, note that (i) corresponds to adding a box to the respective shape, and (ii) to adding a rim hook. Theorem 1.2 can be also proved by means of the approach of [K81]. 3. Shifted shapes In this section we dene the shifted rim hooks (Denition 3.4) and nd the analogous isomorphism theorem (Theorem 3.7) for shifted shapes. 3.1 Denition. Let SemiPascal be the set f(k; l) 2 Z 2 : l > k 1g ordered by inclusion. The nite order ideals in SemiPascal are called shifted shapes; the corresponding distributive lattice is denoted SY. For any 2 SY, let () denote the \symmetrized" shape being a union of and a ipped shifted shape 0 ; formally, 0 = f(l; k? 1) : (k; l) 2 g ; () = [ 0 : Informally, this means that we fold the shifted shape about a diagonal line just to the left of 's main diagonal, and add it to.

6 6 For example, if = (4; 1), then () = (5; 3; 1; 1): : Similarly, two fairy sequences f and g are said to be folded to each other if f(k) = g(1? k) for all k 2 Z. This means that their respective shapes are related by folding across the diagonal in the denition of (). We call f self-folded if f(k) = f(1? k) for all k 2 Z. The next lemma follows immediately from the denition of (). 3.2 Lemma. For any shifted shape, the fairy sequence f = f () is self-folded; namely, (5) f(k) = f(1? k) for k 2 Z : Conversely, any fairy sequence satisfying (5) has a unique representation of the form f = f () for an appropriate shifted shape. It is clear that self-conjugate (left-justied) shapes have fairy sequences f which are symmetric, f(k) = f(?k), for all k 2 Z. We need these fairy sequences for the next lemma, which applies (4) to self-folded shapes (). 3.3 Lemma (cf. [Ol87,MY86,GKS90]). The bijection (4), when restricted to the shifted shape case, reduces to a bijection between (i) r-decomposable self-folded fairy sequences and (ii) r-tuples (f (0) ; : : : ; f (r?1) ) of fairy sequences where f (0) is self-folded, f (i) is folded to f (r?i) for 1 i r?1 2, and if r is even then, in addition, f (r=2) is symmetric. We next dene shifted rim hooks. This denition will allow us to dene the shifted rim hook lattice, SRH r, on all r-decomposable shifted shapes. 3.4 Denition. A shifted rim hook is a convex subset of SemiPascal which satises one of the three following conditions: (1) for some i r, h has exactly one box on each of the diagonals i? r + 1; : : : ; i; (2) for some i; r=2 < i < r, h has two boxes on each of the diagonals 1; : : : ; r? i and one box on the diagonals r? i + 1; : : : ; i; (3) for i = r=2, h has one box on each of the diagonals 1; : : : ; r=2. (In the cases (1) and (2), a shifted rim hook contains r boxes, while in the case (3), r is even, and the shifted rim hook has r=2 boxes.)

7 7 The following picture describes some shifted rim hooks which one can add to the shifted shape 41: M L K H I G F E D C B A For r = 4: BCDE, EF G, K; for r = 5: ABCDE, DEF G, EF GK, GHIK. Shifted rim hooks dene the covering relation in the shifted rim hook lattice SRH r. The posets (lattices) SYand SRH 2 are given in Figures 3 and 4, respectively; the join-irreducible elements are highlighted. The rank function rank r on SRH r is standard for r odd: rank r () = #=r, but this does not hold for r even. For example, for r = 2, rank 2 () is the number of boxes of lying on odd diagonals; rank 2 (542) = 6. The next two lemmas are straightforward corollaries of the denitions. 3.5 Lemma. The bijection $ f () is a poset isomorphism between SYand the coordinate-wise partial order on self-folded fairy sequences. 3.6 Lemma. The coordinate-wise partial order on the set of symmetric fairy sequences is isomorphic to SY. We thus obtain the following result. 3.7 Theorem. If r is odd, then SRH r = SY Y r?1 2 : If r is even, then SRH r = SY SY Y r?2 2 : 3.8 Lemma [Fo2]. Let SY be the graph obtained from SY by doubling the edges which correspond to adding boxes lying outside the rst diagonal. Then SYand SY are dual. Let us now dene the graphs SRHr as follows: take the shifted rim hook lattice SRH r and double its edges which correspond to adding rim hooks of type (1) (see Denition 3.4) with i = rj, j 2, and, in case r is even, those with i = r(j + 2 1), j 1, as well. 3.9 Corollary. The graphs SRH r and SRH r are r+2 2 -dual. In addition, if r is odd, then SRHr = SY Y r?1 2 ; if r is even, then SRH r = SY SY Y r?2 2 : Once a dual graph is constructed, the corresponding Schensted algorithm arises, r?1 as shown in [Fo2, Fo3]. In this case it decomposes into 2 independently running

8 8 ordinary Schensteds, along with one or two (for r odd and even, respectively) independently running \shifted Schensteds" (see [Wo84,Sa87,Ha89,Fo2]). Now we can apply to the shifted rim hook lattices all of the results concerning arbitrary dual graphs (see [St88, St90, Fo1, Fo2]). In particular, we get the following analogue of the Young-Frobenius identity. To state it, let us dene the numbers d r () as follows. Take any decomposition of a shifted shape into shifted rim hooks. Let d r () be the number of shifted rim hooks whose value of i in Denition 3.4 is r(j + 1) or r(j ) for j Corollary. Let e r () denote the number of shifted rim hook tableaux of shape. Then r + 2 n e 2 r() 2 dr() = n! : 2 2SRH r rank()=n To provide an example, let us take r = 2 and n = 3. Note that for r = 2, d 2 () is the number of shifted rim hooks whose value of i is not 1 or 2. The elements of rank 3 in SRH 2 are (6), (4,2), (4,1), (3,2), (3,1), and (5), which respectively have 1,1,3,3,1, and 1 shifted rim hook tableaux for r = 2. For example, for (4,1), the shifted rim hook tableaux are ; 2 ; 2 : The shapes (6), (4,2), (4,1), (3,2), (3,1), and (5) have weights 2 d r() equal to 4, 2, 2, 2, 2, and 4, respectively. Then Corollary 3.10 tells that = 48 = 2 3 3!. References [Fo1] S. Fomin, Duality of graded graphs,. Algebr. Combinatorics 3 (1994), [Fo2] S. Fomin, Schensted algorithms for dual graded graphs,. Algebr. Combinatorics 4 (1995), [Fo3] S. Fomin, Dual graphs and Schensted correspondences, in: Proceedings of the Fourth Intern. Conf. on Formal Power Series and Algebraic combinatorics, Montreal, [Fo4] S. Fomin, Generalized Robinson-Schensted-Knuth correspondence,. Sov. Math. 41 (1988), [GKS90] F. Garvan, D. Kim, and D. Stanton, Cranks and t-cores, Invent. Math., 101 (1990), [GH90] C. Greene and E. Hunsicker, A Mathematica package for exploring posets, Haverford College, [Ha89] M. D. Haiman, On mixed insertion, symmetry, and shifted Young tableaux,. Combin. Theory, Ser.A 50 (1989),

9 [K81] G. ames and A. Kerber, The representation theory of the symmetric group, Vol. 16, in: Encyclopedia of Mathematics and its Applications, (G.-C. Rota, Ed.), Addison-Wesley, Reading, Mass., [MY86] A. O. Morris and A. K. Yasseen, Some combinatorial results involving shifted Young diagrams, Math. Proc. Camb. Phil. Soc., 99 (1986), [Ol87]. Olsson, Frobenius symbols for partitions and degrees of spin characters, Math. Scand., 61 (1987), [Ro91] T. W. Roby, Applications and extensions of Fomin's generalization of the Robinson-Schensted correspondence to dierential posets, Ph.D.thesis, M.I.T., [Sa87] B. E. Sagan, Shifted tableaux, Schur Q-functions and a conjecture of R.Stanley,. Combin. Theory, Ser.A 45 (1987), [Sa90] B. E. Sagan, The ubiquitous Young tableaux, in: Invariant theory and Young tableaux, D.Stanton, Ed., Springer-Verlag, 1990, [SS90] B. E. Sagan and R. P. Stanley, Robinson-Schensted algorithms for skew tableaux,. Combin. Theory, Ser.A 55 (1990), [St86] R. P. Stanley, Enumerative combinatorics, vol.i, Wadsworth and Brooks/Cole, Pacic Grove, CA, [St88] R. P. Stanley, Dierential posets,. Amer. Math. Soc. 1 (1988), [SW85] D. W. Stanton and D. E. White, A Schensted algorithm for rim hook tableaux,. Combin. Theory, Ser.A 40 (1985), [Wo84] D. R. Worley, A theory of shifted Young tableaux, Ph.D.thesis, M.I.T.,

Sergey Fomin* Theory of Algorithms Laboratory Institute of Informatics, Russian Academy of Sciences St.Petersburg , Russia

Sergey Fomin* Theory of Algorithms Laboratory Institute of Informatics, Russian Academy of Sciences St.Petersburg , Russia Sergey Fomin* Theory of Algorithms Laboratory Institute of Informatics, Russian Academy of Sciences St.Petersburg 199178, Russia and Dennis Stanton** School of Mathematics University of Minnesota Minneapolis,

More information

2 IGOR PAK so we loose some information about the structure of the tilings since there could be many tilings of with the same multiset of tiles (see e

2 IGOR PAK so we loose some information about the structure of the tilings since there could be many tilings of with the same multiset of tiles (see e RIBBON TILE INVARIANTS Igor Pak MIT E-mail: pak@math.mit.edu September 30, 1997 Abstract. Let T be a nite set of tiles, B be a set of regions tileable by T. We introduce a tile counting group G (T; B)

More information

MULTI-ORDERED POSETS. Lisa Bishop Department of Mathematics, Occidental College, Los Angeles, CA 90041, United States.

MULTI-ORDERED POSETS. Lisa Bishop Department of Mathematics, Occidental College, Los Angeles, CA 90041, United States. INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A06 MULTI-ORDERED POSETS Lisa Bishop Department of Mathematics, Occidental College, Los Angeles, CA 90041, United States lbishop@oxy.edu

More information

A Bijection between Maximal Chains in Fibonacci Posets

A Bijection between Maximal Chains in Fibonacci Posets journal of combinatorial theory, Series A 78, 268279 (1997) article no. TA972764 A Bijection between Maximal Chains in Fibonacci Posets Darla Kremer Murray State University, Murray, Kentucky 42071 and

More information

ODD PARTITIONS IN YOUNG S LATTICE

ODD PARTITIONS IN YOUNG S LATTICE Séminaire Lotharingien de Combinatoire 75 (2016), Article B75g ODD PARTITIONS IN YOUNG S LATTICE ARVIND AYYER, AMRITANSHU PRASAD, AND STEVEN SPALLONE Abstract. We show that the subgraph induced in Young

More information

DIFFERENTIAL POSETS SIMON RUBINSTEIN-SALZEDO

DIFFERENTIAL POSETS SIMON RUBINSTEIN-SALZEDO DIFFERENTIAL POSETS SIMON RUBINSTEIN-SALZEDO Abstract. In this paper, we give a sampling of the theory of differential posets, including various topics that excited me. Most of the material is taken from

More information

The symmetric group action on rank-selected posets of injective words

The symmetric group action on rank-selected posets of injective words The symmetric group action on rank-selected posets of injective words Christos A. Athanasiadis Department of Mathematics University of Athens Athens 15784, Hellas (Greece) caath@math.uoa.gr October 28,

More information

Pieri s Formula for Generalized Schur Polynomials

Pieri s Formula for Generalized Schur Polynomials Formal Power Series and Algebraic Combinatorics Séries Formelles et Combinatoire Algébrique San Diego, California 2006 Pieri s Formula for Generalized Schur Polynomials Abstract. We define a generalization

More information

q-alg/ v2 15 Sep 1997

q-alg/ v2 15 Sep 1997 DOMINO TABLEAUX, SCH UTZENBERGER INVOLUTION, AND THE SYMMETRIC GROUP ACTION ARKADY BERENSTEIN Department of Mathematics, Cornell University Ithaca, NY 14853, U.S.A. q-alg/9709010 v 15 Sep 1997 ANATOL N.

More information

The Gaussian coefficient revisited

The Gaussian coefficient revisited The Gaussian coefficient revisited Richard EHRENBORG and Margaret A. READDY Abstract We give new -(1+)-analogue of the Gaussian coefficient, also now as the -binomial which, lie the original -binomial

More information

GENERALIZATION OF THE SIGN REVERSING INVOLUTION ON THE SPECIAL RIM HOOK TABLEAUX. Jaejin Lee

GENERALIZATION OF THE SIGN REVERSING INVOLUTION ON THE SPECIAL RIM HOOK TABLEAUX. Jaejin Lee Korean J. Math. 8 (00), No., pp. 89 98 GENERALIZATION OF THE SIGN REVERSING INVOLUTION ON THE SPECIAL RIM HOOK TABLEAUX Jaejin Lee Abstract. Eğecioğlu and Remmel [] gave a combinatorial interpretation

More information

ENUMERATION OF TREES AND ONE AMAZING REPRESENTATION OF THE SYMMETRIC GROUP. Igor Pak Harvard University

ENUMERATION OF TREES AND ONE AMAZING REPRESENTATION OF THE SYMMETRIC GROUP. Igor Pak Harvard University ENUMERATION OF TREES AND ONE AMAZING REPRESENTATION OF THE SYMMETRIC GROUP Igor Pak Harvard University E-mail: pak@math.harvard.edu Alexander Postnikov Massachusetts Institute of Technology E-mail: apost@math.mit.edu

More information

A RELATION BETWEEN SCHUR P AND S. S. Leidwanger. Universite de Caen, CAEN. cedex FRANCE. March 24, 1997

A RELATION BETWEEN SCHUR P AND S. S. Leidwanger. Universite de Caen, CAEN. cedex FRANCE. March 24, 1997 A RELATION BETWEEN SCHUR P AND S FUNCTIONS S. Leidwanger Departement de Mathematiques, Universite de Caen, 0 CAEN cedex FRANCE March, 997 Abstract We dene a dierential operator of innite order which sends

More information

A multiplicative deformation of the Möbius function for the poset of partitions of a multiset

A multiplicative deformation of the Möbius function for the poset of partitions of a multiset Contemporary Mathematics A multiplicative deformation of the Möbius function for the poset of partitions of a multiset Patricia Hersh and Robert Kleinberg Abstract. The Möbius function of a partially ordered

More information

Euler characteristic of the truncated order complex of generalized noncrossing partitions

Euler characteristic of the truncated order complex of generalized noncrossing partitions Euler characteristic of the truncated order complex of generalized noncrossing partitions D. Armstrong and C. Krattenthaler Department of Mathematics, University of Miami, Coral Gables, Florida 33146,

More information

arxiv: v1 [math.co] 23 Feb 2012

arxiv: v1 [math.co] 23 Feb 2012 HOW TO WRITE A PERMUTATION AS A PRODUCT OF INVOLUTIONS (AND WHY YOU MIGHT CARE) T. KYLE PETERSEN AND BRIDGET EILEEN TENNER arxiv:0.9v [math.co] Feb 0 Abstract. It is well-known that any permutation can

More information

R-S correspondence for (Z 2 Z 2 ) S n and Klein-4 diagram algebras

R-S correspondence for (Z 2 Z 2 ) S n and Klein-4 diagram algebras R-S correspondence for (Z Z ) S n and Klein-4 diagram algebras M. Parvathi and B. Sivakumar Ramanujan Institute for Advanced Study in Mathematics University of Madras, Chennai-600 005, India sparvathi.riasm@gmail.com,b.sivakumar@hotmail.com

More information

DESCENT SETS FOR SYMPLECTIC GROUPS

DESCENT SETS FOR SYMPLECTIC GROUPS DESCENT SETS FOR SYMPLECTIC GROUPS MARTIN RUBEY, BRUCE E. SAGAN, AND BRUCE W. WESTBURY Abstract. The descent set of an oscillating (or up-down) tableau is introduced. This descent set plays the same role

More information

Modular representations of symmetric groups: An Overview

Modular representations of symmetric groups: An Overview Modular representations of symmetric groups: An Overview Bhama Srinivasan University of Illinois at Chicago Regina, May 2012 Bhama Srinivasan (University of Illinois at Chicago) Modular Representations

More information

Stability of Kronecker products of irreducible characters of the symmetric group

Stability of Kronecker products of irreducible characters of the symmetric group Stability of Kronecker products of irreducible characters of the symmetric group Ernesto Vallejo 1 Instituto de Matemáticas Universidad Nacional Autónoma de México Area de la Inv. Cient. 04510 México,

More information

THREE GENERALIZATIONS OF WEYL'S DENOMINATOR FORMULA. Todd Simpson Tred Avon Circle, Easton, MD 21601, USA.

THREE GENERALIZATIONS OF WEYL'S DENOMINATOR FORMULA. Todd Simpson Tred Avon Circle, Easton, MD 21601, USA. THREE GENERALIZATIONS OF WEYL'S DENOMINATOR FORMULA Todd Simpson 7661 Tred Avon Circle, Easton, MD 1601, USA todo@ora.nobis.com Submitted: July 8, 1995; Accepted: March 15, 1996 Abstract. We give combinatorial

More information

ON AN INFINITE-DIMENSIONAL GROUP OVER A FINITE FIELD. A. M. Vershik, S. V. Kerov

ON AN INFINITE-DIMENSIONAL GROUP OVER A FINITE FIELD. A. M. Vershik, S. V. Kerov ON AN INFINITE-DIMENSIONAL GROUP OVER A FINITE FIELD A. M. Vershik, S. V. Kerov Introduction. The asymptotic representation theory studies the behavior of representations of large classical groups and

More information

Standard Young Tableaux Old and New

Standard Young Tableaux Old and New Standard Young Tableaux Old and New Ron Adin and Yuval Roichman Department of Mathematics Bar-Ilan University Workshop on Group Theory in Memory of David Chillag Technion, Haifa, Oct. 14 1 2 4 3 5 7 6

More information

THE LARGEST INTERSECTION LATTICE OF A CHRISTOS A. ATHANASIADIS. Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin.

THE LARGEST INTERSECTION LATTICE OF A CHRISTOS A. ATHANASIADIS. Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin. THE LARGEST INTERSECTION LATTICE OF A DISCRIMINANTAL ARRANGEMENT CHRISTOS A. ATHANASIADIS Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin. 6 (1997), 229{246] about the \largest" intersection

More information

Cylindric Young Tableaux and their Properties

Cylindric Young Tableaux and their Properties Cylindric Young Tableaux and their Properties Eric Neyman (Montgomery Blair High School) Mentor: Darij Grinberg (MIT) Fourth Annual MIT PRIMES Conference May 17, 2014 1 / 17 Introduction Young tableaux

More information

Heights of characters and defect groups

Heights of characters and defect groups [Page 1] Heights of characters and defect groups Alexander Moretó 1. Introduction An important result in ordinary character theory is the Ito-Michler theorem, which asserts that a prime p does not divide

More information

A Formula for the Specialization of Skew Schur Functions

A Formula for the Specialization of Skew Schur Functions A Formula for the Specialization of Skew Schur Functions The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher

More information

1 I A Q E B A I E Q 1 A ; E Q A I A (2) A : (3) A : (4)

1 I A Q E B A I E Q 1 A ; E Q A I A (2) A : (3) A : (4) Latin Squares Denition and examples Denition. (Latin Square) An n n Latin square, or a latin square of order n, is a square array with n symbols arranged so that each symbol appears just once in each row

More information

Multiplicity-Free Products of Schur Functions

Multiplicity-Free Products of Schur Functions Annals of Combinatorics 5 (2001) 113-121 0218-0006/01/020113-9$1.50+0.20/0 c Birkhäuser Verlag, Basel, 2001 Annals of Combinatorics Multiplicity-Free Products of Schur Functions John R. Stembridge Department

More information

The Catalan matroid.

The Catalan matroid. The Catalan matroid. arxiv:math.co/0209354v1 25 Sep 2002 Federico Ardila fardila@math.mit.edu September 4, 2002 Abstract We show how the set of Dyck paths of length 2n naturally gives rise to a matroid,

More information

A Pieri rule for key polynomials

A Pieri rule for key polynomials Séminaire Lotharingien de Combinatoire 80B (2018) Article #78, 12 pp. Proceedings of the 30 th Conference on Formal Power Series and Algebraic Combinatorics (Hanover) A Pieri rule for key polynomials Sami

More information

An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings

An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 2 (207) 205 27 An algebraic proof of the Erdős-Ko-Rado theorem for intersecting

More information

Theoretical Computer Science

Theoretical Computer Science Theoretical Computer Science 406 008) 3 4 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Discrete sets with minimal moment of inertia

More information

arxiv: v1 [math.co] 2 Dec 2008

arxiv: v1 [math.co] 2 Dec 2008 An algorithmic Littlewood-Richardson rule arxiv:08.0435v [math.co] Dec 008 Ricky Ini Liu Massachusetts Institute of Technology Cambridge, Massachusetts riliu@math.mit.edu June, 03 Abstract We introduce

More information

YOUNG TABLEAUX AND THE REPRESENTATIONS OF THE SYMMETRIC GROUP

YOUNG TABLEAUX AND THE REPRESENTATIONS OF THE SYMMETRIC GROUP YOUNG TABLEAUX AND THE REPRESENTATIONS OF THE SYMMETRIC GROUP YUFEI ZHAO ABSTRACT We explore an intimate connection between Young tableaux and representations of the symmetric group We describe the construction

More information

Partitions, rooks, and symmetric functions in noncommuting variables

Partitions, rooks, and symmetric functions in noncommuting variables Partitions, rooks, and symmetric functions in noncommuting variables Mahir Bilen Can Department of Mathematics, Tulane University New Orleans, LA 70118, USA, mcan@tulane.edu and Bruce E. Sagan Department

More information

A note on quantum products of Schubert classes in a Grassmannian

A note on quantum products of Schubert classes in a Grassmannian J Algebr Comb (2007) 25:349 356 DOI 10.1007/s10801-006-0040-5 A note on quantum products of Schubert classes in a Grassmannian Dave Anderson Received: 22 August 2006 / Accepted: 14 September 2006 / Published

More information

Two Remarks on Skew Tableaux

Two Remarks on Skew Tableaux Two Remarks on Skew Tableaux Richard P. Stanley Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139 rstan@math.mit.edu Submitted: 2011; Accepted: 2011; Published: XX Mathematics

More information

The Descent Set and Connectivity Set of a Permutation

The Descent Set and Connectivity Set of a Permutation 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.3.8 The Descent Set and Connectivity Set of a Permutation Richard P. Stanley 1 Department of Mathematics Massachusetts Institute

More information

Combinatorics for algebraic geometers

Combinatorics for algebraic geometers Combinatorics for algebraic geometers Calculations in enumerative geometry Maria Monks March 17, 214 Motivation Enumerative geometry In the late 18 s, Hermann Schubert investigated problems in what is

More information

The cocycle lattice of binary matroids

The cocycle lattice of binary matroids Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*

More information

Two Remarks on Skew Tableaux

Two Remarks on Skew Tableaux Two Remarks on Skew Tableaux The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Stanley, Richard P. "Two

More information

arxiv:math/ v2 [math.co] 19 Sep 2005

arxiv:math/ v2 [math.co] 19 Sep 2005 A COMBINATORIAL PROOF OF THE ROGERS-RAMANUJAN AND SCHUR IDENTITIES arxiv:math/04072v2 [math.co] 9 Sep 2005 CILANNE BOULET AND IGOR PAK Abstract. We give a combinatorial proof of the first Rogers-Ramanujan

More information

NOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET. 1. Basic Definitions

NOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET. 1. Basic Definitions NOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET JENNIFER WOODCOCK 1. Basic Definitions Dyck paths are one of the many combinatorial objects enumerated by the Catalan numbers, sequence A000108 in [2]:

More information

DUAL IMMACULATE QUASISYMMETRIC FUNCTIONS EXPAND POSITIVELY INTO YOUNG QUASISYMMETRIC SCHUR FUNCTIONS

DUAL IMMACULATE QUASISYMMETRIC FUNCTIONS EXPAND POSITIVELY INTO YOUNG QUASISYMMETRIC SCHUR FUNCTIONS DUAL IMMACULATE QUASISYMMETRIC FUNCTIONS EXPAND POSITIVELY INTO YOUNG QUASISYMMETRIC SCHUR FUNCTIONS EDWARD E. ALLEN, JOSHUA HALLAM, AND SARAH K. MASON Abstract. We describe a combinatorial formula for

More information

Balanced Labellings and Schubert Polynomials. Sergey Fomin. Curtis Greene. Victor Reiner. Mark Shimozono. October 11, 1995.

Balanced Labellings and Schubert Polynomials. Sergey Fomin. Curtis Greene. Victor Reiner. Mark Shimozono. October 11, 1995. Balanced Labellings and Schubert Polynomials Sergey Fomin Curtis Greene Victor Reiner Mark Shimozono October 11, 1995 Abstract We study balanced labellings of diagrams representing the inversions in a

More information

A quasisymmetric function generalization of the chromatic symmetric function

A quasisymmetric function generalization of the chromatic symmetric function A quasisymmetric function generalization of the chromatic symmetric function Brandon Humpert University of Kansas Lawrence, KS bhumpert@math.ku.edu Submitted: May 5, 2010; Accepted: Feb 3, 2011; Published:

More information

Factorization of the Robinson-Schensted-Knuth Correspondence

Factorization of the Robinson-Schensted-Knuth Correspondence Factorization of the Robinson-Schensted-Knuth Correspondence David P. Little September, 00 Abstract In [], a bijection between collections of reduced factorizations of elements of the symmetric group was

More information

PARKING FUNCTIONS. Richard P. Stanley Department of Mathematics M.I.T Cambridge, MA

PARKING FUNCTIONS. Richard P. Stanley Department of Mathematics M.I.T Cambridge, MA PARKING FUNCTIONS Richard P. Stanley Department of Mathematics M.I.T. -75 Cambridge, MA 09 rstan@math.mit.edu http://www-math.mit.edu/~rstan Transparencies available at: http://www-math.mit.edu/~rstan/trans.html

More information

ON SOME FACTORIZATION FORMULAS OF K-k-SCHUR FUNCTIONS

ON SOME FACTORIZATION FORMULAS OF K-k-SCHUR FUNCTIONS ON SOME FACTORIZATION FORMULAS OF K-k-SCHUR FUNCTIONS MOTOKI TAKIGIKU Abstract. We give some new formulas about factorizations of K-k-Schur functions, analogous to the k-rectangle factorization formula

More information

A NATURAL EXTENSION OF THE YOUNG PARTITIONS LATTICE

A NATURAL EXTENSION OF THE YOUNG PARTITIONS LATTICE A NATURAL EXTENSION OF THE YOUNG PARTITIONS LATTICE C. BISI, G. CHIASELOTTI, G. MARINO, P.A. OLIVERIO Abstract. Recently Andrews introduced the concept of signed partition: a signed partition is a finite

More information

Domino tilings with barriers. In memory of Gian-Carlo Rota

Domino tilings with barriers. In memory of Gian-Carlo Rota Domino tilings with barriers In memory of Gian-Carlo Rota James Propp Richard Stanley University of Wisconsin, Madison, WI 53706 Massachusetts Institute of Technology, Cambridge, MA 02139 In this paper,

More information

It is well-known (cf. [2,4,5,9]) that the generating function P w() summed over all tableaux of shape = where the parts in row i are at most a i and a

It is well-known (cf. [2,4,5,9]) that the generating function P w() summed over all tableaux of shape = where the parts in row i are at most a i and a Counting tableaux with row and column bounds C. Krattenthalery S. G. Mohantyz Abstract. It is well-known that the generating function for tableaux of a given skew shape with r rows where the parts in the

More information

A Generating Algorithm for Ribbon Tableaux and Spin Polynomials

A Generating Algorithm for Ribbon Tableaux and Spin Polynomials Discrete Mathematics and Theoretical Computer Science DMTCS vol. 9:, 007, 5 58 A Generating Algorithm for Ribbon Tableaux and Spin Polynomials Francois Descouens Institut Gaspard Monge, Université de Marne-la-Vallée

More information

A Characterization of (3+1)-Free Posets

A Characterization of (3+1)-Free Posets Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of

More information

THE SEMISIMPLE SUBALGEBRAS OF EXCEPTIONAL LIE ALGEBRAS

THE SEMISIMPLE SUBALGEBRAS OF EXCEPTIONAL LIE ALGEBRAS Trudy Moskov. Matem. Obw. Trans. Moscow Math. Soc. Tom 67 (2006) 2006, Pages 225 259 S 0077-1554(06)00156-7 Article electronically published on December 27, 2006 THE SEMISIMPLE SUBALGEBRAS OF EXCEPTIONAL

More information

CHAINS OF MAXIMUM LENGTH IN THE TAMARI LATTICE

CHAINS OF MAXIMUM LENGTH IN THE TAMARI LATTICE CHAINS OF MAXIMUM LENGTH IN THE TAMARI LATTICE SUSANNA FISHEL AND LUKE NELSON Abstract. The Tamari lattice T n was originally defined on bracketings of a set of n+1 objects, with a cover relation based

More information

Row-strict quasisymmetric Schur functions

Row-strict quasisymmetric Schur functions Row-strict quasisymmetric Schur functions Sarah Mason and Jeffrey Remmel Mathematics Subject Classification (010). 05E05. Keywords. quasisymmetric functions, Schur functions, omega transform. Abstract.

More information

ON IDEALS OF TRIANGULAR MATRIX RINGS

ON IDEALS OF TRIANGULAR MATRIX RINGS Periodica Mathematica Hungarica Vol 59 (1), 2009, pp 109 115 DOI: 101007/s10998-009-9109-y ON IDEALS OF TRIANGULAR MATRIX RINGS Johan Meyer 1, Jenő Szigeti 2 and Leon van Wyk 3 [Communicated by Mária B

More information

arxiv: v1 [math.rt] 8 Oct 2017

arxiv: v1 [math.rt] 8 Oct 2017 REMARKS ON SKEW CHARACTERS OF IWAHORI-HECKE ALGEBRAS DEKE ZHAO Abstract. In this short note we give a new proof of the quantum generalization of Regev s theorems by applying the Murnaghan-Nakayama formula

More information

Results and conjectures on the number of standard strong marked tableaux

Results and conjectures on the number of standard strong marked tableaux FPSAC 013, Paris, France DMTCS proc. (subm.), by the authors, 1 1 Results and conjectures on the number of standard strong marked tableaux Susanna Fishel 1 and Matjaž Konvalinka 1 School of Mathematical

More information

Skew row-strict quasisymmetric Schur functions

Skew row-strict quasisymmetric Schur functions Journal of Algebraic Combinatorics manuscript No. (will be inserted by the editor) Skew row-strict quasisymmetric Schur functions Sarah K. Mason Elizabeth Niese Received: date / Accepted: date Abstract

More information

Maximum union-free subfamilies

Maximum union-free subfamilies Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called

More information

1. Introduction

1. Introduction Séminaire Lotharingien de Combinatoire 49 (2002), Article B49a AVOIDING 2-LETTER SIGNED PATTERNS T. MANSOUR A AND J. WEST B A LaBRI (UMR 5800), Université Bordeaux, 35 cours de la Libération, 33405 Talence

More information

A Family of Finite De Morgan Algebras

A Family of Finite De Morgan Algebras A Family of Finite De Morgan Algebras Carol L Walker Department of Mathematical Sciences New Mexico State University Las Cruces, NM 88003, USA Email: hardy@nmsuedu Elbert A Walker Department of Mathematical

More information

SHELLABILITY AND HIGHER COHEN-MACAULAY CONNECTIVITY OF GENERALIZED CLUSTER COMPLEXES

SHELLABILITY AND HIGHER COHEN-MACAULAY CONNECTIVITY OF GENERALIZED CLUSTER COMPLEXES ISRAEL JOURNAL OF MATHEMATICS 167 (2008), 177 191 DOI: 10.1007/s11856-008-1046-6 SHELLABILITY AND HIGHER COHEN-MACAULAY CONNECTIVITY OF GENERALIZED CLUSTER COMPLEXES BY Christos A. Athanasiadis Department

More information

Quantum logics with given centres and variable state spaces Mirko Navara 1, Pavel Ptak 2 Abstract We ask which logics with a given centre allow for en

Quantum logics with given centres and variable state spaces Mirko Navara 1, Pavel Ptak 2 Abstract We ask which logics with a given centre allow for en Quantum logics with given centres and variable state spaces Mirko Navara 1, Pavel Ptak 2 Abstract We ask which logics with a given centre allow for enlargements with an arbitrary state space. We show in

More information

Combinatorial properties of the numbers of tableaux of bounded height

Combinatorial properties of the numbers of tableaux of bounded height Combinatorial properties of the numbers of tableaux of bounded height Marilena Barnabei, Flavio Bonetti, and Matteo Sibani Abstract We introduce an infinite family of lower triangular matrices Γ (s), where

More information

Combinatorial Structures

Combinatorial Structures Combinatorial Structures Contents 1 Permutations 1 Partitions.1 Ferrers diagrams....................................... Skew diagrams........................................ Dominance order......................................

More information

Shellability of Interval Orders

Shellability of Interval Orders Shellability of Interval Orders Louis J. Billera and Amy N. Myers September 15, 2006 Abstract An finite interval order is a partially ordered set whose elements are in correspondence with a finite set

More information

Lecture 1. Toric Varieties: Basics

Lecture 1. Toric Varieties: Basics Lecture 1. Toric Varieties: Basics Taras Panov Lomonosov Moscow State University Summer School Current Developments in Geometry Novosibirsk, 27 August1 September 2018 Taras Panov (Moscow University) Lecture

More information

= i 0. a i q i. (1 aq i ).

= i 0. a i q i. (1 aq i ). SIEVED PARTITIO FUCTIOS AD Q-BIOMIAL COEFFICIETS Fran Garvan* and Dennis Stanton** Abstract. The q-binomial coefficient is a polynomial in q. Given an integer t and a residue class r modulo t, a sieved

More information

Irreducible subgroups of algebraic groups

Irreducible subgroups of algebraic groups Irreducible subgroups of algebraic groups Martin W. Liebeck Department of Mathematics Imperial College London SW7 2BZ England Donna M. Testerman Department of Mathematics University of Lausanne Switzerland

More information

A Rational-Function Identity Related to the Murnaghan-Nakayama Formula for the Characters of Sn

A Rational-Function Identity Related to the Murnaghan-Nakayama Formula for the Characters of Sn Journal of Algebraic Combinatorics 1 (1992), 235-255 1992 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. A Rational-Function Identity Related to the Murnaghan-Nakayama Formula for

More information

REPRESENTATION THEORY OF S n

REPRESENTATION THEORY OF S n REPRESENTATION THEORY OF S n EVAN JENKINS Abstract. These are notes from three lectures given in MATH 26700, Introduction to Representation Theory of Finite Groups, at the University of Chicago in November

More information

BP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS. 1. Introduction and results

BP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS. 1. Introduction and results BP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS DONALD M. DAVIS Abstract. We determine the BP -module structure, mod higher filtration, of the main part of the BP -homology of elementary 2- groups.

More information

JOSEPH ALFANO* Department of Mathematics, Assumption s y i P (x; y) = 0 for all r; s 0 (with r + s > 0). Computer explorations by

JOSEPH ALFANO* Department of Mathematics, Assumption s y i P (x; y) = 0 for all r; s 0 (with r + s > 0). Computer explorations by A BASIS FOR THE Y SUBSPACE OF DIAGONAL HARMONIC POLYNOMIALS JOSEPH ALFANO* Department of Mathematics, Assumption College 500 Salisbury Street, Worcester, Massachusetts 065-0005 ABSTRACT. The space DH n

More information

ON REGULARITY OF FINITE REFLECTION GROUPS. School of Mathematics and Statistics, University of Sydney, NSW 2006, Australia

ON REGULARITY OF FINITE REFLECTION GROUPS. School of Mathematics and Statistics, University of Sydney, NSW 2006, Australia ON REGULARITY OF FINITE REFLECTION GROUPS R. B. Howlett and Jian-yi Shi School of Mathematics and Statistics, University of Sydney, NSW 2006, Australia Department of Mathematics, East China Normal University,

More information

A Z q -Fan theorem. 1 Introduction. Frédéric Meunier December 11, 2006

A Z q -Fan theorem. 1 Introduction. Frédéric Meunier December 11, 2006 A Z q -Fan theorem Frédéric Meunier December 11, 2006 Abstract In 1952, Ky Fan proved a combinatorial theorem generalizing the Borsuk-Ulam theorem stating that there is no Z 2-equivariant map from the

More information

The Sorting Order on a Coxeter Group

The Sorting Order on a Coxeter Group FPSAC 2008, Valparaiso-Viña del Mar, Chile DMTCS proc. AJ, 2008, 411 416 The Sorting Order on a Coxeter Group Drew Armstrong School of Mathematics, University of Minnesota, 206 Church St. SE, Minneapolis,

More information

Marisa Gaetz, Will Hardt, Shruthi Sridhar, Anh Quoc Tran. August 2, Research work from UMN Twin Cities REU 2017

Marisa Gaetz, Will Hardt, Shruthi Sridhar, Anh Quoc Tran. August 2, Research work from UMN Twin Cities REU 2017 Marisa Gaetz, Will Hardt, Shruthi Sridhar, Anh Quoc Tran Research work from UMN Twin Cities REU 2017 August 2, 2017 Overview 1 2 3 4 Schur Functions Example/Definition (Young Diagram & Semistandard Young

More information

Asymptotics of generating the symmetric and alternating groups

Asymptotics of generating the symmetric and alternating groups Asymptotics of generating the symmetric and alternating groups John D. Dixon School of Mathematics and Statistics Carleton University, Ottawa, Ontario K2G 0E2 Canada jdixon@math.carleton.ca October 20,

More information

into B multisets, or blocks, each of cardinality K (K V ), satisfying

into B multisets, or blocks, each of cardinality K (K V ), satisfying ,, 1{8 () c Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Balanced Part Ternary Designs: Some New Results THOMAS KUNKLE DINESH G. SARVATE Department of Mathematics, College of Charleston,

More information

DUALITY OF ANTIDIAGONALS AND PIPE DREAMS

DUALITY OF ANTIDIAGONALS AND PIPE DREAMS Séminaire Lotharingien de Combinatoire 58 (2008) Article B58e DUALITY OF ANTIDIAGONALS AND PIPE DREAMS NING JIA AND EZRA MILLER The cohomology ring H (Fl n ) of the manifold of complete flags in a complex

More information

arxiv:math/ v1 [math.co] 15 Sep 1999

arxiv:math/ v1 [math.co] 15 Sep 1999 ON A CONJECTURED FORMULA FOR QUIVER VARIETIES ariv:math/9909089v1 [math.co] 15 Sep 1999 ANDERS SKOVSTED BUCH 1. Introduction The goal of this paper is to prove some combinatorial results about a formula

More information

Counting k-marked Durfee Symbols

Counting k-marked Durfee Symbols Counting k-marked Durfee Symbols Kağan Kurşungöz Department of Mathematics The Pennsylvania State University University Park PA 602 kursun@math.psu.edu Submitted: May 7 200; Accepted: Feb 5 20; Published:

More information

q-alg/ Mar 96

q-alg/ Mar 96 Integrality of Two Variable Kostka Functions Friedrich Knop* Department of Mathematics, Rutgers University, New Brunswick NJ 08903, USA knop@math.rutgers.edu 1. Introduction q-alg/9603027 29 Mar 96 Macdonald

More information

PIERI S FORMULA FOR GENERALIZED SCHUR POLYNOMIALS

PIERI S FORMULA FOR GENERALIZED SCHUR POLYNOMIALS Title Pieri's formula for generalized Schur polynomials Author(s)Numata, Yasuhide CitationJournal of Algebraic Combinatorics, 26(1): 27-45 Issue Date 2007-08 Doc RL http://hdl.handle.net/2115/33803 Rights

More information

GENERALIZATION OF THE SCHENSTED ALGORITHM FOR RIM HOOK TABLEAUX. Jaejin Lee

GENERALIZATION OF THE SCHENSTED ALGORITHM FOR RIM HOOK TABLEAUX. Jaejin Lee Korean J. Math. (0), No., pp. 9 87 http://dx.doi.org/0.8/km.0...9 GENERALIZATION OF THE SCHENSTED ALGORITHM FOR RIM HOOK TABLEAUX Jaein Lee Abstract. In [] Schensted constructed the Schensted algorithm,

More information

SYMMETRIC CHAIN DECOMPOSITION FOR CYCLIC QUOTIENTS OF BOOLEAN ALGEBRAS AND RELATION TO CYCLIC CRYSTALS

SYMMETRIC CHAIN DECOMPOSITION FOR CYCLIC QUOTIENTS OF BOOLEAN ALGEBRAS AND RELATION TO CYCLIC CRYSTALS SYMMETRIC CHAIN DECOMPOSITION FOR CYCLIC QUOTIENTS OF BOOLEAN ALGEBRAS AND RELATION TO CYCLIC CRYSTALS PATRICIA HERSH AND ANNE SCHILLING Abstract. The quotient of a Boolean algebra by a cyclic group is

More information

Elementary divisors of Cartan matrices for symmetric groups

Elementary divisors of Cartan matrices for symmetric groups Elementary divisors of Cartan matrices for symmetric groups By Katsuhiro UNO and Hiro-Fumi YAMADA Abstract In this paper, we give an easy description of the elementary divisors of the Cartan matrices for

More information

A Conjectured Combinatorial Interpretation of the Normalized Irreducible Character Values of the Symmetric Group

A Conjectured Combinatorial Interpretation of the Normalized Irreducible Character Values of the Symmetric Group A Conjectured Combinatorial Interpretation of the Normalized Irreducible Character Values of the Symmetric Group Richard P. Stanley Department of Mathematics, Massachusetts Institute of Technology Cambridge,

More information

arxiv: v1 [math.co] 16 Feb 2018

arxiv: v1 [math.co] 16 Feb 2018 CHAIN POSETS arxiv:1802.05813v1 [math.co] 16 Feb 2018 IAN T. JOHNSON Abstract. A chain poset, by definition, consists of chains of ordered elements in a poset. We study the chain posets associated to two

More information

UNIMODALITY OF PARTITIONS WITH DISTINCT PARTS INSIDE FERRERS SHAPES

UNIMODALITY OF PARTITIONS WITH DISTINCT PARTS INSIDE FERRERS SHAPES UNIMODALITY OF PARTITIONS WITH DISTINCT PARTS INSIDE FERRERS SHAPES RICHARD P. STANLEY AND FABRIZIO ZANELLO Abstract. We investigate the rank-generating function F λ of the poset of partitions contained

More information

Isomorphisms between pattern classes

Isomorphisms between pattern classes Journal of Combinatorics olume 0, Number 0, 1 8, 0000 Isomorphisms between pattern classes M. H. Albert, M. D. Atkinson and Anders Claesson Isomorphisms φ : A B between pattern classes are considered.

More information

On the classication of algebras

On the classication of algebras Technische Universität Carolo-Wilhelmina Braunschweig Institut Computational Mathematics On the classication of algebras Morten Wesche September 19, 2016 Introduction Higman (1950) published the papers

More information

IRREDUCIBLE REPRESENTATIONS OF SEMISIMPLE LIE ALGEBRAS. Contents

IRREDUCIBLE REPRESENTATIONS OF SEMISIMPLE LIE ALGEBRAS. Contents IRREDUCIBLE REPRESENTATIONS OF SEMISIMPLE LIE ALGEBRAS NEEL PATEL Abstract. The goal of this paper is to study the irreducible representations of semisimple Lie algebras. We will begin by considering two

More information

Generalized Foulkes Conjecture and Tableaux Construction

Generalized Foulkes Conjecture and Tableaux Construction Generalized Foulkes Conjecture and Tableaux Construction Thesis by Rebecca Vessenes In Partial Fulfillment of the Requirements for the egree of octor of Philosophy California Institute of Technology Pasadena,

More information

LARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS

LARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS Bull. Korean Math. Soc. 51 (2014), No. 4, pp. 1229 1240 http://dx.doi.org/10.4134/bkms.2014.51.4.1229 LARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS Su Hyung An, Sen-Peng Eu, and Sangwook Kim Abstract.

More information

AN ALGORITHMIC SIGN-REVERSING INVOLUTION FOR SPECIAL RIM-HOOK TABLEAUX

AN ALGORITHMIC SIGN-REVERSING INVOLUTION FOR SPECIAL RIM-HOOK TABLEAUX AN ALGORITHMIC SIGN-REVERSING INVOLUTION FOR SPECIAL RIM-HOOK TABLEAUX BRUCE E. SAGAN AND JAEJIN LEE Abstract. Eğecioğlu and Remmel [2] gave an interpretation for the entries of the inverse Kostka matrix

More information