اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExplicit formulas for enumeration of lattice paths: basketball and the kernel method
52
0
0.0
(
0
)
تأليف
Cyril Banderier
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This article deals with the enumeration of directed lattice walks on the integers with any finite set of steps, starting at a given altitude $j$ and ending at a given altitude $k$, with additional constraints such as, for example, to never attain altitude $0$ in-between. We first discuss the case of walks on the integers with steps $-h, dots, -1, +1, dots, +h$. The case $h=1$ is equivalent to the classical Dyck paths, for which many ways of getting explicit formulas involving Catalan-like numbers are known. The case $h=2$ corresponds to basketball walks, which we treat in full detail. Then we move on to the more general case of walks with any finite set of steps, also allowing some weights/probabilities associated with each step. We show how a method of wide applicability, the so-called kernel method, leads to explicit formulas for the number of walks of length $n$, for any $h$, in terms of nested sums of binomials. We finally relate some special cases to other combinatorial problems, or to problems arising in queuing theory.
قيم البحث
اقرأ أيضاً
We derive a new explicit formula in terms of sums over graphs for the $n$-point correlation functions of general formal weighted double Hurwitz numbers coming from the Kadomtsev-Petviashvili tau functions of hypergeometric type (also known as Orlov-S
cherbin partition functions). Notably, we use the change of variables suggested by the associated spectral curve, and our formula turns out to be a polynomial expression in a certain small set of formal functions defined on the spectral curve.
In this paper, we consider various classes of polyiamonds that are animals residing on the triangular lattice. By careful analyses through certain layer-by-layer decompositions and cell pruning/growing arguments, we derive explicit forms for the gene
rating functions of the number of nonempty translation-invariant baryiamonds (bargraphs in the triangular lattice), column-convex polyiamonds, and convex polyiamonds with respect to their perimeter. In particular, we show that the number of (A) baryiamonds of perimeter $n$ is asymptotically $$frac{(xi+1)^2sqrt{xi^4+xi^3-2xi+1}}{2sqrt{pi n^3}}xi^{-n-2},$$ where $xi$ is a root of a certain explicit polynomial of degree 5. (B) column-convex polyiamonds of perimeter $n$ is asymptotic to $$frac{(17997809sqrt{17}+3^3cdot13cdot175463)sqrt{95sqrt{17}-119}}{2^7cdot43^2cdot 89^2sqrt{6pi n^3}}left(frac{3+sqrt{17}}{2}right)^{n-1}.$$ (C) convex polyiamonds of perimeter $n$ is asymptotic to $$frac{1280}{441sqrt{3pi n^3}}3^n.$$
For generalized Dyck paths (i.e., directed lattice paths with any finite set of jumps), we analyse their local time at zero (i.e., the number of times the path is touching or crossing the abscissa). As we are in a discrete setting, the event we analy
se here is invisible to the tools of Brownian motion theory. It is interesting that the key tool for analysing directed lattice paths, which is the kernel method, is not directly applicable here. Therefore, we introduce a variant of this kernel method to get the trivariate generating function (length, final altitude, local time): this leads to an expression involving symmetric and algebraic functions. We apply this analysis to different types of constrained lattice paths (meanders , excursions, bridges,. . .). Then, we illustrate this approach on basketball walks which are walks defined by the jumps --2, --1, 0, +1, +2. We use singularity analysis to prove that the limit laws for the local time are (depending on the drift and the type of walk) the geometric distribution, the negative binomial distribution, the Rayleigh distribution, or the half-normal distribution (a universal distribution up to now rarely encountered in analytic combinatorics).
Motivated by Grobner basis theory for finite point configurations, we define and study the class of standard complexes associated to a matroid. Standard complexes are certain subcomplexes of the independence complex that are invariant under matroid d
uality. For the lexicographic term order, the standard complexes satisfy a deletion-contraction-type recurrence. We explicitly determine the lexicographic standard complexes for lattice path matroids using classical bijective combinatorics.
Ganter and Kapranov associated a 2-character to 2-representations of a finite group. Elgueta classified 2-representations in the category of 2-vector spaces 2Vect_k in terms of cohomological data. We give an explicit formula for the 2-character in te
rms of this cohomological data and derive some consequences.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
