Related papers: Lattice paths and Rogers--Ramanujan--Gordon type o…
We prove that on the set of lattice paths with steps N=(0,1) and E=(1,0) that lie between two fixed boundaries T and B (which are themselves lattice paths), the statistics `number of E steps shared with B' and `number of E steps shared with…
Finding paths in graphs is a fundamental graph-theoretic task. In this work, we we are concerned with finding a path with some constraints on its length and the number of vertices neighboring the path, that is, being outside of and incident…
In his recent work, Andrews revisited two-color partitions with certain restrictions on the differences between consecutive parts, and he established three theorems linking these two-color partitions with more familiar kinds of partitions.…
Recently, Andrews and Paule studied Schmidt type partitions using MacMahon's Partition Analysis and obtained various interesting results. In this paper, we focus on the combinatorics of Schmidt type partition theorems and characterize them…
The set of Dyck paths of length $2n$ inherits a lattice structure from a bijection with the set of noncrossing partitions with the usual partial order. In this paper, we study the joint distribution of two statistics for Dyck paths:…
The combinatorics of certain osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. More specifically, the paths being considered have fixed start and end points on respectively the lower and right…
We present two new Ramanujan-type congruences modulo 5 for overpartition. We also give an affirmative answer to a conjecture of Dou and Lin, which includes four congruences modulo 25 for overpartition.
We introduce the notions of tree-like path and tree-like equivalence between paths and prove that the latter is an equivalence relation for paths of finite length. We show that the equivalence classes form a group with some similarity to a…
We give formulas for enumerating directed paths in the graded poset of semi-magic squares of size three. We give two applications of these formulas: an advanced example of Vandermonde convolution for finite graded posets, and a direct…
We present a simple bijection between restricted (Bressoud) lattice paths and RSOS paths in regime II. Both types of paths describe states in Z_k parafermionic irreducible modules. The bijection implies a direct correspondence between a…
We give a proof of a recent combinatorial conjecture due to the first author, which was discovered in the framework of commutative algebra. This result gives rise to new companions to the famous Andrews-Gordon identities. Our tools involve…
The existence of greatest lower bounds in the imbalance order of path-length sequences of binary trees is seen to be a consequence of a joint monotonicity property of the greater and lower expension operations. Path length sequences that…
In this article, we first investigate the partitions whose parts are congruent to $a$ or $b$ modulo $k$ with the aid of separable integer partition classes with modulus $k$ introduced by Andrews. Then, we introduce the…
A new type of polynomial analogue of the Rogers-Ramanujan identities is proven. Here the product-side of the Rogers-Ramanujan identities is replaced by a partial theta sum and the sum-side by a weighted sum over Schur polynomials.
The $(k,i)$-singular overpartitions, combinatorial objects introduced by Andrews in 2015, are known to satisfy Ramanujan-type congruences modulo any power of prime coprime to $6k$. In this paper we consider the parity of the number…
We prove a family of partition identities involving integer partitions in three colors. The conditions imposed on the types of partitions appearing in these identities involve constraints that arise in the Rogers-Ramanujan and…
Let ${\cal PO}_n$ be the semigroup of all order-preserving partial transformations of a finite chain. It is shown that there exist bijections between the set of certain lattice paths in the Cartesian plane that start at $(0,0)$, end at…
In this paper, we present pathwise counterparts of Doob's maximal inequalities (on the probability of exceeding a level) for submartingales and supermartingales.
Suppose $G$ is a locally solid lattice group. It is known that there are non-equivalent classes of bounded homomorphisms on $G$ which have topological structures. In this paper, our attempt is to assign lattice structures on them. More…
In this thesis we develop generalized versions of the Chung-Feller theorem for lattice paths constrained in the half plane. The beautiful cycle method which was developed by Devoretzky and Motzkin as a means to prove the ballot problem is…