Related papers: A Note on Generalized Narayana Numbers

This paper concentrates on the set $\mathcal{V}_n$ of weighted Dyck paths of length $2n$ with special restrictions on the level of valleys. We first give its explicit formula of the counting generating function in terms of certain weight…

Let $I_{n,m} = (x_1\cdots x_{m},x_2 \cdots x_{m+1},\ldots,x_{n+1}x_{n+2}\cdots x_{n+m})$ be the $m$-path ideal of a path of length $n + m-1$ over a polynomial ring $S = \mathrm{k}[x_1,\ldots,x_{n+m}]$. We compute all the graded Betti…

Let $k$ be an algebraically closed field. The generalized or $n$-Kronecker quiver $K(n)$ is the quiver with two vertices, called a source and a sink, and $n$ arrows from source to sink. Given a finite-dimensional module $M$ of the path…

Skew Dyck paths are a variation of Dyck paths, where additionally to steps $(1,1)$ and $(1,-1)$ a south-west step $(-1,-1)$ is also allowed, provided that the path does not intersect itself. Replacing the south-west step by a red south-east…

We answer a question of Simental by providing a combinatorial interpretation of a formula which generalizes rational Catalan numbers and which appears in the study of Springer fibers. We provide an interpretation in terms of binary…

Descents of odd length in Dyck paths are discussed, taking care of some variations. The approach is based on generating functions and the kernel method and augments relations about them from the Encyclopedia of Integer Sequences, that were…

Koroljuk gave a summation formula for counting the number of lattice paths from $(0,0)$ to $(m,n)$ with $(1,0), (0,1)$-steps in the plane that stay strictly above the line $y=k(x-d)$, where $k$ and $d$ are positive integers. In this paper…

All quasi-affine connected Generalized Dynkin Diagram with rank $= 3$ and $2$ are found. All quasi-affine Nichols (Lie braided) algebras with rank $ 3$ and $2$ are also found.

Let $G$ be a graph and let $m_{ij}(G)$, $i,j\ge 1$, be the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. The {\em $M$-polynomial} of $G$ is introduced with $\displaystyle{M(G;x,y) = \sum_{i\le j} m_{ij}(G)x^iy^j}$.…

We consider the generalized Fibonacci counting problem with rabbits that become fertile at age $f$ and die at age $d$, with $1<=f<=d$ and $d$ finite or infinite. We provide a simple proof, based exclusively on a counting argumentation, for…

Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…

In this paper, we study the behavior of a sequence of harmonic maps from surfaces with uniformly bounded energy on the generalized neck domain. The generalized neck domain is a union of ghost bubbles and annular neck domains, which connects…

This article develops an approximate proximal approach for the generalized method of lines. The present results are extensions and applications of previous ones which have been published since 2011, in books and articles such as [3,4,5,6].…

We count the number of walks of length n on a k-node circular digraph that cover all k nodes in two ways. The first way illustrates the transfer-matrix method. The second involves counting various classes of height-restricted lattice paths.…

For a graph $G$ on $[n]$, the $k$-cut complex $\Delta_k(G)$ has facets $[n]\setminus T$, where $T$ ranges over the disconnected $k$-vertex induced subgraphs of $G$. Bayer, Denker, Jeli\'c Milutinovi\'c, Sundaram, and Xue proved that the…

In this note, we investigate some properties of the integer sequence of general term $a_n := \sum_{k = 0}^{n - 1} k! (n - k - 1)!$ ($\forall n \geq 1$) to derive a new identity of the Genocchi numbers $G_n$ ($n \in \mathbb{N}$), which…

We consider the class of directed graphs with $N\geq 1$ edges and without loops shorter than $k\geq1$. Using the concept of a labelled graph, we determine graphs from this class that maximize the number of all paths of length $k$. Then we…

We generalise the finite biquandle colouring invariant to a polynomial invariant based on labelling a knot diagram with a finite birack that reduces to the biquandle colouring invariant in that case. The polynomial is an invariant of a…

This paper establishes an upper bound on the number of generalized cospectral mates of simple graphs, where the generalized spectrum consists of the spectrum of a graph and its complement. Moving beyond the classical problem of identifying…

For any non-negative integers $v > k > i$, the {\em generalized Johnson graph}, $J(v,k,i)$, is the undirected simple graph whose vertices are the $k$-subsets of a $v$-set, and where any two vertices $A$ and $B$ are adjacent whenever $|A…