相关论文: Elliptic enumeration of nonintersecting lattice pa…
A $\tau$ function formalism for Sakai's elliptic Painlev'e equation is presented. This establishes the equivalence between the two formulations by Sakai and by Ohta-Ramani-Grammaticos. We also give a simple geometric description of the…
We prove new bijections between different variants of Dyck paths and integer compositions, which give combinatorial explanations of their simple counting formula $4^{n-1}$. These give relations between different statistics, such as the…
In 1992, Loeb considered a natural extension of the binomial coefficients to negative entries and gave a combinatorial interpretation in terms of hybrid sets. He showed that many of the fundamental properties of binomial coefficients…
The set of Dyck paths of length $2n$ inherits a lattice structure from a bijection with the set of noncrossing partitions with the usual partial order. In this paper, we study the joint distribution of two statistics for Dyck paths:…
The degree of symmetry of a combinatorial object, such as a lattice path, is a measure of how symmetric the object is. It typically ranges from zero, if the object is completely asymmetric, to its size, if it is completely symmetric. We…
We provide a new strategy to compute the exponential growth constant of enumeration sequences counting walks in lattice path models restricted to the quarter plane. The bounds arise by comparison with half-planes models. In many cases the…
Recent work of the author connected several parking function enumeration problems to enumerations of Catalan paths with respect to certain weight functions that are expressed in terms of the ascent lengths. Motivated by this, we generalise…
The lattice polynomials $L_{i,j}(x)$ are introduced by Hough and Shapiro as a weighted count of certain lattice paths from the origin to the point $(i,j)$. In particular, $L_{2n, n}(x)$ reduces to the generating function of the numbers…
We provide a unified combinatorial framework connecting Entringer numbers, Dumont-Viennot snakes, and elliptically weighted continued fractions, which gives a structural interpretation of the Jacobi elliptic identity \begin{equation}…
We consider a partially asymmetric exclusion process (PASEP) on a finite number of sites with open and directed boundary conditions. Its partition function was calculated by Blythe, Evans, Colaiori, and Essler. It is known to be a…
We present refined enumeration formulas for lattice paths in $\mathbb{Z}^2$ with two kinds of steps, by keeping track of the number of descents (i.e., turns in a given direction), the major index (i.e., the sum of the positions of the…
A weight-dependent generalization of the binomial theorem for noncommuting variables is presented. This result extends the well-known binomial theorem for q-commuting variables by a generic weight function depending on two integers. For a…
This work presents new asymptotic formulas for family of walks in Weyl chambers. The models studied here are defined by step sets which exhibit many symmetries and are restricted to the first orthant. The resulting formulas are very…
In addition to extending some facts from field coefficients to commutative ring coefficients for Leavitt path algebras with new shorter proofs, we also prove some results that are new even for field coefficients. In particular, we show that…
We deduce Narayana's formula for the number of lattice paths that fit in a Young diagram as a direct consequence of the Gessel-Viennot theorem on non-intersecting lattice paths.
Using multiple q-integrals and a determinant evaluation, we establish a multivariable extension of Bailey's nonterminating 10-phi-9 transformation. From this result, we deduce new multivariable terminating 10-phi-9 transformations, 8-phi-7…
In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some…
The theme of this article is a "reciprocity" between bounded up-down paths and bounded alternating sequences. Roughly speaking, this ``reciprocity" manifests itself by the fact that the extension of the sequence of numbers of paths of…
Explicit algebraic area enumeration formulae are derived for various lattice walks generalizing the canonical square lattice walk, and in particular for the triangular lattice chiral walk recently introduced by the authors. A key element in…
This paper addresses the prediction of positive rank for elliptic curves without the need to find a point of infinite order or compute L-functions. While the most common method relies on parity conjectures, a recent technique introduced by…