This paper proves a conjecture by Finkelberg and Ionov that their defined Kostka functions coincide with the negative variant of Kostka functions associated to complex reflection groups, and explores multi-variable extensions.
Contribution
The paper confirms Finkelberg and Ionov's conjecture linking their Kostka functions to existing ones and discusses multi-variable generalizations.
Findings
01
Finkelberg-Ionov conjecture is proven to hold.
02
Kostka functions are extended to multi-variable versions.
03
Results connect Kostka functions with Lusztig's partition function.
Abstract
Kostka functions Kλ,μ±(t) associated to complex reflection groups are a generalization of Kostka polynomials, which are indexed by r-partitions λ,μ and a sign +,−. It is known that Kostka polynomials have an interpretation in terms of Lusztig's partition function. Finkelberg and Ionov defined alternate functions Kλ,μ(t) by using an analogue of Lusztig's partition function, and showed that Kλ,μ(t) are polynomials in t with non-negative integer coefficients. They conjecture that their Kλ,μ(t) coincide with Kλ,μ−(t). In this paper, we show that their conjecture holds. We also discuss a multi-variable version of Kostka functions.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Algebraic structures and combinatorial models · Advanced Algebra and Geometry
Full text
**Kostka functions associated to complex reflection groups
and a conjecture of Finkelberg-Ionov**
Toshiaki Shoji
Abstract.
Kostka functions Kλ,μ±(t), indexed by r-partitions λ,μ of n,
are a generalization of Kostka polynomials Kλ,μ(t) indexed by partitions
λ,μ of n. It is known that Kostka polynomials have an interpretation in terms
of Lusztig’s partition function. Finkelberg and Ionov defined alternate functions
Kλ,μ(t) by using an analogue of Lusztig’s partition function, and showed that
Kλ,μ(t)∈Z≥0[t] for generic μ by making use of a coherent realization.
They conjectured that Kλ,μ(t) coincide with Kλ,μ−(t).
In this paper, we show that their conjecture holds. We also discuss the multi-variable
version, namely, r-variable Kostka functions Kλ,μ±(t1,…,tr).
1. Introduction
Let Kλ,μ(t)∈Z[t] be Kostka polynomials indexed by partitions
λ,μ of n. It is known by [M, III, Example 4] that Kostka polynomials
have an interpretation in terms of Lusztig’s partition function.
(Actually, Lusztig defined a partition function in [L1], and conjectured
a formula on a q-analogue
of the weight multiplicities for semisimple Lie algebras in terms of
his partition function, as a generalization of the above result which corresponds to
the case of type A. Soon after that the conjecture was proved by [K].)
Let Pn,r be the set of r-tuples of partitions
λ=(λ(1),…,λ(r))
such that ∑i=1r∣λ(i)∣=n.
In [S1, S2], as a generalization of the classical Kostka polynomials, Kostka functions
Kλ,μ±(t) attached to λ,μ∈Pn,r were introduced.
(In general, there exist two types, “+” and “−” types. If r=1 or 2,
Kλ,μ+(t)=Kλ,μ−(t). If r=1, they coincide with the classical
Kostka polynomials.)
A priori, they are rational functions in Q(t),
and the construction depends on the choice of a total order on Pn,r.
Kλ,μ±(t) are called Kostka functions associated to complex
reflection groups, or r-Kostka functions, in short
(see [S1] for the relationship with the complex reflection
group Sn⋉(Z/rZ)n).
In [FI], Finkelberg and Ionov introduced polynomials Kλ,μ(t)∈Z[t]
attached to λ,μ∈Pn,r, by using an analogue of Lusztig’s partition
function on GLmr, where we choose an integer m such that
the number of parts of λ(i),μ(i) is smaller than m for each i.
They proved, in the case where μ is regular (see 7.6 for the precise
definition), that Kλ,μ(t)∈Z≥0[t],
by showing the higher cohomology vanishing
Hi>0(X,O(μ))=0, where X is a certain (GLm)r-equivariant
vector bundle over the flag variety B of (GLm)r, and
O(μ) is the pull-back of the (GLm)r-equivariant ample line bundle
O(μ) over B associated to μ∈Pn,r.
(In fact, they proved the higher cohomology vanishing by showing the Frobenius splitting
of X.) In turn, the higher cohomology vanishing for general μ was recently proved
by Hu [H]. Hence the positivity property for Kλ,μ(t) now holds
without any restriction.
Their result is a natural
generalization of the coherent realization of the classical Kostka polynomials
due to Brylinski [B].
On the other hand, the vector bundle X is nothing but (a special case of )
Lusztig’s iterated covolution diagram ([L2]) associated to the cyclic quiver of r-vertices.
In this direction, Orr and Shimozono [OS] constructed a wider class of polynomials,
as a generalization of Kλ,μ(t) of [FI], by making use of Lusztig’s
iterated covolution diagram associated to arbitrary quivers.
Finkelberg and Ionov conjectured in [FI] that Kλ,μ(t) coincide with our
Kλ,μ−(t). More generally,
they construct in [FI] polynomials Kλ,μ(t1,…,tr)∈Z[t1,…,tr],
a multi-variable version of Kλ,μ(t),
by making use of Lusztig’s partition function.
Those polynomials have a property that Kλ,μ(t1,…,tr)
coincides with Kλ,μ(t) if t1=⋯=tr=t.
Inspired by their work, we generalize our r-Kostka functions to the
multi-variable case. In the one-variable case, Kλ,μ±(t) are defined
as the coefficients of the expansion of Schur functions sλ(x)
in terms of the Hall-Littlewood
functions Pμ±(x;t), where x=(x(1),…,x(r)) are r types
of infinitely many variables x(k)=x1(k),x2(k),….
Hence we generalize the definition of Hall-Littlewood functions to the multi-parameter
case Pλ±(x;t) with t=(t1,…,tr), and define
Kλ,μ±(t) as the coefficients of the expansion of sλ(x)
in terms of Pλ±(x;t).
Note that the construction of Hall-Littlewood functions depends on the choice of the
total order which is compatible with the dominance order on Pn,r, and they are
symmetric functions with respect to x(1),…,x(r) with coefficients in
Q(t).
We show that both of Kλ,μ±(t) have an interpretation in terms of
an analogue of Lusztig’s partition function, and that Kλ,μ−(t)
coincides with their Kλ,μ(t), which proves their conjecture in a generalized
form.
The main step for the proof is to establish a closed formula for
Hall-Littlewood functions as given in [M, III, 2] for the
classical case. By using this formula, one can show that Hall-Littlewood
functions are actually independent of the choice of the total order, and are
symmetric functions with coefficients in Z[t]. This implies that
Kλ,μ±(t)∈Z[t], and
they are independent of the choice of the total order.
Note that in establishing the closed formula for Hall-Littlewood functions,
the multi-variable setting is essential.
Even if one is interested only in the one-variable case, our discussion does not
work without multi-variable setting.
In December of 2015, Michael Finkelberg gave a lecture concerning their conjecture
at the conference in Shanghai, Chongming Island. This work arose from his
interesting talk there, and from his question on the stability of Kostka functions
on the occasion of the conference at Besse-et-St-Anastaise in 2013.
The author is very grateful for him for stimulating discussions.
Contents
Introduction
Hall-Littlewood functions with multi-parameter
Comparison of Hall-Littlewood functions for different r
Closed formula for Hall-Littlewood functions
Closed formula for Hall-Littlewood functions – continued
Closed formula for Hall-Littlewood functions – “+”case
A conjecture of Finkelberg-Ionov
2. Hall-Littlewood functions with multi-parameter
2.1.
First we recall basic properties of Hall-Littlewood functions and Kostka polynomials
in the original setting, following [M].
Let Pn be the set of partitions λ=(λ1,…,λk) with λi≥0
such that
∣λ∣=∑iλi=n.
For a partition λ, the length l(λ) of λ is defined as the number of λi
such that λi=0.
Let Λ=Λ(y)=⨁n≥0Λn be the ring of symmetric functions
over Z with respect to the variables y=(y1,y2,…), where Λn denotes the
free Z-module of symmetric functions of degree n.
For each λ∈Pn, the Schur function sλ(y)∈Λ is defined as follows;
first choose finitely many variables
y1,…,ym such that m≥l(λ), and define the Schur polynomial
sλ(y1,…,ym)∈Z[y1,…,ym] by
[TABLE]
sλ(y1,…,ym) satisfies the stability property
[TABLE]
and one can define sλ(y) by
[TABLE]
Then
{sλ∣λ∈Pn} gives a Z-basis of Λn.
2.2
We fix m, and consider a partition λ=(λ1,…,λm)∈Pn
such that l(λ)≤m. We denote λ as
λ=(0m0,1m1,2m2,…), where mi=♯{j∣λj=i}
for i=0,1,2,….
Let t be an indeterminate. We define
a polynomial vλ(t)∈Z[t] as follows;
for each integer k≥1, we define vk(t) by
[TABLE]
where ℓ(w) is the length function of the symmetric group Sk of degree k,
and put vk(t)=1 for k=0.
Set
[TABLE]
The symmetric group Sm acts on the set of variables
{y1,…,ym} as permutations.
For l(λ)≤m, we define the Hall-Littlewood
polynomial Pλ(y1,…,ym;t)∈Z[y1,…,ym;t] by
[TABLE]
where we use the standard notation yα=y1α1y2α2⋯ymαm
for α=(α1,…,αm)∈Zm.
Let Λ[t]=Z[t]⊗ZΛ be the ring of symmetric functions with
coefficients in Z[t]. We have Λ[t]=⨁n≥0Λn[t],
where Λn[t]=Z[t]⊗ZΛn.
The Hall-Littlewood polynomial has the stability property, and one can define
the Hall-Littlewood function Pλ(y;t)∈Λ[t] by taking m↦∞.
{Pλ(y;t)∣λ∈Pn,r} gives a Z[t]-basis of the free
Z[t]-module Λn[t].
Another type of Hall-Littlewood function Qλ(y;t) is defined by
Qλ(y;t)=bλ(t)Pλ(y;t), where
b(t)=vλ(t)(1−t)l/vm0(t)∈Z[t]
with l=l(λ).
{Qλ∣λ∈Pn} gives a Q(t)-basis of
ΛQn(t)=Q(t)⊗ZΛn.
2.3.
For λ,μ∈Pn, the Kostka polynomials Kλ,μ(t)∈Z[t] are
defined by the formula
[TABLE]
We define a partial order ξ≤η, the so-called dominance order, on Zm
by the condition, for
ξ=(ξ1,…,ξm),η=(η1,…,ηm)∈Zm,
[TABLE]
For each partition λ=(λ1,…,λm), we define an integer n(λ)
by
[TABLE]
It is known that Kλ,μ(t)=0 unless μ≤λ, and in which case,
Kλ,μ(t) is monic of degree n(μ)−n(λ).
For any integer s≥1, we define a function qs(y1,…,ym;t) by
[TABLE]
and put qs=1 for s=0.
The generating function for qs is given as follows ([M, III, (2.10)]).
Let u be another indeterminate. Then we have
[TABLE]
For a partition λ=(λ1,…,λm)∈Pn, we define a function qλ
by
[TABLE]
By taking m↦∞, qλ(y1,…,ym;t) defines qλ(y;t)∈Λn[t].
Then Qλ has an expansion by qμ,
Qλ=qλ+∑μ>λaλ,μ(t)qμ,
with aλ,μ(t)∈Z[t].
Hence {qλ∣λ∈Pn} gives a Q(t)-basis of
ΛQn(t).
2.4.
We fix an integer r≥2, and consider the r types of variables
x=(x(1),…,x(r)), where x(k) stands for the infinitely many
variables x1(k),x2(k),….
We consider the ring of symmetric functions
Ξ=Ξ(x)=Λ(x(1))⊗⋯⊗Λ(x(r)),
symmetric with respect to each variable x(k).
We have Ξ=⨁n≥0Ξn, where Ξn is the free Z-module
consisting of homogeneous symmetric functions of degree n.
Let Pn,r be the set of r-tuple of partitions
λ=(λ(1),…,λ(r)) such that ∑k=1r∣λ(k)∣=n.
For λ∈Pn,r, we choose an integer m such that m≥l(λ(k))
for any k, and consider the finitely many variables
{xi(k)∣1≤k≤r,1≤i≤m}.
We prepare the index set
[TABLE]
and write xi(k) as xν for ν=(k,i)∈M.
We denote by xM the set of variables {xν∣ν∈M}.
We define a polynomial sλ(xM) by
[TABLE]
sλ(xM) has the stability property with respect to the operation
xm+1(1)=⋯=xm+1(r)=0 in M(m+1),
and by taking m↦∞, one can
define sλ(x)∈Ξ. Then
{sλ(x)∣λ∈Pn,r} gives a basis of Ξn.
For a partition λ∈Pn, the monomial symmetric polynomial
mλ(y1,…,ym)∈Z[y1,…,ym] is defined for m≥l(λ).
For λ∈Pn,r, we define
mλ(xM) by
[TABLE]
By taking m↦∞, one can define
mλ(x)∈Ξn, and {mλ(x)∣λ∈Pn,r}
gives a basis of Ξn.
2.5.
For any integer s≥1 we define a function
qs,±(k)(x;t) (for x=xM) by
[TABLE]
where we regard k∈Z/rZ,
and put qs,±(k)(x;t)=1 for s=0.
Let u be another indeterminate. As in the proof of [S1, Lemma 2.3],
by using the Lagrange’s interpolation formula
[TABLE]
one can prove the formula
[TABLE]
It follows from (2.5.2) that qs,±(k)(x;t)∈Z[xM;t], and
symmetric with respect to the variables x(k),x(k∓1). Moreover, it satisfies the
stability property.
Let Ξ[t]=Z[t]⊗ZΞ be the ring of symmetric functions in Ξ
with coefficients in Z[t]. Put Ξn[t]=Z[t]⊗ZΞn.
More generally, we consider the multi-parameter case.
Let t=(t1,…,tr) be r-parameters, and consider Z[t]=Z[t1,…,tr].
Put Ξ[t]=Z[t]⊗ZΞ.
We have Ξ[t]=⨁n≥0Ξn[t], where
Ξn[t]=Z[t]⊗ZΞn.
For λ∈Pn,r, we define polynomials
qλ±(xM;t)∈Z[xM;t]=Z[xM;t1,…,tr] by
[TABLE]
where c=1 for the “+”-case, and c=0 for the “−”-case.
Then qλ±(xM;t) satisfies the stability condition, and one can define
qλ±(x;t)∈Ξn[t].
Note that if t1=⋯=tr=t, qλ±(x;t) coincides with
qλ±(x;t) defined in [S1, 2.4].
Put ΞQn(t)=Q(t)⊗ZΞn, and
ΞQn(t)=Q(t)⊗ZΞn.
It is known by [S1, (4.7.2)] that {qλ±(x;t)∣λ∈Pn,r}
gives a Q(t)-basis of ΞQn(t).
The analogous fact holds also in the multi-parameter case.
Lemma 2.6**.**
{qλ±(x;t)∣λ∈Pn,r}* gives a Q(t)-basis
of ΞQn(t).*
Proof.
Since {sμ(x)∣μ∈Pn,r} is a Z[t]-basis of
Ξn[t] and qλ±(t)∈Ξn[t],
qλ±(x;t) can be written as a linear combination of
sμ(x). Let A(t)=(aλ,μ(t)) be the corresponding matrix
with aλ,μ(t)∈Z[t].
Let A(t) be the matrix obtained from A(t) by putting t1=⋯=tr=t.
Then A(t) is a non-singular matrix by the above remark.
Hence A(t) is also non-singular, and
qλ±(x;t) gives a basis of ΞQn(t).
∎
2.7.
We consider two types
of (infinitely many) variables x=(x(1),…,x(r)) and
y=(y(1),…,y(r)), and put
[TABLE]
The following formula is a multi-parameter version of [S1, (2.5.1)].
The proof is done by an entirely similar way, and we omit it.
Proposition 2.8**.**
Under the notation above, we have
[TABLE]
Remark 2.9.
In the one-parameter case, another expression of Ω(x,y;t) involving power sum symmetric
functions pλ(x) was proved in [S1, (2.5.2)]. However, we don’t have a generalization
of (2.5.2) in [S1] in the multi-parameter case.
2.10.
We define a non-degenerate bilinear form
⟨,⟩:ΞQn(t)×ΞQn(t)→Q(t) by
[TABLE]
for λ,μ∈Pn,r.
By using a similar argument as in [M, I,4], (2.8.1) implies that
[TABLE]
Let A be the Q-subalgebra of Q(t) consisting of rational functions
f/g such that g(0)=0, where 0=(0,…,0).
Put A⊗ZΞn=ΞAn.
Then ΞAn∣t=0=ΞQn.
By a similar argument as in [M, I,4], one can show
[TABLE]
Hence if we define the symmetric bilinear form ⟨,⟩0 on ΞQn by
⟨sλ,sμ⟩0=δλ,μ for λ,μ∈Pn,r,
the restriction of ⟨,⟩ on ΞAn gives rise to the form
⟨,⟩0 on ΞQn by taking t↦0.
2.11.
For λ=(λ(1),…,λ(r))∈Pn,r with
λ(k)=(λ1(k),…,λm(k)), we define
c(λ)∈Z≥0rm by
[TABLE]
We define a partial order on Pn,r by the condition, for λ,μ∈Pn,r,
λ≤μ if c(λ)≤c(μ) with respect to the dominance order on Zrm.
The partial order λ≤μ is called the dominance order on Pn,r.
In the remainder of this section, we fix a total order λ⪯μ on Pn,r
which is compatible with the dominance order λ≤μ.
By making use of the bilinear form ⟨,⟩, we shall construct
Hall-Littlewood functions with multi-parameter Pλ±(x;t).
The following result is an analogue of [S1, Proposition 4.8].
Proposition 2.12**.**
For each λ∈Pn,r, there exists a unique function
Pλ±(x;t)∈ΞAn
satisfying the following properties.
(i)
Pλ±(x;t)* can be expressed as*
[TABLE]
where uλ,μ±(t)∈A.
2. (ii)
⟨Pλ+,Pμ−⟩=0* if λ=μ.*
3. (iii)
Pλ±(x;0)=sλ(x).
Proof.
We prove the proposition following the discussion in [S1, Remark 4.9].
We construct Pλ±(x;t) satisfying the properties (i), (ii), (iii)
by induction on the total order ⪯ on Pn,r.
Let λ0=(−;…;−;(1n)). λ0 is the minimum element in Pn,r
with respect to
≤, and so the minimum element with respect to ⪯.
By (i), Pλ0±(x;t) must coincide with sλ0(x), which clearly
satisfies (iii).
Take λ∈Pn,r, and assume,
for any λ′,λ′′≺λ, that Pλ′+,Pλ′′−
satisfying (i), (iii) and
(ii)′ : ⟨Pλ′+,Pλ′′−⟩=0
for λ′′=λ′, was constructed.
Note that the condition (i) for Pλ± is equivalent to the condition
[TABLE]
with dλ,λ′±∈A.
By taking the inner product with Pμ− (μ≺λ) in (2.12.1),
we have a relation
[TABLE]
By (iii) and by 2.10,
⟨Pμ+,Pμ−⟩∣t=0=⟨sμ,sμ⟩0=1.
In particular, ⟨Pμ+,Pμ−⟩=0. Hence
if we define Pλ+ as in (2.12.1) with
dλ,λ′+=−⟨sλ,Pλ′−⟩⟨Pλ′+,Pλ′−⟩−1∈A,
we have ⟨Pλ+,Pμ−⟩=0 for any μ≺λ.
Since ⟨sλ,Pλ′−⟩∣t=0=⟨sλ,sλ′⟩0=0,
we have dλ,λ′+(0)=0.
It follows that Pλ+(x;0)=sλ(x).
A similar argument shows, if we define Pλ− as in (2.12.1) with
dλ,λ′−=−⟨Pλ′+,sλ⟩⟨Pλ′+,Pλ′−⟩−1∈A,
that Pλ− satisfies the required condition. Thus one can construct
Pλ± satisfying (i), (ii), (iii).
The uniqueness is clear from the construction.
∎
2.13.
The discussion in the proof of Proposition 2.12 shows that
bλ(t)=⟨Pλ+,Pλ−⟩−1∈Q(t)−{0}.
We define Qλ±(x;t)∈ΞAn by
[TABLE]
Then we have
[TABLE]
The sets {Pλ±∣λ∈Pn,r},
{Qλ±∣λ∈Pn,r} give Q(t)-bases of ΞQn(t).
Pλ±,Qλ± are called Hall-Littlewood functions with
multi-parameter.
Note that the formula (2.13.2) can be interpreted by using Ω(x,y;t) as follows;
[TABLE]
The following result gives a characterization of Pλ± and Qλ±.
Theorem 2.14**.**
Let ε∈{+,−}. For each λ∈Pn,r, there exists a unique function
Pλε(x;t) satisfying the following properties.
(i)
Pλε(x;t)* can be expressed as*
[TABLE]
where cλ,μ(t)∈Q(t) with cλ,λ(t)=0.
2. (ii)
Pλε(x;t)* can be expressed as*
[TABLE]
where uλ,μ(t)∈Q(t) with uλ,λ(t)=1.
A similar property holds also for Qλε(x;t) by replacing the condition
for cλ,μ(t),uλ,μ(t)
by cλ,λ(t)=1 and uλ,λ(t)=0.
Proof.
For bases u={uλ},v={vλ} of ΞQn(t), we denote by
M=M(u,v) the transition matrix (mλ,μ) of two bases, where
uλ=∑μ∈Pn,rmλ,μvμ.
Consider the bases P±={Pλ±},q±={qλ±},s={sλ},m={mλ} of ΞQn(t), and put
[TABLE]
We want to show that A± is upper triangular.
By Proposition 2.12, M(P±,s) is lower unitriangular. On the other hand,
since the total order ⪯ is compatible with the dominance order ≤ on Pn,r,
M(s,m) is lower unitriangular (the verification is reduced to the case where r=1, in which
case, it is well-known).
Thus B±−1=M(P±,s)M(s,m) is lower unitriangular, and B± is
also lower unitriangular.
Put D±=tB∓A±.
If we put A+=(Aλ,μ+),B−=(Bλ,μ−), we have,
by (2.8.1) and (2.13.3),
[TABLE]
Since Pμ+(x;t)Pμ′−(y;t) are linearly independent, this implies that
D+=tB−A+ is a diagonal matrix with λλ-entry bλ(t).
Hence A+ is upper triangular with Aλλ+=bλ(t).
A similar argument, by using the formula for ∑mν(x)qν−(y;t) in (2.8.1),
shows that A− is upper triangular with Aλλ−=bλ(t).
Thus Pλ±(x;t) satisfies the conditions (i) and (ii).
Next we show the uniqueness of Pλ±.
Take ε∈{+,−}, and assume that R satisfies the condition (i) and (ii)
for ε. By (i) and (ii) for Pλε, one can write as
[TABLE]
It follows that
[TABLE]
Hence R=Pλε, and the uniqueness follows.
This proves the theorem for Pλε(x;t).
The above discussion shows that cλ,λ(t) (for Pλε)
coincides with bλ(t)−1. Thus by multiplying bλ(t) on both sides of
(i) and (ii), we obtain the corresponding formulas for Qλε(x;t).
The theorem is proved.
∎
2.15.
Since {Pλε(x;t)∣λ∈Pn,r} and
{sλ(x)∣λ∈Pn,r} are bases of
ΞQn(t), there exist unique functions
Kλ,μ±(t)∈Q(t) satisfying the properties
[TABLE]
Kλ,μ±(t)∈Q(t)=Q(t1,…,tr) are called
multi-variable Kostka functions.
By definition, Kλ,μ±=0 unless λ⪰μ.
Put t1=(t,…,t), and let A1 be the Q-subalgebra of Q(t)
consisting of rational functions f/g such that g(t1)=0.
Put ΞA1n=A1⊗ZΞn. We have
ΞA1n∣t=t1=ΞQn(t).
We have
[TABLE]
Thus if we define a bilinear form ⟨,⟩1 on ΞQn(t) by
[TABLE]
[S1, Proposition 2.5] implies that the restriction of ⟨,⟩ on ΞA1n
induces the form ⟨,⟩1 on ΞQn(t) by putting t=t1.
By comparing [S1, Proposition 4.8] with Proposition 2.12, we see that
[TABLE]
where Pλ±(x;t),Qλ±(x;t) are Hall-Littlewood functions
defined in [S1, Theorem 4.4].
In particular, we have
[TABLE]
where Kλ,μ±(t) is the Kostka function (with one variable) defined
in [S1, 5.2].
Remark 2.16.
In the one-variable case, a simple algorithm of computing Kostka functions
Kλ,μ±(t) was given in [S1, Theorem 5.4] in connection with the representation
theory of the complex reflection group Sn⋉(Z/rZ)n. This formula is based
on the formula (2.5.2) in [S1].
Since we don’t have an analogous formula for the multi-parameter case, we don’t know
whether or not those Kostka functions Kλ,μ±(t) have a relationship with
complex reflection groups as above.
3. Comparison of Hall-Littlewood functions for different r
3.1.
Let Pn,ra be the set of λ=(λ(1),…,λ(r))∈Pn,r
such that λ(k)=∅ for k=1,…,a.
We identify Pn,ra with Pn,r−a by
λ↔λ′=(λ(a+1),…,λ(r)).
We consider the variables x′=(x(a+1),…,x(r)) and
t′=(ta+1′,…,tr′). Assume that λ∈Pn,ra.
One can consider Hall-Littlewood
functions Pλ′±(x′;t′) and Qλ′±(x′;t′)
associated to those data. In this section, we discuss the relationship
between Pλ±(x;t) and
Pλ′±(x′;t′), and also between Qλ±(x;t) and
Qλ′±(x′;t′).
First consider the case where a=1, and put x′=(x(2),…,x(r)).
We denote by q′s,±(k)(x′;t) the function of x′ corresponding to the
function qs,±(k)(x;t) of x (note that k∈Z/(r−1)Z for
q′s,±(k)).
We have a lemma.
Lemma 3.2**.**
(i)
q′s,+(k)(x′;tk−1)=qs,+(k)(x;tk−1)* for k=3,…,r, and*
[TABLE]
2. (ii)
q′s,−(k)(x′;tk)=qs,−(k)(x;tk)* for k=2,…,r−1, and*
[TABLE]
Proof.
We prove (i). The first statement is clear from the definition. Recall,
by (2.5.2), that
[TABLE]
Since
[TABLE]
we have
[TABLE]
Thus (i) holds. The proof for (ii) is similar.
∎
3.3.
By the map λ′=(λ(2),…,λ(r))↦λ=(−,λ(2),…,λ(r)),
we can identify
Pn,r−1 with the subset Pn,r1 of Pn,r.
Since the dominance order on Pn,r−1 is compatible with the dominance order of
Pn,r, one can choose a total order on Pn,r compatible with the total
order on Pn,r−1, namely, which satisfies the property
if λ∈Pn,r1 and μ⪯λ, then μ∈Pn,r1.
More generally, by considering the sequence
Pn,1⊂Pn,2⊂⋯⊂Pn,r,
we can choose a total order on Pn,r
so that it is compatible with the total order on each subset Pn,k.
Assume that λ∈Pn,r1. Then μ∈Pn,r1 for any μ⪯λ,
and sμ(x)=sμ′(x′) is a function with respect
to the variable x′=(x(2),…,x(r)).
Since Qλ± is a linear combination of sμ with μ∈Pn,r1,
Qλ± is a function with respect to the variable x′. We show the following.
Proposition 3.4**.**
Assume that λ∈Pn,r1. Let Q′λ′± be the
function defined with respect to x′=(x(2),…,x(r)), and
λ′∈Pn,r−1, the element corresponding to λ. Then
[TABLE]
Proof.
Since Q′λ′± is written as a linear combination of sμ′(x′)
with μ′⪯λ′, by our choice of the total order ⪯ on Pn,r,
it is written as a linear combination of sμ(x) with μ⪯λ.
Thus it is enough to show that Q′λ′± can be written as
a linear combination of qμ± with μ⪰λ such that the coefficient of
qλ± is equal to 1. We can write
[TABLE]
where t′=(t2,…,tr−1,t1tr).
Here for μ′=(μ(2),…,μ(r)),
[TABLE]
q′μi(2),+(2)(x′;t1tr) can be written as a linear combination of
qs′,+(2)(x;t1)qs′′,+(1)(x;tr) by (3.2.1), where s′,s′′≥0 are such that
μi(2)=s′+s′′. Hence q′μ′+ can be written as a linear combination of
various qν+, where ν=(ν(1),…,ν(r)) are r-compositions such that
νi(1)+νi(2)=μi(2) for each i and that ν(k)=μ(k) for
k≥3. Then clearly ν≥μ for μ=(−,μ(2),…,μ(r)).
If we denote by ν the r-partition obtained
from ν by rearranging the order, then we have ν≥ν.
This is true also for q′λ′+.
It follows that Q′λ′+ is a linear combination of various qμ+ for
μ∈Pn,r such that μ⪰λ. The term qλ+ comes only from
q′λ′+, and it is easily checked that the coefficient of qλ+ is equal to 1.
This proves the proposition in the “+”case. The proof for the “−”case is
done similarly by using (3.2.2).
∎
As a corollary, we have the following result, which describes the relationship
of Hall-Littlewood functions and Kostka functions for different r.
Theorem 3.5**.**
(i)
Assume that λ∈Pn,ra for 1≤a<r.
Let Q′λ′±,P′λ′± be the functions
defined with respect to
x′=(x(a+1),…,x(r)), and λ′∈Pn,r−a
the element corresponding to λ.
Then
[TABLE]
2. (ii)
Let λ,μ∈Pn,r be such that μ⪯λ. Assume that
λ∈Pn,ra. Then μ∈Pn,ra,
and we have
[TABLE]
where K′λ′,μ′± is the Kostka function associated to
λ′,μ′∈Pn,r−a.
3. (iii)
Assume that a=r−1. For λ=(−,…,−,λ(r))∈Pn,rr−1,
by setting t1=⋯=tr=t, we have
[TABLE]
*where the left hand side is the one variable Hall-Littlewood functions associated to
the r-partition λ *(see (2.15.2)),
and the right hand side is the classical Hall-Littlewood functions
associated to the partition λ(r).
4. (iv)
Under the same assumption as in (iii), take μ∈Pn,r
such that μ⪯λ. Then μ=(−,…,−,μ(r))∈Pn,rr−1,
and we have
[TABLE]
*where the left hand side is the one-variable Kostka function
associated to r-partitions *(see (2.15.3)), and the right hand side is
the classical Kostka polynomial associated to partitions.
Proof.
The first formula of (i) follows from Proposition 3.4.
In this formula, Qλ±(x;t) has an expansion in terms of Schur
functions
[TABLE]
On the other hand, if μ⪯λ and λ∈Pn,ra,
then μ∈Pn,ra, and sμ(x)=sμ′(x′).
Thus (3.5.1) also gives an expansion of Q′λ′±(x′;t′) in terms of
Schur functions for μ′∈Pn,r−a,
[TABLE]
with uλ,λ(t)=uλ′,λ′′(t′), where
t′=(ta+1,ta+2,…,tr−1,tata−1⋯t1tr).
By Theorem 2.14, we have Pλ±(x;t)=uλ,λ(t)−1Qλ±(x;t),
P′λ′±(x′;t′)=u′λ′,λ′(t′)−1Q′λ′±(x′;t′).
Thus we obtain the second formula of (i).
Now (ii) is immediate from the second formula of (i).
(iii) and (iv) are the special case of (i) and (ii).
∎
Remark 3.6.
In the case where r=2, the formula (iv) was first
proved by Achar-Henderson in [AH, Corollary 5.3] by a geometric method.
After that a combinatorial proof of (iv) and the related formula (iii)
for Hall-Littlewood functions (for r=2) were given
in [LS, Proposition 1.11 and Corollary 1.12].
This argument also works for the general r.
In those discussions, the proof proceeds under the one-variable setting,
namely under the setting where t1=t2=⋯=tr=t.
However, in order to describe the relationship among Kostka functions and
Hall-Littlewood functions as in the setting of (i) and (ii), one needs to introduce
multi-variable Kostka functions and Hall-Littlewood functions.
Note that the proof of (iii) and (iv) here is much simpler than
the discussion in [LS].
4. Closed formula for Hall-Littlewood functions
4.1.
In this section, we define a function Rλ±(x;t), as
an analogue of the function Rλ(x;t) in [M, III, 1], and show
in this and next section that Qλ±(x;t) has an explicit
description in terms of Rλ±(x;t) under a mild restriction.
Let M be as in (2.4.1).
We define a total order on M by
[TABLE]
We fix λ=(λ(1),…,λ(r))∈Pn,r with
λ(k)=(λ1(k),…,λm(k)) for a common m≥1.
Write λi(k)=λν and xi(k)=xν if ν=(k,i)∈M.
Let ν0=(k0,i0)∈M be the largest element such that
λν0=0. We put b(ν)=k if ν=(k,i).
We define a function Iν±(x;t) for ν=(k,i)∈M by
[TABLE]
where c is as in (2.5.3).
We regard k∈Z/rZ.
Let Smr=Sm×⋯×Sm (r-factors)
be the permutation group of the variables
x=(x(1),…,x(r)).
We define a function Rλ±(x;t) by
[TABLE]
where ε±(k)=(ε1,±(k)…,εm,±(k))∈Zm
is given by
[TABLE]
It follows from the definition that Rλ±(x;t)∈Z[xM;t] and that
[TABLE]
For λ∈Pn,r, define a subgroup Sλ′ of Smr by
Sλ′=Sλ1′×⋯×Sλr′,
where λk′=♯{1≤i≤m∣(k,i)>ν0}.
We regard Sλk′ as the permutation group of the set
{xi(k)∣(k,i)>ν0} fixing any variable xi(k) for (k,i)≤ν0.
We define a polynomial vλ′(t)∈Z[t] by
[TABLE]
where vi(t) is given as in (2.2.1).
4.2.
We consider the special case where λ=((s);−;⋯;−) with s≥1.
Then Sλ′=Sm−1×Smr−1, where
Sm−1 is the stabilizer of x1(1).
Hence vλ′(t)=vm−1(t1)∏k≥2vm(tk).
We have
[TABLE]
Sλ′ stabilizes the factor
[TABLE]
and by [M, p.207, (1.4)]
[TABLE]
It follows that
[TABLE]
Hence we have
(4.2.1) Assume that λ=((s);−;⋯;−). Then
Rλ±(x;t)=vλ′(t)qλ±(x;t).
The above computation can be generalized as follows.
For λ∈Pn,r,
Sλ′ stabilizes the expression
[TABLE]
Moreover, by [M, p.207, (1.4)],
[TABLE]
Thus we have an expression for Rλ±(x;t),
[TABLE]
where (*) is given by the first and the second condition in (4.1.1).
It follows from (4.2.2) that
(4.2.3) Rλ±(x;t)∈Z[xM;t] is divisible by vλ′(t).
vλ′(t)−1Rλ±(x;t)∈Z[xM;t]
has the stability for the increase of variables
{x1(k),…,xm(k)} to {x1(k),…,xm+1(k)}. In particular,
by taking m↦∞, we obtain vλ′(t)−1Rλ±∈Ξn[t].
We define a polynomial Pλ±(x;t)∈Z[xM;t] by
[TABLE]
(4.2.4) is an analogue of [M, III, (2.1)] in the classical case. But note
that vλ′(t) is different from vλ(t) there.
Let p be the largest number such that λp(k)=0 for
k=1,…,r−1, and put
j0=max{ℓ(λ(r))−p,0}.
We define a polynomial Qλ±(x;t)∈Z[xM;t] by
[TABLE]
where we put t0=t1⋯tr.
By taking m→∞, Pλ±(x;t),Qλ±(x;t)
determine symmetric functions Pλ±,Qλ±∈Ξn[t].
Next result describes the expansion of Rλ±(x;t)
in terms of Schur functions. Note that in this formula, the total
order ⪯ is replaced by the partial order ≤.
Proposition 4.3**.**
For a given λ∈Pn,r, fix a set M, and
consider Rλ±(x;t)∈Z[xM;t].
Then there exist polynomials uλ,μ±(t)∈Z[t] such that
[TABLE]
Moreover, uλμ±(0)=0 if μ=λ, and
uλλ±(0)=1.
Proof.
The product ∏ν∈MIν±(x;t) can be written as a sum of monomials
[TABLE]
where
[TABLE]
(See 4.1 for the definition of b(ν).)
Moreover, (rν,ν′) is an integral matrix indexed by M consisting of 0 and 1 satisfying
the condition
[TABLE]
and the matrices (rν,ν′) satisfying the above condition are in 1-1 correspondence
with the above monomials.
For a given matrix (rν,ν′) as above, we put
[TABLE]
for ν=(k,i). Let β=(β(1),…,β(r)) be the r-composition.
Then β produces the “Schur function” aβ/aδ, where
aβ=∑w∈Smrε(w)w(xβ), and δ=(δ(1),…,δ(r))
with δ(k)=(m−1,…,1,0). By (4.1.2), Rλ±
is a sum of ∏ν′(−tν′)rν′,νaβ/aδ
obtained from the matrix (rν,ν′).
If the entries of the composition β(k) are
not all distinct for some k, then aβ/aδ=0.
So we may assume that all the entries of β(k) are distinct for any k.
By rearranging its entries in the decreasing order, one can write it as
[TABLE]
for some wk∈Sm. Then μ=(μi(k))∈Pn,r, and
aβ/aδ coincides with ε(w)sμ(x) for
w=(w1,…,wr)∈Smr.
We shall show that
[TABLE]
Define the matrix (sν,ν′) by sν,ν′=rw(ν),w(ν′),
where w(ν)=(k,wk(i)) for ν=(k,i)∈M.
One can write as
[TABLE]
where ν=(k,i).
We want to show that
[TABLE]
for 0≤a≤m−1 and 1≤s≤r.
Note that (4.3.5) implies (4.3.3) since w(λ)≤λ for any w∈Smr.
By (4.3.4), we have
[TABLE]
where
[TABLE]
Hence in order to show (4.3.5), it is enough to see that
[TABLE]
Let
w(B)={(k,wk(i))∣(k,i)∈B}.
Put w+′=(w2,w3,…,wr,w1) and
w−′=(wr,w1,…,wr−1). Define B±′⊂M by
w(B±′)=w±′(B). We have
[TABLE]
For k=1,…,r, let Xk±=Xk′∪Xk′′ with
[TABLE]
and put
[TABLE]
By (4.3.2) we have ∑k=1r(Ak±+Bk±)=∑ν∈B,ν′∈Msν,ν′.
By our choice of B and B±′, the k-th row of w(B) consists of
{(k,wk(i))∣(k,i)∈B}, and (k∓1)-row of w(B±′) consists of
{(k∓1,wk(i))∣(k,i)∈B}.
Assume that k>s.
It is easy to see that
[TABLE]
Hence
[TABLE]
A similar formula as (4.3.8) holds for the case where k≤s by replacing
a by a+1.
By summing up those formulas, we have
[TABLE]
Thus (4.3.6) holds, and so (4.3.3) follows.
This proves the first assertion of the proposition. The second assertion
follows from (4.1.3).
∎
4.4.
We shall determine the polynomial uλ,λ±(t).
In the proof of Proposition 4.3,
the equality μ=λ holds if and only if
w(λ)=λ and the equality holds for each k in the formulas (4.3.7),
namely, sν,ν′=1 for any sν,ν′ appearing in the expression of
Ak±,Bk±. It follows that
[TABLE]
Let Sλ′ be the subgroup of Smr as given in 4.1.
In order to obtain the equality for Bk± in (4.3.7) for any a,
we must have w∈Sλ′.
In that case, sw−1(ν′),w−1(ν)=1 only when the pair (ν,ν′)
satisfies the condition that
[TABLE]
Since tν′=tb(ν) in this case, we have
[TABLE]
where ℓ(wk) is the length function of Sλk′.
By taking Proposition 4.3 and
(4.4.1) into account, we have an expression
[TABLE]
with wλ,μ±(t)∈Z[t].
5. Closed formula for Hall-Littlewood functions – continued
5.1.
In this section, we discuss the expansion of Qλ± in terms of
qμ±.
For given 1≤a≤r and m≥1, we define a subset M(a) of M by
removing (1,1),…,(a−1,1) from M.
Note that if a=1, M(1) coincides with the original M.
The total order on M(a) is
inherited from M.
We consider an r-partition λ=(λ(1),…,λ(r)),
where λ(k)=(λ2(k),λ3(k),…,λm(k)) for k<a
and λ(k)=(λ1(k),…,λm(k)) for k≥a. Thus we have
a bijective correspondence λi(k)↔(k,i)∈M(a).
In this case, we say that λ is compatible with M(a).
For such λ, one can construct a polynomial
Rλ±(x;t) by extending the previous definition,
where x={xi(k)∣(k,i)∈M(a)}.
(Here we consider Sm=Sm−1a−1×Smr−a+1 as
the permutation group of the variables
{xν∣ν∈M(a)} for m=(m−1,…,m−1,m,…,m).)
In the following discussion, by fixing a, we write M(a) as M.
We discuss separately the “+”case and the “−”case. First consider the
“−”case. Then Qλ− is defined by using the formula (4.2.5).
Let b≤r be the smallest integer such that
b≥a and that λ(b)=∅,
hence λ1(b)=0. If such b does not exist, i.e., λ(a′)=∅
for any r≥a′≥a, we put b=r.
Let μ=(μ(1),…,μ(r)) be the r-partition compatible with
M(b+1)
obtained from λ by removing {λ1(a′)∣a≤a′≤b}. Thus we have
μ(k)=(λ2(k),λ3(k),…,λm(k)) for 1≤k≤b,
and μ(k)=λ(k) otherwise.
Put M′=M(b+1), and consider the polynomial Qμ−(x′;t) for
x′=(xν)ν∈M′.
(Note that if b=r, M′ coincides with M(1), but by replacing m by m−1.)
m′ is defined for M′ similarly to m and we have
Sm′=Sm−1b×Smr−b. Hence
Sm/Sm′≃[1,m]b−a+1, and we express the elements in
Sm/Sm′ as i=(ia,ia+1,…,ib)∈[1,m]b−a+1.
For
i∈Sm/Sm′,
we denote by
Qμ[i],− the polynomial obtained from Qμ−
by replacing the variables
x2(k),…,xm(k) by
x1(k),…,xik(k),…,xm(k) (xik(k) is removed)
for a≤k≤b,
and leaving variables in other rows unchanged.
We have the following lemma.
Lemma 5.2**.**
Under the notation above, we have
[TABLE]
where gi,−(a) for i=(ia,…,ib)∈[1,m]b−a+1
is given by
[TABLE]
if b<r,
[TABLE]
if b=r and a>1,
[TABLE]
if b=r and a=1.
Proof.
Here Sm′ is the stabilizer of the variables x1(k) for a≤k≤b
in Sm. Note that Sλ′=Sμ′⊂Sm′. First assume that b<r.
Let i0=(1,…,1)∈[1,m]b−a+1.
Since (x1(b))λ1(b)−ε1,−(b)gi0,−(a) is stable by Sm′
we have
[TABLE]
(Here j0 used in the definition of Qλ−
coincides with j0 used for Qμ−.)
Hence
[TABLE]
The lemma follows from this.
Next assume that b=r.
Since ∏j≥2(x1(r)−trxj(1)) is stable by the action of
Sm−1×Sm−1,
(x1(r))λ1(r)−ε1,−(r)gi0,−(a) is again stable by
Sm′.
Then a similar argument works.
Note that in the case of (5.2.2), j0 is common for Qλ− and for
Qμ−, but in the case of (5.2.3),
the discrepancy for j0 between Qλ−
and Qμ− occurs.
The lemma is proved.
∎
Remark 5.3.
A similar formula was proved in Lemma 3.3 in [S1].
But in our definition of Rλ±(x;t), we can not
take b=a if λ1(a)=0 for a<r since the product
∏j≥2(x1(a)−taxj(a+1)) is not stable
by the action of Sm−1×Sm.
5.4.
We consider the “+”case. Let M=M(a) be as in 5.1.
In this case, we assume that λ2(1)=0.
Then Qλ+ is defined as in (4.2.5).
Put M′=M(a+1), and consider m′ with respect to M′.
We have Sm′=Sm−1a×Smr−a, and Sm/Sm′≃[1,m].
Put, for i=1,…,m,
[TABLE]
Here the condition (a−1,j)∈M is given by j≥2 if a>1 and
j≥1 if a=1. Then the product ∏j≥2(x1(a)−ta−1xj(a−1))
(resp. ∏j≥1(x1(1)−trxj(r))) for a>1 (resp. a=1)
is stable by the action of Sm′. (Note that the condition j≥1 in the a=1 case
comes from the assumption that λ(1)=∅. If λ(1)=∅,
we need the condition j≥2, in which case, the product is not stable by
Sm′.)
Now μ is defined as in 5.1, and Qμ[i],+ can be defined for
i=1,…,m (apply 5.1 to the case where b=a).
The following formula can be proved in a similar way as in Lemma 5.2
(Note, by the condition λ2(1)=0, that j0 is common for λ and μ.)
Lemma 5.5**.**
Assume that λ2(1)=0.
Then we have
[TABLE]
The following lemmas will be used in later discussions.
Lemma 5.6**.**
Assume that a<b. Consider
the variables x(k) for a≤k≤b, and denote the
action of Sm on the variable x(k) by Sm(k).
Then we have
[TABLE]
Proof.
If we write Sm(a)×⋯×Sm(b−1) as Smb−a,
the left hand side of (5.6.1) is equal to
[TABLE]
But the sum in the numerator is an alternating polynomial with respect to the
variables x(k) for a≤k<b,
and so is divisible by ∏a≤k<b∏i<j(xi(k)−xj(k)).
Hence by comparing the degrees as polynomials with respect to the variables
x1(k) for a fixed k,
the last formula is equal to
[TABLE]
where the numerator coincides with
[TABLE]
If we put xi(k)=yi,Sm(k)=Sm, we have
[TABLE]
The lemma is proved.
∎
Lemma 5.7**.**
Consider three types of variables xi,yi,zi for
i=1,…,m.
Then the following identity holds.
[TABLE]
where Sm acts on the variables x1,…,xm as permutations.
Proof.
We define an operator Ax on the variables x1,…,xm by
[TABLE]
Then the left hand side of (5.7.1) can be written as
[TABLE]
We can write
[TABLE]
where yI=yi1⋯yik for I={i1,…,ik}, and similarly
for xJ.
Put F=∏j≥2(x1−t1yj)∏j≥2(z1−t3xj). Then
[TABLE]
We compute, for a fixed k,ℓ,
[TABLE]
where Sm−1 is the stabilizer of x1 in Sm.
We apply the operator Ax
for each monomial X=xJx1m−1−kxσ(2)m−2⋯xσ(m−1)
determined by the choice of J and σ.
If k>ℓ, then Ax(X)=0 by the degree reason.
So assume that k≤ℓ.
We write
[TABLE]
Note that if a1,…,am are not all distinct in the monomial
X=x1a1⋯xmam, then again Ax(X)=0.
It follows that, if Ax(X)=0, then X must have the form
[TABLE]
namely, ℓ=k and J={σ(2),…,σ(k+1)}.
Write X as xτ(1)m−1xτ(2)m−2⋯xτ(m−1)
for τ∈Sm. Then we have
[TABLE]
For a fixed J, the number of such σ is equal to k!×(m−1−k)!.
The number of the choices of J is (km−1). Hence
[TABLE]
It follows that
[TABLE]
This proves (5.7.1). The lemma is proved.
∎
5.8.
Recall the definition of qs,±(k)(x;t) in (2.5.1).
In the “−”case with k=r, we define a function qs,−(r)(x;t) by
[TABLE]
for s≥0. If s≥1, we have
qs,−(r)(x;t)∣x1(1)=0=qs,−(r)(x;t).
We note that qs,−(r)=1 if s=0. In fact,
[TABLE]
The last equality follows from Lemma 5.6 by applying it to the case
where b−a=1.
Thus qs,−(r)(x;t)∣x1(1)=0=qs,−(r)(x;t), and
qs,−(r)∈Z[x;t] for s≥0.
By using the generating function of qs,−(r)(x;tr) in (2.5.2), we have
[TABLE]
In the “+”case with k>1, we define qs,+(k)(x;t) by
[TABLE]
for s≥0.
As in the “−”case, we see that
qs,+(k)(x;t)∣x1(k−1)=0=qs,+(k)(x;t), and that
the generating function of qs,+(k) is given by
[TABLE]
In the “−”case, we need the following.
Proposition 5.9**.**
Assume that a≤b≤r, and put d=b−a+1. Set
[TABLE]
where ε=1 if b<r and ε=0 if b=r.
Furthermore assume that s≥1 if b<r.
Then we have
[TABLE]
where t0=t1⋯tr, and qs(x(r);t0) is
the original q-function given in (2.3.4) with respect to the variables x(r).
Proof.
First assume that b<r.
We denote by Sm(k) the action of Sm on the variables x(k).
[TABLE]
where
[TABLE]
By Lemma 5.6, we have A=∣Sm−1∣b−a.
Since
[TABLE]
we obtain the required formula.
A similar argument works also for the case where b=r and a>1.
In that case, the formula
in the last step is given by
[TABLE]
Thus the assertion holds.
Finally consider the case where b=r and a=1.
In this case, we have
[TABLE]
By applying Lemma 5.7 for xi=xi(1),yi=xi(2),zi=xi(r),
the right hand side turns out to be
[TABLE]
Thus by repeating this procedure, we see that
[TABLE]
Hence the assertion holds. The proposition is proved.
∎
Remark 5.10.
Let λ=(λ1,…,λm) be a partition, and
Qλ(y;t) the original Hall-Littlewood function.
In this case it is known by [M, III, 2.14] that
[TABLE]
with
[TABLE]
where μ=(μ2,…,μm) and Qμ[i] is defined similarly
to 5.1.
Now assume that λ=(−,…,−,λ(r))∈Pn,r.
We compare the formula (5.10.1) with Lemma 5.2. Then by using
a similar argument as in the proof of the third formula in Proposition 5.9,
one can show, by induction on m, that Qλ−(x;t) coincides with
Qλ(r)(x(r);t0) for t0=t1⋯tr.
By Theorem 3.5 we know that Qλ−(x;t)=Qλ(r)(x(r);t0).
It follows, for a special case λ=(−,…,−,λ(r)),
that we obtain
[TABLE]
5.11.
Based on the discussion in 5.8, we define functions
Ψ−(k,i)(u),Ψ+(k)(u) associated to M as follows.
Set Δ=Δ(λ)={(k,i)∈M∣λi(k)=0}. Let
Δ0 be the subset of Δ consisting of (r,i) such that
λi(k)=0 for 1≤k<r, and set Δ1=Δ−Δ0.
In the “−” case, for (k,i)∈Δ1, set
[TABLE]
Also set, for (r,i)∈Δ0 and t0=t1⋯tr,
[TABLE]
In the “+”case, for 1≤k≤r, set
[TABLE]
Then we have
[TABLE]
[TABLE]
We introduce infinitely many variables u1(k),u2(k),…
for 1≤k≤r.
We consider the set M=M(a) by letting m↦∞,
and give the total order on M inherited from M.
We define functions Φ±(u)
with multi-variables u={ui(k)∣(k,i)∈M} by
[TABLE]
[TABLE]
Recall that ν0=(k0,i0) (see 4.1).
We consider the following condition on λ∈Pn,r;
(A) : λi0(1)=0.
We shall prove the following result.
Proposition 5.12**.**
*In the “+”case, assume that λ satisfies the condition *(A).
In the “−”case, give no assumption.
Then Qλ±(x;t) coincides with the coefficient of
uλ=∏k,i(ui(k))λi(k) in the function Φ±(u).
Proof.
First we consider the “−”case.
We assume that either a>1 or a=1 and λ is not of the form
(−,…,−,λ(r)).
Let b≤r be the smallest integer b≥a such that λ(b)=∅.
We follow the notation in 5.1. First assume that such b exists.
Hence (b,1)∈Δ1.
Let i0=(1,…,1)∈[1,m]d be as before, and put
u′=u−{u1(k)∣a≤k≤b}.
The function Φ−[i0](u′) is defined similarly to Φ−(u),
by replacing u and xM by u′ and xM′.
For each
i=(ia,…,ib)∈[1,m]d with d=b−a+1,
we denote by Φ−[i](u) the function obtained
from Φ−[i0](u′) by replacing the variables
x2(k),…,xm(k) by x1(k),…,xik(k),…xm(k)
(xik(k) is removed) for a≤k≤b.
Then by (5.11.6), we have
[TABLE]
where the condition (*) is that (b−1,1)∈Δ1 and (b−1,ℓ)∈M′
(this occurs only when a=b).
Moreover, Φ−(u′) is defined as the product of factors in Φ−(u)
not containing u1(b).
Let μ be as in 5.1.
By induction hypothesis, we may assume that
Qμ−,[i0] is obtained as the coefficient of uμ in the
function Φ−[i0](u′).
Thus a similar result holds also for Qμ−,[i].
Combining it with Lemma 5.2, we see that Qλ−(x;t) is the
coefficient of uλ in
[TABLE]
where ε1,−(b)=1 (resp. ε1,−(b)=0) if b<r (resp. b=r).
Now by (5.12.1) this expression is equal to
[TABLE]
We expand the products in (5.12.2) as a power series in xib(b),
[TABLE]
where fp(u′;t) is a polynomial in u′,t.
Write the expression (5.12.2) as Φ−(u′)Z.
Now assume that b<r.
Substituting the above expansion into
Z, we have
[TABLE]
where the second identity follows from Proposition 5.9.
By using (5.11.4),
the positive degree part of Z with respect to u1(b) coincides with that of
[TABLE]
Thus Qλ− is the coefficient of uλ in
[TABLE]
as asserted.
If b=r, in the last expression of Z, qj,−(b) should be replaced by
qj,−(b) by Proposition 5.9. By using (5.11.4),
we obtain the required formula in this case.
If such b does not exist, i.e., λ(b)=∅, still
a similar formula as (5.12.1) holds, but we must replace the numerator by 1.
The remaining argument is the same as above.
Next consider the case where λ=(−,…,−,λ(r)) and a=1,
namely, (r,1)∈Δ0.
In this case, the formula (5.12.1) is replaced by
[TABLE]
Then a similar computation as above shows that the positive degree part of
Z with respect to u1(r) coincides with that of
[TABLE]
Hence the assertion holds by a similar argument as above.
Finally we consider the “+”-case.
The formula corresponding to (5.12.1) is given as
[TABLE]
where the condition (**) is that (a+1,ℓ)∈M′, namely,
ℓ≥1 if a<r and ℓ≥2 if a=r.
Then a similar argument works by using Lemma 5.5 instead of Lemma 5.2.
The proposition is proved.
∎
5.13.
Returning to the original setting, we consider M=M(1).
Let β=(β(1),…,β(r)) be an r-composition such that
∑i∣β(i)∣=n.
We write βi(k)=βν if ν=(k,i)∈M, and
identify β=(βi(k)) with an element (βν)∈ZM. For
ν=ν′∈M, we define an operator
Rν,ν′:ZM→ZM as follows; for β=(βξ)∈ZM,
Rν,ν′(β)=(βξ′) is given by
[TABLE]
and βξ′=βξ for ξ=ν,ν′.
A raising operator is defined as a product of various
Rν,ν′ for ν<ν′.
For each r-composition β=(βi(k)), one can define qβ±(x;t) by
generalizing the definition (2.5.3).
We also extend the definition of qβ± to the case where β∈ZM,
by putting qβ±=0 if some βi(k)∈Z<0. Then the action of
the raising operator R on the functions qβ± is defined by
R(qβ±)=qβ′± with β′=R(β).
As a corollary to Proposition 5.12 we have the following.
Corollary 5.14**.**
Under the same assumption as in Proposition 5.12,
for each λ∈Pn,r, Qλ± is expressed as
[TABLE]
[TABLE]
In particular, Qλ±∈Z[x;t], and is expressed as
[TABLE]
with cλ,μ(t)∈Z[t].
Proof.
First consider the “−” case.
By applying (5.11.4) for the case M=M(1), we have
∏(k,i)∈Δ1∏j≥iΨ−(k,i)(uj(k))=∑βqβ−uβ, where
β=(β(1),…,β(r)) runs over all r-compositions
such that βi(k)=0 if (k,i)∈/Δ1.
Moreover,
∏(r,i)∈Δ0∏j≥iΨ−(r,i)(uj(r))=∑βqβ(u(r))β
where β runs over all the compositions in Z≥0j0 (j0 is as in
(4.2.4)) and qβ=qβ(x(r);t0) is defined similarly to qβ−
under the notation of (5.11.4).
Then the coefficient of uλ in Φ−(u) is equal to that of uλ in
[TABLE]
where qβ−(x;t) should be replaced by
qβ(r)(x(r);t0) if β=(−,…,−,β(r)).
Thus the coefficient of uλ is equal to
[TABLE]
Hence (5.14.1) holds. The “+” case is dealt with similarly, and we obtain (5.14.2).
It follows that Qλ± is a sum of Rqλ±=qRλ±
for various raising operators R. μ′=Rλ is an r-composition if Rqλ=0,
and in that case we have μ′≥λ. Let μ be the r-partition obtained from μ′
by permuting the parts of μ′. Then μ≥μ′, and so μ≥λ.
We have Rqλ±=qμ±. Thus Qλ±
can be written as a linear combination
of qμ± with μ≥λ. The equality μ=λ holds only when R=id.
Hence (5.14.3) holds.
∎
By using the characterization of Hall-Littlewood functions in Theorem 2.14,
we have the following result.
Theorem 5.15**.**
*Assume that λ satisfies the condition *(A) in 5.11 in the “+”case.
Give no assumption in the “−”case. Then we have
[TABLE]
Proof.
The second formula follows from Proposition 4.3 and Corollary 5.14.
Then the first formula follows from (4.4.2).
∎
Remark 5.16.
In the “+”case, the inductive argument as in the proof of Proposition 5.12
does not work if (A) is not satisfied. Although the definition of
Qλ+ makes sense even in that case,
this function does not coincide with Qλ+ in general.
In next section, we discuss the excluded case, and give the closed formula
for Qλ+ without assuming (A).
6. Closed formula for Hall-Littlewood functions – “+”case
6.1.
Take λ∈Pn,r and consider M=M(1) associated to λ.
Recall that ν0=(k0,i0).
We define a sequence of integers m1≤m2≤⋯≤mr=i0
inductively by m1=ℓ(λ(1)),mk=max(mk−1,ℓ(λ(k)))
for k≥2.
We define a function I(k)(x;t) as follows;
[TABLE]
for k=2,…,r, and I(1)=J1J2⋯Jr, where
[TABLE]
if ma−1<ma, and Ja(x;t)=1 if ma−1=ma.
(By convention, put m0=0.)
Moreover for k=1,…,r, put
[TABLE]
We define a function Rλ♯(x;t) by
[TABLE]
Here ε(k)=(ε1(k),…,εm(k)),
where εi(k)=1 for mk−1<i≤mk
and εi(k)=0 otherwise.
Let vλ′(t) be as in (4.1.4). By a similar discussion as in the
proof of (4.2.2), we obtain a formula
[TABLE]
Thus Rλ♯(x;t) is a polynomial in Z[xM;t], and
is divisible by vλ′(t). Moreover, vλ′(t)−1Rλ♯
satisfies the stability property for m↦∞.
We note that Rλ♯ satisfies a similar property
as in Proposition 4.3, namely,
Proposition 6.2**.**
There exist polynomials uλ,μ(t)∈Z[t] such that
[TABLE]
Proof.
We use the same notation as in the proof of Proposition 4.3
(here we consider the “+” case), in particular, let w=(w1,…,wr)∈Smr
be as defined there.
In the “+”-case in 4.3, we modify the definition of X1′ as follows
(Xk′ for k=1 are unchanged).
X1′=∐a=1rYa, where
[TABLE]
Let Mk (resp. Bk) be the k-th row of M (resp. B).
We define a subset Br,a′ of
Mr by
wa(Ba)=wr(Br,a′).
Put
[TABLE]
We put A1+=∐a=1rA1,a+,B1+=∐a=1rB1,a+.
Then a similar argument as in the proof of Proposition 4.3 works by replacing
A1+,B1+ there by the current version. Thus the proposition follows.
∎
6.3.
Let λ∈Pn,r.
We define a polynomial fλ(t) by
[TABLE]
where Ai=(m−i0)+(m−i0+1)+⋯+(m−mi−1).
We define a function Qλ♯(x;t) by
[TABLE]
We show the following result.
Theorem 6.4**.**
Let λ∈Pn,r be an arbitrary r-partition of n.
(i)
Qλ♯(x;t)* coincides with Qλ+(x;t).*
2. (ii)
Qλ+(x;t)* can be expressed as*
[TABLE]
3. (iii)
Pλ+(x;t)=(1−t0)−j0Qλ+(x;t).
6.5.
We prove the theorem in 6.10 after some preliminaries.
Assume that λ=(−,λ(2),…,λ(r))∈Pn,r1, and
put μ=(λ(2),…,λ(r)).
We consider the function Q′μ♯(x′;t′), defined similarly to
Qλ♯(x;t), but by replacing x by
x′=(x(2),…,x(r)) and t by t′=(t2,…,tr−1,t1tr).
We have a lemma.
Lemma 6.6**.**
Assume that λ∈Pn,r1.
Under the notation as above, we have
[TABLE]
Proof.
Since m1=0, we have J1=1. Hence
[TABLE]
where I′(k)(x′;t′) is defined by replacing r by r−1 with respect to the variables
x′, and Sm′=Sm(2)×⋯×Sm(r).
We note that
[TABLE]
In fact, let S0 be the subgroup of Sm which stabilizes
1,…,i0. Since λ(1)=∅, Sλ(1)′=S0.
Let X be the left hand side of (6.6.2). We use the notation xi(1)=yi,xi(2)=zi. Sm acts only on yi variables. Then
[TABLE]
Since ∑w∈Smε(w)w∏(zi−t1yj)∏(yi−yj)
is an alternating polynomial with respect to yi,
non-zero contribution only comes from the term
[TABLE]
Since the last product can be written as
[TABLE]
we have
[TABLE]
Thus (6.6.2) holds.
By (6.6.1) and (6.6.2), we have
vλ′(t)−1Rλ♯(x;t)=t1A1vμ′(t′)−1R′μ♯(x′;t′).
Since fλ(t)=t1A1fμ(t′), we obtain the lemma.
∎
6.7.
We consider the special case where m1=⋯=mr−1=0
and mr=i0. In this case,
[TABLE]
where t0=t1⋯tr.
We write λ=(−;⋯;−;μ) with μ∈Pn.
By a similar computation as in the proof of
Lemma 6.6 (note that fλ(t)=1), we have
[TABLE]
where Rμ is the function defined in [M, III, 1].
Under the notation in [M, III, 2], we have
[TABLE]
where Pμ,Qμ are classical Hall-Littlewood functions associated
to the partition μ.
Since vμ(t0)=vμ′(t0)bμ(t0)/(1−t0)i0
(see [M, III,2], note that vλr′(t0)=vm−i0(t0)), we have
the following.
Lemma 6.8**.**
Assume that λ∈Pn,rr−1. Then
[TABLE]
Next we show the following proposition.
Proposition 6.9**.**
Assume that Theorem 6.4 holds for r−1. Then for any λ∈Pn,r1,
we have
[TABLE]
Proof.
Write λ=(−,λ(2),…,λ(r))∈Pn,r1
and λ′=(λ(2),…,λ(r))∈Pn,r−1.
By Proposition 3.4, we have Qλ+(x;t)=Q′λ′+(x′,t′) with
t′=(t2,…,tr−1,t1tr).
By applying Theorem 6.4 (ii) for Q′λ′+,
we have an expression
[TABLE]
where tb(ν)′ is defined with respect to t′, and
Rν,ν′′ is the raising operator with
respect to M′={(k,i)∣2≤k≤r,1≤i≤m}.
In particular Rν,ν′′=Rν,ν′ if b(ν)=b(ν′)
or b(ν′)=b(ν)+1 with b(ν)=r.
Assume that b(ν)=r and b(ν′)=2.
Write ν=(r,i),ν′=(2,j). In the computation below, we omit the sign “+”.
By Lemma 3.2,
q′j(2)(x;t1tr)=∑j1+j2=jt1j1qj2(2)(x;t1)qj1(1)(x;tr).
For a≥1, we denote by (tRν,ν′′)[a] the operator
(tRν+a−1,ν′−a+1′)⋯(tRν+1,ν−1′)(tRν,ν′′).
Then
the action of (t1trRν,ν′′)[a] on q′j(2)q′i(r) can be written as
[TABLE]
where Ri,j(r)=R(r,i),(1,j) and Rj1,j2(1)=R(1,j1),(2,j2).
We understand that R0,j(1) is the raising operator which sends
q0(1)=1 to q1(1) and qj(2) to qj−1(2).
It follows that for any λ∈Pn,r1,
[TABLE]
Note that since λ(1)=∅, the operator
∏b(ν)=b(ν′)=1(1−Rν,ν′) acts trivially.
The proposition follows from this formula.
∎
6.10.
We are now ready to prove Theorem 6.4. Assume that λ(1)=∅.
Let M=M(1) in the notation of 5.1, and consider M(a) for
a=1,…,r. Then a similar formula as in Lemma 5.5
holds for Qλ♯. Repeating this procedure for a=1 to r, one can replace
M by M′ which is defined by replacing m by m−1.
By induction, we may assume that the statements (i), (ii) of the theorem hold
for the corresponding function Q′μ♯ on M′.
In particular, Q′μ♯ coincides with Q′μ+, and
has an expression in terms of raising operators
(assertion (ii) of the theorem). This is equivalent to saying that
Q′μ♯ can be expressed as a coefficient of u′μ in the
function Φ+(u′) given in Proposition 5.12.
Then a similar argument as in the proof of Proposition 5.12 works for Qλ♯,
and Qλ♯ can be expressed as the coefficient of uλ in
Φ+(u), in other words, Qλ♯ has an expression in terms of
raising operators as in (ii) of the theorem (see Corollary 5.14).
Since Qλ♯ satisfies
the condition for the expansion by Schur functions (Lemma 6.2), we see that
Qλ♯=Qλ+ by Theorem 2.14.
Hence (i), (ii) holds in this case.
Next assume that λ(1)=∅, i.e., λ∈Pn,r1.
In this case, by Proposition 3.4, we have
Qλ+(x;t)=Q′μ+(x′,t′) with
μ=(λ(2),…,λ(r)) and t′=(t2,…,tr−1,t1tr).
We also have Qλ♯(x;t)=Q′μ♯(x′;t′) by
Lemma 6.6.
By induction, we assume that the theorem holds for Q′μ+.
Hence Q′μ♯(x′,t′)=Q′μ+(x′;t′).
This implies that Qλ♯(x;t)=Qλ+(x;t), which proves (i).
Then (ii) holds for Qλ+(x;t) by Proposition 6.9.
It remains to consider the case where λ∈Pn,rr−1, namely
λ=(−,…,−,λ(r)). In this case, by Theorem 3.5 and Lemma 6.8, we have
Qλ♯(x;t)=Qλ+(x,t)=Qλ(r)(x(r);t1⋯tr).
Hence (i) holds.
By [M, III, (2.15′)], Qλ(r) has an expression by raising operators.
Then by a similar argument as in the proof of Proposition 6.9, one sees that
Qλ+ has an expression by raising operators as in (ii) of the theorem.
Finally, we show (iii).
We already know by (4.2.5) and Theorem 5.15
that Qλ−=(1−t0)j0Pλ−.
Then (iii) follows from (2.13.1). The theorem is proved.
Combining Theorem 5.15 and Theorem 6.4, we have the following result.
Theorem 6.11**.**
Let Pλ±(x;t),Qλ±(x;t)∈ΞQn(t)
be the Hall-Littlewood functions.
(i)
Pλ±(x;t),Qλ±(x;t)∈Ξn[t].
2. (ii)
Qλ±(x;t)=(1−t1⋯tr)j0Pλ±(x;t), where
j0 is as in 4.2.
3. (iii)
Pλ±(x;t)* and Qλ±(x;t) are characterized by the property
as in Theorem 2.14, but the total order ⪯ can be replaced by the dominance order
≤, and the coefficients cλ,μ(t),uλ,μ(t)∈Z[t].
In particular, Pλ±,Qλ± are determined independently from
the choice of the total order.*
4. (iv)
{Pλ±∣λ∈Pn,r}* give rise to Z[t]-bases
of Ξn[t]. We have Kλ,μ±(t)∈Z[t].*
Proof.
(ii) follows from Theorem 5.15 and Theorem 6.4.
By (4.2.4) and (4.2.5), Pλ−(x;t),Qλ−(x;t)∈Z[xM;t].
Thus Pλ−,Qλ−∈Ξn[t] by Theorem 5.15.
By Theorem 6.4, Qλ+ has
an expression by raising operators. Thus Qλ+∈Ξn[t].
Hence (i) holds. Then (iii) follows from Proposition 4.3 and Corollary 5.14 in the
“−”case, and from Proposition 6.2 and Theorem 6.4 in the “+”case. (iv) follows from (iii).
∎
7. A conjecture of Finkelberg-Ionov
7.1
For two basis u={uλ},v={vμ} on the Q(t)-space ΞQ(t),
we denote by M(u,v)=(Mλμ) the transition matrix between u and v
as in the proof of Theorem 2.14.,
Recall the non-degenerate bilinear form ⟨,⟩ on ΞQn(t)
introduced in 2.10, which satisfies the properties
[TABLE]
For a matrix M, let M∗ be the matrix tM−1.
We denote the basis {Pλ±∣λ∈Pn,r} of ΞQn(t) by
P±, and similarly define Q±,s,m, with respect to
Qλ±,sλ,mλ, respectively.
Then we have
[TABLE]
Since M(s,P∓)=K(t)∓=(Kλ,μ∓(t)), we have
M(P∓,s)∗=t(K(t)∓).
The Kostka number Kλ,μ for λ,μ∈Pn,r is defined by
Kλ,μ=∏iKλ(i),μ(i) if ∣λ(i)∣=∣μ(i)∣
for each i, and Kλ,μ=0 otherwise. Put K=(Kλ,μ).
We know that M(s,m)∗=K∗=M(s,h), and by [M, I, (3.4′)]
[TABLE]
where hλ is the complete symmetric function
defined similarly to sλ,mλ.
Hence the operation ∏ν,ν′(1−Rν,ν′) on the basis
{hμ} corresponds to the matrix operation K∗.
Moreover, the matrix operation M(P∓,s)∗ on the basis {sμ}
coincides with the matrix operation M(Q±,q±) on the basis {hμ}.
In particular, if we write M(Q±,q±)=(cλμ±),
we have
[TABLE]
for each λ.
By Corollary 5.14 and Theorem 6.4, we have an expression
for Qλ± such as (5.14.1), (5.14.2).
Hence, for a fixed λ,
we have
[TABLE]
It follows that the right hand sides of (7.1.1) and (7.1.2) coincide with
∑μKμ,λ∓(t)sμ.
7.2.
We keep the notation for M=M(1).
Put M=rm. The n-function n(ξ) for ξ∈PM can be
extended to any composition ξ=(ξi)1≤i≤M∈Z≥0M
by n(ξ)=∑i=1M(i−1)ξi.
Recall the a-function on Pn,r ([S1]),
[TABLE]
where n(λ)=n(λ(1))+⋯+n(λ(r)).
Let c(λ) be the composition of M associated to λ as in 2.11.
We note that
[TABLE]
In fact
[TABLE]
Let ⟨,⟩ be the standard inner product on ZM, and put
δ=(M−1,M−2,…,0)∈ZM. Take λ,μ∈Pn,r. Then we have
[TABLE]
In fact, if we put M=(M−1,M−1,…,M−1)∈ZM, then
⟨c(λ),M−δ⟩=n(c(λ))=a(λ). Also we have
⟨c(λ),M⟩=⟨c(μ),M⟩ since c(λ),c(μ) are
compositions of M.
Hence
[TABLE]
Thus (7.2.2) holds.
Let ε1,…,εM be the standard basis of ZM. We denote by
R+ the set of positive roots of type AM−1, namely
R+={εi−εj∣1≤i<j≤M}.
We identify ZM with ZM by the given total order, and denote
ξ=(ξi)∈ZM as ξ=(ξν) with ν∈M.
For any ξ=(ξi)∈ZM
such that ∑ξi=0, we define a function L±(ξ;t) by
[TABLE]
where c is as in (2.5.3), and
(mγ) runs over all the choices such that ξ=∑γ∈R+mγγ
with mγ≥0, and that γ=εν−εν′ for ν<ν′ with the condition
[TABLE]
Note that L±(ξ;t)=0 only when ξ=∑iηi(εi−εi+1)
with ηi≥0 satisfying the condition (7.2.4). We have L−(ξ;t) is monic
of degree ∑iηi=⟨ξ,δ⟩ (see [M, III, 6, Ex. 4]), and
degL+(ξ;t)<⟨ξ,δ⟩ if r≥3.
In the “+”-case, we define a function L+μ(ξ;t) (depending on the
choice of μ) by
[TABLE]
where (mγ) runs over all the choices such that ξ=∑γ∈R+mγγ
with mγ≥0, and that γ=εν−εν′ for ν<ν′
with the condition
[TABLE]
(here Δ=Δ(μ) is the subset of M determined as in 5.11).
We have the following result.
Theorem 7.3**.**
Let λ,μ∈Pn,r. Under the natural embedding Smr⊂SM,
we have
[TABLE]
In particular, Kλ,μ−(t) is monic of degree a(μ)−a(λ),
and degKλ,μ+<a(μ)−a(λ) if r≥3.
Proof.
By (7.1.1), Kλ,μ−(t) is the coefficient of sλ in
[TABLE]
hence is the coefficient of xλ+δ1 in
[TABLE]
where δ1=(δ(1),…,δ(r)) with δ(k)=(m−1,…,0)
and (mγ) are given as in (7.2.3) and (7.2.5).
We now consider the change of variables {xi(k)∣1≤k≤r,1≤i≤m}
to {yj∣1≤j≤M} by the assignment xi(k)↦y(i−1)r+k.
Then the above coefficient coincides with the coefficient of yc(λ)+δ in
[TABLE]
This proves (7.3.1).
(7.3.2) is proved in a similar way by using (7.1.2).
We have
[TABLE]
The last step follows from (7.2.2).
The equality holds only when w=1.
Note that λ is obtained from μ by applying the raising operator
Rν,ν′ with b(ν′)=b(ν)+1, c(λ)−c(μ) can be written
as a sum of γ∈R+ satisfying (7.2.4). Hence L−(c(λ)−c(μ)) is
monic of degree a(μ)−a(λ), and the same is true for Kλ,μ−(t).
Finally consider the degree of Kλ,μ+(t). In this case,
for ν=(r,i),ν′=(r,i+1), γ=εν−εν′ can be written as
[TABLE]
Then the computation of L+μ(ξ;t), which involves the monomials with respect to
t1,…,tr and t0, is reduced to the computation of L+(ξ;t), which
involves only t1,…,tr. Since degL+(ξ,t)<⟨ξ,δ⟩ (for r≥3),
the assertion holds.
∎
7.4.
In the “+” case, we consider a special situation where
the function L+μ can be described easily.
We put the following condition for μ∈Pn,r;
(B) ℓ(λ(k))=i0 for k=1,…,r.
If μ satisfies the condition (B), then
Δ0=∅ and Δ1=M for Δ=Δ(μ).
In this case, L+μ(ξ;t) coincides with L+(ξ;t).
Hence as a corollary of Theorem 7.3 (ii), we have the following.
Corollary 7.5**.**
*Assume that μ satisfies the condition *(B). Then we have
[TABLE]
7.6.
In [FI], Finkelberg and Ionov defined the multi-variable
Kostka polynomials Kλ,μ(t)
by using the Lusztig’s partition function ([L1])
as defined in (7.2.3) for “−”case, which
is exactly the formula in the right hand side of (7.3.1). They conjectured
(in the case where t=t1=⋯=tr) that Kλ,μ(t) coincides with
our Kλ,μ−(t). Theorem 7.3 gives an affirmative answer to their conjecture
(for the multi-variable case).
Following [FI], we say that μ∈Pn,r is regular if
μ1(k)>μ2(k)>⋯>μm(k) for k=1,…,r.
They proved in [FI], in the case where μ is regular,
that Kλ,μ(t)∈Z≥0[t] by making use
of the higher cohomology vanishing of a certain vector bundle over
the flag variety of (GLm)r. Recently Hu [H] proved the higher cohomology vanishing
for arbitrary μ, hence the positivity property of Kλ,μ(t) now holds
without any restriction.
Combined with Theorem 7.3, we have
Proposition 7.7**.**
Kλ,μ−(t)∈Z≥0[t].
Remark 7.8.
The last statement in Theorem 7.3 and Proposition 7.7 give
an answer to the conjecture proposed in [S1, Conjecture 5.5] at least for the
“−”case.
7.9.
Let θ=(θ(1),…,θ(r)) be an r-partition, where
θ(k)=(θ1,θ2,…,θm) for
k=1,…,r (independent of k). Let λ,μ∈Pn,r.
Then λ+θ,μ+θ∈Pn′,r for some n′.
As a corollary of Theorem 7.3 and Corollary 7.5, we have the following
result, which was conjectured by Finkelberg (for the “−”case).
Corollary 7.10**.**
Let λ,μ∈Pn,r.
Assume that θ1≫θ2≫⋯≫θm>0.
Then Kλ+θ,μ+θ±(t) has a stable value, independent of the
choice of θ, and we have
[TABLE]
Proof.
The value Kλ+θ,μ+θ±(t) can be
expressed by the formula in Theorem 7.3 and Corollary 7.5.
(Note that in the “+”case, (B) holds for μ+θ since θm>0.)
By our assumption
θ1≫θ2≫⋯≫θm, the non-zero contribution only occurs in
the case where w=1. Hence
[TABLE]
The corollary is proved.
∎
Bibliography12
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[AH] P.N. Achar and A. Henderson; Orbit closures in the enhanced nilpotent cone, Adv. in Math. 219 (2008), no. 1, 27-62, Corrigendum, ibid. 228 (2011), 2984-2988.
2[B] R. Brylinski; Limits of weight spaces, Lusztig’s q 𝑞 q -analogs, and fiberings of adjoint orbits, J. Amer. Math. Soc. 2 (1989), 517-533.
3[FI] M. Finkelberg and A. Ionov; Kostka-Shoji polynomials and Lusztig’s convolution diagram, preprint, ar Xiv:1605.05806 v 2, to appear in Bulletin of the Institute of Mathematics Academia Sinica.
4[H] Y. Hu; Higher cohomology vanishing of line bundles on generalized Springer’s resolution, preprint, ar Xiv: 1704.07947 v 2.
5[K] S.-I. Kato; Spherical functions and a q 𝑞 q -analogue of Kostant’s weight multiplicity formula, Inv. Math. 66 (1982), 461-468.
6[L 1] G. Lusztig; Singularities, character formulas, and a q 𝑞 q -analogue of weight multiplicities, Asterisque 101 - 102 (1983), 208-227.
7[L 2] G. Lusztig; Quivers, perverse sheaves, and quantized enveloping algebras, J. Amer. Math. Soc. 4 (1991), 365 - 421.
8[LS] S. Liu and T. Shoji; Double Kostka polynomials and Hall bimodule, Tokyo J. of Math. 39 (2017), 743 - 776.