In this paper we introduce the notion of congruence for regions in lattice path models. This turns out to be useful for deriving a path counting formula for the auxiliary lattice path model in the presence of long steps, source and target points of which are situated near the filter restrictions. This problem was motivated by the fact, that weighted numbers of paths in such model mimic multiplicities in tensor power decomposition of Uq(sl2)-module T(1)⊗N at roots of unity. We expand on combinatorial properties of such model and introduce the punchline of a proof for explicit path counting formula.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Grabiner and P. Magyar, “Random walks in Weyl chambers and the decomposition of tensor powers,” J. Algebraic Combin., 2(3), 239–260 (1993).
D. Grabiner, “Random walk in an alcove of an affineWeyl group, and non-colliding random walks on an interval,” J. Combin. Theory, Series A, 97(2), 285–306 (2002).
T. Tate and S. Zelditch, “Lattice path combinatorics and asymptotics of multiplicities of weights in tensor powers,” J. Funct. Anal., 217(2), 402–447 (2004).
O. Postnova and N. Reshetikhin, “On multiplicities of ireducibles in large tensor product of representations of simple Lie algebras,” arXiv:1812.11236.
L. Faddeev, N. Reshetikhin and L. Takhtajan, “Quantization of Lie groups and Lie algebras,” Algebraic Analysis, 129–139 (1988).
H. Andersen, “Tensor products of quantized tilting modules,” Comm. Math. Phys., 149, 149–159 (1992).
A. Lachowska, O. Postnova, N. Reshetikhin and D. Solovyev, “Tensor powers of vector representation of Uq(sl2) at even roots of unity,” in preparation.
O. Postnova and D. Solovyev, “Counting filter restricted paths in 2 lattice,” arXiv:2107.09774
C. Krattenthaler, “Lattice path combinatorics chapter in Handbook of Enumerative combinatorics,” edited by Miklos Bona, Chapman and Hall (2015).
P. Littelmann, “Paths and root operators in representation theory,” Ann. Math., 142 (3), 499–525 (1995).
O. Bratteli, “Inductive limits of finite dimensional C*-algebras,” Trans. Amer. Math. Soc., 171, 195–234 (1972).
D. Zeilberger, “The Method of Creative Telescoping,” J. Symb. Comput., 11, 195–204 (1991).
Herbert Wilf and Doron Zeilberger, “Rational Functions Certify Combinatorial Identities,” J. Amer. Math. Soc., 3, 147–158 (1990).
P. Paule and M. Schorn, “A Mathematica Version of Zeilberger’s Algorithm for Proving Binomial Coefficient Identities,” J. Symb. Comput., 11, 1-000 (1994).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 509, 2021, pp. 201–215.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Solovyev, D.P. Towards Counting Paths in Lattice Path Models with Filter Restrictions and Long Steps. J Math Sci 275, 359–369 (2023). https://doi.org/10.1007/s10958-023-06688-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-023-06688-4