Siladić's theorem: weighted words, refinement and companion
From MaRDI portal
Publication:2964031
Abstract: 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 basic idea of the method of weighted words introduced by Alladi and Gordon to give a non-dilated version, further refinement and companion of Siladi'c's theorem. However, while in the work of Alladi and Gordon, identities were proved by doing transformations on generating functions, we use recurrences and -difference equations as the original method seems difficult to apply in our case. As the non-dilated version features the same infinite product as Schur's theorem, another dilation allows us to find a new interesting companion of Schur's theorem, with difference conditions very different from the original ones.
Recommendations
Cites work
- scientific article; zbMATH DE number 1339801 (Why is no real title available?)
- scientific article; zbMATH DE number 727111 (Why is no real title available?)
- A General Theorem on Partitions with Difference Conditions
- A combinatorial proof and refinement of a partition identity of Siladić
- A generalisation of a partition theorem of Andrews
- A generalisation of a second partition theorem of Andrews to overpartitions
- A new generalization of Schur's second partition theorem
- A variation on a theme of Sylvester -- a smoother road to Göllnitz's (Big) theorem
- Annihilating ideals of standard modules of \({\mathfrak sl}(2,{\mathbb{C}})^\sim\) and combinatorial identities
- Generalizations of Schur's partition theorem
- On some representations of twisted affine Lie algebras and combinatorial identities
- Partitionen mit Differenzenbedingungen.
- Refinements and generalizations of Capparelli's conjecture on partitions
- Schur's Partition Theorem, Companions, Refinements and Generalizations
- Twisted \(\mathfrak{sl}(3,\mathbb{C})^-\)-modules and combinatorial identities
Cited in
(10)- \texttt{qFunctions} -- a Mathematica package for \(q\)-series and partition theory applications
- On a Rogers-Ramanujan type identity from crystal base theory
- On partition identities of Capparelli and Primc
- The method of weighted words revisited
- Weighted words at degree two. I: Bressoud's algorithm as an energy transfer
- On partition identities of Capparelli and Primc
- A combinatorial proof and refinement of a partition identity of Siladić
- Generalisations of Capparelli's and Primc's identities. I: Coloured Frobenius partitions and combinatorial proofs
- A bijective proof and generalization of Siladić's theorem
- A bijective proof and generalization of Siladić's theorem
This page was built for publication: Siladić's theorem: weighted words, refinement and companion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2964031)