اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMotzkin numbers of higher rank: Generating function and explicit expression
135
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The generating function and an explicit expression is derived for the (colored) Motzkin numbers of higher rank introduced recently. Considering the special case of rank one yields the corresponding results for the conventional colored Motzkin numbers for which in addition a recursion relation is given.
قيم البحث
اقرأ أيضاً
We show that the formalism of hybrid polynomials, interpolating between Hermite and Laguerre polynomials, is very useful in the study of Motzkin numbers and central trinomial coefficients. These sequences are identified as special values of hybrid po
lynomials, a fact which we use to derive their generalized forms and new identities satisfied by them.
Sequences of Genocchi numbers of the first and second kind are considered. For these numbers, an approach based on their representation using sequences of polynomials is developed. Based on this approach, for these numbers some identities generalizing the known identities are constructed.
The $q,t$-Catalan numbers can be defined using rational functions, geometry related to Hilbert schemes, symmetric functions, representation theory, Dyck paths, partition statistics, or Dyck words. After decades of intensive study, it was eventually p
roved that all these definitions are equivalent. In this paper, we study the similar situation for higher $q,t$-Catalan numbers, where the equivalence of the algebraic and combinatorial definitions is still conjectural. We compute the limits of sever
A {em Motzkin path} of length $n$ is a lattice path from $(0,0)$ to $(n,0)$ in the plane integer lattice $mathbb{Z}timesmathbb{Z}$ consisting of horizontal-steps $(1, 0)$, up-steps $(1,1)$, and down-steps $(1,-1)$, which never passes below the x-axis
. A {em $u$-segment {rm (resp.} $h$-segment {rm)}} of a Motzkin path is a maximum sequence of consecutive up-steps ({rm resp.} horizontal-steps). The present paper studies two kinds of statistics on Motzkin paths: number of $u$-segments and number of $h$-segments. The Lagrange inversion formula is utilized to represent the weighted generating function for the number of Motzkin paths according to the statistics as a sum of the partial Bell polynomials or the potential polynomials. As an application, a general framework for studying compositions are also provided.
Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index, $m$. Such polygons are called emph{$m$-convex} polygons and are characterised by having up to $
m$ indentations in their perimeter. We first describe how we conjectured the (isotropic) generating function for the case $m=2$ using a numerical procedure based on series expansions. We then proceed to prove this result for the more general case of the full anisotropic generating function, in which steps in the $x$ and $y$ direction are distinguished. In so doing, we develop tools that would allow for the case $m > 2$ to be studied. %In our proof we use a `divide and conquer approach, factorising 2-convex %polygons by extending a line along the base of its indents. We then use %the inclusion-exclusion principle, the Hadamard product and extensions to %known methods to derive the generating functions for each case.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
