Related papers: Generalized Path Pairs and Fuss-Catalan Triangles
We show that weighted path orders are special instances of a variant of semantic path orders. Exploiting this fact, we introduce a generalization of weighted path orders that goes beyond the realm of simple termination. Experimental data…
We present an exposition on the Fuss--Catalan numbers, which are a generalization of the well known Catalan numbers. The literature on the subject is scattered (especially for the case of multiple independent parameters, as will be…
Path integrals are a ubiquitous tool in theoretical physics. However, their use is sometimes hindered by the lack of control on various manipulations -- such as performing a change of the integration path -- one would like to carry out in…
The path integral formulation of constrained systems leads to obtain the equations of motion as total differential equations in many variables. If these equations are integrable then one can constuct a valid and a canonical phase space…
Let $G$ be a fixed graph. Two paths of length $n-1$ on $n$ vertices (Hamiltonian paths) are $G$-different if there is a subgraph isomorphic to $G$ in their union. In this paper we prove that the maximal number of pairwise triangle-different…
The Gaussian polynomial in variable $q$ is defined as the $q$-analog of the binomial coefficient. In addition to remarkable implications of these polynomials to abstract algebra, matrix theory and quantum computing, there is also a…
Path geometries provide a geometric encoding of systems of second order ODE, which serves as a model for the geometric theory of more general systems of ODE and for cone structures. They are an instance of the family of parabolic…
A {\em k-generalized Dyck path} of length $n$ is a lattice path from $(0,0)$ to $(n,0)$ in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of horizontal-steps $(k, 0)$ for a given integer $k\geq 0$, up-steps $(1,1)$, and…
The Raney numbers $R_{p,r}(n)$ are a two-parameter generalization of the Catalan numbers that were introduced by Raney in his investigation of functional composition patterns \cite{Raney}. We give a new combinatorial interpretation for all…
Bargraphs are a special class of convex polyominoes. They can be identified with lattice paths with unit steps north, east, and south that start at the origin, end on the $x$-axis, and stay strictly above the $x$-axis everywhere except at…
We prove that certain numbers occurring in a problem of paths enumeration, studied by Niederhausen (Catlan Traffic at the Beach, The Electronic Journal of Combinatorics, 9, (2002), 1--17), are top intersection numbers in the cohomology ring…
We give a combinatorial interpretation of a matrix identity on Catalan numbers and the sequence $(1, 4, 4^2, 4^3, ...)$ which has been derived by Shapiro, Woan and Getu by using Riordan arrays. By giving a bijection between weighted partial…
It is well known that the Catalan number C_n counts dissections of a regular (n+2)-gon into triangles. Here we count such dissections by number of triangles that contain two sides of the polygon among their three edges, leading to a…
The commonly accepted definition of paths starts from a random field but ignores the problem of setting joint distributions of infinitely many random variables for defining paths properly afterwards. This paper provides a turnaround that…
We investigate the quotient ring $R$ of the ring of formal power series $\Q[[x_1,x_2,...]]$ over the closure of the ideal generated by non-constant quasi-\break symmetric functions. We show that a Hilbert basis of the quotient is naturally…
We present new expressions for the $k$-generalized Fibonacci numbers, say $F_k(n)$. They satisfy the recurrence $F_k(n) = F_k(n-1) +\dots+F_k(n-k)$. Explicit expressions for the roots of the auxiliary (or characteristic) polynomial are…
Weighted Catalan numbers are a class of weighted sums over Dyck paths. Well-studied for their arithmetic properties and applications to enumerative combinatorics, these numbers were recently generalized to the setting of $k$-dimensional…
This paper establishes an upper bound on the number of generalized cospectral mates of simple graphs, where the generalized spectrum consists of the spectrum of a graph and its complement. Moving beyond the classical problem of identifying…
We analyze the combinatorics behind the operation of taking the logarithm of the generating function $G_k$ for $k^\text{th}$ generalized Catalan numbers. We provide combinatorial interpretations in terms of lattice paths and in terms of…
We consider the problem of counting the set of $\mathscr{D}_{a,b}$ of Dyck paths inscribed in a rectangle of size $a\times b$. They are a natural generalization of the classical Dyck words enumerated by the Catalan numbers. By using Ferrers…