Related papers: Lattice paths and Rogers--Ramanujan--Gordon type o…
The Z_k parafermionic conformal field theories, despite the relative complexity of their modes algebra, offer the simplest context for the study of the bases of states and their different combinatorial representations. Three bases are…
We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…
In this note we give three identities for partitions with parts separated by parity, which were recently introduced by Andrews.
The concept of lattice modified symmetry formulations is adapted to the parity symmetry of gauge fields and applied to the pure Abelian Chern-Simons action in three dimensions. We derive an analogue of the Ginsparg-Wilson relation for the…
The main theme of this dissertation is retooling methods to work for different situations. I have taken the method derived by O'Hara and simplified by Zeilberger to prove unimodality of $q$-binomials and tweaked it. This allows us to create…
Xiong and Liu [L. Xiong and Z. Liu, Hamiltonian iterated line graphs, Discrete Math. 256 (2002) 407-422] gave a characterization of the graphs $G$ for which the $n$-th iterated line graph $L^n(G)$ is hamiltonian, for $n\ge2$. In this paper,…
Ramanujan recorded four reciprocity formulas for the Roger-Ramanujan continued fraction. Two reciprocity formulas each are also associated with the Ramanujan--G\"ollnitz--Gordon continued fraction and a level-13 analog of the…
We set up a combinatorial framework for inclusion-exclusion on the partitions into distinct parts to obtain an alternative generating function of partitions into distinct and non-consecutive parts. In connection with Rogers-Ramanujan…
A lattice-path description of $K$-restricted jagged partitions is presented. The corresponding lattice paths can have peaks only at even $x$ coordinate and the maximal value of the height cannot be larger than $K-1$. Its weight is twice…
We recall the main types of lattice paths, which are sequences in the lattice of integer coordinates points in the plane. We start with the fundamental central lattice paths and Dyck paths and proceed in elementary terms through recently…
Let M(n,k,r,s) be the number of ordered paths in the plane, with unit steps E or N, that intersect k times in which the first path ends at the point (r,n-r) and the second path ends at the point (s,n-s). Our main object of study in this…
Let L be a join-distributive lattice with length n and width(Ji L) \leq k. There are two ways to describe L by k-1 permutations acting on an n-element set: a combinatorial way given by P.H. Edelman and R.E. Jamison in 1985 and a recent…
In this paper we develop a method to calculate the overpartition function efficiently using a Hardy-Rademacher-Ramanujan type formula, and we use this method to find many new Ramanujan-style congruences, whose existence is predicted by…
We introduce a method for describing Riordan matrices via recurrence relations along their diagonals. This provides a new structural description that complements the classical row-wise and column-wise constructions via the A-sequence. As an…
We show that it is possible to formulate Abelian Chern-Simons theory on a lattice as a topological field theory. We discuss the relationship between gauge invariance of the Chern-Simons lattice action and the topological interpretation of…
In this survey article, we present an expanded version of Lucy Slater's famous list of identities of the Rogers-Ramanujan type, including identities of similar type, which were discovered after the publication of Slater's papers, and older…
In the Stanley lattice defined on Dyck paths of size $n$, cover relations are obtained by replacing a valley $DU$ by a peak $UD$. We investigate a greedy version of this lattice, first introduced by Chenevi\`ere, where cover relations…
In this paper, we establish two new Ramanujan-type congruences for the overpartition function: $\overline{p}(11\times(8n+5))\equiv 0 \pmod{11}$ and $\overline{p}(13\times 2^6(8n+7))\equiv 0 \pmod{13}$. The proofs rely on the theory of…
We present two general finite extensions for each of the two Rogers-Ramanujan identities. Of these one can be derived directly from Watson's transformation formula by specialization or through Bailey's method, the second similar formula can…
The Rogers-Ramanujan identities have been studied from the viewpoints of combinatorics, number theory, affine Lie algebras, statistical mechanics, and quantum field theory. This note connects the Rogers-Ramanujan identities with the finite…