Related papers: Siladi\'c's theorem: weighted words, refinement an…

In this note we conjecture Rogers-Ramanujan type colored partition identities for an array with odd number of rows w such that the first and the last row consist of even positive integers. In a strange way this is different from the…

In this article, we refine a result of Andrews and Newman, that is, the sum of minimal excludants over all the partitions of a number $n$ equals the number of partitions of $n$ into distinct parts with two colors. As a consequence, we find…

Nested words, a model for recursive programs proposed by Alur and Madhusudan, have recently gained much interest. In this paper we introduce quantitative extensions and study nested word series which assign to nested words elements of a…

In 2018, Stanton proved two types of generalisations of the celebrated Andrews--Gordon and Bressoud identities (in their $q$-series version): one with a similar shape to the original identities, and one involving binomial coefficients. In…

WeintroducethenotionofderivedformalnoncommutativeZariski immersion for differential graded algebra with examples from topology. We il- lustrate the importance of such notion by reformulating the Friedlander-Milnor conjecture in terms of…

A new recursion in only one variable allows very simple verifications of Bressoud's polynomial identities, which lead to the Rogers-Ramanujan identities. This approach might be compared with an earlier approach due to Chapman. Applying the…

In two papers, Little and Sellers introduced an exciting new combinatorial method for proving partition identities which is not directly bijective. Instead, they consider various sets of weighted tilings of a $1 \times \infty$ board with…

We give a bijective proof of an identity relating primed shifted gl(n)-standard tableaux to the product of a gl(n) character in the form of a Schur function and a product of sums of x and y terms. This result generalises a number of…

We study the partition function of the compactified 5D U(1) gauge theory (in the Omega-background) with a single adjoint hypermultiplet, calculated using the refined topological vertex. We show that this partition function is an example a…

We prove modularity of certain residually reducible ordinary 2-dimensional $p$-adic Galois representations with determinant a finite order odd character $\chi$. For certain non-quadratic $\chi$ we prove an $R=T$ result for $T$ the weight 1…

We present what we call a "motivated proof" of the G\"{o}llnitz-Gordon-Andrews identities. A similar motivated proof of the Rogers-Ramanujan identities was previously given by G. E. Andrews and R. J. Baxter, and was subsequently generalized…

We test in $(A_{n-1},A_{m-1})$ Argyres-Douglas theories with $\mathrm{gcd}(n,m)=1$ the proposal of Song's in arXiv:1612.08956 that the Macdonald index gives a refined character of the dual chiral algebra. In particular, we extend the…

A silting theorem was established by Buan and Zhou as a generalisation of the classical tilting theorem of Brenner and Butler. In this paper, we give an alternative proof of the theorem by using differential graded algebras.

Basil Gordon, in the sixties, and George Andrews, in the seventies, generalized the Rogers-Ramanujan identities to higher moduli. These identities arise in many areas of mathematics and mathematical physics. One of these areas is…

We obtain a three-parameter $q$-series identity that generalizes two results of Chan and Mao. By specializing our identity, we derive new results of combinatorial significance in connection with $N(r, s, m, n)$, a function counting certain…

We extend our approach to abstract syntax (with binding constructions) through modules and linearity. First we give a new general definition of arity, yielding the companion notion of signature. Then we obtain a modularity result as…

We give a bijective proof of Macdonald's reduced word identity using pipe dreams and Little's bumping algorithm. This proof extends to a principal specialization due to Fomin and Stanley. Such a proof has been sought for over 20 years. Our…

This article studies some new insertion algorithms that associate pairs of shifted tableaux to finite integer sequences in which certain terms may be primed. When primes are ignored in the input word these algorithms reduce to known…

We give simple elementary proofs of Bressoud's and Schur's polynomial versions of the Rogers-Ramanujan identities

Sang, Shi and Yee, in 2020, found overpartition analogs of Andrews' results involving parity in Rogers-Ramanujan-Gordon identities. Their result partially answered an open question of Andrews'. The open question was to involve parity in…