Related papers: Dyck Paths Categories And Its Relationships With C…
The paper is motivated by an analogy between cluster algebras and Kac-Moody algebras: both theories share the same classification of finite type objects by familiar Cartan-Killing types. However the underlying combinatorics beyond the two…
The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian digraphs. We do so by providing two algorithms implementing such bijection in both directions. The connection between Dyck words and Eulerian…
The cluster category is a triangulated category introduced for its combinatorial similarities with cluster algebras. We prove that a cluster algebra A of finite type can be realized as a Hall algebra, called the exceptional Hall algebra, of…
Motivated by the need for a more comprehensive algebraic structure to calculate coincidence probabilities of a general decay scheme for gamma ray spectroscopy, we model the decay scheme, rather naturally, as a quiver through which we define…
We study the global dimension of Nakayama algebras. In the case of linear Nakayama algebras, which are in canonical bijection to Dyck paths, we show that the global dimension has the same distribution as the height of Dyck paths. For cyclic…
An $n$-multiset of $[k]=\{1,2,\ldots, k\}$ consists of a set of $n$ elements from $[k]$ where each element can be repeated. We present the bivariate generating function for $n$-multisets of $[k]$ with no consecutive elements. For $n=k$,…
Cover-inclusive Dyck tilings are tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths, in which tiles are no larger than the tiles they cover. These tilings arise in the study of certain statistical physics models and…
Let $\Q$ be the quiver of Dynkin type $\mathbb{A}_n$ with linear orientation and $A_{n}=k\Q$. In this paper, we give a complete classification of the silted algebras of type $A_{n}$ by using the geometric models of gentle algebras. We show…
The connection between simple Lie algebras and their Yangian algebras has a long history. In this work, we construct finite-dimensional representations of Yangian algebras $\mathsf{Y}(\mathfrak{sl}_{n})$ using the quiver approach. Starting…
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…
We define the path coalgebra and Gabriel quiver constructions as functors between the category of $k$-quivers and the category of pointed $k$-coalgebras, for $k$ a field. We define a congruence relation on the coalgebra side, show that the…
We study heaps of pieces for lattice paths, which give a combinatorial visualization of lattice paths. We introduce two types of heaps: type $I$ and type $II$. A heap of type $I$ is characterized by peaks of a lattice path. We have a…
We provide multiple combinatorial expansion formulas - in terms of snake graphs, labelled posets, matrices, and $T$-walks - for elements in generalized cluster algebras associated to arcs on punctured orbifolds and illustrate their…
We construct a finite dimensional quiver algebra from the non-simply laced type $B$ Dynkin diagram, which we call the type $B$ zigzag algebra. This leads to a faithful categorical action of the type $B$ braid group $\mathcal{A}(B)$, acting…
We give a simple algebraic description of opetopes in terms of chain complexes, and we show how this description is related to combinatorial descriptions in terms of treelike structures. More generally, we show that the chain complexes…
These notes provide three contributions to the (well-established) representation theory of Dynkin and Euclidean quivers. They should be helpful as part of a direct approach to study representations of quivers, and they may shed some new…
We consider the problem of counting the set of $\mathscr{D}_{a,b}$ of Dyck paths inscribed in a rectangle of size $a\times b$. They are a natural generalization of the classical Dyck words enumerated by the Catalan numbers. By using Ferrers…
We enumerate smooth and rationally smooth Schubert varieties in the classical finite types A, B, C, and D, extending Haiman's enumeration for type A. To do this enumeration, we introduce a notion of staircase diagrams on a graph. These…
The number of Dyck paths of semilength $n$ is famously $C_n$, the $n$th Catalan number. This fact follows after noticing that every Dyck path can be uniquely parsed according to a context-free grammar. In a recent paper, Zeilberger showed…
We interpret walks in the first quadrant with steps {(1,1),(1,0),(-1,0), (-1,-1)} as a generalization of Dyck words with two sets of letters. Using this language, we give a formal expression for the number of walks in the steps above…