This paper investigates singular vector-valued Jack and Macdonald polynomials associated with symmetric groups and Hecke algebras, focusing on their singular values and the structure of polynomials with specific leading terms.
Contribution
It characterizes the singular polynomials' leading terms and determines the singular values based on the Ferrers diagram edges of the Young tableau shape.
Findings
01
Identifies conditions for singular polynomials with leading term $x_1^m ensor S$
02
Determines singular values depend on Ferrers diagram edge properties
03
Analyzes the structure of vector-valued Jack and Macdonald polynomials
Abstract
For each partition ฯ of N there are irreducible modules of the symmetric groups SNโ or the corresponding Hecke algebra HNโ(t) whose bases consist of reverse standard Young tableaux of shape ฯ. There are associated spaces of nonsymmetric Jack and Macdonald polynomials taking values in these modules, respectively.The Jack polynomials are a special case of those constructed by Griffeth for the infinite family G(n,p,N) of complex reflection groups. The Macdonald polynomials were constructed by Luque and the author. For both the group SNโ and the Hecke algebra HNโ(t) there is a commutative set of Dunkl operators. The Jack and the Macdonald polynomials are parametrized by ฮบ and (q,t) respectively. For certain values of the parameters (called singular values) thereโฆ
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
TopicsAlgebraic structures and combinatorial models ยท Advanced Algebra and Geometry ยท Molecular spectroscopy and chirality
Full text
Some Singular Vector-valued Jack and Macdonald Polynomials
Charles F. Dunkl
Dept. of Mathematics, University of Virginia,
Charlottesville VA 22904-4137; email: [email protected]
Abstract
For each partition ฯ of N there are irreducible modules of the
symmetric groups SNโ or the corresponding Hecke algebra
HNโ(t) whose bases consist of reverse standard
Young tableaux of shape ฯ. There are associated spaces of nonsymmetric
Jack and Macdonald polynomials taking values in these modules,
respectively.The Jack polynomials are a special case of those constructed by
Griffeth for the infinite family G(n,p,N) of complex
reflection groups. The Macdonald polynomials were constructed by Luque and the
author. For both the group SNโ and the Hecke algebra
HNโ(t) there is a commutative set of Dunkl
operators. The Jack and the Macdonald polynomials are parametrized by ฮบ
and (q,t) respectively. For certain values of the parameters
(called singular values) there are polynomials annihilated by each Dunkl
operator; these are called singular polynomials. This paper analyzes the
singular polynomials whose leading term is x1mโโS, where S is
an arbitrary reverse standard Young tableau of shape ฯ. The singular
values depend on properties of the edge of the Ferrers diagram of ฯ.
1 Introduction
For each partition ฯ of N there are irreducible modules of the
symmetric groups SNโ and the corresponding Hecke algebra
HNโ(t), whose bases consist of reverse standard
Young tableaux of shape ฯ. There are associated spaces of nonsymmetric
Jack and Macdonald polynomials taking values in these modules, respectively.
(In what follows the polynomials are always of the nonsymmetric type.) The
Jack polynomials are a special case of those constructed by Griffeth
[7] for the infinite family G(n,p,N) of complex
reflection groups. The Macdonald polynomials were constructed by Luque and the
author [6]. The polynomials are the simultaneous eigenfunctions of
the Cherednik operators, which form a commutative set. For both the group
SNโ and the Hecke algebra HNโ(t)
there is a commutative set of Dunkl operators, which lower the degree of a
homogeneous polynomial by 1.
The Jack and the Macdonald polynomials are parametrized by ฮบ and
(q,t) respectively. For certain values of the parameters
(called singular values) there are polynomials annihilated by each Dunkl
operator; these are called singular polynomials. The structure of the singular
polynomials for the trivial module corresponding to the partition (N), that is the ordinary scalar polynomials, is more or less well
understood by now. For the modules of dimension โฅ2 the singular
polynomials are mostly a mystery. In [3] and [4] we
constructed special singular polynomials which correspond to the minimum
parameter values. To be specific denote the longest hook-length in the Ferrers
diagram of ฯ by hฯโ then any other singular value ฮบ
satisfies โฃฮบโฃโฅh1โ and if a pair
(q,t) such that qmtn=1 provides a singular polynomial
then โnmโโโฅh1โ. The main topic of
this paper is the determination of all the singular values for which the Jack
or Macdonald polynomials with leading term x1mโโS are singular,
where S is an arbitrary reverse standard Young tableau of shape ฯ. The
singular values depend on properties of the edge of the Ferrers diagram of
ฯ.
There is a brief outline of the needed aspects of the representation theory of
SNโ and HNโ(t) in Section
2, focussing on the action of the generators on the basis elements.
The important operators on scalar and vector-valued polynomials are defined in
Section 3. Subsection 3.1 deals with the Cherednik-Dunkl
and Dunkl operators on the vector-valued polynomials, introduces the Jack
polynomials, and the key formulas for the action of Dunkl operators, in
particular, when specialized to the polynomials with leading term x1mโโS. Subsection 3.2 contains the analogous results on
Macdonald polynomials. Section 4 combines the previous results
with analyses of the spectral vectors and a combinatorial analysis of the
possible singular values, to prove our main results on Jack and Macdonald
polynomials. Subsection 4.1 illustrates the representation-theoretic
aspect of singular polynomials.
2 Representation Theory
The symmetric group SNโ is the group of permutations of
{1,2,โฆ,N}. The transpositions w=(i,j), defined by w(i)=j,w(j)=i and w(k)=k for k๎ =i,j are fundamental tools in this study. The simple
reflections siโ:=(i,i+1),1โคi<N, generate SNโ ; and the group is abstractly presented by {si2โ=1:1โคi<N} and the braid relations:
[TABLE]
The group algebra CSNโ, namely the linear space
{โwโSNโโcwโw}, is of dimension N!.
The associated Hecke algebra HNโ(t) where t is
transcendental (formal parameter) or a complex number not a root of unity, is
the associative algebra generated by {T1โ,T2โ,โฆ,TNโ1โ} subject to the relations
[TABLE]
It can be shown that there is a linear isomorphism between CSNโ and HNโ(t) based on the map
siโโTiโ. When t=1 they are identical.
The irreducible modules of these algebras correspond to partitions of N and
are constructed in terms of Young tableaux. The descriptions will be given in
terms of the actions of {siโ} or {Tiโ} on the basis elements (see [2]).
Let N0โ:={0,1,2,3,โฆ} and denote the set of
partitionsย N0N,+โ:={ฮปโN0Nโ:ฮป1โโฅฮป2โโฅโฏโฅฮปNโ}. Let
ฯ be a partition of N that is ฯโN0N,+โ and
โฃฯโฃ=N. Thus ฯ=(ฯ1โ,ฯ2โ,โฆ) (often the trailing zero entries are dropped when writing
ฯ). The length of ฯ is โ(ฯ):=max{i:ฯiโ>0}. There is a Ferrers diagram of shape ฯ (given the
same label), with boxes at points (i,j) with 1โคiโคโ(ฯ) and 1โคjโคฯiโ. A tableau of
shape ฯ is a filling of the boxes with numbers, and a reverse
standard Young tableau (RSYT) is a filling with the numbers {1,2,โฆ,N} so that the entries decrease in each row and each
column. Denote the set of RSYTโs of shape ฯ by Y(ฯ) and let Vฯโ=spanFโ{S:SโY(ฯ)} with orthogonal basis
Y(ฯ), (where F is some extension
field of Q containing the parameters ฮบ or q,t). The
dimension of Vฯโ, that is #Y(ฯ), is
given by the well-known hook-length formula. For 1โคiโคN and
SโY(ฯ) the entry i is at coordinates
(row(i,S),col(i,S)) and the content of the entry is
c(i,S)=col(i,S)โrow(i,S). Each SโY(ฯ) is uniquely determined by its content vector[c(i,S)]i=1Nโ. For example let
ฯ=(4,3) and S=\begin{array}[c]{cccc}7&6&5&2\\
4&3&1&\end{array} then the content vector is [1,3,0,โ1,2,1,0]. There are
representations of SNโ and HNโ(t)
on Vฯโ; each will be denoted by ฯ. For each i and S (with
1โคi<N and SโY(ฯ)) there are four
different possibilities:
row(i,S)=row(i+1,S) (implying col(i,S)=col(i+1,S)+1 and c(i,S)โc(i+1,S)=1) then
[TABLE]
col(i,S)=col(i+1,S) (implying row(i,S)=row(i+1,S)+1 and c(i,S)โc(i+1,S)=โ1) then
[TABLE]
row(i,S)<row(i+1,S) and col(i,S)>col(i+1,S). In this case
[TABLE]
and S(i), denoting the tableau obtained from S by
exchanging i and i+1, is an element of Y(ฯ)
and
[TABLE]
c(i,S)โc(i+1,S)โคโ2, thus
row(i,S)>row(i+1,S) and col(i,S)<col(i+1,S) then with b=c(i,S)โc(i+1,S),
[TABLE]
The formulas in (4) are consequences of those in (3) by interchanging S and
S(i) and applying the relations ฯ(siโ)2=I and (ฯ(Tiโ)+I)(ฯ(Tiโ)โtI)=0 (where I denotes the identity operator on
Vฯโ).
There is a commutative set of Jucys-Murphy elements in both ZSNโ and HNโ(t) and which are
diagonalized with respect to the basis Y(ฯ)
(with 1โคiโคN and SโY(ฯ))
[TABLE]
The representation ฯ of SNโ is unitary (orthogonal) when
Vฯโ is furnished with the inner product
[TABLE]
The analogue for HNโ(t) is
[TABLE]
where
[TABLE]
This form satisfies โจfฯ(Tiโ),gโฉ0โ=โจf,gฯ(Tiโ)โฉ0โ for f,gโVฯโ and 1โคi<N.
3 Representations and Operators on Polynomials
For Nโฅ2,ย x=(x1โ,โฆ,xNโ)โRN . The cardinality of a set E is denoted by #E. For ฮฑโN0Nโ (a composition) let โฃฮฑโฃ:=โi=1Nโฮฑiโ, xฮฑ:=โi=1Nโxiฮฑiโโ, a monomial of degree โฃฮฑโฃ. The
spaces of polynomials, respectively homogeneous, polynomials are
[TABLE]
For ฮฑโN0Nโ let ฮฑ+ denote the nonincreasing
rearrangement of ฮฑ. We use partial orders on N0Nโ : for
ฮฑ,ฮฒโN0Nโ, ฮฑโปฮฒ (ฮฑ dominates
ฮฒ) means that ฮฑ๎ =ฮฒ and โi=1jโฮฑiโโฅโi=1jโฮฒiโ for 1โคjโคN; and ฮฑโณฮฒ means that โฃฮฑโฃ=โฃฮฒโฃ
and either ฮฑ+โปฮฒ+ or ฮฑ+=ฮฒ+ and
ฮฑโปฮฒ. Also there is the rank function:
[TABLE]
then rฮฑโโSNโ and rฮฑโ(i)=i for
all i if and only if ฮฑ=ฮฑ+.
The action of the symmetric group on polynomials is defined by
[TABLE]
For arbitrary transpositions x(i,j)=(โฆ,xijโ,โฆ,xjiโ,โฆ) and p(x)(i,j)=p(x(i,j)).There is a
subtlety (implicit inverse) involved due to acting on the right: for example
p(x)s1โs2โ=p(xs1โ)s2โ=p((xs2โ)s1โ), that is, p(x1โ,x2โ,x3โ)s1โs2โ=p(x2โ,x1โ,x3โ)s2โ=p(x3โ,x1โ,x2โ). In general p(x)w=p(xwโ1)
where (xw)iโ=xwโ1(i)โ for all i.
The action of the Hecke algebra on polynomials is defined by
[TABLE]
The defining relations can be verified straightforwardly. There are special
values: xiโTiโ=xi+1โ, (xiโ+xi+1โ)Tiโ=t(xiโ+xi+1โ) and (txiโโxi+1โ)Tiโ=โ(txiโโxi+1โ). Also pTiโ=tp if and only if psiโ=p , because
tpโpTiโ=xiโโxi+1โtxiโโxi+1โโ(pโpsiโ).
For a partition ฯ of N let Pฯโ:=PโVฯโ. The set {xฮฑโS:ฮฑโN0Nโ,SโY(ฯ)} is a basis of
Pฯโ. The representations of SNโ and
HNโ(t) on Pฯโ are respectively
defined by the linear extension from the action on generators by
[TABLE]
for pโP,SโY(ฯ) and 1โคi<N.
(For details and background for the vector-valued Macdonald polynomials see
[6].)
3.1 Jack polynomials
The Dunkl {Diโ} and Cherednik-Dunkl {Uiโ} operators on Pฯโ for
pโP,SโY(ฯ) and 1โคiโคN,
are defined by
[TABLE]
Each of the sets {Diโ} and {Uiโ} consists of pairwise commuting elements. There is a
basis of Pฯโ consisting of homogeneous polynomials each of
which is a simultaneous eigenfunction of {Uiโ};
these are the nonsymmetric Jack polynomials. For each (ฮฑ,S)โN0NโรY(ฯ) there
is the polynomial
[TABLE]
where vฮฑ,ฮฒ,Sโ(ฮบ)โVฯโ; these
coefficients are rational functions of ฮบ. These polynomials satisfy
[TABLE]
The spectral vector is [ฮถฮฑ,Sโ(i)]i=1Nโ. For detailed proofs see [5].
We are concerned with the special case ฮฑ=(m,0,โฆ,0)โN0Nโ. We apply formulas from [3] to analyze
Jฮฑ,SโDiโ.
Proposition 1
([3, Cor. 6.2]) Suppose (ฮฒ,S)โN0NโรY(ฯ) and ฮฒjโ=0
for jโฅk with some fixed k>1 then Jฮฒ,SโDjโ=0 for
all jโฅk.
The next result uses the inner product on Jack polynomials for partition
labels ฮฒ. The Pochhammer symbol is (a)nโ=โi=1nโ(a+iโ1).
Proposition 2
Suppose ฮฒโN0N,+โ and SโY(ฯ) then
[TABLE]
Corollary 3
Suppose ฮฑ=(m,0,โฆ,0) then
[TABLE]
These norm formulas are results of Griffeth [7] specialized to the
symmetric groups. The final ingredient for the formula is a special case of
[3, Thm. 6.3].
Proposition 4
Suppose ฮฑ=(m,0,โฆ,0) and ฮฑ=(mโ1,0,โฆ,0) then
[TABLE]
Proof. The first line comes from [3, Thm. 6.3]. Then the norm ratios are
computed, which involves much cancellation.
Denote the prefactor of Jฮฑ,Sโ in equation (5) by
CS,mโ(ฮบ). Our interest is in the zeros of
CS,mโ(ฮบ) as a function of ฮบ. We will see that
CS,mโ(ฮบ) depends only on ฯ and the location of
1 in S. The idea is to group entries of S by row and use telescoping
properties. There is a simple formula (proven inductively)
[TABLE]
where g is a function on Z and aโคb. For the present
application set g(i)=m+ฮบ(c(1,S)โi).
Definition 5
The partition ฯโN0N,+โ is
obtained from ฯ by removing the box (row(1,S),col(1,S)): for 1โคiโคโ(ฯ) set ฯiโ=ฯiโโ1 if
row(1,S)=i otherwise set ฯiโ=ฯiโ.
The part of the product in CS,mโ(ฮบ) coming from row
#i has c(j,S) ranging from 1โi to ฯiโโi
so the corresponding subproduct is
[TABLE]
Multiply these factors for i=1,2,โฆโ(ฯ); note that
[TABLE]
and thus
[TABLE]
As stated before the formula depends only on ฯ and the location of 1 in
S. More simplification is possible due to telescoping if some ฯiโโs are equal.
Definition 6
For ฯ as in Definition 5 define the
increasing sequence I(ฯ)=[i1โ,i2โ,โฆ,ikโ] such that i1โ=1, and 2โคsโคk
implies ฯisโโ<ฯisโ1โโ and ฯjโ=ฯisโ1โโ for isโ1โโคj<isโ. The last element
ikโ=โ(ฯ)+1. Let Z(ฯ)={ฯisโโ+1โisโ:1โคsโคkโ1}โช{โโ(ฯ):ฯโ(ฯ)โโฅ1} (the latter set is omitted when ฯโ(ฯ)โ=0).
Example 7
Suppose ฯ=[5,5,4,4,4,3,3,2,1] then
I(ฯ)=[1,3,6,8,9,10],
and Z(ฯ)={5,2,โ2,โ5,โ7,โ9}. If ฯ=[5,5,4,4,4,3,3,3,0] then I(ฯ)=[1,3,6,9] and Z(ฯ)={5,2,โ2,โ8}.
Let S denote the tableau formed by deleting the box (row(1,S),col(1,S)) from S. The key property of I(ฯ) is that it controls the possible locations where a box containing
1 could be adjoined to S to form a RSYT. These locations are
{(1,ฯ1โ+1),โฆ,(isโ,ฯisโโ+1),โฆ}. If ฯโ(ฯ)โ=0 then the last location is (โ(ฯ),1) otherwise it is (โ(ฯ)+1,1). Thus Z(ฯ)
is the set of contents of locations in the list. Evaluate the part of the
product in formula (6) for the range isโโคj<is+1โโ to
obtain
If ฯโ(ฯ)โ=0 then the entry at (โ(ฯ),1) is 1, c(1,S)=1โโ(ฯ), ikโ1โ=โ(ฯ) and the
last factor in the product (for s=kโ1) equals m+ฮบmโ, thus
cancelling out the leading factor m+ฮบ(c(1,S)+โ(ฯ))=m+ฮบ.
Lemma 9
Suppose 1โคa,bโคkโ1 then ฯiaโโโiaโ๎ =ฯibโโโib+1โ.
Proof. By construction the sequence {ฯiaโโ}aโฅ1โ is strictly decreasing and the sequence {iaโ}aโฅ1โ is strictly increasing. Suppose for some a,b the equation
ฯiaโโโiaโ=ฯibโโโib+1โ holds, that is,
iaโโib+1โ=ฯiaโโโฯibโโ. Clearly a=b
or a=b+1 are impossible. Suppose iaโโib+1โ>0 then b<b+1<a implying
ฯiaโโโฯibโโ<0, a contradiction. Similarly
suppose iaโโib+1โ<0 then a<b+1, furthermore that a<b since a=b is
impossible, thus ฯiaโโโฯibโโ>0, again a
contradiction. This completes the proof.
Proposition 10
*The set of zeros of Cm,Sโ(ฮบ) is
{โc(1,S)โzmโ:zโZ(ฯ),z๎ =c(1,S)}.*
Proof. None of the numerator factors in the product are cancelled out due to Lemma
9. The only possible cancellation occurs for ฯโ(ฯ)โ=0 when c(1,S) is the last entry
in the list Z(ฯ).
Example 11
Let N=7,ฯ=[5,5,5,4,4,2,2] and (row(1,S),col(1,S))=(3,5), then ฯ=[5,5,4,4,4,2,2]. The possible locations where the box containing 1
could be adjoined to ฯ are {(1,6),(3,5),(6,3),(8,1)} so
that Z(ฯ)={5,2,โ3,โ7}
and
[TABLE]
Here is a sketch of ฯ marked by โก and the possible
cells for the entry 1
[TABLE]
In a later section we examine the relation to singular polynomials of the form
Jฮฑ,Sโ.
3.2 Macdonald polynomials
Adjoin the parameter q. To say that (q,t) is generic means
that q๎ =1,qatb๎ =1 for a,bโZ and โNโคbโคN.
Besides the operators Tiโ defined in (3) we introduce (for
pโP,SโY(ฯ))
[TABLE]
The Cherednik {ฮพiโ} and Dunkl {Diโ} operators, for 1โคiโคN, are defined by
[TABLE]
These definitions were given for the scalar case by Baker and Forrester
[1] and extended to vector-valued polynomials by Luque and the
author [6]. The operators {ฮพiโ:1โคiโคN}
commute pairwise, while the operators {Diโ:1โคiโคN} commute pairwise and map PnโโVฯโ to
Pnโ1โโVฯโ for nโฅ0. A polynomial pโPฯโ is singular for some particular value of (q,t) if pDiโ=0 , evaluated at (q,t),
for all i. There is a basis of Pฯโ consisting of
homogeneous polynomials each of which is a simultaneous eigenfunction of
{ฮพiโ}; these are the nonsymmetric Macdonald
polynomials. For each (ฮฑ,S)โN0NโรY(ฯ) there is the polynomial
[TABLE]
where vฮฑ,ฮฒ,Sโ(q,t)โVฯโ and Rฮฑโ:=(TiiโโTi2โโโฏTimโโ)โ1 where
ฮฑ.si1โโsi2โโโฏsimโโ=ฮฑ+ and there is no shorter
product sj1โโsj2โโโฏhaving this property (that is m=#{(i,j):i<j,ฮฑiโ<ฮฑjโ}), a,bโZ
(see [4, p. 19] for the values of a,b, which are not needed
here), and
[TABLE]
As before [ฮถโฮฑ,Sโ(i)]i=1Nโ is called the spectral vector (the tilde indicates
the(q,t)-version). We consider the special case
ฮฑ=(m,0,โฆ,0).
Proposition 12
([4, Prop. 12]) Suppose (ฮฒ,S)โN0NโรY(ฯ) and ฮฒjโ=0
for jโฅk with some fixed k>1 then Mฮฒ,SโDjโ=0 for
all jโฅk.
Adapting the proof of [4, Lemma 5] we show (recall (2)
u(z)=(1โz)2(tโz)(1โtz)โ):
Proposition 13
Let ฮฑ=(m,0,โฆ), ฮฑโฒ=(0,0,โฆ,m) and SโY(ฯ) then
[TABLE]
The other ingredient is the affine step (from the Yang-Baxter graph, see
[6], [4, (3.14)]): for ฮฒโN0Nโ set
ฮฒฮฆ:=(ฮฒ2โ,ฮฒ3โ,โฆ,ฮฒNโ,ฮฒ1โ+1)
then Mฮฒฮฆ,Sโ=xNโ(Mฮฒ,Sโw). The spectral vector
of ฮฒฮฆ is [ฮถโฮฒ,Sโ(2),โฆ,ฮถโฮฒ,Sโ(N),qฮถโฮฒ,Sโ(1)]. Observe ฮฑฮฆ=ฮฑโฒ for ฮฑ=(mโ1,0,โฆ). By
definition
[TABLE]
Furthermore (1โqฮถโฮฑ,Sโ(1))=(1โqmtc(1,S)) and
wTNโ1โโฏT1โ=tNโ1ฮพ1โ so that M_{\widehat{\alpha},S}\xi_{1}=q^{m-1}t^{c\left(1,S\right)}M_{\widehat{\alpha},S}\.
Proposition 14
Let ฮฑ=(m,0,โฆ), ฮฑ=(mโ1,0,โฆ,0) and SโY(ฯ) then
[TABLE]
This is very similar to the Jack case (5) and the same telescoping
argument will be used. Denote the factor of Mฮฑ,Sโ in
(7) by CS,mโ(q,t). Set g(i)=1โqmtc(1,S)โi for iโZ then
If ฯโ(ฯ)โ=0 then the entry at (โ(ฯ),1) is 1, c(1,S)=1โโ(ฯ), ikโ1โ=โ(ฯ) and the
last factor in the product (for s=kโ1) equals 1โqmt1โqmโ,
thus cancelling out the leading factor 1โqmtc(1,S)+โ(ฯ)=1โqmt.
Proposition 16
*The set of zeros of Cm,Sโ(q,t)
is
ย {qmtc(1,S)โz=1:zโZ(ฯ),z๎ =c(1,S)}.*
Proof. None of the numerator factors in the product are cancelled out due to Lemma
9. The only possible cancellation occurs for ฯโ(ฯ)โ=0 when c(1,S) is the last entry
in the list Z(ฯ).
Example 17
Let N=7,ฯ=[5,5,4,4,4,3,2] and (row(1,S),col(1,S))=(6,3), then ฯ=[5,5,4,4,4,2,2]. This is
the same ฯ as in Example 11, and Z(ฯ)={5,2,โ3,โ7}. The same diagram
applies here. Then
[TABLE]
In the next section we will see under what conditions Mฮฑ,Sโ is singular.
4 Singular Polynomials
For ฮฑ=(m,0,โฆ)โN0N,+โ,ฮฑ=(mโ1,0,โฆ) and SโY(ฯ) we have shown
[TABLE]
and we determined the zeros of CS,mโ(ฮบ) and
CS,mโ(q,t).But not all zeros lead to singular polynomials
because, in general the coefficients of Jฮฒ,Sโ (with respect to the
monomial basis {xฮณโSโฒ}) have
denominators of the form a+bฮบ and the coefficients of Mฮฒ,Sโ
have denominators of the form 1โqatb where a,bโZ and
โฃbโฃโคN. Thus to be able to substitute ฮบ=ฮบ0โ, a zero of CS,mโ(ฮบ), or (q,t)=(q0โ,t0โ), a zero of CS,mโ(q,t), in equations (5) and (7) to conclude that
Jฮฑ,Sโ or Mฮฑ,Sโ are singular it is necessary to show that
neither Jฮฑ,Sโ or Jฮฑ,Sโ have a pole at
ฮบ=ฮบ0โ; the analogous requirement applies to Mฮฑ,Sโ and
Mฮฑ,Sโ. From the triangularity of Jฮฒ,Sโ and
Mฮฒ,Sโ with respect to the monomial basis we can deduce that
[TABLE]
where ฮปโN0N,+โ, the coefficients bฮป,ฮณ,S,Sโฒโ(ฮบ),bฮป,ฮณ,S,Sโฒโ(q,t) are rational functions of ฮบ,(q,t)
respectively and c=qatb for some integers a,b. If one can show that
for each (ฮณ,Sโฒ) with ฮณโฒฮป that the spectral vector is distinct from that of (ฮป,S), that is, [ฮถฮณ,Sโฒโ(i)]i=1Nโ๎ =[ฮถฮป,Sโ(i)]i=1Nโ when evaluated at the specific values of ฮบ or
(q,t) (with ฮถโ) then Jฮป,Sโ,
respectively Mฮป,Sโ, do not have a pole there. The following is a
device for analyzing possibly coincident spectral vectors.
Definition 18
Let (ฮฒ,S),(ฮณ,Sโฒ)โN0NโรY(ฯ) such that
ฮฒโณฮณ, and let m,nโZ with mโฅ1,n๎ =0. Then [(ฮฒ,S),(ฮณ,Sโฒ)] is an (m,n)-critical pair if there is
vโZN such that ฮฒiโโฮณiโ=mviโ and c(rฮฒโ(i),S)โc(rฮณโ(i),Sโฒ)=nviโ for 1โคiโคN.
Lemma 19
Let (ฮฒ,S),(ฮณ,Sโฒ)โN0NโรY(ฯ) such that
ฮฒโณฮณ and ฮถฮฒ,Sโ(i)=ฮถฮณ,Sโฒโ(i) for all i when ฮบ=โnmโ, with gcd(m,n)=1, then [(ฮฒ,S),(ฮณ,Sโฒ)] is an (m,n)-critical pair.
Proof. By hypothesis (1+ฮฒiโโnmโc(rฮฒโ(i,S)))=(1+ฮณiโโnmโc(rฮณโ(i,Sโฒ))) for 1โคiโคN; thus
[TABLE]
From gcd(m,n)=1 it follows that ฮฒiโโฮณiโ=mviโ for some viโโZ and thus rฮฒโ(i,S)โc(rฮณโ(i,Sโฒ))=nviโ.
Now we specialize to ฮฑ=(m,0,โฆ) as in Subsection
3.1 and n satisfying CS,mโ(โnmโ)=0. By
Proposition 10 this is equivalent to n=c(1,S)โz
with zโZ(ฯ).
Proposition 20
There are no (m,n)-critical pairs [(ฮฑ,S),(ฮณ,Sโฒ)].
Proof. Suppose that ฮณโดฮฑ and ฮฑiโโฮณiโ=mviโ,ย c(i,S)โc(rฮณโ(i),Sโฒ)=nviโ with viโโZ, and 1โคiโคN. From
โฃฮณโฃ=โฃฮฑโฃ=m and
ฮฑjโ=m or =0 it follows that ฮณkโ=m for some k and
ฮณiโ=0 for i๎ =k. If k=1 then ziโ=0 for all i and
c(i,S)=c(rฮณโ(i),Sโฒ)=c(i,Sโฒ), because ฮณโN0N,+โ. The content vector determines Sโฒ uniquely and thus
Sโฒ=S and ฮณ=ฮฑ. Now suppose k>1 then v1โ=1,vkโ=โ1
and viโ=0 otherwise. The respective content vectors are
[TABLE]
The hypothesis on ฮณ implies c(i,Sโฒ)=c(iโ1,S) for i=3โคiโคk, c(i,Sโฒ)=c(i,S) for k+1โคiโคN, and c(2,Sโฒ)=c(1,S)โn, c(1,Sโฒ)=c(k,S)+n. Since S and Sโฒ are both of shape ฯ the two
content vectors are permutations of each other. The list of values [c(3,Sโฒ),โฆ,c(N,Sโฒ)]
agrees with [c(2,S),โฆ,c(kโ1,S),c(k+1,S)โฆ,c(N,S)] thus [c(1,S),c(k,S)] and [c(1,Sโฒ),c(2,Sโฒ)] contain the
same two numbers. Since c(2,Sโฒ)=c(1,S)โn๎ =c(1,S) the equation c(1,S)=c(1,Sโฒ) must hold. The possible locations of the entry 1 in a
RSYT must have different contents (else they would be on the same diagonal
{(i,j):jโi=c(1,S)}). Thus
(row(1,Sโฒ),col(1,Sโฒ))=(row(1,S,col(1,S)) and S and Sโฒ
lead to the same ฯ (the partition formed by removing the cell
of 1 from ฯ).By construction n=z for some zโZ(ฯ), and z determines a cell (isโ,ฯisโโ+1) where 1 can be attached to the part of
Sโฒ containing {2,3,โฆ,N} to form a new RSYT
Sโฒโฒ. By construction c(1,Sโฒโฒ)=z=c(1,S)โn=c(2,Sโฒ)=c(2,Sโฒโฒ).It is impossible for c(1,Sโฒโฒ)=c(2,Sโฒโฒ) for any RSYT, thus
ฮณ๎ =ฮฑ can not occur.
The same problem for ฮฑ=(mโ1,0,โฆ) is
almost trivial.
Lemma 21
Suppose SโฒโY(ฯ),
โฃฮณโฃ=mโ1 and ฮฑiโโฮณiโ=mviโ,ย c(i,S)โc(rฮณโ(i),Sโฒ)=nviโ with viโโZ, and 1โคiโคN.
Then (ฮฑ,S)=(ฮณ,Sโฒ).
Proof. The hypothesis โฃฮณโฃ=mโ1 implies ฮณiโโคmโ1 and thus โฃฮฑiโโฮณiโโฃโคmโ1
for all i. This implies viโ=0 for all i implying ฮณ=ฮฑ and c(j,S)=c(j,Sโฒ)
for all j, thus S=Sโฒ.
Proposition 22
Suppose (ฮฒ,S)โN0NโรY(ฯ), gcd(m,n)=1 and
there are no (m,n)-critical pairs [(ฮฒ,S),(ฮณ,Sโฒ)] then
Jฮฒ,Sโ has no poles at ฮบ=โnmโ.
Proof. By the triangularity of formula (4) there is an expansion
[TABLE]
By Lemma 19 for each ฮณโฒฮฒ,SโฒโY(ฯ) there is at least one i=i[ฮณ,Sโฒ] such that ฮถฮฒ,Sโ(i)โฮถฮณ,Sโฒโ(i)๎ =0 when ฮบ=โnmโ.
Define an operator
[TABLE]
Then Jฮฒ,SโT=Jฮฒ,Sโ and each Jฮณ,Sโฒโ
(with ฮณโฒฮฒ) is annihilated by at least one factor of
T. Thus Jฮฒ,Sโ=(xฮฒโSฯ(rฮฒโ))T, a polynomial whose coefficients have
denominators which are factors ofย ฮณโฒฮฒ,SโฒโY(ฯ)โโ(ฮถฮฒ,Sโ(i[ฮณ,Sโฒ])โฮถฮณ,Sโฒโ(i[ฮณ,Sโฒ])). By construction of {i[ฮณ,Sโฒ]} this product does not vanish at ฮบ=โnmโ.
We are ready for the main result on Jack polynomials.
Theorem 23
Suppose ฮฑ=(m,0,โฆ),SโY(ฯ) and Z(ฯ) is as in
Definition 6. Further suppose zโZ(ฯ), n:=c(1,S)โz๎ =0 and gcd(m,n)=1 then Jฮฑ,Sโ is a singular polynomial for ฮบ=โnmโ.
Proof. From Proposition 1Jฮฑ,SโDjโ=0 for 2โคjโคN and Jฮฑ,SโD1โ=CS,mโ(ฮบ)Jฮฑ,Sโ, where ฮฑ=(mโ1,0,โฆ).By Propositions 20, 22 and Lemma 21Jฮฑ,Sโ and Jฮฑ,Sโ do not have poles at
ฮบ=โnmโ. Furthermore CS,mโ(โnmโ)=0
and thus Jฮฑ,SโD1โ=0 at ฮบ=โnmโ.
To set up the analogous results for Macdonald polynomials consider the
differences between two spectral vectors: ฮถโฮฒ,Sโ(i)โฮถโฮณ,Sโฒโ(i)=qฮฒiโtc(rฮฒโ(i),S)โqฮณiโtc(rฮณโ(i),Sโฒ)=qฮณiโtc(rฮณโ(i),Sโฒ)(qฮฒiโโฮณiโtc(rฮณโ(i),Sโฒ)โc(rฮณโ(i),Sโฒ)โ1). To relate this to (m,n)-critical pairs we
specify a condition on (q,t) which implies a=mv and b=nv
for some vโZ when qatb=1.
Definition 24
Suppose m,n are integers such mโฅ1,n๎ =0 and gcd(m,n)=gโฅ1. Let uโC\{0} such that u is
not a root of unity and ฯ=exp(m2ฯikโ) with gcd(k,g)=1. Define ฯ=(q,t)=(ฯuโn/g,um/g).
Lemma 25
Suppose a,b are integers such that qatb=1 at (q,t)=ฯ then a=mv,b=nv for some vโZ.
Proof. By hypothesis
[TABLE]
Since u is not a root of unity it follows that โa(gnโ)+b(gmโ)=0 but gcd(gnโ,gmโ)=1 and thus gmโ divides a. Write
a=(gmโ)c for some integer c then 1=ฯa=exp(m2ฯikโgmcโ)=exp(g2ฯikcโ).This implies c=vg with vโZ
because exp(g2ฯikโ) is a primitive
gth root of unity. Thus a=(gmโ)vg=mv and
b=mnโa=nv.
Remark 26
All the possible values of ฯ are included when (1) g>1 and
ฯ=exp(m2ฯikโ) with gcd(k,g)=1 and 1โคk<g (2) g=1 and ฯ=1. To prove this let
u=ฯv with ฯ=exp(m2ฯiglโ) and
lโZ so that um/g=vm/g. Then q=ฯฯโn/gvโn/g=exp(2ฯi(mkโnlโ))vโn/g. Since gcd(m,n)=g there are integers s,sโฒ such that sโฒm+sn=g. Set l=s"s (with sโฒโฒโZ) then kโnl=kโsโฒโฒgโsโฒโฒsโฒm;
thus ฯฯโn/g=exp(2ฯi(mkโsโฒโฒgโ)). If g>1 then let sโฒโฒ=โgkโโ+1 implying 1โคkโsโฒโฒg<g, while if g=1 set sโฒโฒ=k.
Example 27
Suppose m=8 and n=โ12, then g=4 and the possible values of ฯ are
(exp(4ฯiโ)u3,u2) and
(exp(43ฯiโ)u3,u2)
where u is not a root of unity.
We will use this result to produce singular polynomials Mฮฑ,Sโ for
(q,t)=ฯ.
Lemma 28
Let (ฮฒ,S),(ฮณ,Sโฒ)โN0NโรY(ฯ) such that
ฮฒโณฮณ and ฮถโฮฒ,Sโ(i)=ฮถโฮณ,Sโฒโ(i) for all
i when (q,t)=ฯ then [(ฮฒ,S),(ฮณ,Sโฒ)] is an (m,n)-critical pair.
Proof. The equation ฮถโฮฒ,Sโ(i)=ฮถโฮณ,Sโฒโ(i) is qฮฒiโtc(rฮฒโ(i),S)=qฮณiโtc(rฮณโ(i),Sโฒ), that is, qฮฒiโโฮณiโtc(rฮฒโ(i),S)โc(rฮณโ(i),Sโฒ)=1 at (q,t)=ฯ. By Lemma
25 there is an integer viโ such that ฮฒiโโฮณiโ=mviโ
and c(rฮฒโ(i),S)โc(rฮณโ(i),Sโฒ)=nviโ. This argument applies to all
i.
Proposition 29
Suppose (ฮฒ,S)โN0NโรY(ฯ) and there are no (m,n)-critical pairs [(ฮฒ,S),(ฮณ,Sโฒ)] then Mฮฒ,Sโ has no poles at (q,t)=ฯ.
Proof. The proof is essentially identical to that of Proposition 22. There
replace xฮฒโSฯ(rฮฑโ) by qatbxฮฒโSฯ(Rฮฒโ) (with the appropriate
prefactor qatb), J by M, ฮถ by ฮถโ,
Uiโ by ฮพiโ. The formula shows that Mฮฒ,Sโ is a
polynomial, the denominators of whose coefficients are products of factors
with the form qฮฒiโtbโqฮณiโtbโฒ, and none of
these vanish at (q,t)=ฯ.
This is our main result for the Macdonald polynomials.
Theorem 30
Suppose ฮฑ=(m,0,โฆ),SโY(ฯ) and Z(ฯ) is as in Definition 6. Further suppose zโZ(ฯ), n:=c(1,S)โz๎ =0
then Mฮฑ,Sโ is a singular polynomial for (q,t)=ฯ.
Proof. From Proposition 12Mฮฑ,SโDjโ=0 for 2โคjโคN and Mฮฑ,SโD1โ=CS,mโ(q,t)Mฮฑ,Sโ, where ฮฑ=(mโ1,0,โฆ).By
Propositions 20, 29 and Lemma 21Mฮฑ,Sโ and Mฮฑ,Sโ do not have poles at (q,t)=ฯ. FurthermoreCS,mโ(ฯuโn/g,um/g)=0 (due to the factor 1โqmtc(1,S)โz, Proposition 16) and thus Mฮฑ,SโD1โ=0 at (q,t)=ฯ.
4.1 Isotype of Singular Polynomials
The following discussion is in terms of Macdonald polynomials. It is
straightforward to deduce the analogous results for Jack polynomials. Suppose
ฯ is a partition of N. A basis {pSโ:SโY(ฯ)} of an HNโ(t)-invariant
subspace of Pฯโ is called a basis of isotypeฯ if each pSโ transforms under the action of Tiโ defined in
Section 2 with ฯ(Tiโ) replaced by Tiโ.
For example if row(i,S)=row(i+1,S) then pSโ(xsiโ)=pSโ(x), equivalently pSโTiโ=tpSโ, or
if col(i,S)=col(i+1,S) then pSโTiโ=โpSโ. There is a strong relation to
singular polynomials.
Proposition 31
: A polynomial pโPฯโ is singular for a specific value of
(q,t)=ฯ if and only if pฮพiโ=pฯiโ for 1โคiโคN, evaluated at ฯ.
Proof. Recall the Jucys-Murphy elements {ฯiโ} from
(1). By definition pDNโ=0 if and only if pฮพNโ=p=pฯNโ. Proceeding by induction suppose that pDjโ=0
for i<jโคN if and only if pฮพjโ=pฯjโ for i<jโคN. Suppose
[TABLE]
This completes the proof.
With Mฮฑ,Sโ and n as in Theorem 30 the spectral vector
[ฮถโฮฑ,Sโ(i)]i=1Nโ=[qmtc(1,S),tc(2,S),โฆ,tc(N,S)]. Specialized to (q,t)=ฯ the polynomial Mฮฑ,Sโ is singular and
qmtc(1,S)=tโn+c(1,S). Recall n=z
for some zโZ(ฯ), and z determines
a cell (isโ,ฯisโโ+1). In terms of Ferrers
diagrams let ฯ=ฯโช(isโ,ฯisโโ+1), that is ฯisโโ=ฯisโโ+1. Let Sโฒ
denote the RSYT formed from the cells of ฯ containing the numbers
2,โฆ,N and the cell (isโ,ฯisโโ+1)
containing 1. Then c(i,Sโฒ)=c(i,S)
for 2โคiโคN and c(1,Sโฒ)=c(1,S)โn. Thus the spectral vector of Mฮฑ,Sโ evaluated at (q,t)=ฯ is [tc(i,Sโฒ)]i=1Nโ. This implies that Mฮฑ,Sโ is (a basis element) of isotype
ฯ. The other elements of the basis corresponding to Y(ฯ) are obtained from Mฮฑ,Sโ by appropriate
transformations using {Tiโ}.
5 Concluding Remarks
We have shown the existence of singular vector-valued Jack and Macdonald
polynomials for the easiest possible values of the label ฮฑ, that is,
(m,0,โฆ,0). The proofs required some differentiation
formulas and combinatorial arguments involving Young tableaux. The singular
values were found to have an elegant interpretation in terms of where another
cell can be attached to an RSYT. It may occur that a larger set of parameter
values, say gcd(m,n)>1, or even nmโโ/Z, still leads to singular Jack polynomials but our proof techniques
do not seem to cover these. One hopes that eventually a larger class of
examples (more general labels in N0Nโ) will be found, with a
target of a complete listing as is already known for the trivial
representation ฯ=(N). It is suggestive that the isotype
ฯ of the singular polynomial Mฮฑ,Sโ is obtained by a reasonably
natural transformation of the partition ฯ.
Bibliography7
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] T. H. Baker, P. J. Forrester, A q ๐ q -analogue of the type A ๐ด A Dunkl operator and integral kernel, Int Math Res Notices 14 (1997), 667-686, ar Xiv:q-alg/9701039.
2[2] R. Dipper and G. James, Representations of Hecke algebras of general linear groups, Proc. London Math. Soc. (3) 52 (1986), 2-52.
3[3] C. Dunkl, The smallest singular values and vector-valued Jack polynomials, SIGMA 14 (2018), 115, 20 pp., doi.org/10.3842/SIGMA.2018.115
4[4] C. Dunkl, A positive-definite inner product for vector-valued Macdonald polynomials, Sรฉm. Lothar. Combin . B 80a (2019), 26 pp.
5[5] C. Dunkl and J.-G. Luque, Vector-valued Jack polynomials from scratch, SIGMA 7 (2011) 26, 48 pp.
6[6] C. Dunkl and J.-G. Luque, Vector valued Macdonald polynomials, Sรฉm. Lothar. Combin. B 66b (2011), 68 pp.
7[7] S. Griffeth, Orthogonal functions generalizing Jack polynomials, Trans. Amer. Math. Soc. 362 (2010), 6131-6157, ar Xiv:0707.0251