English
Related papers

Related papers: Lattice Paths, Young Tableaux, and Weight Multipli…

200 papers

For $n \geq 2$ consider the affine Lie algebra $\widehat{s\ell}(n)$ with simple roots $\{\alpha_i \mid 0 \leq i \leq n-1\}$. Let $V(k\Lambda_0), \, k \in \mathbb{Z}_{\geq 1}$ denote the integrable highest weight $\widehat{s\ell}(n)$-module…

Representation Theory · Mathematics 2020-05-01 Rebecca L. Jayne , Kailash C. Misra

Using lattice path counting arguments, we reproduce a well known formula for the number of standard Young tableaux. We also produce an interesting new formula for tableaux of height $\leq 3$ using the Fourier methods of Ault and Kicey.

Combinatorics · Mathematics 2022-01-10 Shaun V. Ault

We determine explicitly the maximal dominant weights for the integrable highest weight $\hat{sl}(n)$-modules $V((k-1)\Lambda_0 + \Lambda_s)$, $0 \leq s \leq n-1$, $ k \geq 2$. We give a conjecture for the number of maximal dominant weights…

Representation Theory · Mathematics 2013-09-20 Rebecca L. Jayne , Kailash C. Misra

We give asymptotic formulas for the multiplicities of weights and irreducible summands in high-tensor powers $V_{\lambda}^{\otimes N}$ of an irreducible representation $V_{\lambda}$ of a compact connected Lie group $G$. The weights are…

Representation Theory · Mathematics 2011-11-10 Tatsuya Tate , Steve Zelditch

In this paper, we propose a notion of colored Motzkin paths and establish a bijection between the $n$-cell standard Young tableaux (SYT) of bounded height and the colored Motzkin paths of length $n$. This result not only gives a lattice…

Combinatorics · Mathematics 2013-02-14 Sen-Peng Eu , Tung-Shan Fu , Justin T. Hou , Te-Wei Hsu

Consider non-negative lattice paths ending at their maximum height, which will be called admissible paths. We show that the probability for a lattice path to be admissible is related to the Chebyshev polynomials of the first or second kind,…

Combinatorics · Mathematics 2016-11-16 Benjamin Hackl , Clemens Heuberger , Helmut Prodinger , Stephan Wagner

The combinatorics of certain osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. More specifically, the paths being considered have fixed start and end points on respectively the lower and right…

Combinatorics · Mathematics 2011-11-29 Roger E. Behrend

Let E be an arbitrary directed graph with no restrictions on the number of vertices and edges and let K be any field. We give necessary and sufficient conditions for the Leavitt path algebra L_K(E) to be of countable irreducible…

Rings and Algebras · Mathematics 2014-06-26 Pere Ara , Kulumani M. Rangaswamy

The weight multiplicities of finite dimensional simple Lie algebras can be computed individually using various methods. Still, it is hard to derive explicit closed formulas. Similarly, explicit closed formulas for the multiplicities of…

Representation Theory · Mathematics 2017-03-31 Jang Soo Kim , Kyu-Hwan Lee , Se-jin Oh

We consider families $\mathcal{P}_n$ of plane lattice paths enumerated by Guy, Krattenthaler, and Sagan (1992). We show by explicit bijection that these families are equinumerous with the set $\mathrm{SYT}(n+2,2,1^n)$ of standard Young…

The spectral decomposition of the path space of the vertex model associated to the level $l$ representation of the quantized affine algebra $U_q(\hat{sl}_n)$ is studied. The spectrum and its degeneracy are parametrized by skew Young…

q-alg · Mathematics 2011-01-28 Anatol N. Kirillov , Atsuo Kuniba , Tomoki Nakanishi

We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context of lattice paths. Specifically, we will consider the case of Dyck, Grand Dyck, Motzkin, Grand Motzkin, Schr\"oder and Grand Schr\"oder…

Combinatorics · Mathematics 2012-04-02 Luca Ferrari , Emanuele Munarini

A lattice path in $\mathbb{Z}^d$ is a sequence $\nu_1,\nu_2,\ldots,\nu_k\in\mathbb{Z}^d$ such that the steps $\nu_i-\nu_{i-1}$ lie in a subset $\mathbf{S}$ of $\mathbb{Z}^d$ for all $i=2,\ldots,k$. Let $T_{m,n}$ be the $m\times n$ table in…

Inhomogeneous lattice paths are introduced as ordered sequences of rectangular Young tableaux thereby generalizing recent work on the Kostka polynomials by Nakayashiki and Yamada and by Lascoux, Leclerc and Thibon. Motivated by these works…

Quantum Algebra · Mathematics 2009-10-31 Anne Schilling , S. Ole Warnaar

We consider the system of equations $A_k(x)=p(x)A_{k-1}(x)(q(x)+\sum_{i=0}^k A_i(x))$ for $k\geq r+1$ where $A_i(x)$, $0\leq i \leq r$, are some given functions and show how to obtain a close form for $A(x)=\sum_{k\geq 0}A_k(x)$. We apply…

Combinatorics · Mathematics 2021-10-28 Jean-Luc Baril , Sergey Kirgizov

We introduce a new generalisation of partitions, multi-grounded partitions, related to ground state paths indexed by dominant weights of Lie algebras. We use these to express characters of irreducible highest weight modules of Kac-Moody…

Quantum Algebra · Mathematics 2021-03-09 Jehanne Dousse , Isaac Konan

We consider a variation of Dyck paths, where additionally to steps $(1,1)$ and $(1,-1)$ down-steps $(1,-j)$, for $j\ge2$ are allowed. We give credits to Emeric Deutsch for that. The enumeration of such objects living in a strip is…

Combinatorics · Mathematics 2021-08-31 Helmut Prodinger

We review and motivate recently-observed relationships between exactly solvable lattice models and modular representations of Hecke algebras. Firstly, we describe how the set of $n$-regular partitions label both of the following classes of…

q-alg · Mathematics 2008-02-03 Omar Foda , Bernard Leclerc , Masato Okado , Jean-Yves Thibon , Trevor A. Welsh

In this paper, we enumerate lattice paths with certain constraints and apply the corresponding results to develop formulas for calculating the dimensions of submodules of a class of modules for planar upper triangular rook monoids. In…

Combinatorics · Mathematics 2017-08-24 Jianqiang Feng , Wenli Liu , Ximei Bai , Zhenheng Li

We define $(k,\ell)$-restricted Lukasiewicz paths, $k\le\ell\in\mathbb{N}_0$, and use these paths as models of polymer adsorption. We write down a polynomial expression satisfied by the generating function for arbitrary values of…

Combinatorics · Mathematics 2015-05-28 Richard Brak , Gary K Iliev , Thomas Prellberg
‹ Prev 1 2 3 10 Next ›