
TL;DR
This paper develops a unified combinatorial framework for various generalizations of Kazhdan-Lusztig R-polynomials, including parabolic, zircon, and Vogan polynomials, enhancing understanding of their interrelations.
Contribution
It introduces a common combinatorial approach that encompasses multiple Kazhdan-Lusztig R-polynomial generalizations, facilitating broader analysis.
Findings
Unified combinatorial framework established
Connections between different R-polynomial variants clarified
Potential for new applications in representation theory
Abstract
The purpose of this work is to provide a common combinatorial framework for some of the analogues and generalizations of Kazhdan-Lusztig R-polynomials that have appeared since the introduction of these remarkable polynomials (e.g., parabolic Kazhdan-Lusztig R-polynomials, Kazhdan-Lusztig R-polynomials of zircons, and Kazhdan-Lusztig-Vogan polynomials for fixed point free involutions).
Peer Reviews
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.
Kazhdan–Lusztig -polynomials for pircons
Mario Marietti
Dipartimento di Ingegneria Industriale e Scienze Matematiche, Università Politecnica delle Marche, Via Brecce Bianche, 60131 Ancona, Italy
Abstract.
The purpose of this work is to provide a common combinatorial framework for some of the analogues and generalizations of Kazhdan–Lusztig -polynomials that have appeared since the introduction of these remarkable polynomials (e.g., parabolic Kazhdan–Lusztig -polynomials, Kazhdan–Lusztig -polynomials of zircons, and Kazhdan–Lusztig–Vogan polynomials for fixed point free involutions).
Key words and phrases:
Kazhdan–Lusztig polynomials, Coxeter groups, Special matchings
2010 Mathematics Subject Classification:
05E99, 20F55
††© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
The final publication is available at: https://doi.org/10.1016/j.jalgebra.2019.05.038
1. Introduction
Kazhdan–Lusztig -polynomials play a central role in Lie theory and representation theory. They are polynomials , in one variable , which are associated with pairs of elements in a Coxeter group . As well as the celebrated Kazhdan–Lusztig -polynomials, they were introduced by Kazhdan and Lusztig in [15] in order to study the (now called) Kazhdan–Lusztig representations of the Hecke algebra of . These polynomials have soon found applications in many other contexts.
Since their introduction, Kazhdan–Lusztig -polynomials have been studied a lot. There is an enormous literature on these polynomials and related objects. In particular, there are several works on analogues and generalizations of Kazhdan–Lusztig -polynomials. The purpose of this work is to provide a common combinatorial framework for some of these analogues and generalizations. For example, parabolic Kazhdan–Lusztig -polynomials (see [10]), Kazhdan–Lusztig -polynomials of diamonds and zircons (see [6] and [16], respectively), and Kazhdan–Lusztig–Vogan -polynomials for fixed point free involutions (which are the Kazhdan–Lusztig–Vogan -polynomials associated with the action of on the flag variety of , see [2]) lie within this framework.
Let us present this general setting. In [1], Abdallah, Hansson, and A. Hultman introduce a generalization of the concept of a zircon, which they call a pircon since pircons relate to special partial matchings in the same way as zircons relate to special matchings. A pircon is a partially ordered set such that, for every non minimal element , the subposet , denoted , is finite and admits a special partial matching. Special partial matchings are a generalization of special matchings (see Section 2) and were introduced in [2] in order to study the Kazhdan–Lusztig–Vogan -polynomials for fixed point free involutions. For each non minimal element , we may fix a special partial matching of and call the pair a refined pircon. For each refined pircon, we define two families and of polynomials in one variable , which are associated with pairs of elements . We call these polynomials the Kazhdan–Lusztig -polynomials of the refined pircon. Note that, in general, Kazhdan–Lusztig -polynomials do depend on the refinement of the pircon . When is a refined zircon, a diamond, or a Coxeter group (partially ordered by Bruhat order), the two families and coincide, and are actually the Kazhdan–Lusztig -polynomials of as a refined zircon, a diamond, or a Coxeter group, respectively. When is the set of minimal coset representatives of left cosets of a parabolic subgroup in a Coxeter group , the two families and are the parabolic Kazhdan–Lusztig -polynomials of type and , respectively. When is the set of twisted identities of the symmetric group , the two families and are the Kazhdan–Lusztig -polynomials and -polynomials for fixed point free involutions.
2. Notation, definitions and preliminaries
This section reviews the background material that is needed in the rest of this work. We follow [19, Chapter 3] and [3] for undefined notation and terminology concerning, respectively, partially ordered sets and Coxeter groups.
2.1. Special matchings and special partial matchings.
Let be a partially ordered set (poset for short). An element covers if the interval coincides with ; in this case, we write as well as . If has a minimum (respectively, a maximum), we denote it by (respectively, ). The poset is graded if has a minimum and there is a function (the rank function of ) such that and for all with . (This definition is slightly different from the one given in [19], but is more convenient for our purposes.) The Hasse diagram of is any drawing of the graph having as vertex set and \{\{x,y\}\in\binom{P}{2}\colon\,\text{ either x\lhd yy\lhd x}\} as edge set, with the convention that, if , then the edge goes upward from to . When no confusion arises, we make no distinction between the Hasse diagram and its underlying graph.
A matching of a poset is an involution such that is an edge in the Hasse diagram of , for all . A matching of is special if
[TABLE]
for all such that .
The following definitions are taken from [16], [2], and [1], respectively. Given a poset and , we set .
Definition 2.1**.**
A poset is a zircon provided that, for every non-minimal element , the order ideal is finite and admits a special matching.
Definition 2.2**.**
Let be a finite poset with . A special partial matching of is an involution such that
- •
,
- •
for all , we have , , or , and
- •
if and , then .
Definition 2.3**.**
A poset is a pircon provided that, for every non-minimal element , the order ideal is finite and admits a special partial matching.
The terminology comes from the fact that a special partial matching without fixed points is precisely a special matching and the fact that pircons relate to special partial matchings in the same way as zircons relate to special matchings. Connected zircons and pircons are graded posets (the argument for the zircons in [13, Proposition 2.3] applies also to pircons). We always denote the rank function by .
Given a poset and , we say that is a matching of if is a matching of , and we denote by the set of all special partial matchings of . Hence, if is a pircon then for all . In pictures, we visualize a special partial matching of a poset by taking the Hasse diagram of and coloring in the same way, for all , either the edge if , or a circle around if . An example is in Figure 1, where the special partial matching is colored in dashed black and fixes only the bottom element .
For a proof of the following result, see [1, Lemma 5.2].
Lemma 2.4** (Lifting property of special partial matchings).**
Let be a finite poset with , and be a special partial matching of . If with and , then
- (i)
,
- (ii)
, and
- (iii)
.
Given a finite poset , we denote by its order complex, which is the simplicial complex whose faces are the chains in . As usual, for , we write for . The following is Theorem 6.4 of [1] (we refer the reader to [1, Section 2.3] for a brief account on PL topology).
Theorem 2.5**.**
Let be a pircon and with . Then is a PL ball or a PL sphere. Moreover, there exist , , such that is a ball if and only if is not a zircon.
2.2. Coxeter groups
We fix our notation on a Coxeter system in the following list:
\begin{array}[]{@{\hskip-1.3pt}l@{\qquad}l}m(s,t)&\textrm{the entry of the Coxeter matrix of (W,S)(s,t)\in S\times S},\\ e&\textrm{identity of W},\\ \ell&\textrm{the length function of (W,S)},\\ T&=\{wsw^{-1}:w\in W,\;s\in S\},\textrm{ the set of {\em reflections} of W},\\ D_{R}(w)&=\{s\in S:\;\ell(ws)<\ell(w)\},\textrm{ the right descent set of w\in W},\\ D_{L}(w)&=\{s\in S:\;\ell(sw)<\ell(w)\},\textrm{ the left descent set of w\in W},\\ W_{J}&\textrm{ the parabolic subgroup of WJ\subseteq S},\\ W^{J}&=\{w\in W\,:\;D_{R}(w)\subseteq S\setminus J\},\textrm{ the set of minimal left coset representatives},\\ {}^{J}W&=\{w\in W\,:\;D_{L}(w)\subseteq S\setminus J\},\textrm{ the set of minimal right coset representatives},\\ \leq&\textrm{ Bruhat order on WP)},\\ \textrm{[u,v]}&=\{w\in W\,:\;u\leq w\leq v\},\textrm{ the (Bruhat) interval generated by u,v\in W},\\ w_{0}(J)&\textrm{ the unique maximal element of [e,w]\cap W_{J}J\subseteq S},\\ w_{0}(s,t)&=w_{0}(\{s,t\}),\textrm{ for s,t\in S},\\ \textrm{ [u,v]^{H}}&=\{z\in W^{H}:\;u\leq z\leq v\},\textrm{ the parabolic (Bruhat) interval generated by u,v\in W^{H}}.\par\end{array}
We make use of the symbol “-” to separate letters in a word in the alphabet when we want to stress the fact that we are considering the word rather than the element that such word represents.
If , then a reduced expression for is a word such that and . When no confusion arises, we also write that is a reduced expression for .
The Coxeter group is partially ordered by Bruhat order (see, for example, [3, Section 2.1] or [14, Section 5.9]), which we denote by . The Bruhat order (sometimes also called Bruhat-Chevalley order) is the partial order whose covering relation is as follows: if , then if and only if and . The Coxeter group , partially ordered by Bruhat order, is a graded poset having as its rank function.
The following well-known characterization of Bruhat order is usually referred to as the Subword Property (see [3, Section 2.2] or [14, Section 5.10]), and is used repeatedly in this work, often without explicit mention. By a subword of a word , we mean a word of the form , where .
Theorem 2.6** (Subword Property).**
Let . Then the following are equivalent:
- •
* in the Bruhat order,*
- •
every reduced expression for has a subword that is a reduced expression for ,
- •
there exists a reduced expression for having a subword that is a reduced expression for .
The following results are well known (see, e.g., [9, Theorem 1.1], [3, Proposition 2.2.7] or [14, Proposition 5.9] for the first one, and [3, Section 2.4] or [14, Section 1.10] for the second one).
Lemma 2.7** (Lifting Property).**
Let and , with .
If and then . 2. -
If and then . 3. -
If and then and .
Symmetrically, left versions of the three statements hold.
Proposition 2.8**.**
Let .
- (i)
Every has a unique factorization with and ; for this factorization, . 2. (ii)
Every has a unique factorization with , ; for this factorization, .
Note that implies both and .
The Hecke algebra of W, denoted , is the -algebra generated by subject to the braid relations
[TABLE]
and the quadratic relations
[TABLE]
For , denote by the product , where is a reduced expression for . The element is independent from the chosen reduced expression. The Hecke algebra is the free -module having the set as a basis and multiplication uniquely determined by
[TABLE]
for all and .
Recall that, given , we say that is a matching of if is a matching of the lower Bruhat interval . For , we have a matching of defined by , for all . Symmetrically, for , we have a matching of defined by , for all . By the Lifting Property (Lemma 2.7), such and are special matchings of . We call these matchings, respectively, right and left multiplication matchings.
We refer to [7] and [8] for more details concerning special matchings of Coxeter systems.
3. Orbits in pircons
In this section, we provide some easy results on pircons that are needed later.
We say that an interval in a poset is dihedral if it is isomorphic to an interval in a Coxeter group with two Coxeter generators, ordered by Bruhat order (see Figure 2).
The proof of the following result is straightforward from the Lifting Property of special partial matchings (Lemma 2.4).
Lemma 3.1**.**
Let be a special partial matching of a poset , and , with . If and , then restricts to a partial matching of the interval (which is special if and only if ).
Given a pircon and two special partial matchings and of , we denote by the group of permutations of generated by and . Furthermore, we denote by the orbit of an element under the action of .
We say that an orbit of the action of is
- •
dihedral, if is isomorphic to a dihedral interval and for all ,
- •
chain-like, if is isomorphic to a chain, , and .
Note that an orbit with two elements and is dihedral, whereas an orbit with two elements and is chain-like (see Figure 4). This is the only case when a dihedral orbit and a chain-like orbit are isomorphic as posets.
Lemma 3.2**.**
Fix a pircon . Let and be two special partial matchings of an element in . Every orbit of is either dihedral or chain-like.
Proof.
Fix an orbit and let be a maximal element in .
Suppose and . If then is a dihedral orbit of rank 1; otherwise and by the definition of a special partial matching. If then is a dihedral orbit of rank 2; otherwise and by the definition of a special partial matching. We iterate this argument and obtain a dihedral orbit of rank , where is the smallest number such that \underbrace{\cdots MNM}_{\text{r letters}}(z)=\underbrace{\cdots NMN}_{\text{r letters}}(z).
Suppose that one of the two matching fixes , say . If then is a chain of rank 0; otherwise . If then is a chain of rank 1; otherwise by the definition of a special partial matching.
If then is a chain of rank 2. Otherwise we claim that . Indeed, suppose by contradiction that : by the definition of a special partial matching and so . Again by the definition of a special partial matching, and so . The last covering relation is in contradiction with the fact that is a maximal element in .
We iterate this argument and obtain a chain-like orbit of rank , where is the smallest number such that \underbrace{\cdots MNM}_{\text{r letters}}(z)=\underbrace{\cdots NMN}_{\text{r letters}}(z). ∎
Lemma 3.3**.**
Fix a pircon . Let and be two special partial matchings of an element in . Every orbit of is an interval in , i.e. .
Proof.
Fix an orbit and, by contradiction, suppose . Let be an element that is covered by some element, say , in . Since , Lemma 3.2 implies that must go down with one of the two matchings, say , and the definition of a special partial matching implies and . If then and the definition of a special partial matching implies and . By iteration, we find a number and a chain z=z_{0}\rhd z_{1}=M(z)\rhd z_{2}=NM(z)\rhd\cdots\rhd z_{k-1}=\underbrace{\cdots MNM}_{\text{(k-1) letters}}(z)\rhd z_{k}=\underbrace{\cdots MNM}_{\text{k letters}}(z) with for all , , and . This is a contradiction since both and restrict to matchings of by Lemma 3.1. ∎
Notice that Lemma 3.3 for dihedral (whose order complex is well known to be a PL sphere) follows also by Theorem 2.5, since a PL sphere can be a proper subcomplex neither of another PL sphere of the same dimension, nor of a PL ball of the same dimension.
4. Hecke algebra actions
In this section, we introduce certain representations of Hecke algebras with two generators, which are needed in Section 5.
Let be the dihedral Coxeter group with Coxeter generators and subject to the relation given by . Let and be the free -module with as a basis.
Let . We set and to be the unique endomorphisms of satisfying
[TABLE]
and
[TABLE]
for every basis element . The endomorphisms and are defined analogously.
For , we denote by the unique element in of length : . Thus , and
- •
L_{s}(m_{w_{p}})=\left\{\begin{array}[]{ll}q\,m_{w_{p-1}}+(q-1)\,m_{w_{p}},&\mbox{if p\in[1,d-1],;p\text{ odd},}\\ m_{w_{p+1}},&\mbox{if p\in[0,d-1),;p\text{ even},}\\ x\,m_{w_{p}},&\mbox{if p=d-1,;p\text{ even},}\end{array}\right.
- •
L_{r}(m_{w_{p}})=\left\{\begin{array}[]{ll}q\,m_{w_{p-1}}+(q-1)\,m_{w_{p}},&\mbox{if p\in(0,d-1],;p\text{ even},}\\ m_{w_{p+1}},&\mbox{if p\in[1,d-1),;p\text{ odd},}\\ x\,m_{w_{p}},&\mbox{if either p=0p=d-1\text{ with odd},}\end{array}\right.
- •
\Gamma_{s}(m_{w_{p}})=\left\{\begin{array}[]{ll}m_{w_{p-1}},&\mbox{if p\in[1,d-1],;p\text{ odd},}\\ q\,m_{w_{p+1}}+(q-1)\,m_{w_{p}},&\mbox{if p\in[0,d-1),;p\text{ even},}\\ x\,m_{w_{p}},&\mbox{if p=d-1,;p\text{ even},}\end{array}\right.
- •
\Gamma_{r}(m_{w_{p}})=\left\{\begin{array}[]{ll}m_{w_{p-1}},&\mbox{if p\in(0,d-1],;p\text{ even},}\\ q\,m_{w_{p+1}}+(q-1)\,m_{w_{p}},&\mbox{if p\in[1,d-1),;p\text{ odd},}\\ x\,m_{w_{p}},&\mbox{if either p=0p=d-1\text{ with odd}.}\end{array}\right.
Furthermore, we define an involutive automorphism of by letting , and we set
[TABLE]
Note that , for all even .
Theorem 4.1**.**
The following two diagrams are commutative:
{\mathfrak{M}^{H}}$${\mathfrak{M}^{H}}$${\mathfrak{M}^{H}}$${\mathfrak{M}^{H}}$$\scriptstyle{I}$$\scriptstyle{L_{s}}$$\scriptstyle{\Gamma_{\bar{s}}}$$\scriptstyle{I}
{\mathfrak{M}^{H}}$${\mathfrak{M}^{H}}$${\mathfrak{M}^{H}}$${\mathfrak{M}^{H}}$$\scriptstyle{I}$$\scriptstyle{L_{r}}$$\scriptstyle{\Gamma_{\bar{r}}}$$\scriptstyle{I}
Moreover, is an -module with and acting as and .
Proof.
Let us show that , for all . We have
I\circ L_{s}(m_{w_{p}})=\left\{\begin{array}[]{ll}q\,m_{w_{d-p}}+(q-1)\,m_{w_{d-p-1}},&\mbox{if p\in[1,d-1],;p\text{ odd},}\\ m_{w_{d-p-2}},&\mbox{if p\in[0,d-1),;p\text{ even},}\\ x\,m_{w_{d-p-1}},&\mbox{if p=d-1,;p\text{ even}.}\end{array}\right.
If is even, then and . Thus
[TABLE]
namely
[TABLE]
since is odd.
If is odd, then and . Thus
[TABLE]
namely
[TABLE]
since is even. Therefore, the first diagram is commutative.
The argument to show that also the second diagram is commutative is entirely similar and left to the reader.
The last statement follows by the commutativity of the above diagrams, since and define a Hecke algebra action by Corollary 2.3 of [10] and is an isomorphism (note that there is a misprint in the definition of at page 485 of [10]). ∎
Recall that, given a pircon and , we denote by the set of all special partial matchings of . Notice that, if , then the orbit is dihedral by the definition of a special partial matching and Lemma 3.2. The following definition is a generalization of [6, Definition 3.1].
Definition 4.2**.**
Let be a pircon, , and . We say that and are strictly coherent provided that
- •
the rank of divides the rank of , if is a dihedral interval,
- •
the rank of plus 1 divides the rank of , if is a chain,
for every orbit of . Moreover, if is a set of special partial matchings, then we say that and are -coherent provided that has a sequence of special partial matchings of such that , , and and are strictly coherent for all . For short, we write coherent instead of -coherent.
Given a pircon , , and , we denote by the Coxeter system whose Coxeter generators are and subject to the relation given by . For every orbit of , we denote by the free -module with as a basis:
Theorem 4.3**.**
Given a pircon and , let and be an orbit of . If and are strictly coherent, then is a module over the Hecke algebra with
[TABLE]
and
[TABLE]
for all .
Proof.
By Lemma 3.2, the orbit can be either dihedral or chain-like. If is dihedral then we can proceed in a similar way as in [6, Section 3]. So we assume that is chain-like; let be its rank and suppose (without loss of generality) that .
Recall that we denote by the dihedral Coxeter group with Coxeter generators and subject to the relation given by . Let and be the free -module with as a basis. The two modules and are isomorphic and we identify them through the isomorphism sending to . Since and are strictly coherent, divides ; so we have a morphism of Hecke algebras:
[TABLE]
The pullback of the representation of Theorem 4.1 is the desired representation. ∎
5. Kazhdan–Lusztig -polynomials for pircons
In this section, we introduce and study the Kazhdan–Lusztig -polynomials of a pircon . The construction mimics that of [6, Section 3], but the proofs in this general setting are more complicated and use the results in Sections 3 and 4. Furthermore, for each , there are possibly many different families of Kazhdan–Lusztig -polynomials attached to a pircon .
By the definition of a pircon, we can fix a special partial matching of , for each . If is the set of such fixed special partial matchings, then we call the pair a refined pircon and a refinement of .
Definition 5.1**.**
Let . Let be a refined pircon, where . The family of Kazhdan–Lusztig -polynomials of (or -polynomials for short) is the unique family of polynomials satisfying the following recursive property and initial conditions:
[TABLE]
and for all .
Notice that
[TABLE]
so the -polynomials are the -polynomials in whose recursion is appearing whereas the -polynomials are the -polynomials in whose recursion is appearing. The (at first glance unnatural) choice follows the usual terminology for the parabolic Kazhdan–Lusztig -polynomials (see Subsection 6.2). The two families of parabolic Kazhdan–Lusztig -polynomials and -polynomials are associated with two modules, usually denoted and , respectively. For these two modules, the adopted notation is more natural than the opposite one.
The two families of -polynomials satisfy the following properties.
Proposition 5.2**.**
Let be a refined pircon with rank function . If , then
- (1)
, 2. (2)
, 3. (3)
**
Proof.
The first two statements are straighforward by Definition 5.1. For the third, we need to show that the polynomials , for , satisfy the recursive property and the initial conditions in Definition 5.1. This easy computation is left to the reader. ∎
Let be a refined pircon and . Mimicking [17, Subsection 4.1], we say that a special partial matching of calculates the Kazhdan–Lusztig -polynomials of (or is calculating, for short) provided that, for all , , the following holds:
[TABLE]
Thus the matchings of are calculating by definition.
Remark 5.3*.*
In general, the Kazhdan–Lusztig -polynomials of a refined pircon depend on the refinement . For example, let be the pircon in Figure 5, and let and be any two refinements of such that contains the dashed special partial matching while contains the solid special partial matching.
No matter what the other special partial matchings in and are, the Kazhdan–Lusztig -polynomial of is and the Kazhdan–Lusztig -polynomial of is . Therefore, the dashed matching does not calculate the Kazhdan–Lusztig -polynomials of and the solid matching does not calculate the Kazhdan–Lusztig -polynomials of . Notice that the dashed matching and the solid matching are not coherent.
Definition 5.4**.**
Let be a refined pircon and . We say that a special partial matching of is strongly calculating provided that the restriction of to is calculating for all such that and .
Notice that, by Lemma 3.1, the restriction of to is indeed a special partial matching for all such that .
Theorem 5.5**.**
Let be a refined pircon, , and be a special partial matching of . Suppose that
- •
the restriction of to is calculating, for all such that and , and
- •
there exists a strongly calculating special partial matching of that is strictly coherent with .
Then is strongly calculating.
Proof.
By hypothesis, the restriction of to is calculating, for all such that and . Hence, we only need to show that is calculating: if we fix , with , then we need to prove
[TABLE]
Let be the rank of and be the orbit . Recall from Section 4 that denotes the Coxeter system whose Coxeter generators are and subject to the relation given by , and that denotes the free -module with as a basis.
By Theorem 4.3, is a -module with and acting as follows:
[TABLE]
and
[TABLE]
for all (recall (5.2)).
Given and , we denote by the polynomial , provided that . In this notation, (5.3) can be reformulated as . Since is calculating, , and hence we are done if we prove
[TABLE]
For all such that , the matching restricts to a special partial matching of , which is calculating (by hypothesis). If , then
[TABLE]
and
[TABLE]
Hence
[TABLE]
for all and all such that . Since is strongly calculating, an analogous computation yields
[TABLE]
for all and all such that . An alternated use of these two formulae implies
[TABLE]
and
[TABLE]
Since and , the desired equality
[TABLE]
holds. ∎
Definition 5.6**.**
We say that is a pircon system provided that
- (1)
is a pircon, 2. (2)
3. (3)
for all , there exists such that is defined and , 4. (4)
for all and all such that and are defined and satisfy and , the restrictions of and to are -coherent.
Theorem 5.5 implies the following result.
Corollary 5.7**.**
Let be a pircon system and . All refinements of , with , yields the same family of Kazhdan–Lusztig -polynomials (for which, all matchings in are strongly calculating).
Proof.
First note that, if is a pircon system, then also is a pircon system, where is the set of special partial matchings obtained from by adding all restrictions of to , for all and such that and . Thus, we may suppose that is closed under taking such restrictions, i.e. .
Choose an arbitrary refinement of , with (whose existence is assured by (3) of Definition 5.6). We need to show that all special partial matchings of belonging to are calculating, for all . We use induction on , the case being clear (as before, denotes the rank function of ).
Suppose . Let be a special partial matching of and denote by the unique special partial matching of belonging to . If , then the assertion is clear since is calculating by definition. Otherwise, and are -coherent.
Suppose first that and are strictly coherent. By the induction hypothesis and the fact that holds, the restriction of to is calculating, for all such that and , and, moreover, is strongly calculating. Thus, we can apply Theorem 5.5, which implies that is calculating.
If and are not strictly coherent, we can conclude by transitivity, since and are -coherent. ∎
Definition 5.8**.**
A pircon is a dircon provided that any two special partial matchings are coherent, for all .
In other words, a pircon is a dircon if and only if is a pircon system. By Corollary 5.7, for both and , a dircon has a unique family of Kazhdan–Lusztig -polynomials.
The terminology comes from the fact that dircons relate to pircons in the same way as diamonds relate to zircons (see [6, Definition 3.2]).
6. Applications
In this section, we show that examples of Kazhdan–Lusztig -polynomials of pircons include Kazhdan–Lusztig–Vogan and -polynomials for fixed point free involutions and parabolic Kazhdan–Lusztig polynomials of Coxeter groups.
6.1. Kazhdan–Lusztig–Vogan -polynomials for fixed point free involutions
The orbits of the action of on the flag variety of are parametrized by the set of fixed point free involutions in the symmetric group , or, equivalently, by the set of twisted identities, where is the involutive automorphism of sending to , for all (here denotes the simple transposition , for all ). Note that for all , where is the longest permutation, i.e. the reverse permutation sending to , for all . The set of twisted identities is endowed with a poset structure induced by the Bruhat order (all covering relations in this subsection refer to the induced poset structure). In this setting, the associated Kazhdan–Lusztig–Vogan -polynomials are indexed by pairs of elements in and are uniquely determined by the following recursive formula and initial values (see [12, Proposition 5.1]).
Proposition 6.1**.**
The family of Kazhdan–Lusztig–Vogan -polynomials for fixed point free involutions satisfies the following properties:
- •
,
- •
* if ,*
- •
if then
[TABLE]
where for all .
A similar result holds for the associated Kazhdan–Lusztig–Vogan -polynomials (see [12, Proposition 5.3]). We refer the reader to [2] for more details on this subject.
We want to show that the Kazhdan–Lusztig–Vogan -polynomials and -polynomials for fixed point free involutions lie in the theory of Kazhdan–Lusztig -polynomials of pircons. Indeed, we have the following result.
Theorem 6.2**.**
The poset is a dircon. Furthermore, the Kazhdan–Lusztig–Vogan -polynomials and -polynomials for fixed point free involutions coincide, respectively, with the Kazhdan–Lusztig -polynomials and -polynomials of as a dircon.
In order to prove Theorem 6.2, we need some preliminary observations. We refer to [2] for more details concerning the set of twisted identities and its special partial matchings. As proved in [2, Theorem 4.3], given and , the map is a special partial matching of the lower interval of . Following [2], we call a special partial matching of this form a conjugation special partial matching.
Lemma 6.3**.**
Let , and and be two distinct conjugation special partial matchings of , say and for all . If (respectively, ) then any orbit of the action of is of one of the types in Figure 6 (respectively, Figure 7), where and are colored in solid and dashed black.
Proof.
If then ; therefore and commute since for all . If then ; therefore since
[TABLE]
for all . The result follows by Lemma 3.2. ∎
Proposition 6.4**.**
Let , and and be two distinct conjugation special partial matchings of . Then and are strictly coherent if and only if .
Proof.
Straightforward by Lemma 6.3. ∎
Proof of Theorem 6.2.
Let and : we need to show that and are coherent. Clearly, we may assume ( being the rank function of ). If is not a conjugation special partial matching, then there exists a conjugation special partial matching of commuting with such that (see Proposition 4.8 of [2]); hence is a dihedral orbit of rank 2, while every other orbit is dihedral of rank 1 or 2 (indeed, it cannot be chain-like since and have no fixed points, again by Proposition 4.8 of [2]). Therefore, and are strictly coherent. So we may assume that and are both conjugation special partial matchings (say and , for all such that ), and that by Proposition 6.4.
Let and . If commutes with one among and , then by Lemma 6.3. Hence is a conjugation special partial matching of ; since is strictly coherent with both and by Proposition 6.4, and are coherent. Thus we are reduced to the case where and holds for a certain . But this is impossible since implies
[TABLE]
and hence .
In order to show that the Kazhdan–Lusztig–Vogan -polynomials and -polynomials coincide with the Kazhdan–Lusztig -polynomials and -polynomials of as a dircon, compare (5.1) with (6.1) and [12, Proposition 5.3]. ∎
6.2. Parabolic Kazhdan–Lusztig polynomials of a Coxeter system
In this subsection, we fix an arbitrary Coxeter system and a subset . The Bruhat order on induces an ordering on the set of minimal coset representatives and, for all , on the parabolic interval .
For the reader’s convenience, we recall the following theorem (see [10, Sections 2 and 3] for a proof).
Theorem 6.5**.**
Let . Then there is a unique family of polynomials such that, for all :
- (1)
* if ;* 2. (2)
; 3. (3)
if and , then
[TABLE]
Moreover, there is a unique family of polynomials , such that, for all :
- (1)
* if ;* 2. (2)
; 3. (3)
deg, if ; 4. (4)
**
The polynomials and are the parabolic Kazhdan–Lusztig -polynomials and parabolic Kazhdan–Lusztig polynomials of of type . If then and are the ordinary Kazhdan–Lusztig -polynomials and Kazhdan–Lusztig polynomials of .
Remark 6.6*.*
The parabolic Kazhdan–Lusztig -polynomials and the parabolic Kazhdan–Lusztig polynomials are equivalent. More precisely, given , one can compute the family once one knows the family , and vice versa.
Let . As in [17, 18], we say that a special matching of is -special provided that
[TABLE]
Note that a -special matching is a special matching and that a left multiplication matching is -special for all .
The following lemmas are needed in the proof of the main result of this subsection.
Lemma 6.7**.**
Let be a Coxeter system. Fix . The Hasse diagram of cannot have the following configuration as a subdiagram:
[TABLE]
with and .
Proof.
Since , the element has a right descent in and admits a reduced expression with . We can obtain a reduced expression for by deleting 2 appropriate letters in the reduced expression for ; one of these letters must be since . Evidently and we may assume . Since , up to changing the chosen reduced expression of , we may assume . Hence . Since , the Lifting Property applied to the multiplication on the right by implies , and so . The Lifting Property (applied to to the multiplications on the right by and ) also implies . Since cannot simultaneously be equal to and , by the Lifting Property , and so cannot be in . ∎
Lemma 6.8**.**
Let be a Coxeter system. Fix , , and two -special matchings of . Let be an orbit of with bottom element . Then can be either
- (1)
the empty set, or 2. (2)
the entire orbit , or 3. (3)
the singleton , or 4. (4)
the chain , for an appropriate coatom of the top element of ,
where, for all , we denote by the unique saturated chain from to such that, for any two of its elements with , either , or .
Proof.
Suppose that . Let be a maximal element in . Clearly cannot be the bottom element of ; by definition of -special, cannot be the top element (otherwise ) and is contained in . It remains to show that is a coatom of the top element of . This follows from Lemma 6.7. ∎
Following [17, Subsection 4.1], for convenience’ sake we say that an -special matching of calculates the parabolic Kazhdan–Lusztig -polynomials (or is calculating, for short) if, for all , , we have
[TABLE]
For this definition, it is essential that the special matching be -special. Note that all left multiplication matchings are calculating.
The main result of [18] is the following.
Theorem 6.9**.**
Let be an -special matching of . The parabolic Kazhdan–Lusztig -polynomial satisfies:
[TABLE]
By [1, Theorem 7.7], the parabolic quotient is a pircon.
Proposition 6.10**.**
Let . An -special matching of gives rise to a special partial matching of , which is defined as follows:
[TABLE]
for all .
Proof.
The first two properties in Definition 2.2 are trivial. Let us prove the third one. Let and .
Suppose that . If or , then clearly . If then since is a special matching.
Suppose that . By the definition of a special matching, and , and we are done since and .
Suppose that . By the definition of , we have . We are done if we show that it is not possible that . Indeed, this is not possible since, otherwise, would cover both and by the definition of a special matching, but an element outside has at most one coatom in (see [17, Lemma 4.1]). ∎
Let be the set of all special partial matchings that are obtained from -special matchings by the recipe of Proposition 6.10:
[TABLE]
Theorem 6.11**.**
If is a simply laced Coxeter group, then is a pircon system. Furthermore, for both and , the parabolic Kazhdan–Lusztig -polynomials coincide with the Kazhdan–Lusztig polynomials of as a pircon.
Proof.
Let us prove that is a pircon system. The only nontrivial property in Definition 5.6 is the last one. Fix . Let and be two special partial matchings (obtained from the two special matchings and ) such that and are defined and satisfy and . For short, we denote the restrictions of the matchings and with the same letters and . (Actually, the restriction of a special partial matching obtained from an -special matching is the special partial matching obtained from the -special matching given by the restriction of ).
If both and are left multiplication matchings, then all orbits of in are dihedral intervals of the same rank ; furthermore, is a dihedral interval of rank and, by Lemma 6.8, any other orbit of is either
- •
a dihedral orbit of rank d, or
- •
a chain-like orbit of rank 0, or
- •
a chain-like orbit of rank ,
and and are strictly coherent.
If is not a left multiplication matching, then by [17, Corollary 3.8] there exists a left multiplication matching (which, being a left multiplication matching, is -special) that commutes with and such that does not agree with on . (We stress the fact that [17, Corollary 3.8] requires the hypothesis that is simply laced). Consider , the special partial matching of obtained from . Notice that . All orbits of in are dihedral intervals of rank 2 or 1; by Lemma 6.8, an orbit which is a dihedral interval of rank 2 or 1 gives rise to an orbit of which is either
- •
the empty set, or
- •
a dihedral interval of rank 2 or 1, or
- •
a chain of rank or [math].
Since and do not agree on , the orbit is a dihedral interval of rank 2 and so and are strictly coherent.
If is a left multiplication matching, then the sequence is a sequence of strictly coherent special partial matchings. If is not a left multiplication matching, we apply the same argument and find a left multiplication matching whose associated special partial matching belongs to and is strictly coherent with . If , then the sequence is a sequence of strictly coherent special partial matchings. If , then the sequence is a sequence of strictly coherent special partial matchings.
The last assertion now follows by Theorem 6.9. ∎
Remark 6.12*.*
Theorem 6.11 does not hold without the assumption that is simply laced. For example, if
- •
is a Coxeter group with generator set and relations , , ,
- •
,
- •
,
then , and has exactly three -special matchings. Since all of them send to , no two of the associated special partial matchings of are coherent. Moreover, one can easily check that there are no other special partial matchings of , and therefore is not a dircon.
Problem 6.13**.**
Let be a Coxeter system, , and . When is a dircon?
Notice that, in general, not all special partial matchings of come from -special matchings of (even under the hypothesis is simply laced).
From a combinatorial point of view, the most intriguing conjecture about (classical) Kazhdan–Lusztig polynomials of Coxeter groups is the Combinatorial Invariance Conjecture of Kazhdan–Lusztig polynomials, which was independently formulated by Lusztig in private and by Dyer in [11].
Conjecture 6.14**.**
Let be a Coxeter system, and . The (classical) Kazhdan–Lusztig polynomial depends only on the isomorphism class of the interval as a poset.
The Combinatorial Invariance Conjecture of Kazhdan–Lusztig polynomials is equivalent to the analogous conjecture on the combinatorial invariance of Kazhdan–Lusztig -polynomials, and is still very much open (see [5] for a partial result). The problem of the combinatorial invariance of parabolic Kazhdan–Lusztig polynomials, which is clearly stronger than the combinatorial invariance of the ordinary Kazhdan–Lusztig polynomials, also attracted much attention but has only recently been found to be false (see [17] for a counterexample by Mongelli and [17, 18] for more details on this subject). For pircons, counterexamples already exist in small pircons: the two intervals and in the pircon of Example 7.2 are both chains of length 3 and have different Kazhdan–Lusztig -polynomials:
[TABLE]
7. Pircons and Stanley’s kernels
After introducing the Kazhdan–Lusztig -polynomials of a refined pircon , it is natural to look for the analog of the Kazhdan–Lusztig polynomials in this general context. Since, for Coxeter groups, these are the Kazhdan–Lusztig–Stanley polynomials of the Kazhdan–Lusztig -polynomials, one might want to define the Kazhdan–Lusztig polynomials of a refined pircon as the Kazhdan–Lusztig–Stanley polynomials of the Kazhdan–Lusztig -polynomials of . Unfortunately, in general, the Kazhdan–Lusztig–Stanley polynomials of the Kazhdan–Lusztig -polynomials of a refined pircon do not exist.
Let us briefly recall from [20] the definition of -kernel and Kazhdan–Lusztig–Stanley polynomials.
Let be a locally finite graded poset, with rank function . The incidence algebra of over the polynomial ring , denoted , is the associative algebra of functions assigning to each nonempty interval an element (denoted also simply by when no confusion arises) with usual sum and convolution product: and , for all and all with . The identity element of is the delta function , defined by \delta_{u,v}=\left\{\begin{array}[]{ll}1&\text{if u=v,}\\ 0&\text{if u<v.}\end{array}\right. An element is invertible if and only if for all . By convention, for all , we let whenever . We say that is unitary if , for all . Let
- •
I^{\prime}(P)=\{f\in I(P):\deg f_{u,v}\leq\rho(v)-\rho(u),\text{ for all u,v\in Pu\leq v}\},
- •
I_{\frac{1}{2}}(P)=\{f\in I^{\prime}(P)\text{ unitary}:\deg f_{u,v}<\frac{1}{2}(\rho(v)-\rho(u)),\text{ for all u,v\in Pu<v}\}.
Note that is a subalgebra of , closed under taking inverse. Given , we denote by the element of such that , for all with . Notice that the map is an involution on .
A unitary element is a -kernel if there exists an invertible element such that . Such an element is called invertible -totally acceptable function in [20]. See [20, Theorem 6.5, Proposition 6.3, Corollary 6.7] for a proof of the next result.
Theorem 7.1**.**
Let be a locally finite graded poset.
- (1)
A unitary is a -kernel if and only if . 2. (2)
There is a bijection from the set of -kernels of to that assigns to an invertible -totally acceptable function.
Let be a -kernel. Following [4], we refer to the unique invertible -totally acceptable function of as the Kazhdan–Lusztig–Stanley polynomials of .
As shown in [20, Sections 6 and 7], Kazhdan–Lusztig–Stanley polynomials specialize to many interesting objects. As an example, the Kazhdan–Lusztig -polynomials of a Coxeter group form a -kernel whose Kazhdan–Lusztig–Stanley polynomials are the Kazhdan–Lusztig polynomials of . More generally, for and , the parabolic Kazhdan–Lusztig -polynomials of form a -kernel whose Kazhdan–Lusztig–Stanley polynomials are the parabolic Kazhdan–Lusztig -polynomials of (see [10, Lemma 2.8 (iv) and Proposition 3.1]).
Unfortunately, as shown in Example 7.2, in general the Kazhdan–Lusztig -polynomials of a refined pircon do not form a -kernel. Therefore, there are no Kazhdan–Lusztig–Stanley polynomials associated with them.
Example 7.2**.**
Let be the pircon in the first picture of Figure 8, with the structure of a refined pircon given by the special partial matchings depicted in the other pictures.
Using the recursive formula (5.1), we can compute all Kazhdan–Lusztig -polynomials of this refined pircon. In particular,
[TABLE]
so the -polynomials of this refined pircon do not form a -kernel.
Acknowledgements: I am grateful to the anonymous referee for the valuable suggestions, which provided insights that helped improve the paper.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] N. Abdallah, M. Hansson, A. Hultman, Topology of posets with special partial matchings , Advances in Math. 348 (2019), 255-276.
- 2[2] N. Abdallah, A. Hultman, Combinatorial invariance of Kazhdan–Lusztig–Vogan polynomials for fixed point free involutions , J. Algebr. Comb. 47 (2018), 543-560.
- 3[3] A. Björner, F. Brenti, Combinatorics of Coxeter Groups , Graduate Texts in Mathematics 231 , Springer-Verlag, New York, 2005.
- 4[4] F. Brenti, P 𝑃 P -kernels, IC bases and Kazhdan–Lusztig polynomials , J. Algebra 259 (2003), 613-627.
- 5[5] F. Brenti, F. Caselli, M. Marietti, Special Matchings and Kazhdan–Lusztig polynomials , Advances in Math. 202 (2006), 555-601.
- 6[6] F. Brenti, F. Caselli, M. Marietti, Diamonds and Hecke algebra representations , Int. Math. Res. Not., Volume 2006 , Article ID 29407, 1-34.
- 7[7] F. Caselli, M. Marietti, Special matchings in Coxeter groups , Europ. J. Combin. 61 (2017), 151-166.
- 8[8] F. Caselli, M. Marietti, A simple characterization of special matchings in lower Bruhat intervals , Discrete Math. 341 (2018), 851-862.
