Related papers: Lattice paths and quiver generating series with hi…
In this paper, we introduce a new type of relation between knots called the descendant relation. One knot $H$ is a descendant of another knot $K$ if $H$ can be obtained from a minimal crossing diagram of $K$ by some number of crossing…
Combinatorial enumeration of various RNA secondary structures and protein contact maps, is of great interest for both combinatorists and computational biologists. Enumeration of protein contact maps has considerable difficulties due to the…
Each quiver corresponds to a path semigroup, and such a path semigroup also corresponds to an associative K-algebra over an algebraically closed field K. Let Q be a quiver and S_Q, KQ be its path semigroup, path algebra, respectively. In…
Coordination sequences of periodic and quasiperiodic graphs are analysed. These count the number of points that can be reached from a given point of the graph by a number of steps along its bonds, thus generalising the familiar coordination…
We obtain a quiver representation for a family of knots called double twist knots $K(p,-m)$. Particularly, we exploit the reverse engineering of Melvin-Morton-Rozansky(MMR) formalism to deduce the pattern of the charge matrix for these…
For a Legendrian knot L in R^3 with a chosen Morse complex sequence (MCS) we construct a differential graded algebra (DGA) whose differential counts "chord paths" in the front projection of L. The definition of the DGA is motivated by…
We present a combinatorial model of configuration spaces and polytopes associated to the quotients of $\mathbb{C} A_n$, the path algebra of the linearly oriented $A_n$ quiver, i.e. the algebra of upper triangular matrices. These quotient…
Lattice paths effectively model phenomena in chemistry, physics and probability theory. Asymptotic enumeration of lattice paths is linked with entropy in the physical systems being modeled. Lattice paths restricted to different regions of…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
An upper bound on degrees of elements of a minimal generating system for invariants of quivers of dimension (2,...,2) is established over a field of arbitrary characteristic and its precision is estimated. The proof is based on the…
We consider module categories of path algebras of connected acyclic quivers. It is shown in this paper that the set of functorially finite torsion classes form a lattice if and only if the quiver is either Dynkin quiver of type A, D, E, or…
We introduce a new poset structure on Dyck paths where the covering relation is a particular case of the relation inducing the Tamari lattice. We prove that the transitive closure of this relation endows Dyck paths with a lattice structure.…
In this paper, we explain how the Tamari lattice arises in the context of the representation theory of quivers, as the poset whose elements are the torsion classes of a directed path quiver, with the order relation given by inclusion.
Let $Q$ be a bipartite quiver with vertex set $Q_0$ such that the number of arrows between any source vertex and any sink vertex is constant. Let $\beta=(\beta(x))_{x \in Q_0}$ be a dimension vector of $Q$ with positive integer coordinates.…
The reduced Kronecker coefficients are particular instances of Kronecker coefficients that contain enough information to recover them. In this notes we compute the generating function of a family of reduced Kronecker coefficients. We also…
In this paper, we count the number of matrices whose rows generate different $\mathbb{Z}_2\mathbb{Z}_8$ additive codes. This is a natural generalization of the well known Gaussian numbers that count the number of matrices whose rows…
This is an expository paper which has two parts. In the first part, we study quiver varieties of affine $A$-type from a combinatorial point of view. We present a combinatorial method for obtaining a closed formula for the generating…
From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…
Motivated by the concept of "generating operators" for a countable family of operators introduced in the recent paper (arXiv:2306.16800), we find a method to reconstruct the Rankin--Cohen brackets from a very simple multivariable contour…
This article deals with three types of mutually inverse series relating Ferrers and associated Legendre functions of arbitrary complex indexes and orders established on the base of integral representations by using a number of generating…