相关论文: (k,m)-Catalan Numbers and Hook Length Polynomials …
The binomial coefficients and Catalan triangle numbers appear as weight multiplicities of the finite-dimensional simple Lie algebras and affine Kac--Moody algebras. We prove that any binomial coefficient can be written as weighted sums…
Planar arrays of tree diagrams were introduced as a generalization of Feynman diagrams that enables the computation biadjoint amplitudes $m^{(k)}_n$ for $k>2$ . In this follow-up work we investigate the poles of $m^{(k)}_n$ from the…
We present an algorithmic mapping from permutations of length dn to labeled n-node d-ary trees and back again. Given such a bijection, one can interpret each of the factorials in the formula for the Catalan numbers as a count of…
The Super-Catalan numbers are a generalization of the Catalan numbers defined as $T(m,n) = \frac{(2m)!(2n)!}{2m!n!(m+n)!}$. It is an open problem to find a combinatorial interpretation for $T(m,n)$. We resolve this for $m=3,4$ using a…
The m-Tamari lattice of F. Bergeron is an analogue of the clasical Tamari order defined on objects counted by Fuss-Catalan numbers, such as m-Dyck paths or (m+1)-ary trees. On another hand, the Tamari order is related to the product in the…
Let k and n be positive integers. We mainly show that $$(ln+1) | k\binom{kn+ln}{kn},$$ $$2\binom{kn}n | \binom {2n}{n}C_{2n}^{(k-1)}$$, $$\binom{kn}n | (2k-1)C_n\binom{2kn}{2n},$$ $$\binom{2n}n | (k+1)C_n^{(k-1)}\binom{2kn}{kn},$$…
Given a coprime pair $(m,n)$ of positive integers, rational Catalan numbers $\frac{1}{m+n} \binom{m+n}{m,n}$ counts two combinatorial objects:rational $(m,n)$-Dyck paths are lattice paths in the $m\times n$ rectangle that never go below the…
We denote a polygon as a connected component in Cayley tree of order 2 containing certain number of fix vertices. We found an exact formula for a polygon counting problem for two cases, in which, for the first case the polygon contain a…
In this article, we extend Moon's classic formula for counting spanning trees in complete graphs containing a fixed spanning forest to complete bipartite graphs. Let $(X,Y)$ be the bipartition of the complete bipartite graph $K_{m,n}$ with…
In this paper, we take interest in finding applications for a hook-length formula recently proved in (Morales Pak Panova 2016). This formula can be applied to give a non trivial relation between alternating permutations and weighted Dyck…
We continue the study of the rational-slope generalized $q,t$-Catalan numbers $c_{m,n}(q,t)$. We describe generalizations of the bijective constructions of J. Haglund and N. Loehr and use them to prove a weak symmetry property…
A hyperplane arrangement in $\mathbb{R}^n$ is a finite collection of affine hyperplanes. Counting regions of hyperplane arrangements is an active research direction in enumerative combinatorics. In this paper, we consider the arrangement…
The purpose of this paper is to enumerate various classes of cyclically colored m-gonal plane cacti, called m-ary cacti. This combinatorial problem is motivated by the topological classification of complex polynomials having at most m…
In this paper, we study the combinatorial structures of straight and ordinary m\'enage permutations. Based on these structures, we prove four formulas. The first two formulas define a relationship between the m\'enage numbers and the…
A hyperbinary expansion of a positive integer n is a partition of n into powers of 2 in which each part appears at most twice. In this paper, we consider a generalization of this concept and a certain statistic on the corresponding set of…
A positive integer k is a length of a polynomial if that polynomial factors into a product of k irreducible polynomials. We find the set of lengths of polynomials of the form x^n in R[x], where (R, m) is an Artinian local ring with m^2 = 0.
The tangent number $T_{2n+1}$ is equal to the number of increasing labelled complete binary trees with $2n+1$ vertices. This combinatorial interpretation immediately proves that $T_{2n+1}$ is divisible by $2^n$. However, a stronger…
By a very simple argument, we prove that if $l,m,n$ are nonnegative integers then $$\sum_{k=0}^l(-1)^{m-k}\binom{l}{k}\binom{m-k}{n}\binom{2k}{k-2l+m} =\sum_{k=0}^l\binom{l}{k}\binom{2k}{n}\binom{n-l}{m+n-3k-l}. On the basis of this…
In this short note, we first present a simple bijection between binary trees and colored ternary trees and then derive a new identity related to generalized Catalan numbers.
We define the disposition polynomial $R_{m}(x_1, x_2, ..., x_n)$ as $\prod_{k=0}^{m-1}(x_1+x_2+...+x_n+k)$. When $m=n-1$, this polynomial becomes the generating function of plane trees with respect to certain statistics as given by Guo and…