# Results and conjectures on the number of standard strong marked tableaux.

1 Introduction

In 1988, Macdonald introduced a new class of polynomials and conjectured that they expand positively in terms of Schur functions. This conjecture, verified in Haiman (2001), has led to an enormous amount of work, including the development of the k-Schur functions. The k-Schur functions were defined in Lapointe et al. (2003). Lapointe, Lascoux, and Morse conjectured that they form a basis for a certain subspace of the space of symmetric functions and that the Macdonald polynomials indexed by partitions whose first part is not larger than k expand positively in terms of the k-Schur functions, leading to a refinement of the Macdonald conjecture. The k-Schur functions have since been found to arise in other contexts; for example, as the Schubert cells of the cohomology of affine Grassmannian permutations Lam (2006), and they are related to the quantum cohomology of the affine permutations Lapointe and Morse (2008).

One of the intriguing features of standard Young tableaux is the Frame-Thrall- Robinson hook-length formula, which enumerates them. It has many different proofs and many generalizations, see e.g. (Stanley, 1999, Chapter 7), Greene et al. (1979), Ciocan-Fontanine et al. (2011) and the references therein.

In this extended abstract, we partially succeed in finding an analogue of the hook-length formula for standard strong marked tableaux (or starred tableaux for short), which are a natural generalization of standard Young tableaux in the context of k-Schur functions. For a fixed n, the shape of a starred tableau (see Subsection 2.5 for a definition) is necessarily an n-core, a partition for which all hook-lengths are different from n. In Lam et al. (2010), a formula is given for the number of starred tableaux for n = 3.

Proposition 1.1 (Lam et al. (2010), Proposition 9.17) For a 3-core [lambda], the number of starred tableaux of shape [lambda] equals

m!/[2.sup.[m/2]],

where m is the number of boxes of [lambda] with hook-length < 3.

The number of 2-hooks is [m/2]. Therefore we can rewrite the result as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

Note that this is reminiscent of the classical hook-length formula.

The authors left the enumeration for n > 3 as an open problem. The main result (Theorem 3.1) of this extended abstract implies the existence, for each n, of (n - 1)! rational numbers which we call correction factors. Once the corrections factors have been calculated by enumerating all starred tableaux for certain shapes, the number of starred tableaux of shape [lambda] for any n-core [lambda] can be easily computed. In fact, Theorem 3.1 is a t-analogue of the hook formula. The theorem is "incomplete" in the sense that we were not able to find explicit formulas for the (weighted) correction factors. We have, however, been able to state some of their properties (some conjecturally), the most interesting of these properties being unimodality (Conjecture 3.7).

Another result of interest is a new, alternative description of strong marked covers via simple triangular arrays of integers which we call residue tables and quotient tables (Theorem 4.2).

The extended abstract is structured as follows. In Section 2, we give the requisite background, notation, definitions, and results. In Section 3, we state the main results and conjectures. In Section 4, we give an alternative description of strong covers directly in terms of bounded partitions (instead of via cores, abacuses or affine permutations). We envision this description as the first steps toward an inductive proof of the main formula We finish with some remarks and open questions in Section 5.

2 Preliminaries

Here we introduce notation and review some constructions. Please see Macdonald for the definitions of integer partitions, ribbons, hook lengths, etc., which we omit in this extended abstract.

2.1 Cores and bounded partitions

Let n be a positive integer. An n-core is a partition [lambda] such that [h.sup.[lambda].sub.ij] [not equal to] n for all (i,j) [member

of] [lambda]. Core partitions were introduced by Nakayama to describe when two ordinary irreducible representations of the symmetric group belong to the same block. There is a close connection between (k + 1)-cores and k-bounded partitions, which are partitions whose first part (and hence every part) is [less than or equal to] k. Indeed, in Lapointe and Morse (2005), a simple bijection between (k + 1)-cores and k-bounded partitions is presented. Given a (k + 1)-core [lambda], whose diagram has [[lambda].sub.i] boxes in row i, let [[pi].sub.i] be the number of boxes in row i of [lambda] with hook-length [less than or equal to] k. The resulting [pi] = ([[pi].sub.1], [[pi].sub.2], ..., [[pi].sub.l]) is a k-bounded partition, we denote it b([lambda]). Conversely, given a k-bounded partition [pi], move from the last row of [pi] upwards, and in row i, shift the [[pi].sub.i] boxes of the diagram of [pi] to the right until their hook-lengths are at most k. The resulting (k + 1)- core is denoted c([pi]). In this extended abstract, we will always use n as shorthand for k + 1.

Example 2.1 On the left-hand side of Figure 1, the hook-lengths of the boxes of the 5-core [lambda] = 953211 are shown, with the ones that are < 5 in bold. That means that b([lambda]) = 432211.

The right-hand side shows the construction of c([pi]) = 75221 for the 6-bounded partition [pi] = 54221.

Of particular importance are k-bounded partitions [pi] that satisfy [m.sub.i]([pi]) [less than or equal to] k-i for all i = 1, ..., k. We call such partitions k-irreducible partitions, see Lapointe et al. (2003). The number of k-irreducible partitions is k!.

2.2 Young tableaux and the hook-length formula

Young's lattice Y takes as its vertices all integer partitions, and the relation is containment. If [lambda] and [mu] are partitions, then [mu] covers [lambda] if and only if [lambda] [subset or equal to] [mu] and [absolute value of [mu]] = [absolute value of [lambda]] + 1. The rank of a partition is given by its size.

A semistandard Young tableau T of shape [lambda] is a Young diagram of shape [lambda] whose boxes have been filled with positive integers satisfying the following: the integers must be nondecreasing as we read a row from left to right, and increasing as we read a column from top to bottom. The weight of T is the composition ([[alpha].sub.1], [[alpha].sub.2], ...), where [[alpha].sub.i] is the number of i's in T. The tableau T is a standard Young tableau if the entries are 1, ..., [absolute value of [lambda]] in some order, i.e. if the weight is (1, ..., 1). A standard Young tableau of shape [lambda] represents a saturated chain in the interval [0, [lambda]] of the Young's lattice. Let ([[lambda].sup.(0)], [[lambda].sup.(1)], ..., [[lambda].sup.(m)]), [[lambda].sup.(0)] = 0, [[lambda].sup.(m)] = [lambda], be such a chain. Then in the tableau corresponding to this chain, i is the entry in the box added in moving from [[lambda].sup.(i-1)] to [[lambda].sup.(i)].

The Frame-Thrall-Robinson hook-length formula shows how to compute [f.sub.[lambda]], the number of standard Young tableaux of shape [lambda]. We have:

[f.sub.[lambda]] = [[absolute value of [lambda]]!/[[PI].sub.i,j[member of][lambda]][h.sup.[lambda].sub.ij]]. (2.1)

This formula has a well-known weighted version, see (Stanley, 1999, Corollary 7.21.5) For a standard Young tableau T, define a descent to be an integer i such that i + 1 appears in a lower row of T than i, and define the descent set D(T) to be the set of all descents of T. Define the major index of T as maj(T) = [[summation].sub.i[member of]D(T)]i, and the polynomial

[f.sub.[lambda]](t) = [summation][t.sup.maj(T)],

where the sum is over all standard Young tableaux of shape [lambda]. Then

[f.sub.[lambda]](t) = [[t.sup.b([lambda])]([absolute value of [lambda]])!/[[PI].sub.i,j[member of][lambda]]([h.sup.[lambda].sub.ij])]. (2.2)

Here [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

2.3 Strong marked and starred tableaux

The strong n-core poset [C.sub.n] is the subposet of Y induced by the set of all n-core partitions. That is, its vertices are n-core partitions and [lambda] [less than or equal to] [mu] in [C.sub.n] if [lambda] [subset or equal to] [mu]. The cover relations are trickier to describe in [C.sub.n] than in Y.

Proposition 2.2 (Lam et al. (2010), Proposition 9.5) Suppose [lambda] [less than or equal to] [mu] in [C.sub.n], and let [C.sub.1], ..., [C.sub.m] be the connected components of [mu]/[lambda]. Then [mu] covers [lambda] (denoted [lambda] [??] [mu]) if and only if each [C.sub.i] is a ribbon, and all the components are translates of each other with heads on consecutive diagonals with the same residue.

The rank of an n-core is the number of boxes of its diagram with hook-length < n. If [lambda] [??] [mu] and [mu]/[lambda] consists of m ribbons, we say that [mu] covers [lambda] in the strong order with multiplicity m. Figure 2 shows the strong marked covers for 4-cores with rank at most 6. Only multiplicities [not equal to] 1 are marked.

A strong marked cover is a triple ([lambda], [mu], c) such that [lambda] [??] [mu] and that c is the content of the head of one of the ribbons. We call c the marking of the strong marked cover. A strong marked horizontal strip of size r and shape [mu]/[lambda] is a sequence [([v.sup.(i)], [v.sup.(i+1)], [c.sub.i]).sup.r-1.sub.i=0] of strong marked covers such that [c.sub.i] < [c.sub.i+1], [v.sup.(0)] = [lambda], [v.sup.(r)] = [mu]. If [lambda] is an n-core, a strong marked tableau T of shape [lambda] is a sequence of strong marked horizontal strips of shapes [[mu].sup.(i+1)]/[[mu].sup.(i)], i = 0, ..., m - 1, such that [[mu].sup.(0)] = 0 and [[mu].sup.(m)] = [lambda]. The weight of T is the composition ([r.sub.1], ..., [r.sub.m]), where [r.sub.i] is the size of the strong marked horizontal strip [[mu].sup.(i)]/[[mu].sup.(i-1)]. If all strong marked horizontal strips are of size 1, we call T a standard strong marked tableau or a starred tableau for short. For a k-bounded partition [pi] (recall that n = k + 1), denote the number of starred tableaux of shape c([pi]) by [F.sup.(k).sub.[pi]].

Figure 3 illustrates [F.sup.(3).sub.211] = 6.

If [lambda] is a k-bounded partition that is also an n-core (i.e., if [[lambda].sub.1] + l([lambda]) [less than or equal to] k + 1), then strong marked covers on the interval [0, [lambda]] are equivalent to the covers in the Young lattice, strong marked tableaux of shape [lambda] are equivalent to semistandard Young tableaux of shape [lambda], and starred tableaux of shape [lambda] are equivalent to standard Young tableaux of shape [lambda].

2.4 Schur functions

For the definition of [LAMBDA], the ring of symmetric functions, see Macdonald or Stanley (1999). For a partition [lambda], define the monomial symmetric function

[m.sub.[lambda]] = [m.sub.[lambda]] ([x.sub.1],[x.sub.2], ...) = [summation over ([alpha])][x.sup.[alpha]],

where the sum is over all weak compositions [alpha] that are a permutation of [lambda], and [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. For partitions [lambda] and [mu] of the same size, define the Kostka number [K.sub.[lambda][mu]] as the number of semistandard Young tableaux of shape [lambda] and weight [mu]. Define the Schur function

[s.sub.[lambda]] = [summation][K.sub.[lambda][mu]][m.sub.[mu]]

with the sum over all partitions [mu]. The Schur functions form the most important basis of [LAMBDA] and have numerous beautiful properties. See for example (Stanley, 1999, Chapter 7) and (Macdonald, Chapter 1).

2.5 k-Schur functions

There are at least three conjecturally equivalent definitions of k-Schur functions. Here, we give the definition from Lam et al. (2010) via strong marked tableaux. For k-bounded partitions [pi] and [tau], define the k-Kostka number [K.sup.(k).sub.[pi][tau]] as the number of strong marked tableaux of shape c([pi]) and weight [tau]. Then we define the k-Schur function

[s.sup.(k).sub.[pi]] = [summation over ([tau])][K.sup.(k).sub.[pi][tau]][m.sub.[tau]], (2.3)

where the sum is over all k-bounded partitions [tau].

If [pi] is also a (k + 1)-core, then strong marked tableaux of shape [pi] are equivalent to semistandard Young tableaux of shape [pi], and therefore in this case [s.sup.(k).sub.[pi]] = [s.sub.[pi]].

The original definition of k-Schur functions was via atoms Lapointe et al. (2003), which we will not use here (but see 5.2). Note that in full generality, the k-Schur functions (in any definition) have a parameter t. In this extended abstract, t = 1.

3 Main results and conjectures

For a starred tableau T, define the descent set of T, D(T), as the set of all i for which the marked box at i is strictly above the marked box at i + 1. Define the major index of T, maj(T), by [[summation].sub.i[member of]D(T)]i. For a k-bounded partition [pi], define the polynomial

[F.sup.(k).sub.[pi]](t) = [summation over (T)][t.sup.maj(T)], (3.1)

where the sum is over all starred tableaux of shape c([pi]). Recall that [F.sup.(k).sub.[pi]] denotes the number of such starred tableaux, i.e. [F.sup.(k).sub.[pi]] = [F.sup.(k).sub.[pi]] (1).

Our main result is the following theorem.

Theorem 3.1 Let [pi] be a k-bounded partition, and write

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII],

for 0 [less than or equal to] [a.sub.i] < i. Then

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII],

where [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

By plugging in t = 1, we get the following.

Corollary 3.2 Let [pi] be a k-bounded partition, and write

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII],

for 0 [less than or equal to] [a.sub.i] < i. Then

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII],

where [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII],

The theorem (respectively, corollary) implies that in order to compute [F.sup.(k).sub.[pi]](t) (resp., [F.sup.(k).sub.[pi]]) for all k-bounded partitions [pi], it suffices to compute [F.sup.(k).sub.[sigma]](t) (resp., [F.sup.(k).sub.[sigma]]) only for k- irreducible partitions [sigma]; recall that there are k! such partitions.

The proof is omitted in the extended abstract. Let us just mention that it uses the expansion of k-Schur functions in terms of fundamental quasisymmetric functions, and the stable principal specialization (i.e., evaluation at 1, t, [t.sup.2], ...) of fundamental quasisymetric functions.

Example 3.3 The following gives the formulas for k [less than or equal to] 3.

1. For k = 1, we have [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] and therefore

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

This is consistent with (Lam et al., 2010, [section]9.4.1), which states that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

2. For k = 2, we have [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. Therefore,

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

This is consistent with (Lam et al., 2010, Proposition 9.17), reprinted here as Proposition 1.1.

3. For k = 3, we have [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. So, among other formulas, we have

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

Using a computer, it is easy to obtain formulas for larger k.

We now introduce weighted correction factors. For a k-bounded partition [pi], let [H.sup.(k).sub.[pi]](t) = [PI] ([h.sub.ij]), where the product is over all boxes (i, j) of the (k + 1)-core c([pi]) with hook-lengths at most k, and let [H.sup.(k).sub.[pi]] = [H.sup.(k).sub.[pi]] (1) be the product of all hook- lengths [less than or equal to] k of c([pi]). Furthermore, if [b.sub.j] is the number of boxes in the j-column of c([pi]) with hook-length at most k, write [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

Example 3.4 For the 6-bounded partition [pi] = 54211 from Example 22.1, we have [H.sup.(6).sub.[pi]](t) = [(1).sup.4][(2).sup.3][(3).sup.2][(4).sup.2](5)[(6).sup.2], [H.sup.(6).sub.[pi]] = 207360 and [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

By introducing weighted correction factors [C.sup.(k).sub.[sigma]](t) for a k- irreducible partition [sigma], we can, by Theorem 3.1, express [F.sup.(k).sub.[pi]](t) (for all k-bounded partitions [pi]) in another way which is reminiscent of the classical hook-length formula. More precisely, define a rational function [C.sup.(k).sub.[sigma]](t) so that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (3.2)[right arrow]

Note that this implies, in the notation of Theorem 3.1, that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

The correction factor [C.sup.(k).sub.[sigma]] is defined as [C.sup.(k).sub.[sigma]] (1).

For k [less than or equal to] 3, all weighted correction factors are 1. For k = 4, all but four of the 24 weighted correction factors-for 4-bounded partitions 2211, 321, 3211 and 32211-are 1, and the ones different from 1 are

[1 + 2t + [t.sup.2] + [t.sup.3]/(2)(3)], [1 + t + 2[t.sup.2] + [t.sup.3]/(2)(3)], [1 + 2t + 2[t.sup.2] + 2[t.sup.3] + [t.sup.4]/[(3).sup.2]], [1 + t + 3[t.sup.2] + [t.sup.3] + [t.sup.4]/[(3).sup.2]],

respectively.

We state some results and conjectures about the weighted correction factors. For a k-bounded partition [pi], denote by [[partial derivative].sub.k]([pi]) the boxes of c([pi]) with hook-length [less than or equal to] k. If [[partial derivative].sub.k]([pi]) is not connected, we say that [pi] splits. Each of the connected components of [[partial derivative].sub.k]([pi]) is a horizontal translate of [[partial derivative].sub.k]([[pi].sup.i]) for some k-bounded partition [[pi].sup.i]. Call [[pi].sup.1], [[pi].sup.2], ... the components of [pi].

Proposition 3.5 The weighted correction factors are multiplicative in the following sense. If a k-irreducible partition [sigma] splits into [[sigma].sup.1], [[sigma].sup.2], ..., [[sigma].sup.m], then [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

Conjecture 3.6 For a k-irreducible partition [sigma], the weighted correction factor is 1 if and only if [sigma] splits into [[sigma].sup.1], [[sigma].sup.2], ..., [[sigma].sup.l], where each [[sigma].sup.i] is a k-bounded partition that is also a (k + 1)-core.

The "if" direction is easy: if a k-bounded partition [sigma] is also a (k + 1)- core, then strong covers on the interval [0, [sigma]] are precisely the regular covers in the Young lattice, the starred tableaux of shape [sigma] are standard Young tableaux of shape [sigma], and the major index of a starred tableau of shape [sigma] is the classical major index for standard Young tableaux; the fact that the weighted correction factor is 1 then follows from the classical weighted version of the hook-length formula (2.2). If [sigma] splits into cores, we can use (Denton, 2012, Theorem 1.1).

The most interesting conjecture about the weighted correction factors is the following. Recall that a sequence [([[alpha].sub.i]).sub.i] is unimodal if there exists I so that [[alpha].sub.i] [less than or equal to] [[alpha].sub.i+1] for i < I and [[alpha].sub.i] [greater than or equal to] [[alpha].sub.i+1] for i [greater than or equal to] I, and a unimodal polynomial is a polynomial whose sequence of coefficients is unimodal.

Conjecture 3.7 For a k-irreducible partition [sigma], we can write

1 - [C.sup.(k).sub.[sigma]](t) = [[P.sub.1](t)/[P.sub.2](t)],

where [P.sub.1](t) is a unimodal polynomial with non-negative integer coefficients and [P.sub.2](t) is a polynomial of the form [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] for some non- negative integers [w.sub.j].

In particular, we have 0 < [C.sup.(k).sub.[sigma]] [less than or equal to] 1 for all [sigma].

4 Strong covers and k-bounded partitions

Our proof of Theorem 3.1, omitted in the extended abstract, closely follows one of the possible proofs of the classical (non-weighted and weighted) hook-length formula, see e.g. (Stanley, 1999, [section]7.21). Note, however, that the truly elegant proofs (for example, the celebrated probabilistic proof due to Greene, Nijenhuis and Wilf Greene et al. (1979)) are via induction. In this section, we show the first steps toward such a proof.

In the process, we present a new description of strong marked covers in terms of bounded partitions (previous descriptions included cores--at least implicitly, via k-conjugation-- affine permutations and abacuses). See the definition of residue and quotient tables below, and Theorem 4.2.

We identify a bounded partition [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] with the sequence p = ([p.sub.1], ..., [p.sub.k]). Given i, j, m, 0 [less than or equal to] m < i [less than or equal to] j [less than or equal to] k, define [p.sup.i,j,m] as follows.

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

If j = k, then we are adding m + 1 copies of k - j = 0, which does not change the partition. If i = 1, we have m = 0, so adding m copies of k + 2 - i = k + 1 also does not change the partition. To put it another way: to get [p.sup.i,j,m] from p, increase the first m copies of k + 1 - i by 1, and decrease the last m + 1 copies of k + 1 - j by 1. See Example 4.3.

Define upper-triangular arrays R = [([r.sub.ij]).sub.1[less than or equal to]i[less than or equal to]j[less than or equal to]k], Q = [([q.sub.ij]).sub.1[less than or equal to]i[less than or equal to]j[less than or equal to]k] by

* [r.sub.jj] = [p.sub.j] mod j, [r.sub.ij] = ([p.sub.i] + [r.sub.j+1,j]) mod i for i < j,

* [q.sub.jj] = [p.sub.j] div j, [q.sub.ij] = ([p.sub.i] + [r.sub.i+1,j]) div i for i < j.

We call R the residue table and Q the quotient table.

Example 4.1 Take k = 4 and p = (1, 3, 2, 5). Then the residue and quotient tables are given by

It is easy to reconstruct p from the diagonals of R and Q: [p.sub.1] = 0 + 1 x 1, [p.sub.2] = 1 + 1 x 2, [p.sub.3] = 2 + 0 x 3, [p.sub.4] = 1 + 1 x 4.

It turns out that the residue and quotient tables determine strong marked covers (and probably other important relations as well, see 5.5).

Theorem 4.2 Takep = ([p.sub.1], ..., [p.sub.k]) and 1 [less than or equal to] i [less than or equal to] j [less than or equal to] k. If [r.sub.ij] < [r.sub.i+1,j], ..., [r.sub.jj], then p covers [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] in the strong order with multiplicity [q.sub.ij] + ... + [q.sub.jj]. Furthermore, these are, precisely all strong covers. In particular, an element of the (k + 1)-core lattice covers at most [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] elements.

Example 4.3 Take k = 4 and p = (1, 3, 2, 5) as before. Let us underline the entries [r.sub.ij] in the residue table R for which [r.sub.ij] < [r.sub.i+1,j], ..., [r.sub.jj].

By Theorem 4.2, p covers (exactly) the following elements in the strong order:

[p.sup.1,1,0] = (0, 4, 2, 5) with multiplicity 1, [p.sup.1,2,0] = (1, 2, 3, 5) with multiplicity 2+1 = 3, [p.sup.2,2,1] = (2, 0, 4, 5) with multiplicity 1, [p.sup.1,3,0] = (1, 3, 1, 6) with multiplicity 2 + 2 + 0 = 4, [p.sup.2,3,1] = (2, 2, 0, 7) with multiplicity 2 + 0 = 2, [p.sup.3,3,2] = (1, 5, -3, 8) with multiplicity 0, [p.sup.3,4,0] = (1, 3, 2, 4) with multiplicity 1 + 1 = 2, and [p.sup.4,4,1] = (1, 3, 3, 2) with multiplicity 1.

Note that while (1, 5, -3, 8) does not represent a valid partition, the multiplicity of the cover is 0, so we can ignore this cover relation.

For a k-bounded partition [pi], we clearly have

[F.sup.(k).sub.[pi]] = [summation over ([tau])][m.sub.[tau][pi]][F.sup.(k).sub.[tau]],

where the sum is over all k-bounded [tau] that are covered by [pi], and [m.sub.[tau][pi]] is the multiplicity of the cover. Therefore Theorem 4.2 can be used to prove Corollary 3.2 for small values of k by induction. First, we need the following corollary.

Corollary 4.4 Let p = ([p.sub.1], ..., [p.sub.k]), [p.sub.i] < i, with corresponding residue and quotient tables R and Q. Assume that for 1 [less than or equal to] i [less than or equal to] j [less than or equal to] k, we have [r.sub.ij] < [r.sub.i+1,j], ..., [r.sub.jj]. For [s.sub.i] [member of] N, write s = ([s.sub.1], 2[s.sub.2], ..., [ks.sub.k]). Then p + s covers [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] with multiplicity [q.sub.ij] + ... + [q.sub.jj] + [s.sub.i] + ... + [s.sub.j].

The corollary implies that in order to prove Corollary 3.2, all we have to do is check k! equalities. The authors did all such calculations with a computer for small k (k [less than or equal to] 8).

5 Final remarks

5.1

There are also notions of weak horizontal strips and weak tableaux. For n-cores [lambda] and [mu], [lambda] [subset or equal to] [mu], we say that [mu]/[lambda] is a weak horizontal strip if b([mu])/b([lambda]) is a horizontal strip and b([mu]')/b([lambda]') is a vertical strip. If in addition [absolute value of b([mu])] = [absolute value of b([lambda])] + 1, we say that [mu] covers [lambda] in the weak order. A weak tableau of shape [lambda] is a sequence of weak horizontal strips [[mu].sup.(i+1)]/[[mu].sup.(i)], i = 0, ..., m-1, such that [[mu].sup.(0)] = 0 and [[mu].sup.(m)] = [lambda].

Define [f.sup.(k).sub.[pi]] to be the number of weak tableaux of shape c([pi]). In Lam et al. (2010), it was proved that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

It is not hard to prove by induction that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII];

similar formulas exist for

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

We were unable to find formulas for k [greater than or equal to] 4, and it seems unlikely that simple formulas exist. For example, the simplest recurrence relation that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] seem to satisfy is

a(i, j) g(i, j) + b(i, j)g(i, j + 1) - c(i ,j) g(i + 1, j) = 0,

where a and b are fourth degree polynomials in i and j with rational coefficients and c, also fourth degree, is a polynomial with integer coefficients.

5.2

Our work has led us to consider (weighted) correction factors. They seem to be mysterious objects that deserve further study. The unimodality conjecture (Conjecture 3.7) is certainly intriguing and could hint that the factors have some geometric meaning.

Let us give another perspective on these factors. Since k-Schur functions are symmetric, they can be expanded in terms of Schur functions; in fact, the original definition of k- Schur functions via atoms gives precisely such an expansion. For example, [s.sup.(4).sub.2211] = [s.sub.2211] + [s.sub.321]. Take the stable principal specialization and multiply by (6)![(1 - t).sup.6]. By calculations done in our proof of Theorem 3.1 and (Stanley, 1999, Proposition 7.19.11), we have

[F.sup.(4).sub.2211](t) = [f.sub.2211](t) + [f.sub.321](t).

Then, by (3.2) and (Stanley, 1999, Corollary 7.21.5),

[C.sup.(k).sub.2211](t) = (2)(3)(4) ([[t.sup.3]/[(2).sup.2](4)(5)] + [1/[(3).sup.2](5)]) = [1 + 2t + [t.sup.2] + [t.sup.3]/(2)(3)].

5.3

There is also a formula for the principal specialization of [s.sub.[lambda]] of order i (i.e. evaluation at 1, t, ..., [t.sup.i-1], see e.g. (Stanley, 1999, Theorem 7.21.2)), in which both hook-lengths and contents of boxes appear. By imitating 5.2, we can get rational functions (which depend on i) which converge to the weighted correction factors as i [right arrow] [infinity]. These rational functions also seem interesting and worthy of further study.

5.4

As we already mentioned, it would be preferable to prove Corollary 3.2 by induction, using the cover relations in Section 4 for a general k and in a way that would make apparent the meaning of hook-lengths and correction factors (the ideal being a variant of the probabilistic proof from Greene et al. (1979)). It seems likely that one would need to know a formula for the correction factors before such a proof would be feasible.

5.5

We showed (in Theorem 4.2) how to interpret the residue and quotient table to find strong covers. We feel that residue (and quotient) tables could prove important in other aspects of the k-Schur function theory. These tables can also be used to describe weak covers, weak horizontal and vertical strips and at least one of the possible cases of LLMS insertion for standard strong marked tableaux (see Lam et al. (2010)).

Acknowledgments

We thank Jennifer Morse for pointing us to the right version of the problem, Sara Billey for encouraging our collaboration, and Mike Zabrocki for sharing (Lam et al., 2012, Chapter 2) with us.

References

I. Ciocan-Fontanine, M. Konvalinka, and I. Pak. The weighted hook length formula. J. Combin. Theory Ser.A, 118(6):1703-1717, 2011. ISSN 0097-3165.

T. Denton. Canonical Decompositions of Affine Permutations, Affine Codes, and Split k-Schur Functions. arXiv:1204.2591, Apr. 2012.

C. Greene, A. Nijenhuis, and H. S. Wilf. A probabilistic proof of a formula for the number of Young tableaux of a given shape. Adv. in Math., 31(1):104-109, 1979. ISSN 0001-8708.

M. Haiman. Hilbert schemes, polygraphs and the Macdonald positivity conjecture. J. Amer. Math. Soc., 14(4):941-1006 (electronic), 2001. ISSN 0894-0347.

T. Lam. Affine Stanley symmetric functions. Amer. J. Math., 128(6):1553-1586, 2006. ISSN 0002-9327.

T. Lam, L. Lapointe, J. Morse, and M. Shimozono. Affine insertion and Pieri rules for the affine Grassmannian. Mem. Amer. Math. Soc., 208(977):xii+82, 2010. ISSN 0065-9266.

T. Lam, L. Lapointe, J. Morse, A. Schilling, M. Shimozono, and M. Zabrocki. k- Schur functions and affine Schubert calculus. 2012. draft of manuscript.

L. Lapointe and J. 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. ISSN 0097-3165.

L. Lapointe and J. Morse. Quantum cohomology and the k-Schur basis. Trans. Amer. Math. Soc., 360(4): 2021-2040, 2008. ISSN 0002-9947.

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

I. G. Macdonald. Symmetric functions and Hall polynomials. Oxford Mathematical Monographs. Second edition.

R. P. Stanley. Enumerative combinatorics. Vol. 2, volume 62 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1999. ISBN 0-521-56069-1; 0-521-78987-7. With a foreword by Gian-Carlo Rota and appendix 1 by Sergey Fomin.

Susanna Fishel (1) ([dagger]) Matjaz Konvalinka (2) ([double dagger])

(1) School of Mathematical and Statistical Sciences, Arizona State University, Tempe, Arizona, USA

(2) Department of Mathematics, University of Ljubljana, Slovenia

([dagger]) Partially supported by NSF grant # 1200280 and Simons Foundation grant # 209806

([double dagger]) Partially supported by Research Program L1-069 of the Slovenian Research Agency

In 1988, Macdonald introduced a new class of polynomials and conjectured that they expand positively in terms of Schur functions. This conjecture, verified in Haiman (2001), has led to an enormous amount of work, including the development of the k-Schur functions. The k-Schur functions were defined in Lapointe et al. (2003). Lapointe, Lascoux, and Morse conjectured that they form a basis for a certain subspace of the space of symmetric functions and that the Macdonald polynomials indexed by partitions whose first part is not larger than k expand positively in terms of the k-Schur functions, leading to a refinement of the Macdonald conjecture. The k-Schur functions have since been found to arise in other contexts; for example, as the Schubert cells of the cohomology of affine Grassmannian permutations Lam (2006), and they are related to the quantum cohomology of the affine permutations Lapointe and Morse (2008).

One of the intriguing features of standard Young tableaux is the Frame-Thrall- Robinson hook-length formula, which enumerates them. It has many different proofs and many generalizations, see e.g. (Stanley, 1999, Chapter 7), Greene et al. (1979), Ciocan-Fontanine et al. (2011) and the references therein.

In this extended abstract, we partially succeed in finding an analogue of the hook-length formula for standard strong marked tableaux (or starred tableaux for short), which are a natural generalization of standard Young tableaux in the context of k-Schur functions. For a fixed n, the shape of a starred tableau (see Subsection 2.5 for a definition) is necessarily an n-core, a partition for which all hook-lengths are different from n. In Lam et al. (2010), a formula is given for the number of starred tableaux for n = 3.

Proposition 1.1 (Lam et al. (2010), Proposition 9.17) For a 3-core [lambda], the number of starred tableaux of shape [lambda] equals

m!/[2.sup.[m/2]],

where m is the number of boxes of [lambda] with hook-length < 3.

The number of 2-hooks is [m/2]. Therefore we can rewrite the result as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

Note that this is reminiscent of the classical hook-length formula.

The authors left the enumeration for n > 3 as an open problem. The main result (Theorem 3.1) of this extended abstract implies the existence, for each n, of (n - 1)! rational numbers which we call correction factors. Once the corrections factors have been calculated by enumerating all starred tableaux for certain shapes, the number of starred tableaux of shape [lambda] for any n-core [lambda] can be easily computed. In fact, Theorem 3.1 is a t-analogue of the hook formula. The theorem is "incomplete" in the sense that we were not able to find explicit formulas for the (weighted) correction factors. We have, however, been able to state some of their properties (some conjecturally), the most interesting of these properties being unimodality (Conjecture 3.7).

Another result of interest is a new, alternative description of strong marked covers via simple triangular arrays of integers which we call residue tables and quotient tables (Theorem 4.2).

The extended abstract is structured as follows. In Section 2, we give the requisite background, notation, definitions, and results. In Section 3, we state the main results and conjectures. In Section 4, we give an alternative description of strong covers directly in terms of bounded partitions (instead of via cores, abacuses or affine permutations). We envision this description as the first steps toward an inductive proof of the main formula We finish with some remarks and open questions in Section 5.

2 Preliminaries

Here we introduce notation and review some constructions. Please see Macdonald for the definitions of integer partitions, ribbons, hook lengths, etc., which we omit in this extended abstract.

2.1 Cores and bounded partitions

Let n be a positive integer. An n-core is a partition [lambda] such that [h.sup.[lambda].sub.ij] [not equal to] n for all (i,j) [member

of] [lambda]. Core partitions were introduced by Nakayama to describe when two ordinary irreducible representations of the symmetric group belong to the same block. There is a close connection between (k + 1)-cores and k-bounded partitions, which are partitions whose first part (and hence every part) is [less than or equal to] k. Indeed, in Lapointe and Morse (2005), a simple bijection between (k + 1)-cores and k-bounded partitions is presented. Given a (k + 1)-core [lambda], whose diagram has [[lambda].sub.i] boxes in row i, let [[pi].sub.i] be the number of boxes in row i of [lambda] with hook-length [less than or equal to] k. The resulting [pi] = ([[pi].sub.1], [[pi].sub.2], ..., [[pi].sub.l]) is a k-bounded partition, we denote it b([lambda]). Conversely, given a k-bounded partition [pi], move from the last row of [pi] upwards, and in row i, shift the [[pi].sub.i] boxes of the diagram of [pi] to the right until their hook-lengths are at most k. The resulting (k + 1)- core is denoted c([pi]). In this extended abstract, we will always use n as shorthand for k + 1.

Example 2.1 On the left-hand side of Figure 1, the hook-lengths of the boxes of the 5-core [lambda] = 953211 are shown, with the ones that are < 5 in bold. That means that b([lambda]) = 432211.

The right-hand side shows the construction of c([pi]) = 75221 for the 6-bounded partition [pi] = 54221.

Of particular importance are k-bounded partitions [pi] that satisfy [m.sub.i]([pi]) [less than or equal to] k-i for all i = 1, ..., k. We call such partitions k-irreducible partitions, see Lapointe et al. (2003). The number of k-irreducible partitions is k!.

2.2 Young tableaux and the hook-length formula

Young's lattice Y takes as its vertices all integer partitions, and the relation is containment. If [lambda] and [mu] are partitions, then [mu] covers [lambda] if and only if [lambda] [subset or equal to] [mu] and [absolute value of [mu]] = [absolute value of [lambda]] + 1. The rank of a partition is given by its size.

A semistandard Young tableau T of shape [lambda] is a Young diagram of shape [lambda] whose boxes have been filled with positive integers satisfying the following: the integers must be nondecreasing as we read a row from left to right, and increasing as we read a column from top to bottom. The weight of T is the composition ([[alpha].sub.1], [[alpha].sub.2], ...), where [[alpha].sub.i] is the number of i's in T. The tableau T is a standard Young tableau if the entries are 1, ..., [absolute value of [lambda]] in some order, i.e. if the weight is (1, ..., 1). A standard Young tableau of shape [lambda] represents a saturated chain in the interval [0, [lambda]] of the Young's lattice. Let ([[lambda].sup.(0)], [[lambda].sup.(1)], ..., [[lambda].sup.(m)]), [[lambda].sup.(0)] = 0, [[lambda].sup.(m)] = [lambda], be such a chain. Then in the tableau corresponding to this chain, i is the entry in the box added in moving from [[lambda].sup.(i-1)] to [[lambda].sup.(i)].

The Frame-Thrall-Robinson hook-length formula shows how to compute [f.sub.[lambda]], the number of standard Young tableaux of shape [lambda]. We have:

[f.sub.[lambda]] = [[absolute value of [lambda]]!/[[PI].sub.i,j[member of][lambda]][h.sup.[lambda].sub.ij]]. (2.1)

This formula has a well-known weighted version, see (Stanley, 1999, Corollary 7.21.5) For a standard Young tableau T, define a descent to be an integer i such that i + 1 appears in a lower row of T than i, and define the descent set D(T) to be the set of all descents of T. Define the major index of T as maj(T) = [[summation].sub.i[member of]D(T)]i, and the polynomial

[f.sub.[lambda]](t) = [summation][t.sup.maj(T)],

where the sum is over all standard Young tableaux of shape [lambda]. Then

[f.sub.[lambda]](t) = [[t.sup.b([lambda])]([absolute value of [lambda]])!/[[PI].sub.i,j[member of][lambda]]([h.sup.[lambda].sub.ij])]. (2.2)

Here [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

2.3 Strong marked and starred tableaux

The strong n-core poset [C.sub.n] is the subposet of Y induced by the set of all n-core partitions. That is, its vertices are n-core partitions and [lambda] [less than or equal to] [mu] in [C.sub.n] if [lambda] [subset or equal to] [mu]. The cover relations are trickier to describe in [C.sub.n] than in Y.

Proposition 2.2 (Lam et al. (2010), Proposition 9.5) Suppose [lambda] [less than or equal to] [mu] in [C.sub.n], and let [C.sub.1], ..., [C.sub.m] be the connected components of [mu]/[lambda]. Then [mu] covers [lambda] (denoted [lambda] [??] [mu]) if and only if each [C.sub.i] is a ribbon, and all the components are translates of each other with heads on consecutive diagonals with the same residue.

The rank of an n-core is the number of boxes of its diagram with hook-length < n. If [lambda] [??] [mu] and [mu]/[lambda] consists of m ribbons, we say that [mu] covers [lambda] in the strong order with multiplicity m. Figure 2 shows the strong marked covers for 4-cores with rank at most 6. Only multiplicities [not equal to] 1 are marked.

A strong marked cover is a triple ([lambda], [mu], c) such that [lambda] [??] [mu] and that c is the content of the head of one of the ribbons. We call c the marking of the strong marked cover. A strong marked horizontal strip of size r and shape [mu]/[lambda] is a sequence [([v.sup.(i)], [v.sup.(i+1)], [c.sub.i]).sup.r-1.sub.i=0] of strong marked covers such that [c.sub.i] < [c.sub.i+1], [v.sup.(0)] = [lambda], [v.sup.(r)] = [mu]. If [lambda] is an n-core, a strong marked tableau T of shape [lambda] is a sequence of strong marked horizontal strips of shapes [[mu].sup.(i+1)]/[[mu].sup.(i)], i = 0, ..., m - 1, such that [[mu].sup.(0)] = 0 and [[mu].sup.(m)] = [lambda]. The weight of T is the composition ([r.sub.1], ..., [r.sub.m]), where [r.sub.i] is the size of the strong marked horizontal strip [[mu].sup.(i)]/[[mu].sup.(i-1)]. If all strong marked horizontal strips are of size 1, we call T a standard strong marked tableau or a starred tableau for short. For a k-bounded partition [pi] (recall that n = k + 1), denote the number of starred tableaux of shape c([pi]) by [F.sup.(k).sub.[pi]].

Figure 3 illustrates [F.sup.(3).sub.211] = 6.

If [lambda] is a k-bounded partition that is also an n-core (i.e., if [[lambda].sub.1] + l([lambda]) [less than or equal to] k + 1), then strong marked covers on the interval [0, [lambda]] are equivalent to the covers in the Young lattice, strong marked tableaux of shape [lambda] are equivalent to semistandard Young tableaux of shape [lambda], and starred tableaux of shape [lambda] are equivalent to standard Young tableaux of shape [lambda].

2.4 Schur functions

For the definition of [LAMBDA], the ring of symmetric functions, see Macdonald or Stanley (1999). For a partition [lambda], define the monomial symmetric function

[m.sub.[lambda]] = [m.sub.[lambda]] ([x.sub.1],[x.sub.2], ...) = [summation over ([alpha])][x.sup.[alpha]],

where the sum is over all weak compositions [alpha] that are a permutation of [lambda], and [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. For partitions [lambda] and [mu] of the same size, define the Kostka number [K.sub.[lambda][mu]] as the number of semistandard Young tableaux of shape [lambda] and weight [mu]. Define the Schur function

[s.sub.[lambda]] = [summation][K.sub.[lambda][mu]][m.sub.[mu]]

with the sum over all partitions [mu]. The Schur functions form the most important basis of [LAMBDA] and have numerous beautiful properties. See for example (Stanley, 1999, Chapter 7) and (Macdonald, Chapter 1).

2.5 k-Schur functions

There are at least three conjecturally equivalent definitions of k-Schur functions. Here, we give the definition from Lam et al. (2010) via strong marked tableaux. For k-bounded partitions [pi] and [tau], define the k-Kostka number [K.sup.(k).sub.[pi][tau]] as the number of strong marked tableaux of shape c([pi]) and weight [tau]. Then we define the k-Schur function

[s.sup.(k).sub.[pi]] = [summation over ([tau])][K.sup.(k).sub.[pi][tau]][m.sub.[tau]], (2.3)

where the sum is over all k-bounded partitions [tau].

If [pi] is also a (k + 1)-core, then strong marked tableaux of shape [pi] are equivalent to semistandard Young tableaux of shape [pi], and therefore in this case [s.sup.(k).sub.[pi]] = [s.sub.[pi]].

The original definition of k-Schur functions was via atoms Lapointe et al. (2003), which we will not use here (but see 5.2). Note that in full generality, the k-Schur functions (in any definition) have a parameter t. In this extended abstract, t = 1.

3 Main results and conjectures

For a starred tableau T, define the descent set of T, D(T), as the set of all i for which the marked box at i is strictly above the marked box at i + 1. Define the major index of T, maj(T), by [[summation].sub.i[member of]D(T)]i. For a k-bounded partition [pi], define the polynomial

[F.sup.(k).sub.[pi]](t) = [summation over (T)][t.sup.maj(T)], (3.1)

where the sum is over all starred tableaux of shape c([pi]). Recall that [F.sup.(k).sub.[pi]] denotes the number of such starred tableaux, i.e. [F.sup.(k).sub.[pi]] = [F.sup.(k).sub.[pi]] (1).

Our main result is the following theorem.

Theorem 3.1 Let [pi] be a k-bounded partition, and write

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII],

for 0 [less than or equal to] [a.sub.i] < i. Then

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII],

where [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

By plugging in t = 1, we get the following.

Corollary 3.2 Let [pi] be a k-bounded partition, and write

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII],

for 0 [less than or equal to] [a.sub.i] < i. Then

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII],

where [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII],

The theorem (respectively, corollary) implies that in order to compute [F.sup.(k).sub.[pi]](t) (resp., [F.sup.(k).sub.[pi]]) for all k-bounded partitions [pi], it suffices to compute [F.sup.(k).sub.[sigma]](t) (resp., [F.sup.(k).sub.[sigma]]) only for k- irreducible partitions [sigma]; recall that there are k! such partitions.

The proof is omitted in the extended abstract. Let us just mention that it uses the expansion of k-Schur functions in terms of fundamental quasisymmetric functions, and the stable principal specialization (i.e., evaluation at 1, t, [t.sup.2], ...) of fundamental quasisymetric functions.

Example 3.3 The following gives the formulas for k [less than or equal to] 3.

1. For k = 1, we have [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] and therefore

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

This is consistent with (Lam et al., 2010, [section]9.4.1), which states that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

2. For k = 2, we have [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. Therefore,

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

This is consistent with (Lam et al., 2010, Proposition 9.17), reprinted here as Proposition 1.1.

3. For k = 3, we have [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. So, among other formulas, we have

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

Using a computer, it is easy to obtain formulas for larger k.

We now introduce weighted correction factors. For a k-bounded partition [pi], let [H.sup.(k).sub.[pi]](t) = [PI] ([h.sub.ij]), where the product is over all boxes (i, j) of the (k + 1)-core c([pi]) with hook-lengths at most k, and let [H.sup.(k).sub.[pi]] = [H.sup.(k).sub.[pi]] (1) be the product of all hook- lengths [less than or equal to] k of c([pi]). Furthermore, if [b.sub.j] is the number of boxes in the j-column of c([pi]) with hook-length at most k, write [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

Example 3.4 For the 6-bounded partition [pi] = 54211 from Example 22.1, we have [H.sup.(6).sub.[pi]](t) = [(1).sup.4][(2).sup.3][(3).sup.2][(4).sup.2](5)[(6).sup.2], [H.sup.(6).sub.[pi]] = 207360 and [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

By introducing weighted correction factors [C.sup.(k).sub.[sigma]](t) for a k- irreducible partition [sigma], we can, by Theorem 3.1, express [F.sup.(k).sub.[pi]](t) (for all k-bounded partitions [pi]) in another way which is reminiscent of the classical hook-length formula. More precisely, define a rational function [C.sup.(k).sub.[sigma]](t) so that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (3.2)[right arrow]

Note that this implies, in the notation of Theorem 3.1, that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

The correction factor [C.sup.(k).sub.[sigma]] is defined as [C.sup.(k).sub.[sigma]] (1).

For k [less than or equal to] 3, all weighted correction factors are 1. For k = 4, all but four of the 24 weighted correction factors-for 4-bounded partitions 2211, 321, 3211 and 32211-are 1, and the ones different from 1 are

[1 + 2t + [t.sup.2] + [t.sup.3]/(2)(3)], [1 + t + 2[t.sup.2] + [t.sup.3]/(2)(3)], [1 + 2t + 2[t.sup.2] + 2[t.sup.3] + [t.sup.4]/[(3).sup.2]], [1 + t + 3[t.sup.2] + [t.sup.3] + [t.sup.4]/[(3).sup.2]],

respectively.

We state some results and conjectures about the weighted correction factors. For a k-bounded partition [pi], denote by [[partial derivative].sub.k]([pi]) the boxes of c([pi]) with hook-length [less than or equal to] k. If [[partial derivative].sub.k]([pi]) is not connected, we say that [pi] splits. Each of the connected components of [[partial derivative].sub.k]([pi]) is a horizontal translate of [[partial derivative].sub.k]([[pi].sup.i]) for some k-bounded partition [[pi].sup.i]. Call [[pi].sup.1], [[pi].sup.2], ... the components of [pi].

Proposition 3.5 The weighted correction factors are multiplicative in the following sense. If a k-irreducible partition [sigma] splits into [[sigma].sup.1], [[sigma].sup.2], ..., [[sigma].sup.m], then [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

Conjecture 3.6 For a k-irreducible partition [sigma], the weighted correction factor is 1 if and only if [sigma] splits into [[sigma].sup.1], [[sigma].sup.2], ..., [[sigma].sup.l], where each [[sigma].sup.i] is a k-bounded partition that is also a (k + 1)-core.

The "if" direction is easy: if a k-bounded partition [sigma] is also a (k + 1)- core, then strong covers on the interval [0, [sigma]] are precisely the regular covers in the Young lattice, the starred tableaux of shape [sigma] are standard Young tableaux of shape [sigma], and the major index of a starred tableau of shape [sigma] is the classical major index for standard Young tableaux; the fact that the weighted correction factor is 1 then follows from the classical weighted version of the hook-length formula (2.2). If [sigma] splits into cores, we can use (Denton, 2012, Theorem 1.1).

The most interesting conjecture about the weighted correction factors is the following. Recall that a sequence [([[alpha].sub.i]).sub.i] is unimodal if there exists I so that [[alpha].sub.i] [less than or equal to] [[alpha].sub.i+1] for i < I and [[alpha].sub.i] [greater than or equal to] [[alpha].sub.i+1] for i [greater than or equal to] I, and a unimodal polynomial is a polynomial whose sequence of coefficients is unimodal.

Conjecture 3.7 For a k-irreducible partition [sigma], we can write

1 - [C.sup.(k).sub.[sigma]](t) = [[P.sub.1](t)/[P.sub.2](t)],

where [P.sub.1](t) is a unimodal polynomial with non-negative integer coefficients and [P.sub.2](t) is a polynomial of the form [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] for some non- negative integers [w.sub.j].

In particular, we have 0 < [C.sup.(k).sub.[sigma]] [less than or equal to] 1 for all [sigma].

4 Strong covers and k-bounded partitions

Our proof of Theorem 3.1, omitted in the extended abstract, closely follows one of the possible proofs of the classical (non-weighted and weighted) hook-length formula, see e.g. (Stanley, 1999, [section]7.21). Note, however, that the truly elegant proofs (for example, the celebrated probabilistic proof due to Greene, Nijenhuis and Wilf Greene et al. (1979)) are via induction. In this section, we show the first steps toward such a proof.

In the process, we present a new description of strong marked covers in terms of bounded partitions (previous descriptions included cores--at least implicitly, via k-conjugation-- affine permutations and abacuses). See the definition of residue and quotient tables below, and Theorem 4.2.

We identify a bounded partition [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] with the sequence p = ([p.sub.1], ..., [p.sub.k]). Given i, j, m, 0 [less than or equal to] m < i [less than or equal to] j [less than or equal to] k, define [p.sup.i,j,m] as follows.

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

If j = k, then we are adding m + 1 copies of k - j = 0, which does not change the partition. If i = 1, we have m = 0, so adding m copies of k + 2 - i = k + 1 also does not change the partition. To put it another way: to get [p.sup.i,j,m] from p, increase the first m copies of k + 1 - i by 1, and decrease the last m + 1 copies of k + 1 - j by 1. See Example 4.3.

Define upper-triangular arrays R = [([r.sub.ij]).sub.1[less than or equal to]i[less than or equal to]j[less than or equal to]k], Q = [([q.sub.ij]).sub.1[less than or equal to]i[less than or equal to]j[less than or equal to]k] by

* [r.sub.jj] = [p.sub.j] mod j, [r.sub.ij] = ([p.sub.i] + [r.sub.j+1,j]) mod i for i < j,

* [q.sub.jj] = [p.sub.j] div j, [q.sub.ij] = ([p.sub.i] + [r.sub.i+1,j]) div i for i < j.

We call R the residue table and Q the quotient table.

Example 4.1 Take k = 4 and p = (1, 3, 2, 5). Then the residue and quotient tables are given by

0 0 0 0 1 1 1 2 0 1 1 2 2 2 1 2 1 0 1 1

It is easy to reconstruct p from the diagonals of R and Q: [p.sub.1] = 0 + 1 x 1, [p.sub.2] = 1 + 1 x 2, [p.sub.3] = 2 + 0 x 3, [p.sub.4] = 1 + 1 x 4.

It turns out that the residue and quotient tables determine strong marked covers (and probably other important relations as well, see 5.5).

Theorem 4.2 Takep = ([p.sub.1], ..., [p.sub.k]) and 1 [less than or equal to] i [less than or equal to] j [less than or equal to] k. If [r.sub.ij] < [r.sub.i+1,j], ..., [r.sub.jj], then p covers [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] in the strong order with multiplicity [q.sub.ij] + ... + [q.sub.jj]. Furthermore, these are, precisely all strong covers. In particular, an element of the (k + 1)-core lattice covers at most [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] elements.

Example 4.3 Take k = 4 and p = (1, 3, 2, 5) as before. Let us underline the entries [r.sub.ij] in the residue table R for which [r.sub.ij] < [r.sub.i+1,j], ..., [r.sub.jj].

0 0 0 0 1 1 1 2 0 1

By Theorem 4.2, p covers (exactly) the following elements in the strong order:

[p.sup.1,1,0] = (0, 4, 2, 5) with multiplicity 1, [p.sup.1,2,0] = (1, 2, 3, 5) with multiplicity 2+1 = 3, [p.sup.2,2,1] = (2, 0, 4, 5) with multiplicity 1, [p.sup.1,3,0] = (1, 3, 1, 6) with multiplicity 2 + 2 + 0 = 4, [p.sup.2,3,1] = (2, 2, 0, 7) with multiplicity 2 + 0 = 2, [p.sup.3,3,2] = (1, 5, -3, 8) with multiplicity 0, [p.sup.3,4,0] = (1, 3, 2, 4) with multiplicity 1 + 1 = 2, and [p.sup.4,4,1] = (1, 3, 3, 2) with multiplicity 1.

Note that while (1, 5, -3, 8) does not represent a valid partition, the multiplicity of the cover is 0, so we can ignore this cover relation.

For a k-bounded partition [pi], we clearly have

[F.sup.(k).sub.[pi]] = [summation over ([tau])][m.sub.[tau][pi]][F.sup.(k).sub.[tau]],

where the sum is over all k-bounded [tau] that are covered by [pi], and [m.sub.[tau][pi]] is the multiplicity of the cover. Therefore Theorem 4.2 can be used to prove Corollary 3.2 for small values of k by induction. First, we need the following corollary.

Corollary 4.4 Let p = ([p.sub.1], ..., [p.sub.k]), [p.sub.i] < i, with corresponding residue and quotient tables R and Q. Assume that for 1 [less than or equal to] i [less than or equal to] j [less than or equal to] k, we have [r.sub.ij] < [r.sub.i+1,j], ..., [r.sub.jj]. For [s.sub.i] [member of] N, write s = ([s.sub.1], 2[s.sub.2], ..., [ks.sub.k]). Then p + s covers [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] with multiplicity [q.sub.ij] + ... + [q.sub.jj] + [s.sub.i] + ... + [s.sub.j].

The corollary implies that in order to prove Corollary 3.2, all we have to do is check k! equalities. The authors did all such calculations with a computer for small k (k [less than or equal to] 8).

5 Final remarks

5.1

There are also notions of weak horizontal strips and weak tableaux. For n-cores [lambda] and [mu], [lambda] [subset or equal to] [mu], we say that [mu]/[lambda] is a weak horizontal strip if b([mu])/b([lambda]) is a horizontal strip and b([mu]')/b([lambda]') is a vertical strip. If in addition [absolute value of b([mu])] = [absolute value of b([lambda])] + 1, we say that [mu] covers [lambda] in the weak order. A weak tableau of shape [lambda] is a sequence of weak horizontal strips [[mu].sup.(i+1)]/[[mu].sup.(i)], i = 0, ..., m-1, such that [[mu].sup.(0)] = 0 and [[mu].sup.(m)] = [lambda].

Define [f.sup.(k).sub.[pi]] to be the number of weak tableaux of shape c([pi]). In Lam et al. (2010), it was proved that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

It is not hard to prove by induction that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII];

similar formulas exist for

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

We were unable to find formulas for k [greater than or equal to] 4, and it seems unlikely that simple formulas exist. For example, the simplest recurrence relation that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] seem to satisfy is

a(i, j) g(i, j) + b(i, j)g(i, j + 1) - c(i ,j) g(i + 1, j) = 0,

where a and b are fourth degree polynomials in i and j with rational coefficients and c, also fourth degree, is a polynomial with integer coefficients.

5.2

Our work has led us to consider (weighted) correction factors. They seem to be mysterious objects that deserve further study. The unimodality conjecture (Conjecture 3.7) is certainly intriguing and could hint that the factors have some geometric meaning.

Let us give another perspective on these factors. Since k-Schur functions are symmetric, they can be expanded in terms of Schur functions; in fact, the original definition of k- Schur functions via atoms gives precisely such an expansion. For example, [s.sup.(4).sub.2211] = [s.sub.2211] + [s.sub.321]. Take the stable principal specialization and multiply by (6)![(1 - t).sup.6]. By calculations done in our proof of Theorem 3.1 and (Stanley, 1999, Proposition 7.19.11), we have

[F.sup.(4).sub.2211](t) = [f.sub.2211](t) + [f.sub.321](t).

Then, by (3.2) and (Stanley, 1999, Corollary 7.21.5),

[C.sup.(k).sub.2211](t) = (2)(3)(4) ([[t.sup.3]/[(2).sup.2](4)(5)] + [1/[(3).sup.2](5)]) = [1 + 2t + [t.sup.2] + [t.sup.3]/(2)(3)].

5.3

There is also a formula for the principal specialization of [s.sub.[lambda]] of order i (i.e. evaluation at 1, t, ..., [t.sup.i-1], see e.g. (Stanley, 1999, Theorem 7.21.2)), in which both hook-lengths and contents of boxes appear. By imitating 5.2, we can get rational functions (which depend on i) which converge to the weighted correction factors as i [right arrow] [infinity]. These rational functions also seem interesting and worthy of further study.

5.4

As we already mentioned, it would be preferable to prove Corollary 3.2 by induction, using the cover relations in Section 4 for a general k and in a way that would make apparent the meaning of hook-lengths and correction factors (the ideal being a variant of the probabilistic proof from Greene et al. (1979)). It seems likely that one would need to know a formula for the correction factors before such a proof would be feasible.

5.5

We showed (in Theorem 4.2) how to interpret the residue and quotient table to find strong covers. We feel that residue (and quotient) tables could prove important in other aspects of the k-Schur function theory. These tables can also be used to describe weak covers, weak horizontal and vertical strips and at least one of the possible cases of LLMS insertion for standard strong marked tableaux (see Lam et al. (2010)).

Acknowledgments

We thank Jennifer Morse for pointing us to the right version of the problem, Sara Billey for encouraging our collaboration, and Mike Zabrocki for sharing (Lam et al., 2012, Chapter 2) with us.

References

I. Ciocan-Fontanine, M. Konvalinka, and I. Pak. The weighted hook length formula. J. Combin. Theory Ser.A, 118(6):1703-1717, 2011. ISSN 0097-3165.

T. Denton. Canonical Decompositions of Affine Permutations, Affine Codes, and Split k-Schur Functions. arXiv:1204.2591, Apr. 2012.

C. Greene, A. Nijenhuis, and H. S. Wilf. A probabilistic proof of a formula for the number of Young tableaux of a given shape. Adv. in Math., 31(1):104-109, 1979. ISSN 0001-8708.

M. Haiman. Hilbert schemes, polygraphs and the Macdonald positivity conjecture. J. Amer. Math. Soc., 14(4):941-1006 (electronic), 2001. ISSN 0894-0347.

T. Lam. Affine Stanley symmetric functions. Amer. J. Math., 128(6):1553-1586, 2006. ISSN 0002-9327.

T. Lam, L. Lapointe, J. Morse, and M. Shimozono. Affine insertion and Pieri rules for the affine Grassmannian. Mem. Amer. Math. Soc., 208(977):xii+82, 2010. ISSN 0065-9266.

T. Lam, L. Lapointe, J. Morse, A. Schilling, M. Shimozono, and M. Zabrocki. k- Schur functions and affine Schubert calculus. 2012. draft of manuscript.

L. Lapointe and J. 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. ISSN 0097-3165.

L. Lapointe and J. Morse. Quantum cohomology and the k-Schur basis. Trans. Amer. Math. Soc., 360(4): 2021-2040, 2008. ISSN 0002-9947.

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

I. G. Macdonald. Symmetric functions and Hall polynomials. Oxford Mathematical Monographs. Second edition.

R. P. Stanley. Enumerative combinatorics. Vol. 2, volume 62 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1999. ISBN 0-521-56069-1; 0-521-78987-7. With a foreword by Gian-Carlo Rota and appendix 1 by Sergey Fomin.

Susanna Fishel (1) ([dagger]) Matjaz Konvalinka (2) ([double dagger])

(1) School of Mathematical and Statistical Sciences, Arizona State University, Tempe, Arizona, USA

(2) Department of Mathematics, University of Ljubljana, Slovenia

([dagger]) Partially supported by NSF grant # 1200280 and Simons Foundation grant # 209806

([double dagger]) Partially supported by Research Program L1-069 of the Slovenian Research Agency

Printer friendly Cite/link Email Feedback | |

Author: | Fishel, Susanna; Konvalinka, Matjaz |
---|---|

Publication: | DMTCS Proceedings |

Article Type: | Report |

Geographic Code: | 4EXSL |

Date: | Jan 1, 2013 |

Words: | 5427 |

Previous Article: | Crossings and nestings for arc-coloured permutations. |

Next Article: | Generating tuples of integers modulo the action of a permutation group and applications. |

Topics: |