Related papers: Generating Functions for Restricted Motzkin Paths …
We note that a tridiagonal matrix representation of the algebra of the partially asymmetric exclusion process (PASEP) lends itself to interpretation as the transfer matrix for weighted Motzkin lattice paths. A continued fraction…
We present a novel bijection between stacked directed polyominoes and Motzkin paths with catastrophes. Further, we leverage this new bridge between these two worlds to obtain a better understanding of certain parameters of stacked directed…
Microstructure reconstruction and compression techniques are designed to find a microstructure with desired properties. While the microstructure reconstruction searches for a microstructure with prescribed statistical properties, the…
We study nearest-neighbors walks on the two-dimensional square lattice, that is, models of walks on $\mathbb{Z}^2$ defined by a fixed step set that is a subset of the non-zero vectors with coordinates 0, 1 or $-1$. We concern ourselves with…
We present three bijections, the first between little Schr\"{o}der paths and a class of growth-constrained integer sequences, the second between lattice paths consisting of steps with nonnegative slope and another class of…
In this paper we describe explicit generating functions for a large class of Hurwitz-Hodge integrals. These are integrals of tautological classes on moduli spaces of admissible covers, a (stackily) smooth compactification of the Hurwitz…
In this note we focus on combinatorial aspects of plus-one generated line arrangements. We provide combinatorial constraints on such arrangements and we construct a polynomial that decodes the plus-one generated property. We present new…
We present a short, direct proof of the fact that the generating function of all permutations of a fixed length $n\geq 4$ is divisible by $(1+z)^m$, where $m=\lfloor (n-2)/2 \rfloor$.
We present a simple direct discretization for functionals used in the variational mesh generation and adaptation. Meshing functionals are discretized on simplicial meshes and the Jacobian matrix of the continuous coordinate transformation…
We begin our analysis with the study of two collections of lattice paths in the plane, denoted $\mathcal{D}_{[n,i,j]}$ and $\mathcal{P}_{[n,i,j]}$. These paths consist of sequences of $n$ steps, where each step allows movement in three…
In this paper new algorithm for calculating power indices is described. The complexity class of the problem is #P-complete and even calculating power index of the biggest player is NP-hard task. Constructed algorithm is a mix of ideas of…
We present a method to sample Markov-chain trajectories constrained to both the initial and final conditions, which we term Markov bridges. The trajectories are conditioned to end in a specific state at a given time. We derive the master…
A dispersed Dyck path (DDP) of length n is a lattice path on $N\times N$ from (0,0) to (n,0) in which the following steps are allowed: "up" (x, y) $\to$ (x+1, y+1); "down" (x, y) $\to$ (x+1, y-1); and "right" (x,0) $\to$ (x+1,0). An ascent…
We show that the vanishing stepsize subgradient method -- widely adopted for machine learning applications -- can display rather messy behavior even in the presence of favorable assumptions. We establish that convergence of bounded…
This paper is the first application of the compensation approach to counting problems. We discuss how this method can be applied to a general class of walks in the quarter plane $Z_{+}^{2}$ with a step set that is a subset of…
A growing self-avoiding walk (GSAW) is a walk on a graph that is directed, does not visit the same vertex twice, and has a trapped endpoint. We show that the generating function enumerating GSAWs on a half-infinite strip of finite height is…
In this paper we find the generating function for the number of vertices which have $k$ elements in their subtree and use this generating function to calculate the probability that a vertex has a size $k$ subtree. We also show how this same…
An algorithm is proposed for constructing directed spanning forests of the minimum weight, in which the maximum possible degree of affinity between the minimum forests is preserved when the number of trees changes. The correctness of the…
We introduce an equivalence relation on the set of Dyck paths and some operations on them. We determine a formula for the cardinality of those equivalence classes and use this information to obtain a combinatorial formula for the number of…
We study the moments and the distribution of the discrete Choquet integral when regarded as a real function of a random sample drawn from a continuous distribution. Since the discrete Choquet integral includes weighted arithmetic means,…