Related papers: The Andrews-Olsson identity and Bessenrodt inserti…
We use a tensor unfolding technique to prove a new identifiability result for discrete bipartite graphical models, which have a bipartite graph between an observed and a latent layer. This model family includes popular models such as…
In this paper we refine a weighted partition identity of Alladi. We write explicit formulas of generating functions for the number of partitions grouped with respect to a partition statistic other than the norm. We tie our weighted results…
The weight multiplicities of finite dimensional simple Lie algebras can be computed individually using various methods. Still, it is hard to derive explicit closed formulas. Similarly, explicit closed formulas for the multiplicities of…
We prove polynomial boson-fermion identities for the generating function of the number of partitions of $n$ of the form $n=\sum_{j=1}^{L-1} j f_j$, with $f_1\leq i-1$, $f_{L-1} \leq i'-1$ and $f_j+f_{j+1}\leq k$. The bosonic side of the…
We consider an identity relating Fibonacci numbers to Pascal's triangle discovered by G. E. Andrews. Several authors provided proofs of this identity, most of them rather involved or else relying on sophisticated number theoretical…
We give a realization of crystal graphs for basic representations of the quantum affine algebra U_q(C_n^{(1)}) using combinatorics of Young walls. The notion of splitting blocks plays a crucial role in the construction of crystal graphs.
In a series of two papers, S. Capparelli, A. Meurman, A. Primc, M. Primc (CMPP) and then M. Primc put forth three remarkable sets of conjectures, stating that the generating functions of coloured integer partition in which the parts satisfy…
We find an involution as a combinatorial proof of a Ramanujan's partial theta identity. Based on this involution, we obtain a Franklin type involution for squares in the sense that the classical Franklin involution provides a combinatorial…
This paper has a two-fold purpose. First, by considering a reformulation of a deep theorem of G\"ollnitz, we obtain a new weighted partition identity involving the Rogers-Ramanujan partitions, namely, partitions into parts differing by at…
A model for quantum tunnelling of a cluster comprising A identical particles, coupled by oscillator-type potential, through short-range repulsive potential barriers is introduced for the first time in the new symmetrized-coordinate…
The affine vertex operator algebras for $\mathfrak{sl}_2$ and the Virasoro minimal models are related by Drinfeld-Sokolov reduction and by the Goddard-Kent-Olive coset construction. In this work, we propose another connection based on…
Motivated by a partition inequality of Bessenrodt and Ono, we obtain analogous inequalities for $k$-colored partition functions $p_{-k}(n)$ for all $k\geq2$. This enables us to extend the $k$-colored partition function multiplicatively to a…
For an untwisted affine Lie algebra we prove an embedding of any higher level Demazure module into a tensor product of lower level Demazure modules (e.g. level one in type A) which becomes in the limit (for anti-dominant weights) the…
The fingerprint invariant of partitions can be used to describe the Kazhdan-Lusztig map for the classical groups. We discuss the basic properties of fingerprint. We construct the fingerprints of rigid partitions in the $B_n$, $C_n$, and…
The $A$-partition function $p_A(n)$ enumerates those partitions of $n$ whose parts belong to a fixed (finite or infinite) set $A$ of positive integers. On the other hand, the extended $A$-partition function…
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between…
Using the slow triangle map (a type of multi-dimensional continued fraction algorithm), we exhibit a method for generating any number of new identities for subsets of integer partitions.
In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…
In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called \emph{partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…
In the first paper of this series, we gave infinite families of coloured partition identities which generalise Primc's and Capparelli's classical identities. In this second paper, we study the representation theoretic consequences of our…