Related papers: Generalized Path Pairs and Fuss-Catalan Triangles
A new notion of Cartan pairs as a substitute of notion of vector fields in noncommutative geometry is proposed. The correspondence between Cartan pairs and differential calculi is established.
There are many different algebraic, geometric and combinatorial objects that one can attach to a complex polynomial with distinct roots. In this article we introduce a new object that encodes many of the existing objects that have…
The Catalan numbers form a sequence that counts over 200 combinatorial objects. A remarkable property of the Catalan numbers, which extends to these objects, is its recursive definition; that is, we can determine the $n^{th}$ object from…
A generalization of the Catalan numbers is considered. New results include binomial identities, recursive relations and a close formula for the multivariate generating function. A simple expression for the Catalan determinant is derived.
It is well known that the set of $m$-Dyck paths with a fixed height and a fixed amount of valleys is counted by the Fu{\ss}-Narayana numbers. In this article, we consider the set of $m$-Dyck paths that start with at least $t$ north steps.…
We consider the distribution of quadratic Gauss paths, polygonal paths joining partial sums of quadratic Gauss sums to square-free fundamental discriminant moduli in a dyadic range [Q,2Q]. We prove that this striking ensemble converges in…
Given a coprime pair $(m,n)$ of positive integers, rational Catalan numbers $\frac{1}{m+n} \binom{m+n}{m,n}$ counts two combinatorial objects:rational $(m,n)$-Dyck paths are lattice paths in the $m\times n$ rectangle that never go below the…
A path integral is presented that solves a general class of linear second order partial differential equations with Dirichlet/Neumann boundary conditions. Elementary kernels are constructed for both Dirichlet and Neumann boundary…
Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…
In this work we explore the structure of the branching graph of the unitary group using Schur transitions. We find that these transitions suggest a new combinatorial expression for counting paths in the branching graph. This formula, which…
We show how some special production matrices may be used to define families of generalized Eulerian triangles. We furthermore show that these generalized Eulerian triangles are the coefficient arrays of polynomials which are the moments of…
We establish a tantalizing symmetry of certain numbers refining the Narayana numbers. In terms of Dyck paths, this symmetry is interpreted in the following way: if $w_{n,k,m}$ is the number of Dyck paths of semilength $n$ with $k$…
Stanley considered Dyck paths where each maximal run of down-steps to the $x$-axis has odd length; they are also enumerated by (shifted) Catalan numbers. Prefixes of these combinatorial objects are enumerated using the kernel method. A more…
In the Disjoint Paths problem, the input is an undirected graph $G$ on $n$ vertices and a set of $k$ vertex pairs, $\{s_i,t_i\}_{i=1}^k$, and the task is to find $k$ pairwise vertex-disjoint paths connecting $s_i$ to $t_i$. The problem was…
We consider directed weighted graphs and define various families of path counting functions. Our main results are explicit formulas for the main term of the asymptotic growth rate of these counting functions, under some irrationality…
The connection between the commutativity of a family of $n\times n$ matrices and the generalized joint numerical ranges is studied. For instance, it is shown that ${\cal F}$ is a family of mutually commuting normal matrices if and only if…
The embedding problem is to decide, given an ordered pair of structures, whether or not there is an injective homomorphism from the first structure to the second. We study this problem using an established perspective in parameterized…
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]
The main objective of this work is to study mathematical properties of computational paths. Originally proposed by de Queiroz \& Gabbay (1994) as `sequences of rewrites', computational paths can be seen as the grounds on which the…
The parity of the length of paths and cycles is a classical and well-studied topic in graph theory and theoretical computer science. The parity constraints can be extended to label constraints in a group-labeled graph, which is a directed…