Related papers: Generalized Path Pairs and Fuss-Catalan Triangles

In quantum field theory the path integral is usually formulated in the wave picture, i.e., as a sum over field evolutions. This path integral is difficult to define rigorously because of analytic problems whose resolution may ultimately…

We use Riordan array theory to give characterizations of the Borel triangle and its associated polynomial sequence. We show that the Borel polynomials are the moment sequence for a family of orthogonal polynomials whose coefficient array is…

Polynomial sequences $p_n(x)$ of binomial type are a principal tool in the umbral calculus of enumerative combinatorics. We express $p_n(x)$ as a \emph{path integral} in the ``phase space'' $\Space{N}{} \times {[-\pi,\pi]}$. The Hamiltonian…

We present determinantal representations of the Catalan numbers, k-Fuss-Catalan numbers, and its generalized number. The entries of the normalized Hessenberg matrices are the binomial coefficients that related with the enumeration of…

Let $\Gamma$ be a rooted tree and let $t$ be a positive integer. We study algebraic invariants and properties of the path ideal generated by monomial corresponding to paths of length $(t-1)$ in $\Gamma$. In particular, we give a recursive…

The concept of generalized path algebras was introduced in (Coelho and Liu, 2000). It was shown in (Ib\'a\~nez Cobos et al., 2008) how to obtain the Gabriel quiver of a given generalized path algebra. In this article, we generalize the…

We answer a question of Simental by providing a combinatorial interpretation of a formula which generalizes rational Catalan numbers and which appears in the study of Springer fibers. We provide an interpretation in terms of binary…

We introduce and study the complexity of Path Packing. Given a graph $G$ and a list of paths, the task is to embed the paths edge-disjoint in $G$. This generalizes the well known Hamiltonian-Path problem. Since Hamiltonian Path is…

We summarize some combinatoric problems solved by the higher Catalan numbers. These problems are generalizations of the combinatoric problems solved by the Catalan numbers. The generating function of the higher Catalan numbers appeared…

A non-Grassmanian path integral representation is given for the solution of the Klein-Gordon and the Dirac equations. The trajectories of the path integral are rendered differentiable by the relativistic corrections. The nonrelativistic…

A 3-dimensional Catalan word is a word on three letters so that the subword on any two letters is a Dyck path. For a given Dyck path $D$, a recently defined statistic counts the number of Catalan words with the property that any subword on…

We prove that in any $n$-vertex complete graph there is a collection $\mathcal{P}$ of $(1 + o(1))n$ paths that strongly separates any pair of distinct edges $e, f$, meaning that there is a path in $\mathcal{P}$ which contains $e$ but not…

We devise an algorithm that approximately computes the number of paths of length $k$ in a given directed graph with $n$ vertices up to a multiplicative error of $1 \pm \varepsilon$. Our algorithm runs in time $\varepsilon^{-2} 4^k(n+m)…

In this note, we provide a bijection between a new collection of words on nonnegative integers of length n and Dyck paths of length 2n-2, thus proving that this collection belongs to the Catalan family. The surprising key step in this…

introduce {\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$…

In this paper we consider combinatorial numbers $C_{m, k}$ for $m\ge 1$ and $k\ge 0$ which unifies the entries of the Catalan triangles $ B_{n, k}$ and $ A_{n, k}$ for appropriate values of parameters $m$ and $k$, i.e., $B_{n,…

An analysis using a composition of currently-accepted theories is given. Starting with a synthesis of what may be generically termed ``paths'', analysis of representations for these ``paths'' is developed. Foreground and background…

We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…

Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…

In this note we introduce generalised pairs from the perspective of the evolution of the notion of space in birational algebraic geometry. We describe some applications of generalised pairs in recent years and then mention a few open…