Printer Friendly

Combinatorics of k-shapes and Genocchi numbers.


1 Introduction
2 Background
  2.1 Genocchi numbers
  2.2 Integer partitions and skew partitions
  2.3 K-cores and k-shapes
3 Irreducible k-shapes
  3.1 Addition of rectangles
  3.2 Main theorem
4 Work in progress
  4.1 Main conjecture
  4.2 Algebraic perspectives
5 Table

1 Introduction

The goal of this paper is to present some purely combinatorial results on certain partitions; these results are strongly motivated by the theory of symmetric functions. We define a still conjectural new model for the Genocchi numbers and Gandhi polynomials. We begin by explaining the root of this work, namely the k-Schur functions of Lapointe-Lascoux-Morse; however, the reader who is not familiar with the theory of symmetric functions can skip the following paragraphs without harm.

The fundamental theorem of symmetric functions states that their ring Sym is freely generated by the homogeneous symmetric functions [([h.sub.i]).sub.i>0]. It therefore makes sense to study the subring [Sym.sup.(k)] generated by the first k homogeneous functions [Sym.sup.(k)] := Q[[h.sub.1], [h.sub.2], ... [h.sub.k]]. Say that a partition [lambda] = ([[[lambda].sub.1], [[lambda].sub.2], ..., [[lambda].sub.l]) is k-bounded if it has no part exceeding k {i.e., k [greater than or equal to] [[lambda].sub.1] [greater than or equal to] [[lambda].sub.2] [greater than or equal to] ... [greater than or equal to] [[lambda].sub.l] > 0). Then, if we define [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], then [([h.sub.[lambda]]).sub.[lambda]] where [lambda] is k-bounded is a natural basis for [Sym.sup.(k)]. However, there exists another basis which plays the role of Schur functions; this basis is called atoms in [LLM03] and, with a different definition, k-Schur functions in [LM05, LM07]. It should be noted that those papers actually deal with a more general setting where homogeneous symmetric functions are replaced with their natural g-analogues (Hall-Littlewood functions) and q, t-analogues (Macdonald functions). From the combinatorial point of view, it seems that indexing k-Schur functions by k-bounded partitions is not the right approach. In [LM05], Lapointe and Morse showed that k-bounded partitions are in bijection with k + 1-cores and that there is a natural tableau-like definition of k-Schur functions involving paths in the analogue of Young's lattice on k + 1-cores.

An important question is to find a combinatorial way to expand the k-Schur function [s.sup.(k).sub.[lambda]] in terms of the usual Schur functions [s.sub.[lambda]]. The strategy of [LLMS] is to inductively use a combinatorial way to expand k-Schur functions on k + 1-Schur functions. In order to do that, they need to interpolate between k-cores and k + 1-cores. They indeed define a certain partially ordered set of partitions they call k-shapes (see Definition 2.1) such that k + 1-cores are the minimal elements and k-cores the maximal ones. The expansion of [s.sup.(k).sub.[lambda]] is essentially described by counting paths from K-cores to k + 1-cores in this poset up to some equivalence relation. The combinatorial study of these k-shapes is the main goal of our paper.

Our main result is the following theorem:

Theorem 1.1 For k [member of] N, the generating function for k-shapes is given by

[f.sub.k](t) = [P.sub.k](t)/[[PI].sub.u,v](1 - [t.sup.uv]) (1)

where the product is over the set of all couples (w, v) of positive integers such that u + v [member of] {k, k + 1} and [P.sub.k](t) [member of] N[t] is a polynomial with nonnegative integer coefficients.

Using computer, we evaluated the numerator [P.sub.k](t) up to k = 9 (see Section 5). Setting t = 1, one gets the following table
k              1    2    3     4     5

[P.sub.k](l)   1    1    3    17    155

k                6       7         8          9

[P.sub.k](l)   2073    38227    929569    28820619

which seems to be the sequence of Genocchi numbers (sequence AI 10501 of [Slo]):

Conjecture 1.2 The polynomials appearing in Equation (I ) are a q-analogue of the Genocchi numbers: [P.sub.k](1) is the kth Genocchi number.

Outline. The paper is structured as follows: The first background section (Section 2) recalls the necessary definitions on Genocchi numbers (Subsection 2.1), partitions and skew partitions (Subsection 2.2), as well as k-cores and k-shapes (Subsection 2.3). Then, Section 3 is devoted to the operation of adding a rectangle to a k-shape and the construction of the main object of this paper, namely irreducible k-shapes. We finally conclude by stating our main conjecture (Subsection 4.1), as well as some algebraic perspectives (Subsection 4.2).

2 Background

2.1 Genocchi numbers

The unsigned Genocchi numbers [G.sub.2n] can be defined using the Bernoulli numbers [B.sub.n] by

[G.sub.2n] = 2([2.sup.2n] - 1)[absolute value of [B.sub.2n]]

or via the generating function

2t/1 + [e.sup.t] = t + [summation over (n[greater than or equal to]1)] [(-1).sup.n] [G.sub.2n] [t.sup.2n]/(2n)!.

These numbers were named, apparently by Lucas [Luc91], after the 19th century Italian mathematician Angelo Genocchi; they appear in the latter's papers on the Bernoulli numbers [Gen52, Gen86]. However, Euler had already studied them in [Eul55].

The first combinatorial interpretation of the Genocchi numbers was given by Dumont in [Dum74]: [G.sub.2n+2] is the number of permutations [sigma] [member of] [G.sub.2n] such that [[sigma].sub.2n] is odd and, for i such that 1 [less than or equal to] i [less than or equal to] 2n - 1, [[sigma].sub.i] is followed by a smaller number if it is even and by a greater number if it is odd. Such permutations are called Dumont permutations of the first kind. In the same paper, Dumont defined another family of permutations enumerated by the Genocchi numbers, which are now known as Dumont permutations of the second kind. Other families of Genocchi-enumerated permutations were subsequently introduced by Kitaev and Remmel [KR07] and Burstein and Stromquist [BS07].

2.2 integer partitions and skew partitions

A partition [lambda] = ([[lambda].sub.1], ..., [lambda].sub.m]) is a nonincreasing sequence of positive integers which are called the parts of the partition. We will sometimes also use the exponential notation for partitions: if [lambda] is a partition and [f.sub.i] is the number of occurrences of i in [lambda], then we write [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. The number of parts of [lambda] is denoted by l([lambda]). The weight of [lambda] is [absolute value of [lambda]] := [[summation].sup.m.sub.i=1] [[lambda].sub.i]. If the weight of [lambda] is n, we say that [lambda] is a partition of n. A sequence c = ([c.sub.1], ..., [c.sub.m]) (not necessarily nonincreasing) of positive integers whose sum is n is called a composition of n. We denote by c x c' the concatenation of the two compositions c and c'.

A partition A is classically represented by a Ferrers diagram, which we denote by [[lambda]], where the ith row has [[lambda].sub.i] squares (also called cells). We use the French notation for Ferrers diagrams: the rows are counted from bottom to top. More precisely, [A] is formed by the unit cells (x, y) with upper right corner at the point (x, y), where 1 [less than or equal to] y [less than or equal to] l([lambda]) and 1 [less than or equal to] x [less than or equal to] [[lambda].sub.y]. An example is shown on Figure 1.

The union of two partitions [lambda] and [mu], which we denote by [lambda] [union] [mu], is a partition that is obtained by gathering all the parts of [lambda] and [mu] and sorting them in nonincreasing order. For example, if [lambda] = (5, 4, 3, 3) and [mu], = (7, 6, 5, 3, 2, 1), we have [lambda] [union] [mu], = (7, 6, 5, 5, 4, 3, 3, 3, 2, 1).

The notion of skew partition will be needed throughout the paper. Given two partitions [lambda] and [mu], we write [mu] [subset equal to] [lambda] if [[mu]] [less than or equal to] [[lambda].sub.i] for all i. If [lambda] and [mu] satisfy [mu] [subset equal to] [lambda], we identify the skew partition [lambda]/[mu] with its diagram, which is the set-theoretic difference [[lambda]] \ [[mu]]. The weight of [lambda]\[mu] is [absolute value of [lambda]\[mu]] := [absolute value of [lambda]] - [absolute value of [mu]] For example, [lambda]/[mu] = (4, 3, 2, 2, 1)/(2, 1, 1) has weight 8 and its diagram is shown on Figure 2.



2.3 k-cores and k-shapes

The hook of a cell c in the Ferrers diagram of a partition is the set formed by c and the cells that are located to its right in the same row or above it in the same column. The hook length of a cell is the number of cells in its hook. An example is shown on Figure 3, where we have encircled the hook of the dotted cell (2,2); the hook length of this cell is 7.


A partition is a k-core if its diagram contains no cells with hook length k [JK81]. See Figure 4 for an example.

It is not difficult to see that in every Ferrers diagram, the hook lengths decrease from left to right and from bottom to top. Consequently, the cells of a diagram [[lambda]] whose hook length is (strictly) larger than k form the diagram of a partition. Following [LLMS], we call this partition the k-interior of [lambda] and denote it by [Int.sup.k]([lambda]). As for the cells whose hook length does not exceed k, they form the diagram of a skew partition, which we call the k-boundary of [lambda] and denote by [[partial derivative].sup.k]([lambda]). We also define the k-rim of [lambda] as the line that starts at the upper left corner of the diagram, goes down vertically until reaching the k-interior, follows the limit between the k-interior and the k-boundary and then goes horizontally to the lower right corner of the diagram. See Figure 5 for an example.

We call row shape of a skew partition [lambda]/[mu] and denote by rs([lambda]/[mu]) the sequence of the lengths of the rows (from bottom to top) of [lambda]/[mu]. Likewise, we call column shape of [lambda]/[mu] and denote by cs([lambda]/[mu]) the heights of the columns (from left to right) of [lambda]/[mu]. Both rs([lambda]/[mu]) and cs([lambda]/[mu]) are compositions of [absolute value of [lambda]/[mu]]. For example, if we call [lambda]/[mu] the 6-interior of the partition represented on Figure 5, we have rs([lambda]/[mu]) = (5, 4, 2, 1) and cs([lambda]/[mu]) = (2, 2, 1, 1, 2, 1, 1, 1, 1). We also define [rs.sup.k]([lambda]) := rs([partial derivative].sup.k]([lambda])) and [cs.sup.k]([lambda]) := cs([partial derivative].sup.k]([lambda])).

Definition 2.1 (Lam et al [LLMS]) A partition [lambda] is a k-shape [cs.sup.k]([lambda]) and [cs.sup.k]([lambda]) are both partitions.



See Figure 6 for an example. Note that k-cores and k + 1-cores are k-shapes [LLMS, Proposition 10].


For legibility reasons, we will sometimes omit the k-interior when representing k-shapes graphically, since a k-shape is uniquely determined by its k-boundary.

3 Irreducible /c-shapes

3.1 Addition of rectangles

This section deals with an operation that builds a k-shape from another k-shape and a k- or k - 1-rectangle. The definition of irreducible k-shapes and the proof of Theorem 1.1 rest on this operation. Note that it is a generalization of the construction presented in Theorem 10 of [LM04], which is equivalent, in our framework, to adding a k-rectangle to a k + 1-core.

Definition 3.1 ([LLM03]) A k-rectangle is a partition of the form ([l.sup.k+1-l]), where I satisfies 1 [less than or equal to] l [less than or equal to] k.

Evidently, k-rectangles are the partitions whose Ferrers diagram is a rectangle and whose largest hook length is k.

Lemma 3.2 Let r = ([r.sub.i], ..., [r.sub.m]) and c = ([c.sub.1], ..., [c.sub.p]) be two compositions of the same integer n. Then there exists at most one skew partition [lambda]/[mu] of weight n such that rs([lambda]/[mu]) = r and cs([lambda]/[mu]) = c.

Proof: We build the skew partition row by row, from top to bottom. At the ith step (1 [less than or equal to] i [less than or equal to] m), we try to insert a row of length [r.sub.m+1-i]. The first [c.sub.1] rows must be left-justified so that the first column contains [c.sub.1] cells, as desired. The subsequent [c.sub.1] - [c.sub.2] rows must be shifted by one so that the first column does not contain more than [c.sub.1] cells and the second column contains [c.sub.2] cells, and so on. Therefore, the resulting skew partition is unique. []

It must be noted that a solution does not always exist. For example, if r = (3) and c = (2,1), the two conditions are incompatible, because the row condition implies that the skew partition has three columns whereas the column condition implies that it has two columns.

Definition 3.3 Let [lambda] be a k-shape, r = [rs.sup.k]([lambda]) and c = [cs.sup.k]([lambda]). For all i [member of] [N.sup.*], let

[H.sub.i] = [max{j [absolute value of [r.sub.j] > i}, min{j] [r.sub.j] < i} - 1] (2)

[V.sub.j] = [max{j [absolute value of [c.sub.j] > i}, min{j] [c.sub.j] < i} - 1] (3)

We use the convention that if [pi] is a partition, we have [[pi].sub.0] = [infinity] and [[pi].sub.0] = 0 if j > l([pi]).

The horizontal strip [H.sub.i] is the set {(x, y) [member of] [R.sup.2] | y [member of] [H.sub.i]}. Similarly, the vertical strip [V.sub.i] is the set {(x, y) [member of] [R.sup.2] | x [member of] [V.sub.i]}.

Note that the interval [H.sub.i] (resp. [V.sub.i]) is reduced to a singleton if there is no integer j such that [r.sub.j] = i (resp. [c.sub.j] = i). In this case, the corresponding strip is a single line. An example is the vertical strip [V.sub.2] in the k-shape shown on Figure 7.


Proposition 3.4 Let [lambda] be a k-shape and ([u.sup.v]) be a k-rectangle or k - 1-rectangle. Then there exists a point of the k-rim of [lambda] that belongs to [H.sub.u] [intersection] [V.sub.v].

Proof (sketch): Using hook length considerations, we show that the upper right corner of the intersection [H.sub.u] [intersection] [V.sub.v] belongs to the k;-boundary while the lower left corner does not (see Figure 8). Consequently, a path between these two points must cross the k-rim. []


Proposition 3.5 Let [lambda] be a k-shape and ([u.sup.v]) be a k-rectangle or k - 1-rectangle. Then there exists a unique k-shape, which we denote by [lambda] + ([u.sup.v]), such that

[rs.sup.k] ([lambda] + (u.sup.v)) = [rs.sup.k]([lambda]) [union] (u.sup.v) (4)

[cs.sup.k] ([lambda] + (u.sup.v)) = [cs.sup.k]([lambda]) [union] (u.sup.v) (5)

Proof: We describe an algorithm that constructs [[partial derivative].sup.k] ([lambda] + ([u.sup.v])) from [[partial derivative].sup.k]([lambda]) by "inserting" the rectangle into the k-shape. Proposition 3.4 implies that we can decompose [[partial derivative].sup.k]([lambda]) into three parts: the cells located to the right of p and above it, which we call the foot (region F in Figure 9), the cells to the left of the foot (region A) and the cells below the foot (region B).


The insertion process then consists in transforming this k-boundary into the skew partition shown on Figure 10, from which the partition [lambda] + ([u.sup.v]) is easily reconstructed, as said before.


We call this skew partition [??]/[??] First, we must prove that it satisfies (4) and (5). If [R.sub.1] and [R.sub.2] are two regions of the diagram, let [R.sub.1] V [R.sub.2] denote their set-theoretic union. We have that

rs([??]/[??]) = rs(B) x rs([??] v [F.sub.2]) x rs(A v F)

= rs(B) x ([u.sup.v]) x rs(A [disjunction] F)

= rs([lambda]/[mu]) [union] ([u.sup.v])

because rs(B) is a partition into parts [greater than or equal to] u and rs(A V F) is a partition into parts [less than or equal to] u, since [lambda] is a k-shape. Therefore, [??]/[??], satisfies (4); the proof that it satisfies (5) is similar.

We now need to check that [??] is indeed the k-interior of [??], i.e. that the hook lengths of [??]/[??] do not exceed k and those of [??], are greater than k. To this end, we decompose [[??]] as shown on Figure 11.


The hook lengths of the cells that were above p before the insertion (regions A, A', and F on Figure 11) have not been modified since no cells have been added or removed above those cells or to their right. The hook lengths of the cells that were to the right of p (regions B, B', and [F.sub.2]) have not been modified either, for the same reason. A cell in the region [bar.F] has at most u - 1 cells to its right in the same row and at most v - 1 cells above it in the same column: its hook length thus does not exceed u + v - 1 [less than or equal to] k. Likewise, a cell in the region C has at least u cells to its right in the same row and v cells above it in he same column, and therefore has hook length at least u + v + 1 [greater than or equal to] k + 1. All the hook lengths conditions are therefore satisfied.

The uniqueness is proved by Lemma 3.2. In particular, the result does not depend on the choice of p. []

See Figure 12 for an example of the insertion process.

Proposition 3.6 Let [lambda] be a k-shape and let [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] be two k-or k - 1-rectangles. Then



3.2 Main theorem

Definition 3.7 We say that a k-shape is irreducible if it cannot be obtained from another k-shape by inserting a k- or k - 1-rectangle as described in the proof of Proposition 3.5.

We first need to have a better characterization of the irreducible k-shapes.


Proposition 3.8 Let [lambda] be a k-shape and ([u.sup.v]) be a k- or k - 1-rectangle. The following are equivalent:

(i) there exists a k-shape n such that [lambad] = [mu] + ([u.sup.v]),

(ii) there exist two points ([x.sub.1], [y.sub.1]) and ([x.sub.2], [y.sub.2]) of the k-rim of [lambda] lying in [H.sub.u] [intersection] [V.sub.v] such that [x.sub.2] - [x.sub.1] [greater than or equal to] u,

(iii) there exist two points ([y.sub.1], [y.sub.1]) and ([x.sub.2], [y.sub.2]) of the k-rim of [lambda] lying in [H.sub.u] [intersection] [V.sub.v] such that [y.sub.2] - [y.sub.1] [greater than or equal to] v.

By Proposition 3.8, in an irreducible k-shape the length of the k-rim is bounded, so that there are only finitely many of them. Therefore the generating function for irreducible K-shapes is a polynomial.

Thanks to the same proposition, we can also prove the following converse of Proposition 3.5:

Corollary 3.9 Suppose that [lambda], [[lambda].sub.1], [[lambda].sub.2] are k-shapes and that there exist two different k- or k - 1-rectangles [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] such that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. Then there exists a unique k-shape n such that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

It has the following important consequence:

Corollary 3.10 For each k-shape [lambda], there is a unique irreducible k-shape n and a unique family of non-negative integers [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] indexed by k- and k - 1-rectangles ([u.sup.v]) such that


Using this corollary, we can prove that the generating function for k-shapes is of the form shown in (1):

Corollary 3.11 For k [member of] N, the generating function for k-shapes is given by

[f.sub.k](t) = [P.sub.k](t)/[PI](1 - [t.sup.uv]])

where the product is over the set of all k- or k - 1-rectangles ([u.sup.v]) and [P.sub.k](t) [member of] N[t] is the polynomial generating function for irreducible k-shapes.

4 Work in progress

4.1 Main conjecture

In this section we discuss some approaches we are currently exploring around the following conjecture: Conjecture 4.1 Irreducible k-shapes are counted by the Genocchi numbers.

This conjecture has been extensively tested for all k up to 9.

We are considering two approaches: a direct bijection between irreducible k-shapes and some family of objects known to be counted by the Genocchi numbers (such as Dumont permutations of some kind, surjective pistols, certain tableaux ...) and a recursive proof involving the Gandhi polynomials.

Indeed the following conjectural connection with Gandhi polynomials provides more evidence from the conjecture as well as what we believe is a good angle of attack to prove it. Let us recall the definition of those polynomials:

Definition 4.2 For k [greater than or equal to] I, the Gandhi polynomials P2k (x) are defined by the following recurrence:

{[P.sub.2](x) = [x.sup.2] {[P.sub.2k+2](x) = [x.sup.2] ([P.sub.2k](x + 1) - [P.sub.2k(x)) (8)

Gandhi [Gan70] conjectured that [P.sub.2k](1) = [G.sub.2k+2], which was later proved by Carlitz [Car71] and Riordan and Stein [RS73].

We need a small definition before stating a conjecture relating k-shapes and Gandhi polynomials.

Definition 4.3 Let [lambda] be a k-shape and l be an integer such that 1 [less than or equal to] l [less than or equal to] k. We say that (l, k + 1 - l) is a free k-site in [lambda] if there is no cell with l - 1 cells to its right in the same row and k - l cells above it in the same column (note that such a cell would have hook length k).

For example, the reader can check, looking at Figure 12, that the 4-shape (5, 2, 1, 1) has 3 free 4-sites: (1, 4), (3, 2) and (4,1).

Conjecture 4.4 Let S(k, j) be the number of irreducible k-shapes with j free k-sites. Let [S.sub.2k](x) = [[summation].sub.j] S(k, j) [x.sup.J]. Then [S.sub.2k](x) = [P.sub.2k](x).

We aim to prove this conjecture by showing that the [S.sub.2k] satisfy (8).

4.2 Algebraic perspectives

As we said in the introduction, the work presented here has a strong algebraic background. In particular, Lam et al [LLMS, Equation (11)] defined a symmetric function [s.sup.(k).sub.[mu]] associated to each k-shape [mu]. By definition, [s.sup.(k).sub.[mu]] reduces to the k-Schur function [s.sup.(k).sub.[mu]] if [mu] is a k-core and to the [s.sup.(k+1).sub.[mu]] if [mu] is a k + 1-core. Therefore, those functions are not linearly independent. Nevertheless, the operation of adding a k-rectangle to a k-core reflects an algebraic relation on symmetric functions [LM07, Theorem 40]: for any k-core [lambda] and k-rectangle ([u.sup.v]), if [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] is the usual Schur function associated to ([u.sup.v]), then we have [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. It seems that the k-shape functions enjoy a similar property [Lap08]:

Conjecture 4.5 Let [lambda] be a k-shape and ([u.sup.v]) be a k-rectangle or k - 1-rectangle. Then


It seems moreover that this property passes to t-analogues replacing the Schur function by a vertex operator and the k-Schur functions by their graded version (see [LLMS, Equation (18)]).


We wish to thank Luc Lapointe, who discussed the problem with us and provided us with useful references, and Matthieu Josuat-Verges, who introduced us to various aspects of the combinatorics of the Genocchi numbers. We also point out that this research was driven by computer exploration using the open-source mathematical software Sage [[S.sup.+]10] and its algebraic combinatorics features developed by the Sage-Combinat community [SCc10].

5 Table

Generating series for irreducible K-shapes:




[BS07] Alexander Burstein and Walter Stromquist. Dumont permutations of the third kind. In 19th International Conference on Formal Power Series and Algebraic Combinatorics (Tianjin), 2007.

[Car71] L. Carlitz. A conjecture concerning Genocchi numbers. Norske Vid. Selsk. Skr (Trondheim), (9):4, 1971.

[Dum74] Dominique Dumont. Interpretations combinatoires des nombres de Genocchi. Duke Math. J., 41:305-318,1974.

[Eul55] Leonhard Euler. Institutiones calculi differentially, volume 10 of Opera Mathematica 1, chapter 7, pages 368-395. 1913 (orig. date 1755).

[Gan70] J. M. Gandhi. Research Problems: A Conjectured Representation of Genocchi Numbers. Amer. Math. Monthly, 77(5):505-506,1970.

[Gen52] Angelo Genocchi. Intorno all'espressione generale de' numeri Bernulliani. Annali di scienze matematiche efisiche, 3:395-405, 1852.

[Gen86] Angelo Genocchi. Sur les nombres de Bernoulli. J. Reine Angew. Math., 99:315-316,1886.

[JK81 ] Gordon James and Adalbert Kerber. The representation theory of the symmetric group, volume 16 of Encyclopedia of Mathematics and its Applications. Addison-Wesley Publishing Co., Reading, Mass., 1981.

[KR07] Sergey Kitaev and Jeffrey Remmel. Classifying descents according to parity. Ann. Comb., 11(2):173-193,2007.

[Lap08] Luc Lapointe. private communication, 2008.

[LLM03] L. Lapointe, A. Lascoux, and J. Morse. Tableau atoms and a new Macdonald positivity conjecture. Duke Math. J., 116(1):103-146,2003.

[LLMS] Thomas Lam, Luc Lapointe, Jennifer Morse, and Marc Shimozono. K-shape poset and branching of k-Schur functions. Available at

[LM04] L. Lapointe and J. Morse. Order ideals in weak subposets of Young's lattice and associated unimodality conjectures. Ann. Comb., 8(2):197-219,2004.

[LM05] Luc Lapointe and Jennifer Morse. Tableaux on k+1-cores, reduced words for affine permutations, and k-Schur expansions. J. Combin. Theory Ser. A, 112(1):44-81,2005.

[LM07] Luc Lapointe and Jennifer Morse. A k-tableau characterization of k-Schur functions. Adv. Math., 213(l):183-204,2007.

[Luc91] Edouard Lucas. Theorie des nombres. Tome I: Le calcul des nombres entiers, le calcul des nombres rationnels, la divisibilite arithmetique. Gauthier-Villars, Paris, 1891.

[RS73] John Riordan and Paul R. Stein. Proof of a conjecture on Genocchi numbers. Discrete Math., 5:381-388,1973.

[S+10] W.A. Stein et al. Sage Mathematics Software (Version 4.6). The Sage Development Team, 2010.

[SCclO] The Sage-Combinat community. Sage-Combinat: enhancing sage as a toolbox for computer exploration in algebraic combinatorics, 2010.

[Slo] N. J. A. Sloane. The On-Line Encyclopedia of Integer Sequences, http: //www. research.

Florent Hivert ([dagger]) and Olivier Mallet ([double dagger])

LITIS] Universite de Rouen, Saint-Etienne-du-Rouvray, France


([double dagger])
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2011 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Author:Hivert, Florent; Mallet, Olivier
Publication:DMTCS Proceedings
Article Type:Report
Geographic Code:4EUFR
Date:Jan 1, 2011
Previous Article:The short toric polynomial.
Next Article:O-Hecke algebra actions on coinvariants and flags.

Terms of use | Privacy policy | Copyright © 2021 Farlex, Inc. | Feedback | For webmasters |