This paper develops an enriched theory of set-valued P-partitions, constructs a K-theoretic Hopf algebra of peak quasisymmetric functions, and proves symmetry of shifted stable Grothendieck polynomials, advancing algebraic combinatorics.
Contribution
It introduces an enriched set-valued P-partition framework and a K-theoretic Hopf algebra, linking shifted stable Grothendieck polynomials to symmetric functions.
Findings
01
Symmetry of skew shifted stable Grothendieck polynomials proved.
02
Construction of a K-theoretic Hopf algebra of labeled posets.
03
New explicit formulas for the involution on symmetric functions.
Abstract
We introduce an enriched analogue of Lam and Pylyavskyy's theory of set-valued P-partitions. An an application, we construct a K-theoretic version of Stembridge's Hopf algebra of peak quasisymmetric functions. We show that the symmetric part of this algebra is generated by Ikeda and Naruse's shifted stable Grothendieck polynomials. We give the first proof that the natural skew analogues of these power series are also symmetric. A central tool in our constructions is a "K-theoretic" Hopf algebra of labeled posets, which may be of independent interest. Our results also lead to some new explicit formulas for the involution ω on the ring of symmetric 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.
We introduce an enriched analogue of Lam and Pylyavskyy’s theory of set-valued P-partitions. An an application, we construct a K-theoretic version of Stembridge’s Hopf algebra of peak quasisymmetric functions. We show that the symmetric part of this algebra is generated by Ikeda and Naruse’s shifted stable Grothendieck polynomials. We give the first proof that the natural skew analogues of these power series are also symmetric. A central tool in our constructions is a “K-theoretic” Hopf algebra of labeled posets, which may be of independent interest. Our results also lead to some new explicit formulas for the involution ω on the ring of symmetric functions.
Stanley developed the now-classical theory of (ordinary) P-partitions in [39]. These are certain maps
from (finite) labeled posets to the positive integers Z>0:={1,2,3,…}. They can be seen as generalizations
of semistandard Young tableaux, and provide a streamlined description of the tableau generating functions for the skew Schur functions sλ/μ.
Following Stanley’s work, the theory of P-partitions has been generalized and extended in a number of ways.
Stembridge [40] introduced enriched P-partitions,
which are certain maps from labeled posets to the marked integersM:={1′<1<2′<2<…}.
They can be seen as generalizations of semistandard shifted (marked) tableaux, whose generating functions give
the Schur P- and Q-functionsPλ and Qλ.
In [22], Lam and Pylyavskyy defined set-valued P-partitions,
which are maps that now take finite nonempty subsets of Z>0 as values.
These maps are generalizations of semistandard set-valued tableaux,
which play a role in the generating functions
for the stable Grothendieck polynomialsGλ(β) studied in [4, 7, 13].
Our goal in this article is to provide the enriched counterpart to Lam and Pylyavskyy’s definition.
Stembridge [40] remarks that
“almost every aspect of the theory of ordinary P-partitions has an enriched counterpart.”
In a very satisfying sense, it turns out that most features of enriched P-partitions
similarly have a set-valued extension.
In particular, we introduce a theory of
enriched set-valued P-partitions. These are certain maps that take finite nonempty subsets of M as values.
They can be viewed as generalizations of semistandard shifted set-valued tableaux,
which appear in the combinatorial generating functions for Ikeda and Naruse’s
K-theoretic Schur P- and Q-functionsGPλ(β) and GQλ(β) studied in [18, 19, 32, 33, 34].
One motivation for this project was to
compute ω(GPλ(β)) and ω(GQλ(β)),
where ω denotes the usual involution of the ring of symmetric functions
that maps sλ↦sλT for all partitions λ.
It turns out that we can obtain explicit formulas for
ω
evaluated at GPλ(β) and GQλ(β) by decomposing the latter power series
into quasisymmetric functions
attached to enriched set-valued P-partitions
on which ω acts in a more transparent manner.
Our results along these lines appear at end of this paper in Section 6.
There are a few other reasons to be interested in enriched set-valued analogues of P-partitions.
They suggest a straightforward definition of K-theoretic Schur P- and Q-functions indexed by skew
shapes. These skew generalizations
do not seem to have been considered previously;
we establish some of their fundamental properties,
like symmetry. Our definition also indicates a good notion of K-theoretic Schur S-functions.
The theory of enriched set-valued P-partitions leads, moreover, to the construction of a Hopf algebra mΠSym,
whose elements we call multipeak quasisymmetric functions. This is a K-theoretic analogue of Stembridge’s algebra of peak quasisymmetric functions [40], and is perhaps of independent interest.
In [22], Lam and Pylyavskyy study a diagram of
six Hopf algebras related to the K-theory of the Grassmannian.
There are two shifted variants of this diagram, one for the maximal orthogonal Grassmannian and
one for the Lagrangian Grassmannian.
The planned sequel to this paper will study the “shifted K-theoretic” Hopf algebras in these diagrams. The algebra mΠSym and its dual
(a K-theoretic analogue of the peak algebra)
will figure prominently in the shifted diagrams.
We now summarize our main results and outline the rest of this paper.
Section 2 gives some background on Hopf algebras in the category of
linearly compact modules and on combinatorial Hopf algebras.
In Section 3, we introduce a “K-theoretic” Hopf algebra of labeled posets
and use this object to recover several constructions of Lam and Pylyavskyy, including the stable Grothendieck polynomials.
Section 4 contains our main definitions and results related
to enriched P-partitions and associated quasisymmetric functions.
We define the skew analogues of Ikeda and Naruse’s K-theoretic Schur P- and Q-functions
in Section 4.6. In Section 5, we prove the symmetry of these power series
and characterize the subalgebra that they generate.
Finally, Section 6 leverages our results to derive explicit
formulas for some notable involutions on quasisymmetric functions.
Acknowledgements
The first author was partially supported by an ORAU Powe award.
The second author was partially supported by Hong Kong RGC Grant ECS 26305218.
We are grateful to Zach Hamaker, Hiroshi Naruse, Brendan Pawlowski, and Alex Yong
for helpful comments.
2 Preliminaries
2.1 Completions
In this article, we are often concerned with rings of formal power series of unbounded degree
that are “too large” to belong to the category of free modules.
To define monoidal structures on these objects, we need to work in
the following slightly more exotic setting.
Fix an integral domain R and write ⊗=⊗R for the usual tensor product.
An R-algebra is an R-module A with R-linear
product ∇:A⊗A→A
and unit ι:R→A
maps.
Dually, an R-coalgebra is an R-module A with R-linear
coproduct Δ:A→A⊗A
and
counit ϵ:A→R maps.
The (co)product and (co)unit maps must satisfy several natural associativity axioms; see [15, §1]
for the complete definitions.
(Co)algebras form a category in which morphisms are R-linear maps commuting
with the (co)unit and (co)product maps.
An R-module A that is simultaneously an R-algebra and an R-coalgebra is an R-bialgebra
if the coproduct and counit maps are algebra morphisms (equivalently, the product and unit are coalgebra morphisms).
Suppose A is an R-bialgebra with structure maps ∇, ι, Δ, and ϵ.
Let End(A) denote the set of R-linear maps A→A. This set is an R-algebra with
product given by the linear map with
f⊗g↦∇∘(f⊗g)∘Δ
for f,g∈End(A)
and unit
given by the linear map with 1R↦ι∘ϵ.
The bialgebra A is a Hopf algebra if id:A→A has a
(necessarily unique) two-sided multiplicative inverse
S:A→A in the algebra End(A), in which case we call S the antipode of A.
Consider a free R-module A, and fix a basis {ai}i∈I for A.
Suppose that B is an R-module and ⟨⋅,⋅⟩:A×B→R
is a nondegenerateR-bilinear form, in the sense that
b↦⟨⋅,b⟩ is a bijection B→HomR(A,R).
Then for each j∈I, there exists a unique element bj∈B with
⟨ai,bj⟩=δij for all i∈I,
and we can identify B
with the product ∏j∈IRbj, which we view as
the set of arbitrary R-linear combinations of the elements {bj}j∈I.
We refer to {bi}i∈I as a pseudobasis for B;
some authors call this a continuous basis.
Example 2.1**.**
Let A=R[x] and B=R[[x]].
Define ⟨⋅,⋅⟩:A×B→R to be the nondegenerate R-bilinear form with
⟨∑n≥0rnxn,∑n≥0snxn⟩=∑n≥0rnsn.
The set {xn}n≥0 is a basis for A and a pseudobasis for B.
Endow R with the discrete topology.
The linearly compact topology on B [10, §I.2] is the coarsest topology
in which the maps ⟨ai,⋅⟩:B→R are all continuous.
If we identify B≅∏j∈IRbj and give each Rbj the discrete topology, then
this is the usual product topology.
The linearly compact topology depends on ⟨⋅,⋅⟩ but not on the choice of basis for A.
It is discrete if A has finite rank.
We refer to B, equipped with this topology, as a linearly compact R-module,
and say that B is the dual of A with respect to the form ⟨⋅,⋅⟩.
We will often abbreviate by writing “LC-” in place of “linearly compact.” LC-modules form a category in which morphisms are continuous R-linear maps.
Example 2.2**.**
With A=R[x] and B=R[[x]] as in Example 2.1, a basis of open subsets in the LC-topology on R[[x]] is given by sets of power series in R[[x]] whose coefficients are fixed in a finite set of degrees and unconstrained elsewhere. We view formal power series rings in multiple variables as LC-modules similarly.
Suppose A is a free R-module with basis S.
Let B be the
R-module of arbitrary R-linear combinations of elements of S,
equipped with the nondegenerate bilinear form
A×B→R making S orthonormal. We say that B
is the
completion of A with respect to S.
This is a linearly compact R-module with S as a pseudobasis.
Let B and B′ be linearly compact R-modules dual to free R-modules A and A′, and write ⟨⋅,⋅⟩ for both of the
associated bilinear forms. Every R-linear map ϕ:A′→A has a unique adjoint ψ:B→B′ such that
⟨ϕ(a′),b⟩=⟨a′,ψ(b)⟩ for all a′∈A′ and b∈B.
A linear map B→B′ is continuous if and only if it arises as the adjoint
of some linear map A′→A.
The completed tensor product of B and B′
is the R-module
[TABLE]
given the LC-topology from the tautological pairing
(A⊗A′)×HomR(A⊗A′,R)→R.
If {bi}i∈I and {bj′}j∈J are pseudobases for B and B′,
then we can realize B⊗^B′ concretely as the linearly compact R-module
with the set of tensors {bi⊗bj′}(i,j)∈I×J as a pseudobasis.
There is an inclusion
B⊗B′↪B⊗^B′, which is an isomorphism if and only if
A or A′ has finite rank.
Example 2.3**.**
If we view R[[x]] and R[[y]] as
linearly compact R-modules as in Example 2.2
then R[[x]]⊗R[[y]]=R[[x]]⊗^R[[y]]≅R[[x,y]],
where we consider R[[x,y]] as the linearly compact R-module dual to R[x,y].
If ι:B→R and ∇:B⊗^B→B are continuous linear maps,
then these maps are the adjoints of unique linear maps ϵ:R→A and Δ:A→A⊗A,
and we say that (B,∇,ι) is an LC-algebra
if (A,Δ,ϵ) is an R-coalgebra.
Similarly, we say that continuous linear maps
Δ:B→B⊗^B and ϵ:B→R
make B into an LC-coalgebra
if Δ and ϵ are the adjoints of the product and unit
maps of an R-algebra structure on A.
LC-bialgebras and LC-Hopf algebras are defined analogously.
In each case we say that the (co, bi, Hopf) algebra structures on A and B are duals of each other.
If B is an LC-Hopf algebra then its antipode is defined to be the adjoint of the antipode of
the Hopf algebra A.
One can reformulate these definitions in terms of commutative diagrams; see [28, §2 and §3].
Linearly compact (co, bi, Hopf) algebras form a category in which morphisms are continuous linear maps
commuting with (co)products and (co)units.
The completed tensor product of two linearly compact (co, bi, Hopf) algebras is
naturally a linearly compact (co, bi, Hopf) algebra.
Example 2.4**.**
Again let A=R[x] and B=R[[x]] but now suppose R=Z[β].
Define ι:R→B to be the obvious inclusion and let ϵ:B→R be the map setting x=0. Let ∇:B⊗^B→B be the usual multiplication map
but define Δβ:B→B⊗^B to be the continuous algebra homomorphism with
Δβ(x)=x⊗1+1⊗x+βx⊗x.
The operations ι and ϵ restrict to maps R→A and A→R.
Define Δ:A→A⊗A as the linear map with
Δ(xn)=∑i+j=nxi⊗xj
and let ∇β:A⊗A→A be
the commutative, associative, linear map whose
(n−1)-fold iteration maps
[TABLE]
and which is such that ∇β∘(id⊗ι):A⊗R→A and ∇β∘(ι⊗id):R⊗A→A are the canonical isomorphisms.
(The existence and uniqueness of ∇β is not obvious, but follows as an interesting, fairly straightforward exercise.)
The triple (A,∇β,ι) is automatically an algebra, and
one can show that ϵ and Δ are algebra homomorphisms, so (A,∇β,ι,Δ,ϵ) is a bialgebra.
One can check, moreover, that the dual of this bialgebra structure via the form in Example 2.2
is precisely
(B,∇,ι,Δβ,ϵ), which is thus an LC-bialgebra.
There are several ways of seeing that A is a Hopf algebra and computing its antipode S. Since ι∘ϵ=∇β∘(id⊗S)∘Δ,
we must have S(x)=−x. Using this and the fact that S is an algebra anti-automorphism,
one can show that
[TABLE]
for n>0.
It follows by duality that B is an LC-Hopf algebra whose antipode S^:B→B
is the continuous linear map with
S^(1)=1 and
[TABLE]
for m>0.
It is interesting to note that ∇ and Δβ restrict to well-defined maps A⊗A→A and A→A⊗A,
which give A a second bialgebra structure. This bialgebra is not a Hopf algebra, however,
since S^ is not a map A→A.
In a few places we will encounter the following construction, where the added complications of linear compactness seem a little superfluous.
Suppose H is a Z≥0-graded connected111
A graded bialgebra H=⨁n≥0Hn is
connected if the unit and counit maps restrict
to inverse isomorphisms R≅H0.
This condition is not essential, but recurs in many examples and is often convenient to assume.
Any graded connected bialgebra is automatically a Hopf algebra, and
when defining such objects one just needs to specify the (co)product maps. Hopf algebra, with
finite graded rank and with a homogeneous basis S.
Let H^ be the completion of H with respect to S.
There is an inclusion H↪H^ and all Hopf structure maps
automatically extend to continuous linear maps, making
H^ into an LC-Hopf algebra (namely, the one dual to the graded dual of H).
Significantly, LC-Hopf algebras arising as completions
in this way
often have interesting subalgebras that
are not themselves completions.
Example 2.5**.**
If we set β=0 in Example 2.4, then A=Z[x] becomes
a Z≥0-graded connected Hopf algebra with finite graded rank.
The completion of this Hopf algebra with respect to S={xn}n≥0
can be identified with
the (proper) LC-Hopf subalgebra of B=Z[[x]]
with pseudobasis {n!⋅xn}n≥0.
2.2 Quasisymmetric functions
Continue to let R be an integral domain, and
suppose x1, x2, …are commuting indeterminates.
A power series f∈R[[x1,x2,…]] is quasisymmetric if
for any choice of exponents a1,a2,…,ak∈Z>0,
the coefficients of x1a1x2a2⋯xkak and xi1a1xi2a2⋯xikak
in f are equal for all i1<i2<⋯<ik.
Definition 2.6**.**
Let mQSymR denote the R-module of all
quasisymmetric power series in R[[x1,x2,…]].
Let QSymR denote the submodule of power series in mQSymR of bounded degree.
A composition is a finite sequence of positive integers
α=(α1,α2,…,αl).
If n=α1+α2+⋯+αl
then we write α⊨n and and set ∣α∣:=n.
The monomial quasisymmetric function
of a nonempty composition α=(α1,α2,…,αl)
is
[TABLE]
When α=∅ is empty, we set M∅:=1.
Then QSymR is a graded ring that is free as an R-module with the set of
power series Mα
as a homogeneous basis.
We identify mQSymR with the corresponding completion.
This makes mQSymR into a linearly compact R-module, whose
topology coincides with the subspace topology induced by the LC-module R[[x1,x2,…]].
Let α′α′′ denote the concatenation of two compositions α′ and α′′.
There is a unique R-linear map Δ:QSymR→QSymR⊗QSymR such that
Δ(Mα)=∑α=α′α′′Mα′⊗Mα′′
for each composition α.
Let ϵ:QSymR→R be the linear map with M∅↦1 and Mα↦0
for all nonempty compositions α.
With this coproduct and counit,
QSymR becomes a graded, connected Hopf algebra [15, §5.1].
(For a discussion of its antipode, see Section 6.2.)
Since QSymR has finite graded rank,
its product and coproduct extend to continuous linear maps mQSymR⊗^mQSymR→mQSymR
and
mQSymR→mQSymR⊗^mQSymR making mQSymR into an LC-Hopf algebra.
This algebra has an important universal property, which we presently describe.
Suppose H
is a linearly compact R-bialgebra
with product ∇, coproduct Δ, unit ι, and counit ϵ.
Let X(H) denote the set of continuous algebra morphisms ζ:H→R[[t]]
with ζ(⋅)∣t=0=ϵ.
This set is a monoid under the convolution productζ∗ζ′:=∇R[[t]]∘(ζ⊗^ζ′)∘Δ
with unit element ι∘ϵ.
If H has an antipode S then
ζ∘S is the inverse of ζ∈X(H) under ∗, so
in this case X(H) is a group. This leads to a natural extension of Aguiar, Bergeron, and Sottile’s notion of a combinatorial Hopf algebra
[2] to linearly compact modules.
Definition 2.7**.**
If H is an LC-bialgebra (respectively, LC-Hopf algebra)
and ζ∈X(H), then we refer to (H,ζ)
as a combinatorial LC-bialgebra (respectively, combinatorial LC-Hopf algebra).
Such pairs form a category in which morphisms (H,ζ)→(H′,ζ′)
are LC-bialgebra morphisms ϕ:H→H′ with ζ=ζ′∘ϕ.
We view mQSymR as a combinatorial LC-Hopf algebra with respect to
the universal zeta functionζQ:mQSymR→R[[t]]
given by ζQ(f)=f(t,0,0,…).
One has
ζQ(Mα)=t∣α∣
for α∈{∅,(1),(2),(3),…}
and ζQ(Mα)=0
for all other compositions α.
The next theorem, which is a mild generalization of [2, Thm. 4.1],
shows that (mQSymR,ζQ) is a final object in the category of combinatorial LC-bialgebras.
Given an LC-bialgebra H, a character ζ∈X(H), and a nontrivial composition α=(α1,α2,…,αk),
let ζα:H→R denote the map
sending h∈H to the coefficient of
tα1⊗tα2⊗⋯⊗tαk
in ζ⊗k∘Δ(k−1)(h)∈R[[t]]⊗^k,
where Δ(0):=id.
When α=∅ is empty,
let ζ∅=ϵ.
Theorem 2.8**.**
If (H,ζ) is a combinatorial LC-bialgebra
then there exists a unique morphism Φ:(H,ζ)→(mQSymR,ζQ), given explicitly
by the map with
Φ(h)=∑αζα(h)Mα
for h∈H,
where the sum is over all compositions α.
Proof.
By extending the ring of scalars, any such morphism Φ extends to a morphism over the field of fractions of R, and this extension satisfies ζQ∘Φ=ζ. By [28, Thm. 7.8], there is a unique such morphism Φ defined over a field, and this morphism has the given formula Φ(h)=∑αζα(h)Mα. Since this formula is in fact defined over R, the result follows.
∎
Example 2.9**.**
Suppose R=Z[β] and H=Z[β][[x]] with the LC-Hopf algebra structure in Example 2.4.
Each map ζ:H→Z[β][[t]] in X(H) is uniquely determined by its value at x,
and there exists ζ∈X(H) with ζ(x)=f∈Z[[t]]
if and only if f∈tZ[β][[t]] is a power series with no constant term.
If ζ∈X(H) is the trivial isomorphism mapping x↦t,
then the morphism Φ in Theorem 2.8
sends x↦M(1)+βM(1,1)+β2M(1,1,1)+….
Notation**.**
For the rest of this article, we
fix the ring of scalars to be R=Z[β],
where β is an indeterminate,
and define
[TABLE]
All combinatorial Hopf algebras are assumed to be defined over Z[β].
3 Set-valued P-partitions
In this section, we introduce a combinatorial LC-Hopf algebra on labeled posets.
Applying the canonical morphism from this object to mQSym produces a family of interesting quasisymmetric functions,
recovering Lam and Pylyavskyy’s generating functions for set-valued P-partitions [22].
3.1 Labeled posets
Let P be a finite poset with an injective labeling map γ:P→Z.
We refer to
the pair (P,γ) as a labeled poset.
We say that t∈Pcoverss∈P and write s⋖t if {x∈P:s≤x<t}={s}.
Two labelings γ and δ of P are equivalent
if, whenever s⋖t in P, we have γ(s)>γ(t) if and only if δ(s)>δ(t).
Labeled posets (P,γ) and (Q,δ) are isomorphic
if there is a poset isomorphism ϕ:P∼Q such that γ and δ∘ϕ
are equivalent labelings of P. Denote the isomorphism class of (P,γ) by [(P,γ)].
The isomorphism class [(P,γ)] may be represented
uniquely by adding an orientation to the Hasse diagram of P, as follows:
for each covering relation x⋖y, there is an edge
x→y if γ(x)>γ(y) and an edge x←y
if γ(x)<γ(y).
Example 3.1**.**
Let P be the labeled poset with four elements s1,s2,s3,s4 and four covering relations
s1⋖s2 and s1⋖s3 and s2⋖s4 and s3⋖s4,
and let γ:P→Z be defined by γ(s1)=5 and γ(si)=i for i∈{2,3,4}.
Then [(P,γ)] is represented by the oriented Hasse diagram
[TABLE]
Definition 3.2**.**
Define
mLPoset to be the linearly compact Z[β]-module with a pseudobasis given by
the isomorphism classes of all (finite) labeled posets.
There is a natural Hopf structure on mLPoset,
which we now describe.
We define a disjoint union operation ⊔ on labeled posets (P,γ) and (Q,δ)
so that the oriented Hasse diagram of
the isomorphism class
[(P,γ)⊔(Q,δ)]
is the disjoint union of the oriented Hasse diagrams
of [(P,γ)] and [(Q,δ)]: concretely,
(P,γ)⊔(Q,δ):=(P⊔Q,γ⊔δ) is the labeled poset such that
P⊔Q is the usual disjoint poset union
and
γ⊔δ:P⊔Q→Z is the labeling map
[TABLE]
If S⊆P is any subset of a labeled poset (P,γ) then (S,γ∣S)
is itself a labeled poset, where
S inherits the partial order of P.
To unclutter our notation, we will henceforth write (S,γ) in place of (S,γ∣S).
A subposet S⊆P is a lower set (respectively, upper set)
if
for all x,y∈P with x<y,
y∈S⇒x∈S (respectively, x∈S⇒y∈S).
A subset S⊆P is an antichain
if no elements x,y∈S satisfy x<y in P.
Given labeled posets (P,γ) and (Q,δ), define
[TABLE]
and
[TABLE]
where the sum is over all ordered pairs (S,T) of subsets of P such that
S is a lower set, T is an upper set,
P=S∪T, and
S∩T is an antichain.
Since there are only finitely many isomorphism classes of labeled posets of a given size,
these operations extend to continuous linear maps
∇:mLPoset⊗^mLPoset→mLPoset
and Δ:mLPoset→mLPoset⊗^mLPoset.
Example 3.3**.**
The value of Δ([(P,γ)]) for P={a<b} with γ(a)<γ(b)
is
[TABLE]
Write ι:Z[β]→mLPoset
for the linear map that sends 1 to the isomorphism class of the empty labeled poset.
Write ϵ:mLPoset→Z[β]
for the continuous linear map whose value at
[(P,γ)] is 1 if ∣P∣=0 and [math] otherwise.
Theorem 3.4**.**
With respect to the operations ∇, Δ, ι, ϵ just given,
the Z[β]-module mLPoset is a commutative LC-Hopf algebra.
Proof.
Every covering relation in P⊔Q is a covering relation in either P or Q, and the relative order of labels is not altered by the disjoint union.
Hence [(P,γ)⊔(Q,δ)]=[(Q,δ)⊔(P,γ)] and so the product Δ is commutative.
Let LPoset denote the free Z[β]-module with a basis given by all isomorphism
classes of labeled posets [(P,γ)].
For n∈Z≥0, let LPosetn denote the Z[β]-submodule of LPoset spanned by
isomorphism classes [(P,γ)] with ∣P∣=n.
Consider the nondegenerate bilinear form LPoset×mLPoset→Z[β]
making obvious the (pseudo)bases of isomorphism classes dual to each other.
Let ∇∨:LPoset→LPoset⊗LPoset, Δ∨:LPoset⊗LPoset→LPoset, ι∨:LPoset→Z[β], and ϵ∨:Z[β]→LPoset
denote the respective adjoints of ∇, Δ, ι, and ϵ
relative to this form.
One has ι∨=ϵ∣LPoset and ϵ∨=ι∣LPoset,
while
[TABLE]
It is slightly more complicated, but still straightforward, to write
down a similar formula for Δ∨;
the important observation is that ∇∨
maps LPosetn→⨁i+j=nLPoseti⊗LPosetj.
To show that mLPoset is an LC-Hopf algebra, it suffices to
show that the maps Δ∨, ∇∨, ϵ∨, and ι∨
make LPoset into an ordinary Hopf algebra.
It is a routine calculation to show that LPoset is at least a bialgebra.
Moreover, LPoset is evidently graded and connected as a coalgebra
and filtered as an algebra.
It follows that f:=id−ϵ∨∘ι∨ is locally ⋆-nilpotent
in the sense of [15, Rem. 1.4.23], i.e., that
for each x∈LPoset,
(Δ∨)(k−1)∘f⊗k∘(∇∨)(k−1)(x)=0
for some sufficiently large k=k(x).
The bialgebra LPoset therefore has an antipode given by
Takeuchi’s formula [15, Prop. 1.4.22],
and we conclude that LPoset is a Hopf algebra, as needed.
∎
One can obtain an antipode formula for mLPoset by taking the adjoint of
Takeuchi’s antipode formula for LPoset. Both formulas involve substantial cancellation of terms.
This raises the following problem, which seems to be open:
Problem 3.5**.**
Find a cancellation-free formula for the antipode of mLPoset.
A solution to this problem would generalize the antipode formulas
in [1, §15.3], which roughly correspond to the case when β=0.
Up to equivalence, there is a unique labeled poset (P,γ)
in which P is an n-element antichain.
The continuous linear map sending xn to this poset is an injective morphism of LC-Hopf algebras
Z[β][[x]]→mLPoset, where Z[β][[x]] has the LC-Hopf structure
described in Example 2.4.
Define ζ<:mLPoset→Z[β][[t]] to be the continuous linear map
with
[TABLE]
This is a particularly natural algebra morphism,
which makes (mLPoset,ζ<) into a combinatorial LC-Hopf algebra.
Theorem 2.8 asserts that there is a
unique morphism
(mLPoset,ζ<)→(mQSym,ζQ),
and it is an interesting and a priori nontrivial problem to evaluate this map
at the isomorphism class of a given labeled poset.
We turn to this problem in the next section.
3.2 Set-valued P-partitions
Set-valued P-partitions are certain maps assigning sets of integers to
the vertices of a labeled poset (P,γ).
It will turn out that these maps exactly parametrize the monomials appearing
in the quasisymmetric generating
function associated to [(P,γ)] by the unique morphism
(mLPoset,ζ<)→(mQSym,ζQ).
Let Set(Z>0) denote the set of finite, nonempty subsets of
Z>0.
Given S,T∈Set(Z>0), write S≺T if max(S)<min(T)
and S⪯T if max(S)≤min(T).
(In particular, S⪯S if and only if ∣S∣=1.)
For S∈Set(Z>0), define xS=∏i∈Sxi.
Let (P,γ) be a labeled poset.
A set-valued (P,γ)-partition is a map σ:P→Set(Z>0)
such that for each covering relation s⋖t in P one has
σ(s)⪯σ(t), with σ(s)≺σ(t) if γ(s)>γ(t).
Example 3.7**.**
Suppose P={1<2<3} is a 3-element chain and γ(1)<γ(2)>γ(3).
If σ is a set-valued (P,γ)-partition,
then (σ(1),σ(2),σ(3)) could be ({2},{2,3},{4,5}) or ({1},{2,4},{6}),
but not ({1,2},{3},{3,4}).
Lam and Pylyavskyy [22] introduced this definition while studying a “K-theoretic” analogue of
the Malvenuto–Reutenauer Hopf algebra of permutations.
The idea
generalizes the classical notion of a P-partition from [39],
which is just a set-valued partition whose values are all singleton sets.
Let A(P,γ) denote the set of all set-valued (P,γ)-partitions.
The length of σ∈A(P,γ) is the
nonnegative integer ∣σ∣:=∑s∈P∣σ(s)∣,
while the weight of σ is the monomial
xσ:=∏s∈Pxσ(s).
We define the set-valued weight enumerator of (P,γ)
to be the quasisymmetric formal power series
[TABLE]
The power series Γ(1)(P,γ) obtained from (3.3) by setting β=1
is denoted K~P,γ in [22, §5.3].
These generating functions (and by extension, the sets A(P,γ))
are natural objects to consider on account of the following theorem.
Theorem 3.8**.**
The continuous linear map with [(P,γ)]↦Γ(β)(P,γ)
for each labeled poset (P,γ)
is the unique morphism
of combinatorial LC-Hopf algebras
(mLPoset,ζ<)→(mQSym,ζQ).
If (P,γ)≅(Q,δ) then clearly Γ(β)(P,γ)=Γ(β)(Q,δ),
so the continuous linear map
mLPoset→mQSym described in the theorem is at least well-defined.
Proof.
Fix a labeled poset (P,γ).
For each k∈Z≥0, let
Pk denote the set of k-tuples (P1,…,Pk)
of nonempty sets with P1∪⋯∪Pk=P
such that
(a)
if s∈Pi and t∈Pj where i<j then t<s in P, and
2. (b)
if s,t∈Pi and s⋖t in P then γ(s)<γ(t).
Also let Ik be the set of k-tuples of positive integers (i1,…,ik) with i1<⋯<ik.
According to Theorem 2.8,
the unique morphism of
combinatorial LC-Hopf algebras
(mLPoset,ζ<)→(mQSym,ζQ) is the continuous linear map
with
[TABLE]
We claim that the right hand expression is equal to Γ(β)(P,γ).
Given tuples
π=(P1,…,Pk)∈Pk and I=(i1<⋯<ik)∈Ik,
define σ:P→Set(Z>0) to be the map with
σ(s)={ij:1≤j≤k and s∈Pj}.
If s⋖t in P and i,j are indices such that s∈Pi and t∈Pj, then property (a) implies that i≤j,
so σ(s)⪯σ(t); moreover, if γ(s)>γ(t),
then property (b) implies that s and t do not belong to the same Pi and so σ(s)≺σ(t).
Thus σ∈A(P,γ),
and we have ∣σ∣=∑i∣Pi∣ and xσ=xi1∣P1∣⋯xik∣Pk∣.
It suffices to show that (π,I)↦σ is a bijection
⨆k∈Z≥0Pk×Ik→A(P,γ).
This is straightforward; the inverse map is σ↦(π,I)
where I is the sequence of elements in ⋃s∈Pσ(s) arranged in order,
and π=(P1,P2,…,P∣I∣) is the tuple
in which Pi is the set of s∈P such that σ(s) contains the ith element of I.
It is easy to deduce from Definition 3.6 that σ∈A(P,γ) implies π∈Pk.
∎
As one application of Theorem 3.8, we obtain some new
(co)product formulas for the quasisymmetric functions Γ(β)(P,γ).
Corollary 3.9**.**
Suppose (P,γ) and (Q,δ) are labeled posets.
Then
[TABLE]
and
[TABLE]
where the sum is over all ordered pairs (S,T) of subsets of P such that
S is a lower set, T is an upper set,
P=S∪T, and
S∩T is an antichain.
3.3 Multifundamental quasisymmetric functions
In this section we investigate the properties of
the generating functions Γ(β)(P,γ)
in the special case when P is linearly ordered.
One can show that these quasisymmetric functions form a
pseudobasis of mQSym;
following [22],
we refer to them as multifundamental quasisymmetric functions.
Fix an arbitrary labeled poset (P,γ).
Lam and Pylyavskyy show in [22, §5.3]
that both A(P,γ) and Γ(β)(P,γ) are controlled by the following objects:
Definition 3.10**.**
A finite sequence w=(w1,w2,…,wN)
is a linear multiextension of P
if it holds that
P={w1,w2,…,wN}, wi=wi+1 for each 1≤i<N,
and {i:wi=a}≺{i:wi=b} whenever a⋖b in P.
(This differs superficially from Lam and Pylyavskyy’s definition in [22, §5.3];
what they call a linear multiextension is the map sending s∈P
to {i:wi=s} rather than the sequence (w1,w2,…,wN).)
Let L(P) denote the set of linear multiextensions of P.
This set has a unique element if P is a chain
and is infinite otherwise.
For each integer N∈Z≥0,
let [N]:={1<2<⋯<N} be the usual N-element chain.
Given a finite sequence w=(w1,w2,…,wN)
with an injective map γ:{w1,w2,…,wN}→Z,
let δ:[N]→[N] denote the unique bijection with δ(i)>δ(j)
for i<j
if and only if γ(wi)>γ(wj),
and define
[TABLE]
Let ℓ(w):=N denote the length of the finite sequence w.
The following is a sort of
“Fundamental Lemma of Set-Valued (P,γ)-Partitions.”
For each labeled poset (P,γ), there is a length- and weight-preserving bijection
A(P,γ)∼⨆w∈L(P)A(w,γ),
and so
[TABLE]
Remark**.**
To be precise, [22, Thm. 5.6] is the case of the preceding result with β=1;
however, both statements have the same proof.
Fix a sequence w with N=ℓ(w) and an injective map γ:{w1,w2,…,wN}→Z.
Define
Des(w,γ):={i∈[N−1]:γ(wi)>γ(wi+1)}.
We then have
[TABLE]
This suggests the following definition.
For a tuple of sets S=(S1,S2,…,SN), let xS:=∏ixSi
and ∣S∣:=∑i∣Si∣.
For a composition α=(α1,α2,…,αk),
let
[TABLE]
Then α↦I(α) is a bijection from compositions of N to subsets of [N−1].
Define the multifundamental quasisymmetric function
of
α⊨N
to be
[TABLE]
where in the sum each Si belongs to Set(Z>0).
The following holds by definition.
Proposition 3.12**.**
Fix a choice of (w,γ) as above, and
let α⊨ℓ(w) be the unique composition such that I(α)=Des(w,γ).
Then
Lα(β)=Γ(β)(w,γ).
Write ≤ for the usual refinement order on compositions, so that
α≤α′ if and only if
∣α∣=∣α′∣ and
I(α)⊆I(α′).
Setting β=0 in (3.5) gives the fundamental quasisymmetric functionLα:=Lα(0)=∑α≤α′Mα′∈QSym.
If β has degree zero and xi has degree one,
then Lα is the nonzero homogeneous component of Lα(β)
of lowest degree.
Since the power series Lα form a basis of QSym,
it follows that
the functions {Lα(β)} are a pseudobasis of mQSym.
Example 3.13**.**
If α=(2,1) then (3.5) is the sum over all S1⪯S2≺S3
with Si∈Set(Z>0). This translates to the somewhat more explicit formula
[TABLE]
Setting β=0 gives L(2,1)=M(1,1,1)+M(2,1) as expected.
The finite-variable truncations of Lα(β)
are the quasisymmetric glide polynomials in [36],
and each Lα(β) is a certain “stable limit” of Pechenik and Searles’s glide polynomials.
Lam and Pylyavskyy [22, §5.3] refer to the specializations L~α:=Lα(1)
as multifundamental quasisymmetric functions.
One recovers Lα(β) from L~α by substituting
xi↦βxi and then dividing by β∣α∣; that is, we have
[TABLE]
This lets one rewrite any identities in [22] involving L~α in terms of Lα(β).
Remark 3.14**.**
One can use Corollary 3.9 to obtain (co)product formulas
for the multifundamental quasisymmetric functions Lα(β).
Lam and Pylyavskyy have already derived such formulas
in [22, §5.4]; their results are stated in terms of the functions
L~α:=Lα(1), but easily translate to Lα(β)
via (3.6).
The coproduct Δ(Lα(β)) is always a finite Z≥0[β]-linear combination
of tensors of the form Lα′(β)⊗Lα′′(β).
By contrast, the product
∇(Lα′(β)⊗Lα′′(β)) is an
infinite linear combination of Lα(β)’s if α′ and α′′
are both nonempty.
3.4 Stable Grothendieck polynomials
A primary motivation for the definition of set-valued P-partitions
comes from the labeled posets associated with Young diagrams of partitions.
As Lam and Pylyavskyy note in [22],
the weight enumerators of these labeled posets are essentially
the stable Grothendieck polynomials
studied in [13, 23] (see also [4]).
We review these here.
Let λ=(λ1≥λ2≥⋯≥0)
and μ=(μ1≥μ2≥⋯≥0)
be (integer) partitions
with μ⊆λ, i.e., with μi≤λi
for all i.
The skew diagram of λ/μ is
[TABLE]
Let Dλ=Dλ/∅.
We consider Dλ/μ to be partially ordered with (i,j)≤(i′,j′)
if i≤i′ and j≤j′.
Let n=∣λ∣−∣μ∣
and fix a bijection θ:Dλ/μ→[n]
with
[TABLE]
for all relevant positions in Dλ/μ.
(The choice of θ is unimportant,
since all such labelings are equivalent.)
For example, if λ=(5,4,2) and μ=(2,1) then
the oriented Hasse diagram representing (Dλ/μ,θ) is
[TABLE]
The elements of A(Dλ/μ,θ)
may be identified with semistandard set-valued tableaux of shape λ/μ as defined in [4, §3],
i.e., fillings of Dλ/μ by nonempty finite subsets of positive integers that are weakly increasing
(in the sense of ⪯) along rows and strictly increasing (in the sense of ≺) along columns.
Let
[TABLE]
The stable Grothendieck polynomial of λ/μ is then
[TABLE]
Both definitions are independent of the choice of θ.
The power series Gλ/μ(β) is symmetric in the xi variables, though of unbounded degree (see [4, §2 and Thm. 3.1]).
The formula (3.9) sometimes appears in the literature with β set to ±1 [4, 6, 22].
There is no loss of generality in making such a specialization, but it is more convenient to work with a generic parameter.
Setting β=0 in (3.9) gives the skew Schur function sλ/μ.
Say that a set-valued tableau T∈SetSSYT(λ/μ) is standard
if its entries are disjoint sets, not containing any consecutive integers,
with union {1,2,…,N} for some N≥n.
We identify the set SetSYT(λ/μ) of standard set-valued tableaux of shape λ/μ
with the set L(Dλ/μ) of linear multiextensions of Dλ/μ:
each (w1,w2,…,wN)∈L(Dλ/μ)
corresponds to the standard set-valued tableau with i in box wi.
Then it follows from Theorem 3.11 that
[TABLE]
where the sum is over compositions α and fλ/μα is the number of
standard set-valued tableaux T∈SetSYT(λ/μ) with Des(T,θ)=I(α)
and ∣T∣=∣α∣.
4 Enriched P-partitions
In [40], Stembridge introduced an “enriched” analogue of ordinary (i.e., not set-valued)
P-partitions as a means of constructing skew Schur Q-functions. Stembridge’s theory admits a K-theoretic analogue, which we describe in this section.
This leads to interesting quasisymmetric
generalizations of Ikeda and Naruse’s shifted stable Grothendieck polynomials [19], discussed in Section 4.6.
4.1 Labeled posets revisited
We begin by embedding the LC-Hopf algebra mLPoset from Section 3 in a larger algebra.
Given a labeled poset (P,γ),
a valleyv∈P is an element with the property that
γ(x)>γ(v) for all covers x⋖v in P
and γ(v)<γ(y) for all covers v⋖y in P.
In other words, a valley is a sink in the oriented Hasse diagram of (P,γ).
Define Val(P,γ) to be the set of valleys of (P,γ).
Definition 4.1**.**
Let mLPoset+ be the linearly compact Z[β]-module
with a pseudobasis
consisting of the
isomorphism classes [(P,γ,V)]
for labeled posets (P,γ) and subsets V⊆Val(P,γ),
where we define (P,γ,V)≅(P′,γ′,V′)
if there exists an isomorphism of labeled posets (P,γ)∼(P′,γ′) taking V to V′.
The Hopf structure on mLPoset extends to mLPoset+ as follows.
Let ∇:mLPoset+⊗^mLPoset+→mLPoset+
denote the continuous linear map with
[TABLE]
where
(P,γ,V)⊔(Q,δ,W):=(P⊔Q,γ⊔δ,V⊔W),
with γ⊔δ as in (3.1).
Let Δ:mLPoset+→mLPoset+⊗^mLPoset+
be the continuous linear map with
[TABLE]
where the sum is over all ordered pairs (S,T) of subsets of P such that
S is a lower set, T is an upper set,
P=S∪T, and
S∩T is an antichain.
Finally, write ι:Z[β]→mLPoset+
for the linear map with 1↦[(∅,∅,∅)]
and ϵ:mLPoset+→Z[β]
for the continuous linear map whose value at
[(P,γ,V)] is 1 if P is empty and [math] otherwise.
Theorem 4.2**.**
With respect to the operations ∇, Δ, ι, ϵ just given,
the Z[β]-module mLPoset+ is a commutative LC-Hopf algebra.
Proof.
The proof is the same as for Theorem 3.4,
mutatis mutandis.
∎
Identifying [(P,γ)]=[(P,γ,∅)]
lets us view mLPoset⊂mLPoset+ as LC-Hopf algebras.
We now define a map ζ>∣< that turns mLPoset+ into a combinatorial LC-Hopf algebra.
It is slightly different from the structure on mLPoset considered in the previous section.
The map ζ< defined in (3.2) extends to
a continuous algebra morphism mLPoset+→Z[β][[t]]
with ζ<([(P,γ,V)]):=ζ<([(P,γ)]).
Define ζˉ> to be the continuous algebra morphism mLPoset+→Z[β][[t]]
with
[TABLE]
Finally, write ζ>∣<:mLPoset+→Z[β][[t]] for the convolution product
[TABLE]
Next, we derive a more explicit formula for this algebra morphism.
For a labeled poset (P,γ), let Peak(P,γ)
denote the set of elements y∈P for which there exist elements x,z∈P
with x⋖y⋖z and γ(x)<γ(y)>γ(z).
Proposition 4.3**.**
Let (P,γ) be a labeled poset and V⊆Val(P,γ).
Then
[TABLE]
Proof.
Each pair (S,T) of subsets of P such that S is a lower set, T is an upper set,
P=S∪T, and
S∩T is an antichain contributes
[TABLE]
to the value of ζ>∣<([(P,γ,V)]).
If there is some element y∈Peak(P,γ), then for every such pair (S,T), either y∈S and there is x⋖y in S with γ(x)<γ(y)
or y∈T and there is z⋗y in T with γ(y)>γ(z). Thus one of
ζˉ>([(S,γ,V∩S)]) or ζ<([(T,γ)]) is always zero,
and consequently ζ>∣<([(P,γ,V)])=0, as claimed.
Otherwise, we may assume Peak(P,γ)=∅.
We construct a collection of pairs (S,T) of subsets of P, as follows:
(i)
if there is z⋗y in P and γ(y)>γ(z) then y∈S;
2. (ii)
if there is x⋖y in P and γ(x)<γ(y) then y∈T;
3. (iii)
if y∈V then y∈T; and
4. (iv)
if y∈Val(P,γ)∖V then we may assign y to S, to T, or to both.
Since Peak(P,γ)=∅, these rules are disjoint.
Suppose (S,T) is one of the pairs so constructed.
If y∈S and x⋖y, then rules (ii) and (iv) imply that
γ(x)>γ(y), and rule (i) implies that x∈S.
Thus S is a lower set with ζˉ>([(S,γ,∅)])=t∣S∣.
It follows similarly that T is an upper set
with ζ<([(T,γ)])=t∣T∣.
Finally, it is clear that S∩T is an antichain
contained in Val(P,γ)∖V. Thus, the total contribution (4.2) of the pair (S,T) is t∣P∣(βt)∣S∩T∣.
Moreover, any pair (S,T) with nonzero contribution must be constructed in this way.
Since constructing such a pair (S,T) is equivalent to choosing,
independently
for each v∈Val(P,γ)∖V,
whether v∈S∖T or v∈T∖S or v∈S∩T,
the proposition follows.
∎
4.2 Enriched P-partitions
In Section 3.2, we encountered set-valued P-partitions
by considering Theorem 2.8 applied to the combinatorial
LC-Hopf algebra
(mLPoset,ζ<).
To obtain “enriched” analogues of those definitions,
we proceed in a similar way but
now consider
(mLPoset+,ζ>∣<)
in place of (mLPoset,ζ<).
Let M:={1′<1<2′<2<…} denote
the totally ordered marked alphabet.
Let Set(M) denote the set of finite, nonempty subsets of M.
For i∈Z>0, let ∣i′∣:=∣i∣=i, and define xS:=∏i∈Sx∣i∣ for S∈Set(M).
For S,T∈Set(M), write S≺T if max(S)<min(T) and S⪯T if max(S)≤min(T) (just as before).
Definition 4.4**.**
Let (P,γ) be a labeled poset.
An enriched set-valued (P,γ)-partition is a map σ:P→Set(M)
such that for each covering relation s⋖t in P,
one has σ(s)⪯σ(t) and the following properties hold:
(a)
if γ(s)<γ(t) then
σ(s)∩σ(t)⊂{1,2,3,…}, and
2. (b)
if γ(s)>γ(t) then
σ(s)∩σ(t)⊂{1′,2′,3′,…}.
This is a generalization of Stembridge’s definition of an enriched P-partition [40, §2],
which corresponds to the case when ∣σ(s)∣=1 for all s∈P.
(For other generalizations of this notion, see [37].)
A set-valued partition
in the sense of Definition 3.6 is an
enriched set-valued (P,γ)-partition with values in Set(Z>0).
Example 4.5**.**
Suppose P={1<2<3} and γ(1)<γ(2)>γ(3).
If σ is an enriched set-valued (P,γ)-partition,
then possible values for the sequence (σ(1),σ(2),σ(3))
include ({2′,2},{2,3′},{3′,3}), ({2′},{2,3′},{3,4′,4}),
and ({1′,2′},{3′},{3′}),
but not
({1,2′},{2′,3′},{3,4′})
or
({1,2′},{2,3},{3,4′}).
For a given labeled poset (P,γ),
let E(P,γ) denote the set of all enriched set-valued (P,γ)-partitions.
For each subset V⊆Val(P,γ), define
[TABLE]
so that E(P,γ)=E(P,γ,∅).
Define the length and weight of σ∈E(P,γ)
to be ∣σ∣:=∑s∈P∣σ(s)∣
and xσ:=∏s∈Pxσ(s).
The enriched set-valued weight enumerator of the triple (P,γ,V) is
the quasisymmetric formal power series
[TABLE]
These definitions are natural in view of the following analogue of Theorem 3.8.
Theorem 4.6**.**
The continuous linear map with [(P,γ,V)]↦Ω(β)(P,γ,V)
for each labeled poset (P,γ) and subset V⊆Val(P,γ)
is the unique morphism of combinatorial LC-Hopf algebras
(mLPoset+,ζ>∣<)→(mQSym,ζQ).
Proof.
The result follows by a calculation similar to the proof of Theorem 3.8.
Fix a labeled poset (P,γ) and a subset V⊆Val(P,γ).
For each k∈Z≥0, let
Qk denote the set of 2k-tuples π=(Q1′,Q1,…,Qk′,Qk)
of sets with Qi′∪Qi=∅ for all i∈[k] and Q1′∪Q1∪⋯∪Qk′∪Qk=P
such that
(a)
if s∈Qi′∪Qi and t∈Qj′∪Qj where i<j
then t<s in P,
2. (b)
if s∈Qi′ and t∈Qi,
then t<s in P,
3. (c)
if s,t∈Qi′ and s⋖t in P then γ(s)>γ(t),
4. (d)
if s,t∈Qi and s⋖t in P then γ(s)<γ(t), and
5. (e)
V⊆P∖(Q1′∪Q2′∪⋯∪Qk′).
Define Ik
to
be the set of k-tuples of positive integers I=(i1,i2,…,ik) with i1<i2<⋯<ik.
Given π∈Qk and I∈Ik,
let ∣π∣:=∣Q1′∣+∣Q1∣+⋯+∣Qk′∣+∣Qk∣ and
x(π,I):=xi1∣Q1′∣+∣Q1∣⋯xik∣Qk′∣+∣Qk∣.
According to Theorem 2.8,
the unique morphism
Φ:(mLPoset+,ζ<)→(mQSym,ζQ) is the continuous linear map
with
[TABLE]
We claim that the right side is Ω(β)(P,γ,V).
For
π=(Q1′,Q1,…,Qk′,Qk)∈Qk and I=(i1<⋯<ik)∈Ik,
define σ:P→Set(M) to be the map with
[TABLE]
Properties (a) and (b) imply that if s,t∈P are such that s⋖t
then σ(s)⪯σ(t).
Given this fact, it is easy to see that properties (c)-(e) imply that
σ∈E(P,γ,V).
Clearly ∣σ∣=∣π∣ and xσ=x(π,I).
It suffices to show that (π,I)↦σ is a bijection
⨆k∈Z≥0Qk×Ik→E(P,γ,V).
This is straightforward: the inverse map is σ↦(π,I)
where I is the sequence of elements in {i1<i2<⋯<ik}:=⋃s∈P{∣i∣:i∈σ(s)}
arranged in order,
and π=(Q1′,Q1,…,Qk′,Qk) is the tuple
in which Qj′ and Qj are the sets consisting of the elements s∈P
with ij′∈σ(s) and ij∈σ(s), respectively.
∎
with the summation as above.
The same formula does not hold if we replace Ω(β) by Ωˉ(β),
since one may have
Val(P,γ)∩S⊊Val(S,γ).
However, it does hold that
[TABLE]
this follows by setting V=Val(P,γ) and W=Val(Q,δ) in Corollary 4.7.
4.3 Multipeak quasisymmetric functions
For an arbitrary labeled poset (P,γ), the structures of E(P,γ) and Ω(β)(P,γ) are again determined by
the set L(P) of linear multiextensions of P.
Given an arbitrary finite sequence w=(w1,w2,…,wN) with an injective
map γ:{w1,w2,…,wN}→Z,
let δ:[N]→[N] denote the
unique bijection such that if i<j then
[TABLE]
and define
[TABLE]
The set E(w,γ) consists of all maps σ:[N]→Set(M)
with σ(1)⪯⋯⪯σ(N) such that, for each i∈[N−1],
the following properties hold:
(a)
if i∈/Des(w,γ)
then σ(wi)∩σ(wi+1)⊂{1,2,3,…}, and
2. (b)
if i∈Des(w,γ) then σ(wi)∩σ(wi+1)⊂{1′,2′,3′,…}.
Theorem 4.8**.**
For any labeled poset (P,γ), there is a length- and weight-preserving bijection
E(P,γ)∼⨆w∈L(P)E(w,γ)
and consequently
To make sense of the constructions that follow,
it may be helpful to consult Example 4.9.
Fix σ∈E(P,γ). For each i∈Z>0,
let
[TABLE]
be the sequences of elements s∈P with
i′∈σ(s) and i∈σ(s), respectively,
arranged so that
γ(a1(i))>⋯>γ(aMi(i))
and
γ(b1(i))<⋯<γ(bNi(i)).
The concatenation a(1)b(1)a(2)b(2)⋯ may have adjacent repeated entries,
but omitting these repetitions produces a linear multiextension w=(w1,…,wN)∈L(P), and
there is a unique non-decreasing surjective map
t:[∑iMi+∑iNi]→[N]
such that a(1)b(1)a(2)b(2)⋯=(wt(1),wt(2),wt(3),⋯).
For each j∈[N],
define τ(j)∈Set(M) to be the set containing
i′ for i∈Z>0 if and only if
[TABLE]
and containing i∈Z>0 if and only if
[TABLE]
In other words, τ(j) contains i′ (respectively, i)
precisely when a(i) (respectively, b(i)) contributes the jth entry of w.
This defines a map τ:[N]→Set(M).
By construction, τ(j)⪯τ(j+1) for all j∈[N−1].
Write δ:[N]→[N] for the unique bijection satisfying (4.8) for i<j.
If max(τ(j))=min(τ(j+1))=i∈Z>0, then b(i) contains (wj,wj+1)
as a consecutive subsequence, so γ(wj)<γ(wj+1)
and δ(j)<δ(j+1).
If max(τ(j))=min(τ(j+1))=i′ for some i∈Z>0, then u(i) contains (wj,wj+1)
as a consecutive subsequence,
so γ(wj)>γ(wj+1)
and δ(j)>δ(j+1).
We conclude that τ∈E(w,γ).
Given w∈L(P) and τ∈E(w,γ), we reconstruct σ
as the map s↦⋃j:wj=sτ(j).
The correspondence σ↦(w,τ) is then a bijection from A(P,γ) to the set of pairs (w,τ) with
w∈L(P) and τ∈E(w,γ). Since it holds by construction that ∣σ∣=∣τ∣ and xσ=xτ, the theorem follows.
∎
Example 4.9**.**
Let (P,γ) be the labeled poset of Example 3.1,
so that P={s1,s2,s3,s4} with covering relations
s1⋖s2 and s1⋖s3 and s2⋖s4 and s3⋖s4,
and γ(s1)=5 and γ(si)=i for i∈{2,3,4}.
The map σ:P→Set(M) with
[TABLE]
is an element of E(P,γ), illustrated below:
[TABLE]
In the notation of the proof of Theorem 4.8,
we have a(1)=b(1)=(s1), a(2)=(s1,s3,s2),
b(2)=a(3)=(s2), b(3)=(s3,s4), and a(i)=b(i)=∅ for i>3.
Thus
[TABLE]
The non-decreasing surjective map t:{1,2,…,9}→{1,2,3,4,5}
has
[TABLE]
and τ:{1,2,3,4,5}→Set(M) is the map with
[TABLE]
As expected, we have τ∈E(w,γ) and ∣σ∣=∣τ∣=9 with xσ=xτ=x12x24x33.
Fix a sequence w of length N and an injective map γ:{w1,w2,…,wN}→Z.
It turns out that Ω(β)(w,γ) depends only on the peak set of w,
given by
[TABLE]
(Since we allow w to have repeated entries, the inequality “≤” on the first line is meaningful and may sometimes be an equality.)
To express this precisely, we introduce an “enriched” analogue of Lα(β).
The set Peak(w,γ) is a finite subset of Z>0 that does not contain 1 or any two consecutive integers;
we refer to such sets as peak sets.
A peak composition is a composition α for which I(α) is a peak set. Equivalently,
α is a peak composition if and only if αi≥2 for 1≤i<ℓ(α).
We define the multipeak quasisymmetric function of a peak composition α⊨N to be
[TABLE]
where the sum is over N-tuples S=(S1,S2,…,SN) of sets Si∈Set(M)
with
•
S1⪯S2⪯⋯⪯SN,
•
Si∩Si+1⊂{1′,2′,3′,…} if i∈I(α), and
•
Si∩Si+1⊂{1,2,3,…} if i∈/I(α).
Example 4.10**.**
If α=(2,1) then
(4.9) is the sum over all triples S1⪯S2⪯S3
in Set(M) with S1∩S2⊂{1,2,…} and S2∩S3⊂{1′,2′,…}.
One can show that in this case (4.9) is equivalent
to the formula
[TABLE]
where
x⊕y:=x+y+βxy. There is an amusing formal similarity between this expression and the one
for L(2,1)(β) in Example 3.13.
Fix a choice of (w,γ) as above, and
let α⊨ℓ(w) be the unique composition such that I(α)=Peak(w,γ).
Then Kα(β)=Ω(β)(w,γ).
Proof.
Let w be a sequence of length N, let γ:{w1,w2,…,wN}→Z be an injective map,
and let α⊨N be the composition with I(α)=Peak(w,γ).
If Peak(w,γ)=Des(w,γ)
then
Ω(β)(w,γ)=Kα(β)
holds by definition.
Suppose 1<i<N is such that i−1,i∈Des(w,γ) and i+1∈/Des(w,γ).
Let w′ be a word of length N with an injective map
γ′:{w1′,w2′,…,wN′}→Z such that Des(w′,γ′)=Des(w,γ)∖{i}.
Then Peak(w′,γ′)=Peak(w,γ)=Des(w,γ)
and σ(i)∩σ(i+1)⊆{1′,2′,…}
for all σ∈E(w,γ).
It suffices to show that Ω(β)(w,γ)=Ω(β)(w′,γ′),
since iterating this identity
lets us assume without loss of generality that Peak(w,γ)=Des(w,γ).
To this end, it is enough to construct
a length- and weight-preserving bijection
E(w,γ)∼E(w′,γ′).
For σ∈E(w,γ), define σ′:[N]→Set(M) as follows.
Set σ′(j)=σ(j) for j∈/{i,i+1},
and if max(σ(i))<min(σ(i+1)) then define
[TABLE]
Suppose max(σ(i))=min(σ(i+1))=a′ for a∈Z>0.
If a∈σ(i+1) then set
[TABLE]
and if a∈/σ(i+1) then set
[TABLE]
The resulting map σ′ is an element of E(w′,γ′)
with ∣σ∣=∣σ′∣ and xσ=xσ′
and it is easy to see that σ↦σ′
is a bijection E(w,γ)∼E(w′,γ′), as needed.
∎
Setting β=0 in (4.9) recovers Stembridge’s definition [40, §2.2] of
the peak quasisymmetric functionKα:=Kα(0)=∑α′2ℓ(α′)Mα′∈QSym,
where the sum is over all compositions α′⊨∣α∣ with
I(α)⊆I(α′)∪(I(α′)+1).
If β has degree zero and xi has degree one,
then Kα is the nonzero homogeneous component of Kα(β)
of lowest degree.
The peak quasisymmetric functions are
a basis for a subalgebra of QSym [40, Thm. 3.1].
The power series {Kα(β)} are therefore a pseudobasis for a linearly compact Z[β]-submodule
of mQSym.
There is a slight variant of the preceding constructions which is also of interest.
Let w=(w1,w2,…,wN) be an arbitrary finite sequence along with
an injective map γ:{w1,w2,…,wN}→Z.
Extending our earlier notation, let
[TABLE]
where
δ:[N]→[N] is again the map
satisfying (4.8) for all 1≤i<j≤N.
For a
peak composition α⊨N, define
[TABLE]
where the sum is over N-tuples S=(S1,S2,…,SN) of sets Si∈Set(M)
with
•
S1⪯S2⪯⋯⪯SN,
•
Si≺Si+1 if i∈I(α), and Si+1⊆Z>0 if i∈{0}∪I(α), and
•
Si∩Si+1⊆Z>0 if i∈/I(α).
These are the same as the tuples indexing the sum in (4.9) except
we require the set Si+1 to contain only unprimed numbers if i∈{0}∪I(α).
Example 4.12**.**
If α=(2,1) then
(4.10) is the sum over all triples S1⪯S2≺S3
with S1,S3∈Set(Z>0) and S2∈Set(M).
In this case (4.10) is equivalent
to
Fix a choice of (w,γ) as above, and
let α⊨ℓ(w) be the unique composition such that I(α)=Peak(w,γ).
Then Kˉα(β)=Ωˉ(β)(w,γ).
Proof.
Our argument is similar to the proof of Proposition 4.11
but relies on a different bijection.
Let w=(w1,w2,…,wN) be a finite sequence
of length N, let γ:{w1,w2,…,wN}→Z be an injective map,
and let
α⊨N be the composition with I(α)=Peak(w,γ).
We have Ωˉ(β)(w,γ)=Kˉα(β) by definition if
Peak(w,γ)=Des(w,γ).
Let
Eˉ(w,γ)=E([N],δ,Val([N],δ)) where δ:[N]→[N] satisfies (4.8), so that
Ωˉ(β)(w,γ)=∑σ∈Eˉ(w,γ)β∣σ∣−Nxσ.
Suppose 1<i<N is such that i−1,i∈Des(w,γ) and i+1∈/Des(w,γ).
Define w′ and γ′ as in the proof of Proposition 4.11
so that Des(w′,γ′)=Des(w,γ)∖{i}
and Peak(w′,γ′)=Peak(w,γ)=Des(w,γ).
It suffices to show that Ωˉ(β)(w,γ)=Ωˉ(β)(w′,γ′),
and we do so
by constructing
a length- and weight-preserving bijection
Eˉ(w,γ)∼Eˉ(w′,γ′).
We have
i+1∈Val(w,γ):={j∈[N]:γ(wj−1)>γ(wj)≤γ(wj+1)},
where we define γ(w0)=γ(wN+1):=∞.
More specifically, it holds that
[TABLE]
Let σ∈E(w,γ)
and observe that necessarily
[TABLE]
We must therefore have σ(i)≺σ(i+1).
We define a map σ′:[N]→Set(M) as follows.
Set σ′(j)=σ(j) for j∈/{i,i+1}.
If σ(i)⊆Z>0 then define
[TABLE]
Otherwise, there exists a smallest a∈Z>0 with a′∈σ(i)∩{1′,2′,…}.
In this case, if b:=min(σ(i+1))∈Z>0 and b′∈σ(i) then we set
[TABLE]
while if b′∈/σ(i) then we set
[TABLE]
The resulting map σ′ is an element of Eˉ(w′,γ′)
with ∣σ∣=∣σ′∣ and xσ=xσ′
and one can check that σ↦σ′
is a bijection Eˉ(w,γ)∼Eˉ(w′,γ′), as needed.
∎
Setting β=0 in (4.10) recovers
the power series denoted
Kˉα
in [40],
which is the nonzero homogeneous component of Kˉα(β)
of lowest degree.
Since Kˉα=2−ℓ(α)Kα,
the power series {Kˉα(β)} are a pseudobasis for a (different) linearly compact Z[β]-submodule
of mQSym.
Unlike Kˉα=Kˉα(0) and Kα=Kα(0),
the power series Kˉα(β) and Kα(β)
are not scalar multiples of each other. We investigate their precise relationship next.
4.4 Poset operators
Fix a labeled poset (P,γ) and let V⊆Val(P,γ).
It is not hard to show that we always have
Ω(0)(P,γ,V)=2−∣V∣Ω(0)(P,γ).
The relationship between Ω(β)(P,γ,V) and Ω(β)(P,γ) is more complicated,
involving the vertex doubling operatorsDv that we now define.
Given v∈P,
define Dv(P,γ):=(Q,δ) to be the labeled poset with the following properties.
•
As a set, Q=P⊔{v′} is the disjoint of union of P and a new element v′.
•
The order on Q is the one extending the order on P such that
v⋖v′ and for every x∈P∖{v}, v′ is related to x in the same way that v is.
•
The labeling map δ satisfies δ(v)=γ(v), δ(v′)=γ(v)+1, δ(x)=γ(x)+1 for x∈P with γ(v)<γ(x), and δ(x)=γ(x) for all other x∈P.
Example 4.14**.**
If we represent labeled posets as oriented Hasse diagrams as in
Example 3.1,
then the doubling operator Dv acts as follows:
[TABLE]
If P is a chain (i.e., linearly ordered) then Dv(P,γ) is also a chain.
Lemma 4.15**.**
Let (P,γ) be a labeled poset.
Suppose v∈V⊆Val(P,γ) and (Q,δ)=Dv(P,γ).
There is then a length- and weight-preserving bijection
Let E′(P,γ,V) be the set of enriched set-valued (P,γ)-partitions
τ∈E(P,γ,V∖{v})
such that max(τ(v)) is the unique primed entry of τ(v).
Removing the prime from max(τ(v))
defines a length- and weight-preserving bijection E′(P,γ,V)→E(P,γ,V).
We describe a bijection
E(P,γ,V∖{v})→E(P,γ,V)⊔E′(P,γ,V)⊔E(Q,δ,V).
Fix σ∈E(P,γ,V∖{v}) and define σ′ as follows.
If σ∈E(P,γ,V)⊔E′(P,γ,V),
then we set σ′=σ.
Otherwise, σ(v) contains a least primed integer a′=max(σ(v)), and we define
σ′∈E(Q,δ,V) to be the map with
[TABLE]
and σ′(s)=σ(s) for all s∈P∖{v}=Q∖{v,v′}.
It is easy to see that σ↦σ′
is a length- and weight-preserving bijection of the desired type.
∎
Fix a labeled poset (P,γ), a subset V⊆Val(P,γ), and a vertex v∈P.
Let (Q,δ):=Dv(P,γ).
We use the notational shorthand Dv⋅Ω(β)(P,γ,V) to mean
[TABLE]
so that
Dv⋅Ωˉ(β)(P,γ)=Ωˉ(β)(Dv(P,γ))
and
Dv⋅Ω(β)(P,γ)=Ω(β)(Dv(P,γ)).
In this shorthand, one has by simple telescoping that
[TABLE]
in mQSymQ[β], and we define (2+βDv)−1:=21∑n=0∞(−β/2)nDvn.
Theorem 4.16**.**
Let (P,γ) be a labeled poset, V a subset of Val(P,γ), and U=Val(P,γ)∖V. Then
[TABLE]
In
particular, we have
Ω(β)(P,γ)=∏v∈Val(P,γ)(2+βDv)⋅Ωˉ(β)(P,γ).
Proof.
Lemma 4.15 implies
that
(2+βDu)⋅Ω(β)(P,γ,V⊔{u})=Ω(β)(P,γ,V)
if u∈U. The result follows by repeating this observation.
∎
As a corollary, we deduce
that each Kα(β) is a finite Z[β]-linear combination of Kˉα(β)’s
while each Kˉα(β) is an infinite Q[β]-linear combination of Kα(β)’s.
Corollary 4.17**.**
If α=(α1,α2,…,αn) is a peak composition then
[TABLE]
Proof.
Given Propositions 4.11 and 4.13,
it is straightforward to deduce these identities from
Theorem 4.16.
∎
4.5 Quasisymmetric subalgebras
As noted in Section 4.3, both
{Kα(β)} and
{Kˉα(β)} (with α ranging over all peak compositions) are
linearly independent families
in mQSym.
Moreover, all x-monomials appearing
in Kα(β) and Kˉα(β) have degree at least ∣α∣.
We may therefore make the following definitions.
Definition 4.18**.**
Let mΠSym and mΠˉSym
denote the linearly compact Z[β]-modules
with the multipeak quasisymmetric functions {Kα(β)}
and {Kˉα(β)}
(α ranging over all peak compositions) as
respective pseudobases.
Define
mΠSymQ[β] to
be the linearly compact Q[β]-module with {Kα(β)} as a pseudobasis.222For simplicity, we define mΠSymQ[β] over the polynomial ring Q[β] with rational coefficients, but in fact, it would be sufficient to work with coefficients in Z[2−1] rather than Q. As in Corollary 4.17, we will only ever need to divide by powers of the prime 2.
Theorem 4.19**.**
Both mΠSym and mΠˉSym are LC-Hopf subalgebras of mQSym,
and
mΠˉSym=mQSym∩mΠSymQ[β]⊇mΠSym.
On setting β=0, this reduces to [40, Cor. 3.4],
whose proof is similar.
Proof.
The modules mΠSym and mΠˉSym are LC-Hopf subalgebras of mQSym
since (in view of
Theorem 4.8 and the results in the previous section) they
are the images of mLPoset and mLPoset+ under the LC-Hopf algebra morphism
described in Theorem 4.6.
Corollary 4.17 implies that mΠˉSym⊆mQSym∩mΠSymQ[β].
Write ≺ for the linear order on compositions with α≺α′ if
∣α∣<∣α′∣ or
if ∣α∣=∣α′∣ and α exceeds α′ in lexicographic order.
By (4.10), if α is a peak composition then
Kˉα(β)∈Mα+∑α≺α′Z[β]Mα′,
so any Q[β]-linear combination of Kˉα(β)’s
in mQSym
must have coefficients in Z[β].
Thus, in view of Corollary 4.17,
the reverse inclusion mΠˉSym⊇mQSym∩mΠSymQ[β] also holds.
∎
Corollary 4.20**.**
If V⊆Val(P,γ)
then Ω(β)(P,γ,V)∈mΠˉSym.
Proof.
This follows from Theorem 4.19 since
Ω(β)(P,γ,V) belongs to mQSym by definition and to mΠSymQ[β]
by Theorem 4.16.
∎
As in Example 4.10, let
x⊕y:=x+y+βxy.
Also define ⊖x:=1+βx−x, so that x⊕(⊖x)=0.
Elements of mΠSymQ[β] satisfy the following cancellation law,
which would be equivalent to Ikeda and Naruse’s K-theoretic Q-cancellation property [19, Def. 1.1] if we also required symmetry in the xi variables.
Setting β=0 in this statement recovers [40, Lem. 3.7].
Lemma 4.21**.**
If f∈mΠSymQ[β] then
f(t,⊖t,x3,x4,…)=f(x3,x4,…) where t is an indeterminate
commuting with each xi.
Proof.
If f∈Z[β][[x1,x2,…]] then let f(x1,x2,…,xn)∈Z[β][x1,x2,…,xn]
denote the polynomial obtained by setting xi=0 for all i>n.
Suppose (P,γ) is a labeled poset.
It follows from the definition of Ω(β)(P,γ) that
[TABLE]
where the sum is over all ordered pairs (S,T) of subsets of P such that
S is a lower set, T is an upper set,
P=S∪T, and
S∩T is an antichain.
To prove the lemma, it is therefore enough to check that
Ω(β)(P,γ)(t,⊖t)=0 whenever P is nonempty.
Let α be a nonempty peak composition.
By Theorem 4.8 and Proposition 4.11, it suffices to show that Kα(β)(t,⊖t)=0.
It is clear from (4.9) that Kα(β)(x1,x2)=0 if ℓ(α)>2.
If α has a single part, then in the notation of [19] one has Kα(β)=GQα(β)
(see [19, Thm. 9.1] and Section 4.6 below) and the desired identity
is [19, Prop. 3.1].
Assume α=(j,N−j)⊨N has two parts with j≥2.
From (4.9),
it is easy to see that Kα(β)(x1,x2)=∑σβ∣σ∣−Nxσ
where the sum is over all maps
σ:[N]→{nonempty subsets of {1′,1,2′,2}} such that
•
σ(1) is {1′} or {1} or {1′,1}, and σ(i)={1} for 1<i<j,
•
σ(j) is {1} or {2′} or {1,2′}, and
•
σ(j+1) is {2′} or {2} or {2′,2}, and σ(i)={2} for j+1<i≤N.
Thus Kα(β)(x1,x2)=(2x1+βx12)x1j−2(x1+x2+βx1x2)(2x2+βx22)x2N−j−1,
which we can rewrite as
Kα(β)(x1,x2)=(x1⊕x1)(x1⊕x2)(x2⊕x2)x1j−2x2N−j−1.
Since t⊕(⊖t)=0, we have Kα(β)(t,⊖t)=0 as needed.
∎
The LC-Hopf subalgebra mΠSym is also a quotient of mQSym. Define
[TABLE]
to be the continuous Z[β]-linear map with
Lα(β)↦KΛ(α)(β)
for each composition α,
where Λ(α) is the peak composition of ∣α∣ characterized by
[TABLE]
If Des(w,γ)=I(α)
then Peak(w,γ)=I(Λ(α)),
and if α is already a peak composition then Λ(α)=α.
Corollary 4.22**.**
The map Θ(β) sends Γ(β)(P,γ)↦Ω(β)(P,γ)
for all labeled posets (P,γ)
and is a surjective morphism of LC-Hopf algebras mQSym→mΠSym.
Proof.
Theorems 3.11 and 4.8 show that
Θ(β)(Γ(β)(P,γ))=Ω(β)(P,γ) for all labeled posets (P,γ).
Comparing Corollaries 3.9 and 4.7
shows that this is a bialgebra morphism, and hence an LC-Hopf algebra morphism.
Since the Kα(β) form a pseudobasis for mΠSym, it is also surjective.
∎
Remark**.**
As discussed in Remark 3.14,
results of Lam and Pylyavskyy [22, §5.4]
lead to product and coproduct formulas for the multifundamental quasisymmetric functions
Lα(β). Applying Θ(β) to such identities gives analogous
(co)product formulas for the multipeak quasisymmetric functions Kα(β).
4.6 Shifted stable Grothendieck polynomials
A primary motivation for our definition of enriched set-valued P-partitions
comes from the families of shifted stable Grothendieck
polynomialsGQλ and GPλ introduced by
Ikeda and Naruse in [19].
Mirroring the situation in Section 3.4,
we can recover these power series as the enriched set-valued weight enumerators
of labeled posets associated to shifted Young diagrams.
In this section,
we will also describe skew analogues of GQλ and GPλ, which have not been
considered previously.
Suppose λ=(λ1>λ2>⋯>0)
and μ=(μ1>μ2>⋯>0)
are strict partitions with μ⊆λ.
The shifted skew diagram of λ/μ is
[TABLE]
Let SDλ=SDλ/∅.
As usual, we consider SDλ/μ to be partially ordered with (i,j)≤(i′,j′)
if i≤i′ and j≤j′.
Let n=∣λ∣−∣μ∣ and fix a bijection θ:SDλ/μ→[n]
satisfying the conditions in (3.7).
For example, if λ=(5,4,2) and μ=(2,1) then
the oriented Hasse diagram representing (SDλ/μ,θ) is
[TABLE]
It may be helpful to contrast this picture with (3.8).
The elements of E(SDλ/μ,θ)
may be identified with semistandard shifted set-valued (marked) tableaux of shape λ/μ
as defined in [19, §9.1],
i.e., fillings of SDλ/μ by finite nonempty subsets of M that are weakly increasing along rows and columns in the sense of
the relation ⪯, such that no unprimed number appears twice in the same column and no primed number appears twice in the same row.
We let
[TABLE]
and define the K-theoretic Schur Q-function of λ/μ to be
[TABLE]
Both definitions are independent of θ.
The special case GQλ(β):=GQλ/∅(β)
coincides with Ikeda and Naruse’s definition of a K-theoretic Schur Q-function
[19, Thm. 9.1].
We will show in Section 5 that the quasisymmetric function GQλ/μ(β)
is always symmetric in the xi variables;
when μ=∅, this follows from [19, Thm. 9.1].
Setting β=0 reduces (4.13) to the definition of the skew Schur Q-functionQλ/μ
described, for example, in [40, App. A.1].
Recall that a semistandard set-valued tableau is standard
if its entries are disjoint sets, not containing any consecutive integers,
with union {1,2,…,N} for some N≥n.
The set L(SDλ/μ) of linear multiextensions
of SDλ/μ is naturally identified with the set of standard set-valued (unmarked) tableaux of shifted shape
λ/μ;
a sequence (w1,w2,…,wN)∈L(SDλ/μ)
corresponds to the standard set-valued tableau containing i in box wi.
Let
[TABLE]
and define Peak(T):=Peak(T,θ) for T∈SetSYTshifted(λ/μ);
then i∈Peak(T) if and only if i−1, i, and i+1 all appear in T with i in a strictly greater column
than i−1 and a strictly lesser row than i+1.
Theorem 4.8 implies that
[TABLE]
where the sum is over peak compositions α and
gλ/μα is the number of tableaux
T∈SetSYTshifted(λ/μ) with ∣T∣=∣α∣ and Peak(T)=I(α).
There is a second family of shifted stable Grothendieck polynomials discussed in [19],
which arise in a similar way as enriched set-valued weight enumerators.
Continue to let λ and μ be strict partitions with μ⊆λ.
Let n=∣λ∣−∣μ∣ and fix a bijection θ:SDλ/μ→[n]
satisfying (3.7) as above.
Define
[TABLE]
where the containment is equality if μ=∅.
The elements of E(SDλ/μ,θ,Vλ/μ)
are precisely the semistandard shifted set-valued tableaux in SetSSMT(λ/μ) whose entries on the main diagonal contain only unprimed numbers.
We define the K-theoretic Schur P-function of λ/μ to be
[TABLE]
This formula is again independent of the choice of θ.
The case GPλ(β):=GPλ/∅(β)=Ωˉ(β)(SDλ/μ,θ)
is Ikeda and Naruse’s definition of a K-theoretic Schur P-function
[19, Thm. 9.1].
As with GQλ(β),
Ikeda and Naruse prove that GPλ(β) is symmetric in the xi variables;
we extend this result to skew shapes below.
Setting β=0 in (4.15) recovers the skew Schur P-functionPλ/μ=2ℓ(μ)−ℓ(λ)Qλ/μ.
The essential reference for the properties of GPλ(β) and GQλ(β) is
[19].
For more background and various extensions, see [32, 33, 34].
We obtain a third interesting family of shifted stable Grothendieck polynomials
as a special case of the preceding constructions.
Let μ and λ be arbitrary partitions (i.e., not necessarily strict)
with μ⊆λ.
Suppose λ has k parts and let δk:=(k,k−1,…,2,1).
The partitions
[TABLE]
are then both strict, so we can set
[TABLE]
This definition appears to be new.
We refer to GSλ/μ(β) as the
K-theoretic Schur S-function of λ/μ.
The name makes sense as setting β=0 recovers the Schur S-functionSλ/μ
discussed in [40, §A.4] and [25, §III.8],
which is also the homogeneous
component of GSλ/μ(β) of lowest degree.
Suppose n=∣λ∣−∣μ∣.
Since
SD(λ+δk)/(μ+δk)≅Dλ/μ
as posets, we have
by Corollary 4.22 that
[TABLE]
This shows that Θ(β) is a K-theoretic analogue of the superfication map discussed in
[21, §3.2].
We expect that the functions GSλ(β)
are related to the “K-theoretic Stanley symmetric functions” of classical types B, C, and D introduced
in [20], as well as to
K-theoretic generalizations of the main result in [30].
There is one other connection to the recent literature that we can explain more precisely.
DeWitt has shown that
Sμ=Qν
if μ and ν are the partitions
[TABLE]
for some m,k∈Z>0;
moreover,
this is the only possible identity of the form Sλ/μ=cQν with c∈Z
apart from the equality S(2,1)/(1)=Q(1)Q(1)=2Q(2)
[9, Thm. IV.3].
DeWitt’s result appears to generalize.
Since GS(2,1)/(1)(β)=GQ(1)(β)GQ(1)(β)=2GQ(2)(β)
and since the K-theoretic Schur Q- and S-functions are homogeneous
if β has degree −1,
this formula would describe all possible identities of the form
GSλ/μ(β)=cGQν(β) with c∈Z[β].
5 Symmetric functions
The power series GPλ/μ(β) and GQλ/μ(β) defined
by (4.14) and (4.15) are quasisymmetric by construction. When μ=∅, it follows from [19, Thm. 9.1] that these power series are actually symmetric. In this section,
we
prove that GPλ/μ(β) and GQλ/μ(β) are symmetric for any μ.
As motivation, we start by discussing the
connection between these power series and the K-theory of the Grassmannian.
5.1 K-theory of Grassmannians
Suppose Z is a complex algebraic variety. The
K-theory ringK(Z)
is the Grothendieck group of locally-free sheaves on Z.
The ring multiplication is the operation induced by the tensor product.
Fix integers 0≤k≤n and let Gr(k,Cn) denote the Grassmannian of
k-dimensional subspaces of Cn.
For each partition λ whose diagram fits in the rectangle [k]×[n−k],
there is an associated Schubert varietyXλ⊆Gr(k,Cn); see [26, §3.2]. If OXλ denotes the structure sheaf of Xλ, then
the ring K(Gr(k,Cn)) is spanned by the corresponding classes [OXλ].
Let Γ be the additive group generated by the stable Grothendieck polynomials
Gλ:=Gλ(−1) as λ ranges over all integer partitions,
and let
Ik,n−k denote the subgroup of Γ spanned by the functions Gλ
indexed by partitions λ⊆[k]×[n−k].
Results of Buch [4] show that Γ is a ring in which
the subgroup Ik,n−k is an ideal.
If we set [OXλ]=0 when λ⊆[k]×[n−k],
then Gλ↦[OXλ]
induces a ring isomorphism Γ/Ik,n−k∼K(Gr(k,Cn)).
Thus, the stable Grothendieck polynomials are “universal” K-theory representatives
for Schubert varieties in type A Grassmannians, and their structure constants
determine the structure constants of the ring K(Gr(k,Cn)).
The shifted stable Grothendieck polynomials have a similar interpretation
in the context of Lagrangian and maximal orthogonal Grassmannians.
Fix a nondegenerate symmetric bilinear form ⟨⋅,⋅⟩ on Cn and define OG(k,n) to be the
orthogonal Grassmannian of k-dimensional subspaces V⊆Cn
that are isotropic, in the sense that ⟨V,V⟩=0.
Let Gn be either OG(n,2n+1) or OG(n+1,2n+2).
For each strict partition λ whose shifted diagram fits in the square [n]×[n],
or which equivalently has λ⊆(n,n−1,…,2,1),
there is an associated Schubert varietyΩλ⊆Gn [19, §8.1].
The classes [OΩλ] of the corresponding structure sheaves are a basis for K(Gn).
Let ΓP be the additive group generated by
GPλ:=GPλ(−1) as λ ranges over all strict partitions.
Let
IP,n denote the subgroup of ΓP spanned by the functions GPλ
indexed by strict partitions λ⊆(n,n−1,n…,2,1).
Results in [8, 19]
(see also [18]) show that ΓP is a ring in which IP,n is an ideal.
If we set [OΩλ]=0 when λ⊆(n,n−1,…,2,1),
then GPλ↦[OΩλ]
induces a ring isomorphism ΓP/IP,n∼K(Gn).
A similar result holds for the K-theoretic Schur Q-functions, with one technical caveat.
Let LG(n) denote the Lagrangian Grassmannian
of n-dimensional subspaces in C2n that are isotropic with respect to a fixed
nondegenerate skew-symmetric bilinear form.
For each strict partition λ⊆(n,n−1,…,2,1),
there is again an associated Schubert varietyΩλ′⊆LG(n), and
the classes [OΩλ′] are a basis for K(LG(n)) [19, §8.1].
Let ΓQ be the additive group generated by
GQλ:=GQλ(−1) as λ ranges over all strict partitions,
and let IQ,n
be the subgroup spanned by the functions GQλ
with λ⊆(n,n−1,…,2,1).
Let Γ^Q:=∏λZGQλ⊋⨁λZGQλ=ΓQ and define I^Q,n as the completion of IQ,n relative to its basis of GQλ’s.
It then follows from [19, Prop. 3.5] that
Γ^Q is a ring in which I^Q,n is an ideal.
If we set [OΩλ′]=0 when λ⊆(n,n−1,…,2,1),
then GQλ↦[OΩλ′]
induces a ring isomorphism Γ^Q/I^Q,n∼K(LG(n)).
We have to state this result in terms of the completions Γ^Q and I^Q,n
because
it is still an open problem to show that ΓQ is a ring; see [19, Conj. 3.2].
If this holds then GQλ↦[OΩλ′]
would also induce an isomorphism ΓQ/IQ,n∼K(LG(n)).
To prove Ikeda and Naruse’s conjecture, it is enough to show that
GQλ(β)GQμ(β) is always a finite linear combination of GQν(β)’s.
Results of Buch and Ravikumar [5] imply that this holds at least when λ or μ has a single part.
5.2 Fomin–Kirillov operators
An element f∈Z[β][[x1,x2,…]] is symmetric if
the coefficients of x1a1x2a2⋯xkak and xi1a1xi2a2⋯xikak
in f are equal for every choice of a1,a2,…,ak∈Z>0 and every choice of k distinct positive integers
i1,i2,…,ik.
Equivalently, f should be invariant under the change of variables swapping
xi and xi+1 for all i.
Definition 5.4**.**
Let mSym denote the Z[β]-module
of all symmetric power series in Z[β][[x1,x2,…]].
Let Sym denote the submodule of power series in mSym of bounded degree.
The monomial symmetric function of a partition λ is
the power series given by the sum
mλ:=∑α)=λMα over all compositions
α that sort to λ.
It is well-known that Sym is a graded Hopf subalgebra of QSym,
which is free as a Z[β]-module
with
a homogeneous basis given by the power series {mλ}.
We identify mSym with the completion of Sym relative to this basis.
The main result of this section is the following theorem,
which reduces to [19, Thm. 9.1] in the case when μ=∅.
Theorem 5.5**.**
Let μ and λ be strict partitions
with μ⊆λ.
The power series GPλ/μ(β) and GQλ/μ(β)
are elements of mSym.
We delay the proof of this result until Section 5.3.
First, we need to introduce two new families of power series closely related to
GPλ/μ(β) and GQλ/μ(β).
Let SPart be
the free Z[β][[x1,x2,…]]-module with a pseudobasis given by the set of all strict partitions, and write
mSPart for the corresponding completion.
Let
⟨⋅,⋅⟩:SPart×mSPart→Z[β][[x1,x2,…]]
denote the associated form making the natural (pseudo)bases of strict partitions in SPart and mSPart dual to each other. In other words, ⟨⋅,⋅⟩ is the
nondegenerate Z[β][[x1,x2,…]]-bilinear form, continuous in the second coordinate,
such that ⟨μ,ν⟩=δμν for all strict partitions μ and ν.
Let μ be a strict partition of n∈Z≥0
with shifted diagram SDμ as in (4.12). The rth diagonal of μ is the set of positions (i,j)∈SDμ with j−i=r.
The removable boxes of μ
are the positions (i,j)∈SDμ such that SDμ∖{(i,j)} is the shifted diagram of
a strict partition of n−1.
The addable boxes of μ
are the positions (i,j)∈/SDμ such that SDμ⊔{(i,j)} is the shifted diagram of a strict partition of n+1.
For n∈Z≥0, define
an:SPart→SPart
to be the continuous linear map such that if μ is a strict partition then
[TABLE]
When β=0 the maps ai specialize to the diagonal box-adding operators considered
in [11, Ex. 2.4] or [38, §1.4].
For x∈Z[β][[x1,x2…]], let
[TABLE]
These operators are similar to the ones which Fomin and Kirillov define in [12].
Fix strict partitions μ⊆λ, let n=λ1≥ℓ(λ),
and define
[TABLE]
The first formula is well-defined because the coefficient of each fixed x-monomial
in ⟨λ,Pn(xN)⋯Pn(x2)Pn(x1)μ⟩
eventually stabilizes as N→∞.
The second formula makes sense for similar reasons.
(One can replace n in these formulas by any integer greater than λ1
without changing the meaning.)
From our definition, it is only clear that GPλ//μ(β)
and GQλ//μ(β) are formal power series in Z[β][[x1,x2,…]].
These power series are actually quasisymmetric and related to
GPλ/μ(β)
and GQλ/μ(β) in the following way.
Let Rem(μ) be the set of removable boxes of the strict partition μ.
Proposition 5.6**.**
Suppose μ⊆λ are strict partitions. Then
[TABLE]
where both sums are over all strict partitions ν⊆μ with SDμ/ν⊆Rem(μ).
In particular, neither GPλ//λ(β) nor GQλ//λ(β)
is equal to GPλ/λ(β)=GQλ/λ(β)=1.
Proof.
A vertical strip (respectively, horizontal strip) is a skew shape with no two boxes in the same row (respectively, same column).
We first prove the formula for GQλ//μ(β).
Let n=λ1≥ℓ(λ).
From the definition of ai and Ai(x), one sees that the strict partition λ appears with nonzero coefficient in A0(x)A1(x)⋯An(x)μ if and only if we can produce the shifted diagram of λ by adding a vertical strip to the shifted diagram of μ. Moreover, if we define Vλ/μ to be the collection of vertical strips V such that V∪SDμ=SDλ and V∩SDμ⊆Rem(μ),
then
[TABLE]
Similarly, λ appears with nonzero coefficient in An(x)⋯A1(x)A0(x)μ if and only if we can can produce the shifted diagram of λ by adding a horizontal strip to the shifted diagram of μ. Moreover, if we define Hλ/μ to be the collection of horizontal strips H such that H∪SDμ=SDλ and H∩SDμ⊆Rem(μ), then
[TABLE]
Combining these observations, we deduce that
[TABLE]
where the sum is over all tuples (V1,H1,V2,H2,…,VN,HN)
such that for some sequence of strict partitions μ=λ0⊆μ1⊆λ1⊆μ2⊆λ2⊆⋯⊆μN⊆λN=λ
it holds that Vi∈Vμi/λi−1 and Hi∈Hλi/μi.
Fix strict partitions μ⊆λ. Consider the set of semistandard shifted set-valued tableaux T of shape λ/ν
where ν⊆μ is a strict partition with SDμ/ν⊆Rem(μ).
This set is in bijection with the sequences indexing the summands of (5.3) via the
map T↦(V1,H1,V2,H2,…)
where
Vi and Hi are the sets of
boxes in T containing i′ and i, respectively.
Moreover, under this bijection, we have
∣T∣=∑i(∣Vi∣+∣Hi∣) and xT=∏ixi∣Vi∣+∣Hi∣.
Thus,
the desired formula for GQλ//μ(β) follows by combining the definition
(4.13) with (5.3).
The argument needed to deduce our formula for GPλ//μ(β) is similar:
one just needs to modify the steps above by
replacing A0(x)A1(x)⋯An(x) by A1(x)⋯An(x) in (5.2)
and requiring all vertical strips V∈Vλ/μ to contain no positions on the main diagonal.
We omit the details.
∎
Applying inclusion-exclusion to the preceding result gives the following.
Corollary 5.7**.**
Suppose μ⊆λ are strict partitions. Then
[TABLE]
where both sums are over all strict partitions ν⊆μ.
5.3 Yang-Baxter relations
In view of Corollary 5.7,
to prove Theorem 5.5 it suffices to show that GPλ//μ(β) and GQλ//μ(β) are symmetric.
For this it is enough to prove that the operators Pn(x) and Pn(y) (respectively, Qn(x) and Qn(y)) commute. To show this latter fact, we follow the approach of [12] (see also [11, 14, 38, 42]), proving some Yang–Baxter-type equations satisfied by the factors Ai(x) and Aj(x).
Extending our earlier notation, for any expressions x and y, we write
[TABLE]
The operators Ai(x) from (5.1) satisfy the following commutation relations.
Lemma 5.8**.**
Let i,j∈Z≥0 and x,y∈Z[β][[x1,x2,…]]. Then
(a)
Ai(x)Aj(y)=Aj(y)Ai(x) if ∣i−j∣>1,
2. (b)
Ai(x)Ai(y)=Ai(x⊕y),
3. (c)
Ai+1(x)Ai(x⊕y)Ai+1(y)=Ai(y)Ai+1(x⊕y)Ai(x) if i>0, and
4. (d)
The first two statements are clear from the definitions of ai and Ai(x) in (5.1).
For part (c), assume i>0 and consider f:=Ai+1(x)Ai(z)Ai+1(y) and f′:=Ai(y)Ai+1(z)Ai(x); later, we will specialize z to x⊕y.
Write dj:={(a,b)∈Z>0×Z>0:b−a=j} for the jth diagonal in Z>0×Z>0.
The behavior of f and f′ on a strict partition μ depends only on local properties of its shifted diagram.
There are finitely many cases to consider:
•
It is not possible for
the adjacent diagonals di and di+1 to both contain removable boxes of μ or to both contain addable boxes of μ.
•
If neither di nor di+1 contains an addable or removable box of μ, then we have aiμ=ai+1μ=0, so fμ=f′μ=μ.
•
Suppose di+1 contains an addable box of μ and di does not contain an addable or removable box.
Let μ′ be the strict partition whose shifted diagram is obtained from SDμ by adding a box in diagonal i+1.
Then μ′ has an addable box in diagonal i;
write μ′′ for the result of adding this box.
Then μ′′ does not have an addable or removable box in diagonal i+1, so we compute
fμ=μ+(x⊕y)μ′+yzμ′′ and f′μ=μ+zμ′+yzμ′′.
Thus we have (f−f′)μ=(x⊕y−z)μ′.
•
If di contains an addable box of μ and di+1 does not contain an addable or removable box then by similar reasoning
(f−f′)μ=(z−x⊕y)μ′ where μ′ is the result of adding a box in diagonal i to μ.
•
If di+1 contains a removable box and di does not contain an addable or removable box,
then fμ=(1+βx)(1+βy)μ=(1+β⋅x⊕y)μ and f′μ=(1+βz)μ.
•
If di has a removable box and di+1 does not contain an addable or removable box then fμ=(1+βz)μ and f′μ=(1+βx)(1+βy)μ=(1+β⋅x⊕y)μ.
•
Suppose di contains an addable box of μ and di+1 contains a removable box.
Let μ′ be the strict partition whose shifted diagram is obtained from SDμ by adding a box in diagonal i. Then μ′ does not have an addable or removable box in diagonal i+1,
so
fμ=(1+βx)(1+βy)μ+(1+βy)zμ′ and f′μ=(1+βz)μ+(x⊕y+βyz)μ′. Thus (f−f′)μ=(x⊕y−z)(βμ−μ′).
•
If di contains a removable box of μ and di+1 contains an addable box then
by similar reasoning (f−f′)μ=(z−x⊕y)(βμ−μ′),
where μ′ is the result of adding a box to μ in diagonal i+1.
Comparing coefficients in each case, we see that if z=x⊕y then f=f′.
Our proof of part (d) is similar. Fix w,x,y,z∈Z[β][[x1,x2,…]] and consider g:=A0(x)A1(w)A0(y)A1(z) and g′:=A1(z)A0(y)A1(w)A0(x) acting on a diagram S. We have four cases: diagonal [math] is always an addable or removable box, and diagonal 1 can be addable, removable, or neither, but never the same as [math]. We illustrate the cases with shapes (2), (2,1), (3), (3,1), (3,2), and (3,2,1).
•
If d0 contains a removable box of μ and d1 does not contain
an addable or removable box, then
the last two parts of μ must be (2,1) and we have
gμ=g′μ=(1+βx)(1+βy)μ.
•
Suppose d0 contains an addable box of μ and d1 does not contain
an addable or removable box.
Then the smallest part of μ must be ≥3, and we can assume without loss of generality that μ=(3).
Let μ′=(3,1), μ′′=(3,2), and μ′′′=(3,2,1). Then one can check that
[TABLE]
so (g−g′)μ=−(wx+xz+yz+βwxz+βxyz−wy)μ′′.
•
Suppose d0 contains an addable box of μ and d1 contains a removable box,
so that the last part of μ must be 2. Let μ′ be the strict partition formed by adding a box to μ in d0, creating a new part of size 1.
Then we have
[TABLE]
so (g−g′)μ=β(wx+xz+yz+βwxz+βxyz−wy)μ′.
•
Suppose d0 contains a removable box of μ and d1 contains an addable box.
Then the last part of μ must be 1 and the second-to-last part of μ must be ≥3,
and we can assume without loss of generality that μ=(3,1).
Let μ′=(3,2) and μ′′=(3,2,1). Then it follows by similar calculations that
(g−g′)μ=(wx+xz+yz+βwxz+βxyz−wy)(βμ′−μ′′).
It follows in each case that we have g=g′ provided that
[TABLE]
and in particular this is satisfied if w=x⊕y and z=x⊖y.
∎
We can now show that GPλ/μ(β) and GQλ/μ(β) are symmetric functions.
The relations in Lemma 5.8 are the same as [12, (2.1)–(2.4)] with “hi” replaced by “Ai” and “+/−” replaced by “⊕/⊖”.
Making the same substitutions transforms [12, Prop. 4.2] to the
assertion that the operators Pn(x) and Pn(y) commute for all x,y, which is what we need to show
to deduce that GPλ//μ(β) and GPλ/μ(β) are symmetric.
Fomin and Kirillov’s proof of [12, Prop. 4.2] only depends on the fact that + is a commutative formal group law; hence every formal consequence of the Yang–Baxter equations for their hi’s also holds for our Ai’s, with “+” and “−” respectively replaced by “⊕” and “⊖”. In particular, the proof of [12, Prop. 4.2] carries over to our context, mutatis mutandis, and we conclude that
Pn(x)Pn(y)=Pn(y)Pn(x) as desired.
We now explain how to see that the operators Qn(x) and Qn(y) likewise commute.
Fomin and Kirillov’s proof of [12, Prop. 4.2]
is implicitly an inductive argument, which translates when n=2, for example,
to the following sequence of transformations. Here, the Yang–Baxter relations from Lemma 5.8
are indicated with braces overhead:
[TABLE]
Only minor adjustments to this inductive argument are needed to check that
Qn(x)Qn(y)=Qn(y)Qn(x).
For example, when n=2 one has
[TABLE]
where the transformation in the fifth line uses the identity
[TABLE]
which follows from (5.5).
The general case is similar and we omit the details.
We conclude that the power series
GQλ//μ(β) and GQλ/μ(β) are symmetric.
∎
5.4 Symmetric subalgebras
We have seen that GPλ and GQλ are linearly independent
in mSym and involve only x-monomials of degree at least ∣λ∣,
so
the following is well-defined.
Definition 5.9**.**
Let mΓSym and mΓˉSym denote the linearly compact Z[β]-modules
with the K-theoretic Schur Q- and P-functions {GQλ(β)} and {GPλ(β)}
as respective pseudobases (λ ranging over all strict partitions).
The images of mΓˉSym and mΓSym
under the truncation map setting xn+1=xn+2=⋯=0
are the rings GΓn and GΓn,+ in [19].
Ikeda and Naruse’s results in [19] show
that mΓˉSym is characterized by the following cancellation law.
where t is an indeterminate
commuting with each xi.
The following is a K-theoretic extension of [40, Thm. 3.8].
Theorem 5.11**.**
It holds that
[TABLE]
In particular, we have
mΓSym⊆mΓˉSym.
Proof.
First, we consider the case of mΓˉSym.
Fix a strict partition λ.
By (4.15) and Corollary 4.20,
we have GPλ(β)∈mΠˉSym.
Since GPλ(β) is symmetric,
mΓˉSym⊆mSym∩mΠˉSym.
On the other hand, by Lemma 4.21 and Theorem 5.10
we have
mΓˉSym⊇mSym∩mΠSymQ[β]=mSym∩(mQSym∩mΠSymQ[β]),
so Theorem 4.19 implies that mΓˉSym⊇mSym∩mΠˉSym.
Second, we consider the case of mΓSym. By (4.14), we have GQλ(β)∈mΠSym
and so mΓSym⊆mSym∩mΠSym.
To finish, we will check that mΓSym⊇mΓˉSym∩mΠSym, which implies mΓSym⊇mSym∩mΠSym
by Theorem 4.19.
Let mΓSymQ[β] be the linearly compact Q[β]-module
with the K-theoretic Schur Q-functions GQλ(β) as a pseudobasis.
We claim that mΓˉSym⊆mΓSymQ[β].
Since GQλ(β)∈mSym∩mΠSym⊆mΓˉSym,
we have GQλ(β)∈∑μZ[β]GPμ(β)
where the sum is over all strict partitions.
If β has degree [math] and each xi has degree 1 then
the nonzero homogeneous components of GPλ(β) and GQλ(β)
of lowest degree
are Pλ and Qλ=2ℓ(λ)Pλ,
so
[TABLE]
Hence GPλ(β)∈2−ℓ(λ)GQλ(β)+∑∣λ∣<∣μ∣Q[β]GPμ(β) and it follows
that GPλ(β)∈mΓSymQ[β], so mΓˉSym⊆mΓSymQ[β] as claimed.
The peak quasisymmetric function Kλ is the nonzero homogeneous component
of Kλ(β) of lowest degree, and it is shown in
the proof of [40, Thm. 3.8]
that Qλ∈Kλ+∑λ≺αZKα
where ≺ is the partial order on compositions
described in the proof of Theorem 4.19.
Since GQλ(β)∈mΠSym, we must have
[TABLE]
Thus,
as in the proof of Theorem 4.19,
any Q[β]-linear combination of GQλ(β)’s
that belongs to mΠSym must have coefficients in Z[β].
By the previous paragraph,
this means that mΓSym⊇mΓSymQ[β]∩mΠSym⊇mΓˉSym∩mΠSym.
Finally, mΓSym⊆mΓˉSym holds
as mΠSym⊂mΠˉSym by Theorem 4.19.
∎
Corollary 5.12**.**
Suppose (P,γ) is a labeled poset and V⊆Val(P,γ).
(a)
If Ω(β)(P,γ)∈mSym then Ω(β)(P,γ)∈mΓSym.
2. (b)
If
Ω(β)(P,γ,V)∈mSym
then Ω(β)(P,γ,V)∈mΓˉSym.
Proof.
We have Ω(β)(P,γ)∈mΠSym by Theorem 4.8
and Ω(β)(P,γ,V)∈mΠˉSym by Corollary 4.20,
so this follows by Theorem 5.11.
∎
We single out one especially important case.
Fix strict partitions μ⊆λ.
Corollary 5.13**.**
It holds that
GPλ/μ(β)∈mΓˉSym
and GQλ/μ(β)∈mΓSym.
Proof.
This holds by Corollary 5.12 given
(4.14), (4.15), and Theorem 5.5.
∎
Concretely, Corollary 5.13 means
that we have GPλ/μ(β)∈∑νZ[β]GPν(β)
and GQλ/μ(β)∈∑νZ[β]GQν(β) where the sums are over all strict partitions ν.
We expect that these sums are actually finite with positive coefficients:
Conjecture 5.14**.**
GPλ/μ(β)∈⨁νZ≥0[β]GPν(β)
and GQλ/μ(β)∈⨁νZ≥0[β]GQν(β).
This should be a direct consequence of the geometric interpretation of
GPλ(β) and GQλ(β) in [19].
It would be interesting to find a combinatorial proof.
Since mΓSym⊆mΓˉSym,
we must have GQμ(β)∈∑λZ[β]GPμ(β).
Computer calculations suggest
that this expansion is actually always finite, with the following fairly simple description.
As before, a vertical strip is a subset of Z>0×Z>0 that contains at most one position in each row.
Conjecture 5.15**.**
If μ is a strict partition then
[TABLE]
where the sum is over the finite set of strict partitions λ⊇μ
with ℓ(μ)=ℓ(λ) such that SDλ/μ is a vertical strip,
and we define c(λ/μ) to be the number of distinct columns occupied by positions in SDλ/μ.
For example, one has
GQ(3,2)(β)=4GP(3,2)(β)+2β⋅GP(4,2)(β)−β2⋅GP(4,3)(β).
Remark**.**
The coefficients in (5.9)
have the form ±2iβj for i,j∈{0,1,…,ℓ(μ)},
and if the coefficient of GPλ(β) is nonzero, then its sign is (−1)s(λ/μ) where
s(λ/μ) is the number of nonempty columns of SDλ/μ
with an even number of boxes.
We end this section with two results involving the power series GSλ(β).
Corollary 5.16**.**
The map Θ(β)
restricts to a morphism mSym→mΓSym.
Proof.
This holds since Θ(β)(Gλ(β))=GSλ(β)∈mΓSym by Corollary 5.13.
∎
Corollary 5.17**.**
The set of K-theoretic Schur S-functions {GSλ(β)},
with λ ranging over all strict partitions,
is another pseudobasis for mΓSym.
Proof.
Fix a strict partition λ.
We have GSλ(β)∈mΓSym,
and it follows from [25, (8.8*′*), §III.8]
and [25, Ex. 7, §III.8]
that Sλ∈Qλ+∑μ>λZQμ
where > is the dominance order on strict partitions.
Comparing lowest-degree terms, we deduce that GSλ(β)∈GQλ(β)+∑μZ[β]GQμ(β)
where the sum is over strict partitions μ with μ>λ or ∣μ∣>∣λ∣,
so the corollary follows.
∎
6 Antipode formulas
In this section, we show how to expand the multipeak quasisymmetric functions {Kα(β)}
in terms of the multifundamental quasisymmetric functions {Lα(β)}.
We then derive formulas for several
involutions of mQSym,
including the antipode.
6.1 Mirroring operators
We start by defining an operation on posets that adds “mirror images” of certain vertices.
Let (P,γ) be a labeled poset. Assume
the vertices of P are all positive integers (not necessarily with the usual order on Z)
and γ takes only positive integer values.
We refer to labeled posets with these properties as positive.
Write ≺ for the partial order on P. For each pair (I,J) of subsets such that P=I∪J, we
define MIJ(P,γ)
to be the labeled poset MIJ(P,γ):=(Q,δ) with the following properties.
•
As a set, we have Q:=I∪(−J).
•
The partial order on Q has s≺t if and only if ∣s∣≺∣t∣ in P.
•
We have δ(s)=sign(s)γ(∣s∣)
where sign(s):=s/∣s∣∈{±1}.
Thus ∣Q∣=∣P∣+∣I∩J∣, and if s∈I∩J then −s and s are incomparable in Q.
If J=∅ then MP∅(P,γ)=(P,γ), while if I=∅ then
M∅P(P,γ)=(P,−γ) reverses all arrows in the oriented Hasse diagram of (P,γ).
Example 6.1**.**
Drawing labeled posets as oriented Hasse diagrams,
we have
[TABLE]
Now, given a positive labeled poset (P,γ),
define
[TABLE]
When β=0, we have
Ψ(0)(P,γ)=∑ϵ:P→{±1}[(P,ϵγ)]
where ϵγ is the map s↦ϵ(s)γ(s); compare with [40, Thm. 3.6].
Any isomorphism class of labeled posets contains at least one positive element (P,γ),
and the value of Ψ(β)(P,γ) does not depend on the choice of this representative.
The formula for Ψ(β) therefore extends uniquely to a continuous Z[β]-linear map
mLPoset→mLPoset.
Write Φ<:mLPoset→mQSym and Φ>∣<:mLPoset+→mQSym
for the
morphisms of combinatorial LC-Hopf algebras from Theorems 3.8 and 4.6.
Theorem 6.2**.**
The map Ψ(β):mLPoset→mLPoset is an LC-Hopf algebra morphism
making the following diagram commute:
[TABLE]
Consequently, if (P,γ) is a positive labeled poset
then
[TABLE]
Proof.
The lower triangle in the diagram commutes by
Theorems 3.8 and 4.6 and Corollary 4.22.
To complete the proof, it suffices by Theorem 4.6
to show that Ψ(β) is an LC-Hopf algebra morphism
and that ζQ∘Φ<∘Ψ(β)=ζ>∣<.
We check the second property first.
Fix a positive labeled poset (P,γ) and note that ζQ∘Φ<=ζ<.
If P=I∪J
then ζ<([MIJ(P,γ)])
is zero unless
(i) y∈/I whenever y⋖z in P and γ(y)>γ(z)
and
(ii) y∈/J whenever x⋖y in P and γ(x)<γ(y).
These conditions can only hold if Peak(P,γ) is empty (since I∪J=P).
In this case, if (I,J) satisfies conditions (i) and (ii) then
ζ<(β∣I∩J∣⋅[MIJ(P,γ)])=t∣P∣(βt)∣I∩J∣.
Moreover, the decompositions I∪J=P with this nonzero contribution are uniquely determined
by independently assigning each element of Val(P,γ) to I∖J, to J∖I, or to I∩J,
and so
[TABLE]
This agrees with the formula for ζ>∣<([(P,γ)]):=ζ>∣<([(P,γ,∅)])
from Proposition 4.3.
We conclude that ζQ∘Φ<∘Ψ(β)=ζ>∣<, as desired.
Finally, we must check that the map Ψ(β) is an LC-Hopf algebra morphism.
It clearly commutes with the unit, counit, and product maps of mLPoset,
so we only need to check that
(Ψ(β)⊗^Ψ(β))∘Δ=Δ∘Ψ(β).
Continue to let (P,γ) be a positive labeled poset.
Let δ:P∪(−P)→Z be the map with δ(s)=sign(s)δ(∣s∣).
Write ≺ for the partial order on P∪(−P) that has x≺y if and only if ∣x∣≺∣y∣ in P.
Relative to this order, the labeled poset (P∪−P,δ) is the same thing as MPP(P,γ).
Define J(P,γ) to be the set of tuples
(I,J,S1,S2)
where I∪J=P
and, if (Q,δ):=MIJ(P,γ),
then
S1 is a lower set in Q and S2 is an upper set in Q such that
Q=S1∪S2 and S1∩S2 is an antichain.
The value of Δ∘Ψ(β)([(P,γ)]) is
[TABLE]
where the sum is
over all (I,J,S1,S2)∈J(P,γ),
where each Si is partially ordered by ≺.
Next, define K(P,γ) to be the set of tuples
(T1,T2,I1,J1,I2,J2)
where T1 is a lower set in P
and T2 is an upper set in P
such that
P=T1∪T2 and T1∩T2 is antichain,
and where Ti=Ii∪Ji.
The value of (Ψ(β)⊗^Ψ(β))∘Δ([P,γ]) is
[TABLE]
where the sum is
over all (T1,T2,I1,J1,I2,J2)∈K(P,γ).
We must show that (6.3) and (6.4) coincide.
It suffices
to exhibit a bijection
J(P,γ)∼K(P,γ)
such that if
[TABLE]
then for i∈{1,2} it holds that
[TABLE]
The desired map is as follows.
Given (I,J,S1,S2)∈J(P,γ), let
Ii:={s∈P:s∈Si},Ji:={s∈P:−s∈Si}, and
Ti:={s∈P:{±s}∩Si=∅}
for i∈{1,2}.
Clearly Ti=Ii∪Ji,
P=T1∪T2, and (Si,δ)=MIiJi(Ti,γ) as labeled posets.
Moreover, T1 is a lower set in P and T2 is an upper set,
and
[TABLE]
We must also check that T1∩T2 is an antichain in P.
For this, suppose x∈T1∩T2 and y∈P and x≺y.
Since x∈T1∩T2, both S1 and S2 must contain at least one of ±x.
From our assumptions that
S2 is an upper set
and S1∩S2 is an antichain,
it follows that
{±y}∩(S1∪S2)⊆S2∖S1, so y∈T2∖T1.
We conclude that T1∩T2 is an antichain,
so (6.5) is at least a well-defined map J(P,γ)→K(P,γ)
satisfying (6.6).
To invert (6.5),
suppose (T1,T2,I1,J1,I2,J2)∈K(P,γ).
Let
Si:=Ii∪(−Ji) for i∈{1,2}
so that
(Si,δ)=MIiJi(Ti,γ),
and define
[TABLE]
Since every s∈P has {±s}∩(S1∪S2)=∅,
we have P=I∪J and
(S1∪S2,δ)=MIJ(P,γ),
and it is clear that in this labeled poset
S1 is a lower set, S2 is an upper set,
and S1∩S2 is an antichain.
The correspondence
(T1,T2,I1,J1,I2,J2)↦(I,J,S1,S2)
defined in this way
is a map K(P,γ)→J(P,γ).
This is the inverse of (6.5), so (6.5)
is the required bijection.
∎
6.2 Automorphisms
If w is a finite sequence then we write wr for its reversal.
Given a composition α⊨n,
let αc denote the unique composition of n with I(αc)=[n−1]∖I(α),
and define αt:=(αc)r=(αr)c.
If w is a finite sequence of integers with no adjacent repeated entries and α⊨ℓ(w)
has I(α)=Des(w):={i:wi>wi+1},
then I(αt)=Des(wr).
Recall that the quasisymmetric functions
Lα:=Lα(0)=∑α≤α′Mα′
form a homogeneous basis for QSym and a pseudobasis for mQSym.
Following [24, §3.6], we write ω,ψ,ρ:QSym→QSym
for the linear maps with
[TABLE]
for all compositions α.
Each of these operators is an algebra morphism;
ψ and ρ are coalgebra anti-automorphisms;
and ω=ψ∘ρ=ρ∘ψ is a Hopf algebra automorphism.
Given a peak composition α=(α1,α2,…,αk), let
[TABLE]
If λ is a partition, α is a peak composition,
and Kα:=Kα(0),
then one has
[TABLE]
by [24, §3.6] and [40, Prop. 3.5].
These maps extend uniquely by continuity to involutions
of mQSym preserving mSym; we denote the extensions by the same symbols.
We can evaluate ω, ψ, and ρ at other
quasisymmetric functions of interest.
If f∈Z[β][[x1,x2,…]] and a,b∈Z[β]
then we abbreviate by writing
[TABLE]
for the power series
obtained by substituting xi↦1−bxiaxi=axi+abxi2+…
for each i∈Z>0.
If (P,γ) is a labeled poset then let P∗ be the dual poset, in which all order relations
are reversed, and define γ∗(s)=−γ(s) for s∈P.
Proposition 6.3**.**
If α is a composition and (P,γ) is a labeled poset then
[TABLE]
When β=1, the top formulas are closely related to [35, Prop. 38].
Proof.
We use the term word in this proof to mean a finite sequence of positive integers.
Let W be the linearly compact Z[β]-module
with the set of all words as a pseudobasis.
Define ϕ≤, ϕ<, and ϕ≥
to be the continuous linear maps W→mQSym
such that if v is a word
and α⊨ℓ(v) has I(α)=Des(v), then
[TABLE]
Fix a word w with no adjacent repeated letters and suppose α⊨ℓ(w)
has I(α)=Des(w).
Let [[w]]∈W be the sum of all words that yield w when adjacent repeated letters are combined,
so that, for example, [[21]]=21+221+211+2221+2211+2111+….
Then [28, Props. 8.2 and 8.5]
assert that
[TABLE]
where L~α:=Lα(1).
As ω∘ϕ<(v)=ϕ≤(vr) for any word v,
we therefore have
[TABLE]
Similarly,
since ρ∘ϕ<(v)=ϕ>(vr) for any word v,
we have
[TABLE]
Substituting xi↦βxi
and applying (3.6) gives the
desired expressions for ω(Lα(β)) and ρ(Lα(β)).
The formulas for
ω(Γ(β)(P,γ)) and ρ(Γ(β)(P,γ))
then follow from
Theorem 3.11 and Proposition 3.12
since L(P∗)={wr:w∈L(P)}
and Γ(β)(wr,γ∗)=Lαr(β) for w∈L(P).
Finally, we compute ψ(Lα(β))
and ψ(Γ(β)(P,γ)) using the identity ψ=ω∘ρ.
∎
It follows from (6.9) that if f∈mSym then ω(f)=ψ(f) and ρ(f)=f, so there is only one nontrivial computation to make on symmetric functions.
Corollary 6.4**.**
If μ⊆λ are partitions then ω(Gλ/μ(β))=GλT/μT(β)(1−βxx).
When β=1 this identity is essentially [22, Prop. 9.22].
Proof.
If θ is a labeling of Dλ/μ satisfying (3.7) and ϑ is an analogous labeling of
DλT/μT, then (Dλ/μ,θ∗)
and (DλT/μT,ϑ) are equivalent labeled posets.
Since we have Gλ/μ(β)=Γ(β)(Dλ/μ,θ) by (3.9),
the result follows from Proposition 6.3.
∎
Next, we state some formulas for the multipeak quasisymmetric functions.
Proposition 6.5**.**
If α is a peak composition
and (P,γ) is a labeled poset
then
[TABLE]
Moreover, the formulas on the left
also hold if we replace “K(β)” by “Kˉ(β)”.
Proof.
If P=I∪J and (Q,δ):=MIJ(P,γ),
then (Q,δ∗)≅MJI(P,γ) and (Q∗,δ∗)≅MJI(P∗,γ)
as labeled posets.
The formulas for
ψ(Ω(β)(P,γ))
and
ρ(Ω(β)(P,γ))
are immediate
from Theorem 6.2 and Proposition 6.3,
and ω(Ω(β)(P,γ))=ψ∘ρ(Ω(β)(P,γ))=ψ(Ω(β)(P∗,γ))=Ω(β)(P∗,γ)(1−βxx).
Given these formulas, the expressions for
ω(Kα(β)),
ψ(Kα(β)), and
ρ(Kα(β)) are clear
from Proposition 4.11, noting that
if w∈L(P) has Peak(w,γ)=I(α)
then Peak(wr,γ)=I(α♭).
The analogous set of identities involving Kˉα(β)
follow in turn by continuous linearity in view of Corollary 4.17.
∎
Corollary 6.6**.**
If μ⊆λ are strict partitions then
[TABLE]
Proof.
Since ω and ψ take the same value on the symmetric functions
GPλ/μ(β) and GQλ/μ(β),
this follows from (4.13), (4.15), and Proposition 6.5.
∎
We can use these formulas to prove two facts about stable Grothendieck polynomials.
The following statement generalizes independent results of
Ardila and Serrano [3, Thm. 4.3] and DeWitt [9, Thm. V.5]
which show that
sδn/μ∈⨁νZ≥0Pν for all partitions μ⊆δn:=(n,n−1,…,2,1).
Theorem 6.7**.**
If n∈Z≥0 and μ⊆δn then Gδn/μ(β)∈⨁νZ≥0[β]GPν(β).
Proof.
Say that a partition μ is strictly contained in λ if μi<λi for 1≤i≤ℓ(μ).
It suffices to prove the proposition when μ is strictly contained in δn,
since Corollary 3.9 implies that
in general Gδn/μ(β) is a product of power series of the form Gδm/ν(β)
with ν strictly contained in δm,
and
results in [8, 18]
show that
products of K-theoretic Schur P-functions are finite Z≥0[β]-linear combinations of
K-theoretic Schur P-functions.
Suppose μ is a partition strictly contained in δn.
Define bi=n−μiT+i for i∈[n] and let a1<a2<⋯<an
be the elements of [2n]∖{b1,b2,…,bn}.
One has 1<b1<b2<⋯<bn=2n and ai<bi for each i.
The second author’s paper [27] considers certain power series
Gw and GPyO in mSym
indexed by permutations w∈Sn and y=y−1∈Sn.
Let
[TABLE]
It follows from [27, Thm. 2.3 and Prop. 5.5] that
GPyO=Gw−1,
while
[31, Thm. 3.1] implies333
Matsumura’s result concerns certain polynomials Gσ(x,ξ)∈Z[β][x1,x2,…,ξ1,ξ2,…]
indexed by permutations w∈S∞.
These are related to the power series Gw by the
identity Gw=limm→∞G1m×w(x,0),
where convergence is in the sense of formal power series.
that
Gw=Gδn/μT(β).
By [27, Lem. 5.3] and Corollary 6.4, we have
ω(GPyO)=ω(Gw−1)=Gw(1−βxx)=ω(Gδn/μ(β)),
so Gδn/μ(β)=GPyO.
Finally, GPyO∈⨁νZ≥0[β]GPν(β) by [27, Thm. 1.9].
∎
The previous result holds in a stronger form when μ=∅.
Proposition 6.8**.**
For a partition λ and a strict partition ν, one has that
Gλ(β)=GPν(β) if and only if λ=ν=δn for some n∈Z≥0.
For a short proof that sδn=Pδn, see [25, Ex. 3, §III.8].
Proof.
First, suppose Gλ(β)=GPν(β). The β-degree-[math] terms of the left and right sides are respectively sλ and Pν,
and the lowest-degree component of Pν is sν, so it must be the case that λ=ν.
The papers [16, 17] study certain symmetric functions F^z
indexed by involutions z∈S∞.
It follows from [17, Thm. 4.20] that every Schur P-function Pν occurs as F^z for some z, while
[16, Prop. 3.34 and Thm. 3.35] assert that sλ=F^z for some z
only if λ=δn for some n∈Z≥0. Thus it must be that λ=ν=δn for some n∈Z≥0.
Conversely, the papers [27, 29] study certain symmetric functions GPzSp
indexed by fixed-point-free involutions z∈S2n.
When z=(1,n+1)⋯(n,2n)∈S2n,
[29, Thm. 4.17] shows
that GPzSp=GPδn−1(β)
while [27, Thms. 2.5 and 5.2 and Prop. 5.5]
imply that GPzSp=Gδn−1(β).
Thus GPδn(β)=Gδn(β).
∎
The antipode S
of the Hopf algebra QSym is the linear map QSym→QSym with Lα↦(−1)∣α∣Lαt
for all compositions α [24, §3.6];
the antipode of mQSym is the unique continuous extension of this map.
One can evaluate S at many elements
of interest in mQSym using the following observation.
Let f(β)∈Z[β][[x1,x2,…]] and define f(−β):=f(β)∣β↦−β.
Observation 6.9**.**
Assume f(β)∈mQSym is homogeneous of degree n
when we define deg(β)=−1 and deg(xi)=1.
Then S(f(β))=(−1)nω(f(−β)).
This hypothesis
applies whenever f(β)∈{Lα(β),Kα(β),Kˉα(β),GQλ/μ(β),…}, in particular.
Taking f(β)=Lα(β)
and then specializing to β=1 recovers [35, Thm. 41], while
taking f(β)=GPλ(β) gives
[TABLE]
for all strict partitions λ.
Comparing with [18, Prop. 3.5]
shows that the power series which Hamaker et al.
denote as GPλ and Kλ
may be given in our notation as GPλ:=GPλ(−1) and
Kλ:=GPλ(1)(1−xx),
and are related by the identity Kλ=(−1)∣λ∣S(GPλ).
Using these formulas, one can check directly that S
preserves the cancelation laws in Lemma 4.21 and Theorem 5.10,
as must hold for mΓSym and
mΓˉSym
to be LC-Hopf subalgebras of mSym.
By contrast, the involutions ω and ψ of mQSym
do not preserve mΓSym, mΓˉSym, mΠSym, or mΠˉSym.
Although ω(mSym)=mSym,
the family of stable Grothendieck polynomials {Gλ(β)}
is not itself preserved by ω.
To correct this,
Yessulizov [41] has introduced a two-parameter generalization Gλ(α,β)∈Z[α,β][[x1,x2,…]]
of Gλ(β)=:Gλ(0,β) that has ω(Gλ(α,β))=GλT(β,α). It would be interesting to describe analogous
two-parameter generalizations GPλ(α,β) and GQλ(α,β)
of the K-theoretic Schur P- and Q-functions
with ω(GPλ(α,β))=GPλ(β,α)
and ω(GQλ(α,β))=GQλ(β,α).
Bibliography42
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] M. Aguiar and F. Ardila “Hopf monoids and generalized permutahedra” Preprint (2017), ar Xiv:1709.07504
2[2] M. Aguiar, N. Bergeron and F. Sottile ‘‘Combinatorial Hopf algebras and generalized Dehn-Sommerville relations’’ In Compos. Math. 142 , 2006, pp. 1–30
3[3] F. Ardila and L.. Serrano ‘‘Staircase skew Schur functions are Schur P 𝑃 P -positive’’ In J. Algebr. Combin. 36 , 2012, pp. 409–423
4[4] A.. Buch ‘‘A Littlewood-Richardson rule for the K-theory of Grassmannians’’ In Acta Math. 189 , 2002, pp. 37–78
5[5] A.. Buch and V. Ravikumar ‘‘Pieri rules for the K 𝐾 K -theory of cominuscule Grassmannians’’ In J. Reine Angew. Math. 668 , 2012, pp. 109–132
6[6] A.. Buch and M. Samuel ‘‘ K 𝐾 K -theory of minuscule varieties’’ In J. Reine Angew. Math. 719 , 2016, pp. 133–171
7[7] A.. Buch et al. ‘‘Stable Grothendieck polynomials and K 𝐾 K -theoretic factor sequences’’ In Math. Ann. 340 , 2008, pp. 359–382
8[8] E. Clifford, H. Thomas and A. Yong ‘‘ K 𝐾 K -theoretic Schubert calculus for OG ( n , 2 n + 1 ) 𝑛 2 𝑛 1 (n,2n+1) and jeu de taquin for shifted increasing tableaux’’ In J. Reine Angew. Math. 690 , 2014, pp. 51–63