A bijective proof and generalization of Siladić's Theorem

  title={A bijective proof and generalization of Siladi{\'c}'s Theorem},
  author={Isaac Konan},
  journal={Eur. J. Comb.},
  • Isaac Konan
  • Published 31 May 2019
  • Computer Science, Mathematics
  • Eur. J. Comb.
In a recent paper, Dousse introduced a refinement of Siladic's theorem on partitions, where parts occur in two primary and three secondary colors. Her proof used the method of weighted words and $q$-difference equations. The purpose of this paper is to give a bijective proof of a generalization of Dousse's theorem from two primary colors to an arbitrary number of primary colors. 
On partition identities of Capparelli and Primc
We show that, up to multiplication by a factor $\frac{1}{(cq;q)_{\infty}}$, the weighted words version of Capparelli's identity is a particular case of the weighted words version of Primc's identity.
Generalisations of Capparelli's and Primc's identities, I: coloured Frobenius partitions and combinatorial proofs
In these two companion papers, we give infinite families of partition identities which generalise Primc's and Capparelli's identities, and study their consequences on the theory of crystal bases of
Beyond Göllnitz' Theorem II: arbitrarily many primary colors
In $2003$, Alladi, Andrews and Berkovich proved a four-parameter partition identity lying beyond a celebrated identity of G\"ollnitz. Since then it has been an open problem to extend their work to
Weighted words at degree two, I: Bressoud's algorithm as an energy transfer
In a recent paper, we generalized a partition identity stated by Siladi\'c in his study of the level one standard module of type $A_2^{(2)}$. The proof used weighted words with an arbitrary number of
Weighted words at degree two, II: flat partitions, regular partitions, and application to level one perfect crystals
In a recent work, Keith and Xiong gave a refinement of Glaisher's theorem by using a Sylvester-style bijection. In this paper, we introduce two families of colored partitions, flat and regular


An iterative-bijective approach to generalizations of Schur's theorem
A bijective proof of Schur's theorem due to Alladi and Gordon is started and how a particular iteration of it leads to some very general theorems on colored partitions are described.
A variation on a theme of Sylvester - a smoother road to Göllnitz's (Big) theorem
  • K. Alladi
  • Computer Science, Mathematics
    Discret. Math.
  • 1999
A three-parameter refinement of the bijective proof of the number of partitions of a positive integer n into distinct odd parts is obtained and shown to be equivalent to a deep partition theorem of Gollnitz.
Siladi\'c's theorem: weighted words, refinement and companion
In a previous paper, the author gave a combinatorial proof and refinement of Siladi\'c's theorem, a Rogers-Ramanujan type partition identity arising from the study of Lie algebras. Here we use the
A new bijective proof of a partition theorem of K. Alladi
A different bijective proof of the theorem that the number of partitions of a positive integer n into distinct odd parts equals the numberOf partitions of n into parts not equal 2 and differing by greater than or equal to, 6 is given.
Generalizations of Schur's partition theorem
AbstractSchur's partition theorem states that the number of partitions ofn into distinct parts ≡ 1,2 (mod 3) is equal to the number of partitions ofn into parts with minimal difference 3 and no
A combinatorial proof of Schur's 1926 partition theorem
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published
Twisted sl(3,C)˜-modules and combinatorial identities
The main result of this paper is a combinatorial description of a basis of standard level 1 module for the twisted affine Lie algebra A (2) 2 . This description also gives two new combinatorial
Annihilating ideals of standard modules of ${rm sl}(2, Bbb C)sp sim$ and combinatorial identities
Abstract Introduction Formal Laurent series and rational functions Generating fields The vertex operator algebra $N(k\Lambda_0)$ Modules over $N(k\Lambda_0)$ Relations on standard modules Colored
PRIMC, Annihilating ideals of standard modules of sl(2,C)∼ and combinatorial identities
  • Mem. Amer. Math. Soc
  • 1999