1. Introduction
Representation theory of Kac–Moody algebras to this day serves as inspiration for numerous combinatorial problems, solutions to which give rise to interesting combinatorial structures. Examples of this can be met in [
1,
2,
3] and many other well-known works. The problem of tensor power decomposition, in turn, can be considered from the combinatorial perspective as a problem of counting lattice paths in Weyl chambers [
4,
5,
6,
7]. In this paper, we count paths on the Bratteli diagram [
8], reproducing the decomposition of tensor powers of the fundamental module of the quantum group
with divided powers, where
q is a root of unity ([
9,
10,
11,
12]), into indecomposable modules. Combinatorial treatment of this problem gives rise to some interesting structures on lattice path models, such as filter restrictions, first introduced in [
13], and long steps, which are introduced in the present paper.
In [
13], the considered lattice path model was motivated by the problem of finding explicit formulas for multiplicities of indecomposable modules in the decomposition of tensor power of fundamental module
of the small quantum group
([
14]). We call this model the auxiliary lattice path model [
9]. It consists of the left wall restriction at
and filter restrictions located periodically at
for
. For
, the filter restriction is of type 1, and the rest of the values of
n filter restrictions are of type 2. Applying periodicity conditions
,
to the Bratteli diagram of this model allows one to obtain another lattice path model, recursion for weighted numbers of paths that coincide with recursion for multiplicities of indecomposable
-modules in the decomposition of
. Counting weighted numbers of paths descending from
to
on this folded Bratteli diagram allows one to obtain desired formula for multiplicity, where
M stands for the highest weight of a module, the multiplicity of which is in question, and
N stands for the tensor power of
. This has been performed in [
9].
We found that the auxiliary lattice path model can be modified in a different way, giving results for representation theory of
, the quantized universal enveloping algebra of
with divided powers, when
q is a root of unity ([
15]). Instead of applying periodicity conditions to the auxiliary lattice path model, as in the case of
, for
we consider all filters to be of the 1st type and also allow additional steps from
to
, where
. Counting weighted numbers of paths descending from
to
on the Bratteli diagram of the lattice path model obtained by this modification gives a formula for the multiplicity of
in the decomposition of
.
The main goal of this paper is to give a more in-depth combinatorial treatment of the auxiliary lattice path model in the presence of long steps and obtain explicit formulas for weighted numbers of paths, descending from to . We explore combinatorial properties of long steps, as well as define boundaries and congruence of regions in lattice path models. Latter is found to be useful for deriving formulas for weighted numbers of paths. For any considered region, weighted numbers of paths at boundary points uniquely define such for the rest of the region by means of recursion. So, for congruent regions in different lattice path models, regions where, roughly speaking, recursion is similar, it is sufficient to prove identities only for boundary points of such regions.
This paper is organized as follows. In
Section 2, we introduce the necessary notation. In
Section 3, we give background on the auxiliary lattice path model. In
Section 4, we introduce the notion of regions in lattice path models, boundary points and congruence of regions. In
Section 5, we explore combinatorial properties of long steps in periodically filtered lattice path models and consider the auxiliary lattice path model in the presence of long steps. We do so by means of boundary points and congruence of regions. In
Section 6, we modify the auxiliary lattice path model and argue that the recursion for the weighted number of paths in such modified model coincides with the recursion for multiplicities of modules in tensor product decomposition of
for
with divided powers, where
q is a root of unity. In
Section 7, we prove formulas for the weighted numbers of descending paths, relevant to this modified model. In
Section 8, we conclude this paper with observations for possible future directions or research.
2. Notations
In this paper, we use the notation following [
16]. For our purposes of counting multiplicities in tensor power decomposition of
-module
, throughout this paper, we consider the lattice
and the set of steps
, where
A lattice path in is a sequence of points in with starting point and the endpoint . The pairs are called steps of .
Given starting point
A and endpoint
B, a set
of steps and a set of restrictions
we write
for the set of all lattice paths from
A to
B that have steps from
and obey the restrictions from
. We denote the number of paths in this set as
The set of restrictions in lattice path models considered throughout this paper mostly contain wall restrictions and filter restrictions. Left(right) wall restrictions forbid steps in the left(right) direction, reflecting descending paths and preventing them from crossing the ‘wall’. Filter restrictions forbid steps in certain directions and provide other steps with non-uniform weights, so paths can cross the ‘filter’ in one direction, but cannot cross it in the opposite direction. A rigorous definition of these restrictions is given in subsequent sections.
To each step from
to
we assign the weight function
and use notation
to denote that the step from
to
has the weight
. By default, all unrestricted steps from
will have weight 1 and is denoted by an arrow with no number at the top. The
weight of a path
is defined as the product
For the set
we define the
weighted number of paths as
where the sum is taken over all paths
.
4. Boundary Points and Congruent Regions
In this section, we consider notions, which are convenient for counting paths in the auxiliary lattice path model in the presence of long steps. We will see, that multiplicities on the boundary of a region uniquely define multiplicities in the rest of the region. For proving identities between multiplicities in two congruent regions, it is sufficient to prove such identities for their boundary points.
Definition 4. Consider the lattice path model, defined by a set of steps and a set of restrictions on lattice . Subset with steps and restrictions is called a region of the lattice path model under consideration.
Intuitively, region is a restriction of the lattice path model defined by , on lattice to the subset . The word ‘restriction’ is overused, so we consider regions of lattice path models instead.
Definition 5. Consider a region of the lattice path model defined by steps and restrictions . Point is called a boundary point of if there exists , such that step is allowed in by a set of steps and restrictions . The union of all such points is a boundary of and is denoted by .
The Definition 5 introduces a notion, reminiscent of the outer boundary in graph theory. Note that boundary points are defined with respect to some lattice path models under consideration. For brevity, we assume that this lattice path model is known from the context, and mentioning it will be mostly omitted.
Example 1. For a strip in the auxiliary lattice path model, its boundary is in the left filter. It is depicted in Figure 5. Example 2. Consider region of the unrestricted lattice path model, as depicted in Figure 6 and highlighted with blue dashed lines. Its boundary is a set of points highlighted with purple dashed lines. Lemma 4. Consider region of a lattice path model defined by , on lattice . Weighted numbers of paths for are uniquely defined by weighted numbers of paths for its boundary points .
Proof. Suppose weighted numbers of paths for are known. Suppose that there exists some point , such that its weighted number of paths cannot be expressed in terms of weighted numbers of paths for points in .
The first case is that recursion for a weighted number of paths for A involves some point , a weighted number of paths for which cannot be expressed in terms of such for points in . In this case, we need to consider and recursion on the weighted number of paths for such a point instead of A.
The second case is that recursion for a weighted number of paths for A involves a weighted number of paths for some point . Then, by definition of a boundary point and weighted number of paths for such point is known by the initial supposition of the lemma.
Note that due to the fact that we consider descending paths, M and N, to be finite, the first case can be iterated finitely many times at most. □
Definition 6. Consider two lattice path models with steps , and restrictions , defined on lattice . Subset is a region in the lattice path model defined by . Subset is a region in the lattice path model defined by . Regions and are congruent if there exists a translation T in such that
as sets of points in
Translation T induces a bijection between steps in and , meaning that there is a one-to-one correspondence between steps with source and target points related by T, with preservation of weights.
The second condition can be written down explicitly. Firstly, for each and each step in obeying such that , there is a step in obeying , where , . Secondly, for each and each step in obeying such that , there is a step in obeying , where , . To put it simply, if we forget about lattice path models outside and , these two regions will be indistinguishable. Due to translations in being invertible, it is easy to see that congruence defines an equivalence relation.
Now we must prove the main theorem of this subsection.
Theorem 2. Consider two lattice path models with steps , and restrictions , defined on lattice . Region of the lattice path model defined by , is congruent to region of the lattice path model defined by , , where . If equalityholds for all , then it holds for all . Note, that if
it does not necessarily follow that
, due to
and
being different. So, it is natural to ask Formula (
7) to hold for
.
Proof. We need to prove that Formula (
7) is true for
. The l.h.s. can be uniquely expressed in terms of its values at
, following procedure in Lemma 4. Due to the congruence between
and
, recursion for the r.h.s. of (
7) coincides with the one for the l.h.s., so we can obtain the same expression on the r.h.s., but with values of weighted numbers of paths for
instead of
. We can compare the l.h.s. and the r.h.s. term by term, for points related by translation
T. All of such terms have the same values due to the initial supposition of the theorem. □
Corollary 1. Consider lattice path models with steps , , and restrictions , , defined on lattice . Region is congruent to and , where , for . If equalityholds for all , then it holds for all . Proof. Due to linearity of the r.h.s. of Formula (
8), the proof repeats the one of Theorem 2. □
The moral of this section is that for two congruent regions, weighted numbers of paths are defined by values of such at the boundary of the considered regions. For proving identities, it is sufficient to establish equality for weighted numbers of paths at boundary points, while equality for the rest of the region will follow due to the congruence.
8. Conclusions
In this paper, we considered the lattice path model , which is the auxiliary lattice path model in the presence of long steps. Weighted numbers of paths in this model recreate multiplicities of -modules in tensor product decomposition of , where is a quantum deformation of the universal enveloping algebra of with divided powers and q is a root of unity. Explicit formulas for multiplicities of all tilting modules in tensor product decomposition were derived by purely combinatorial means in the main theorem of this paper Theorem 4.
We found that the auxiliary lattice model defined in [
13] is of great use for counting multiplicities of modules of differently defined quantum deformations of
at
q root of unity. For instance, in [
9] we applied periodicity conditions to the auxiliary lattice path model to obtain a folded Bratteli diagram, weighted numbers of paths for which recreate multiplicities of modules in tensor product decomposition of
, where
is a fundamental module of the small quantum group
. In this paper, we modified the auxiliary lattice path model by applying long steps to obtain multiplicities for the case of
with divided powers in a similar fashion.
The model defined in [
13] required analysis of combinatorial properties of filters, which we heavily relied on. In this paper, we introduced long steps and explored their combinatorial properties. In order to derive formulas for weighted numbers of paths in this setting, we also defined boundary points and congruence of regions in lattice path models. The philosophy of congruence is fairly easy to understand. Two different lattice path models can be locally indistinguishable due to coinciding recursions for weighted numbers of paths in these regions. Weighted numbers of paths at boundary points of the considered region uniquely define weighted numbers of paths for the rest of the region by recursion. So, instead of proving identities for the whole region, it is sufficient to prove such only for boundary points of the region. At boundary points, an identity can be represented as a linear combination of weighted numbers of paths from different lattice path models and one needs to take into account boundary points of congruent regions with respect to all these models.
We found that besides applying periodicity conditions to the auxiliary lattice path model, one can take , consider its restriction to , where are subalgebras of the small quantum group , generated by F and E, respectively, and is a subalgebra of , generated by and , for , . Then, we can restrict to . This procedure defines another modification of the auxiliary lattice path model and, remarkably, gives the same result as with periodicity conditions. The lattice path model corresponding to will be considered in the upcoming paper.
Considering other possible directions for further research, the following questions remain open:
Multiplicity formulas for decomposition of tensor powers of fundamental representations of
at roots of unity remain out of reach and can be a source of inspiration for other interesting combinatorial constructions. We expect that for
derivation of such formulas will rely on similar combinatorial ideas. It is worth mentioning that obtaining such formulas explicitly is of interest for asymptotic representation theory, mainly, for constructing Plancherel measure and possibly obtaining its limit shape in different regimes, including regime when
([
7,
9,
21]).
In [
22], similar lattice path models emerge when studying the Grothendieck ring of the category of tilting modules for
in the mixed case: when
q is an odd root of unity and the ground field is
. One can expand the combinatorial analysis presented in this paper to a mixed case.
Inr [
23], it was shown that
at roots of unity is in Schur–Weyl duality with Hecke algebra
on
. For the case of
at roots of unity, multiplicity formulas should give answers for dimensions of certain representations of Temperley–Lieb algebra
at roots of unity. Dimensions of which representations were obtained is an open question, at least to the knowledge of the author of this paper.