Related papers: Grand Dyck paths with air pockets
A deposition process with particles having realistic intermediate stickiness is studied in 2+1 dimensions. At each stage of the deposition process, for any given configuration, a newly depositing particle gives rise to allowed set of…
Black holes play an important role in linking microphysics with macrophysics, with those of the Planck mass ($M_P \sim10^{-5}$g) featuring in any theory of quantum gravity. In particular, the Compton-Schwarzschild correspondence posits a…
In this work, we introduce new combinatorial objects called Dyck tableaux, which present a natural insertion algorithm. These tools may be useful to describe statistics which are relevant in the study of the physical model named PASEP.
The displacement and deviation vectors in spaces (manifolds), the tangent bundle of which is endowed with a transport along paths, are introduced. In case these spaces are equipped with a linear connection, the deviation equations (between…
This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…
The super upper half plane, this is the ordinary upper half plane with additional odd (anticommuting) directions, admits a transitive super action of a certain super Lie group G . First we define the spaces of super automorphic and cusp…
This paper's aim is to present recent combinatorial considerations on r-Dyck paths, r-Parking functions, and the r-Tamari lattices. Giving a better understanding of the combinatorics of these objects has become important in view of their…
Gyroscopic alignment of a fluid occurs when flow structures align with the rotation axis. This often gives rise to highly spatially anisotropic columnar structures that in combination with complex domain boundaries pose challenges for…
When G denotes a graph, the unlabeled subgraph obtained by deleting a vertex from G is called a card of G and the collection of all cards of G is the deck of G. A graph having the same deck as G is called a hypomorph of G. A graph is called…
The entropy of an ergodic finite-alphabet process can be computed from a single typical sample path x_1^n using the entropy of the k-block empirical probability and letting k grow with $n$ roughly like log n. We further assume that the…
This paper enumerates all juxtaposition classes of the form "Av($abc$) next to Av($xy$)", where $abc$ is a permutation of length three and $xy$ is a permutation of length two. We use Dyck paths decorated by sequences of points to represent…
The lattice path model suggested by E. Deutsch is derived from ordinary Dyck paths, but with additional down-steps of size -3,-5,-7,... . For such paths, we find the generating functions of them, according to length, ending at level $i$,…
Dyck paths are one of the most important objects in enumerative combinatorics, and there are many papers devoted to counting selected families of Dyck paths. Here we present two approaches for the automatic counting of many such families,…
Several modern applications involve huge graphs and require fast answers to reachability queries. In more than two decades since first proposals, several approaches have been presented adopting on-line searches, hop labelling or transitive…
An induced additive action on a projective variety $X \subseteq \mathbb{P}^n$ is a regular action of the group $\mathbb{G}_a^m$ on $X$ with an open orbit, which can be extended to a regular action on the ambient projective space…
In this paper, we establish the first large deviation bounds for the Airy point process. The proof is based on a novel approach which relies upon the approximation of the Airy point process using the Gaussian unitary ensemble (GUE) up to an…
We consider a generalized birth-death process (GBDP) whose state space is a finite subset of a $q$-dimensional lattice. It is assumed that there can be a jump of finite step size in all possible directions such that the probability of…
We define a graded multiplication on the vector space of essential paths on a graph $G$ (a tree) and show that it is associative. In most interesting applications, this tree is an ADE Dynkin diagram. The vector space of length preserving…
\L{}ukasiewicz paths are lattice paths in $\Bbb{N}^2$ starting at the origin, ending on the $x$-axis, and consisting of steps in the set $\{(1,k), k\geq -1\}$. We give generating function and exact value for the number of $n$-length…
We introduce a family of periods of mixed Tate motives called dissection polylogarithms, that are indexed by combinatorial objects called dissection diagrams. The motivic coproduct on the former is encoded by a combinatorial Hopf algebra…