Related papers: Shift-Plethystic Trees and Rogers-Ramanujan Identi…
We prove two partition identities which are dual to the Rogers-Ramanujan identities. These identities are inspired by (and proved using) a correspondence between three kinds of objects: a new type of partitions (neighborly partitions),…
Arc spaces have been introduced in algebraic geometry as a tool to study singularities but they show strong connections with combinatorics as well. Exploiting these relations we obtain a new approach to the classical Rogers-Ramanujan…
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain…
This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…
We evaluate $q$-Bessel functions at an infinite sequence of points and introduce a generalization of the Ramanujan function and give an extension of the $m$-version of the Rogers-Ramanujan identities. We also prove several generating…
We prove four new Rogers-Ramanujan-type identities for double series. They follow from the classical Rogers-Ramanujan identities using the constant term method and properties of Rogers-Szeg\H{o} polynomials.
We use a q-series identity by Ramanujan to give a combinatorial interpretation of Ramanujan's tau function which involves t-cores and a new class of partitions which we call (m,k)-capsids. The same method can be applied in conjunction with…
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yields a new formula for the number of NATs. We also obtain…
We extend the table of Garoufalidis, Le and Zagier concerning conjectural Rogers-Ramanujan type identities for tails of colored Jones polynomials to all alternating knots up to 10 crossings. We then prove these new identities using q-series…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
For any non-negative integer $n$ and non-zero integer $r$, let $p_r(n)$ denote Ramanujan's general partition function. By employing $q$-identities, we prove some new Ramanujan-type congruences modulo 5 for $p_r(n)$ for $r=-(5\lambda+1),…
In the present paper, we establish a general transformation for $q$-series which contains L. Wang et al's transformation involved in Nahm series. As direct applications, some concrete new transformation formulas for the ${}_{r+1}\phi_r$…
Slater's list of Rogers-Ramanujan type identities consists of 130 series-product identities whose analytic proofs rely primarily on Bailey pair techniques. Although these identities play an important role in the theory of $q$-series and…
We give several expansion and identities involving the Ramanujan function $A_q$ and the Stieltjes--Wigert polynomials. Special values of our idenitities give $m$-versions of some of the items on the Slater list of Rogers-Ramanujan type…
e use Prolog as a flexible meta-language to provide executable specifications of some fundamental mathematical objects and their transformations. In the process, isomorphisms are unraveled between natural numbers and combinatorial objects…
We prove a family of identities, expressing generating functions of powers of characteristic polynomials of permutations, as finite or infinite products. These generalize formulae first obtained in a study of the geometry/topology of…
We use the method of tiling to give elementary combinatorial proofs of some celebrated $q$-series identities, such as Jacobi triple product identity, Rogers-Ramanujan identities, and some identities of Rogers. We give a tiling proof of the…
In 2015 Choi, Kim, and Lovejoy studied a weighted partition function, $A_1(m)$, which counted subpartitions with a structure related to the Rogers--Ramanujan identities. They conjectured the existence of an infinite class of congruences for…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
In this talk we go over several new developments regarding the techniques for a large class of non-hermitian matrix models with unitary randomness (complex random numbers). In particular, we discuss: (a) - A diagrammatic approach based on a…