Results 31 to 40 of about 426,250 (213)
Dyck paths, Motzkin paths and traffic jams [PDF]
It has recently been observed that the normalization of a one-dimensional out-of-equilibrium model, the Asymmetric Exclusion Process (ASEP) with random sequential dynamics, is exactly equivalent to the partition function of a two-dimensional lattice path model of one-transit walks, or equivalently Dyck paths.
Blythe, R. A. +3 more
openaire +3 more sources
Constructing combinatorial operads from monoids [PDF]
We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operad obtained from the additive monoid. These involve various familiar combinatorial objects:
Samuele Giraudo
doaj +1 more source
Cyclic Sieving of Increasing Tableaux [PDF]
An $\textit{increasing tableau}$ is a semistandard tableau with strictly increasing rows and columns. It is well known that the Catalan numbers enumerate both rectangular standard Young tableaux of two rows and also Dyck paths.
Oliver Pechenik
doaj +1 more source
Nondecreasing Dyck paths and q-Fibonacci numbers [PDF]
In this paper, we introduce a subclass of the Dyck paths (Delest and Viennot, 1984) called nondecreasing Dyck paths which are enumerated by the Fibonacci numbers having odd indexes.
Del Lungo, A. +3 more
core +1 more source
From Dyck Paths to Standard Young Tableaux [PDF]
We present nine bijections between classes of Dyck paths and classes of standard Young tableaux (SYT). In particular, we consider SYT of flag and rectangular shapes, we give Dyck path descriptions for certain SYT of height at most 3, and we introduce a ...
Gil, Juan B. +3 more
core +1 more source
A Bijection on Bilateral Dyck Paths
revised ...
Paul R. G. Mortimer, Thomas Prellberg
openaire +3 more sources
MIN-turns and MAX-turns in k-Dyck paths: A pure generating function approach [PDF]
k-Dyck paths differ from ordinary Dyck paths by using an up-step of length k. We analyze at which level the path is after the s-th up-step and before the (s+1)-st up-step.
Helmut Prodinger
doaj +1 more source
Negative moments of orthogonal polynomials
If a sequence indexed by nonnegative integers satisfies a linear recurrence without constant terms, one can extend the indices of the sequence to negative integers using the recurrence.
Jihyeug Jang +4 more
doaj +1 more source
Exact Partition Function for the Random Walk of an Electrostatic Field
The partition function for the random walk of an electrostatic field produced by several static parallel infinite charged planes in which the charge distribution could be either ±σ is obtained. We find the electrostatic energy of the system and show that
Gabriel González
doaj +1 more source
Method for Developing Combinatorial Generation Algorithms Based on AND/OR Trees and Its Application
In this paper, we study the problem of developing new combinatorial generation algorithms. The main purpose of our research is to derive and improve general methods for developing combinatorial generation algorithms.
Yuriy Shablya +2 more
doaj +1 more source

