Related papers: The Riordan Group and Symmetric Lattice Paths

In this paper, we study the connextion between lattice and Riesz homomorphisms in Riesz spaces. We prove, under a certain condition, that any lattice homomorphism on Riesz space is a Riesz homomorphism. This fits in the type of results by…

Following the work of Cano and Diaz, we consider a continuous analog of lattice path enumeration. This allows us to define a continuous version of any discrete object that counts certain types of lattice paths. We define continuous versions…

We show how the set of Dyck paths of length 2n naturally gives rise to a matroid, which we call the "Catalan matroid" C_n. We describe this matroid in detail; among several other results, we show that C_n is self-dual, it is representable…

For sufficiently tame paths in $\mathbb{R}^n$, Euclidean length provides a canonical parametrization of a path by length. In this paper we provide such a parametrization for all continuous paths. This parametrization is based on an…

A bargraph is a self-avoiding lattice path with steps $U=(0,1)$, $H=(1,0)$ and $D=(0,-1)$ that starts at the origin and ends on the $x$-axis, and stays strictly above the $x$-axis everywhere except at the endpoints. Bargraphs have been…

Recently Mansour and Shattuck studied $(k,a)$-paths and gave formulas that relate the total number of humps (peaks) in all $(k,a)$-paths to the number of super $(k,a)$-paths. These results generalize earlier results of Regev on Dyck paths…

In this paper we enumerate the number of $(k, r)$-Fuss-Schr\"{o}der paths of type $\lambda$. Y. Park and S. Kim studied small Schr\"{o}der paths with type $\lambda$. Generalizing the results to small $(k, r)$-Fuss-Schr\"{o}der paths with…

We consider a class of lattice paths with certain restrictions on their ascents and down steps and use them as building blocks to construct various families of Dyck paths. We let every building block $P_j$ take on $c_j$ colors and count all…

In this paper we present a set of results on the integration and on the symmetries of the lattice potential Korteweg-de Vries (lpKdV) equation. Using its associated spectral problem we construct the soliton solutions and the Lax technique…

We prove a series of ``knapsack'' type equalities for irreducible character degrees of symmetric groups. That is, we find disjoint subsets of the partitions of $n$ so that the two corresponding character-degree sums are equal. Our main…

A 1d random geometric graph (1d RGG) is built by joining a random sample of $n$ points from an interval of the real line with probability $p$. We count the number of $k$-hop paths between two vertices of the graph in the case where the…

The purpose of this article is to investigate the combinatorial properties of the cross section lattice of a $J$-irreducible monoid associated with a semisimple algebraic group of one of the types $A_n$, $B_n$, or $C_n$. Our main tool is a…

In this article we study group lattices using the ideas by K.S.Brown and D.Quillen of associating a certain topological space to a partially ordered set. We determine the exact homotopy type for the subgroup lattice of PSL(2,7), find a…

Studying the isotropy orbits of compact symmetric spaces Reiswich introduced a family of explicit polynomials in one variable in order to describe the unique minimal isotropy orbit of compact symmetric spaces with Dynkin diagram of type…

The $m$-Tamari lattices $\mathcal{T}_{n}^{(m)}$, introduced by Bergeron and Pr{\'e}ville-Ratelle, are defined as a poset of $m$-Dyck paths equipped with the generalized rotation order, and constitute a Fuss-Catalan generalization of the…

A graph on $2k$ vertices is path-pairable if for any pairing of the vertices the pairs can be joined by edge-disjoint paths. The so far known families of path-pairable graphs have diameter of length at most 3. In this paper we present an…

We explicitly construct a sequence of hyperbolic links $\{ L_{4n} \}$ where the number of symmetries of each $\mathbb{S}^{3} \setminus L_{4n}$ that are not induced by symmetries of the pair $(\mathbb{S}^{3}, L_{4n})$ grows linearly with n.…

Let $\mathcal{L}_n$ denote the set of all paths from $[0,0]$ to $[n, n]$ which consist of either unit north steps $N$ or unit east steps $E$ or, equivalently, the set of all words $L \in \{E,N\}^*$ with $n$ $E$'s and $n$ $N$'s. Given $L \in…

We provide new interpretations for a subset of Raney numbers, involving threshold sequences and Motzkin-like paths with long up and down steps. Given three integers n, k, l such that n >= 1, k >= 2 and 0 <= l <= k-2, a (k,l)-threshold…

We present a computer-aided, yet fully rigorous, proof of Ira Gessel's tantalizingly simply-stated conjecture that the number of ways of walking $2n$ steps in the region $x+y \geq 0, y \geq 0$ of the square-lattice with unit steps in the…