Abstract:Grounded partitions, introduced by Dousse and Konan, are coloured partitions satisfying difference conditions encoded by a matrix. For suitable choices of this matrix, their generating functions are known to coincide with characters of affine Lie algebras. In this paper, we study, from a combinatorial point of view, the grounded partitions introduced by Dousse, Hardiman and Konan and related to the Lie algebra $A_1^{(1)}$. Using the connection with characters, they showed that the generating function for these grounded partitions is an infinite product. We give direct combinatorial proofs of the corresponding product formulas. In particular, we construct two explicit bijections from grounded partitions to odd overpartitions, and to partitions in which the even parts are distinct.
From: Benedek Dombos [view email]
[v1]
Mon, 4 Aug 2025 17:52:36 UTC (48 KB)
[v2]
Thu, 18 Dec 2025 16:34:22 UTC (57 KB)
[v3]
Mon, 29 Jun 2026 08:04:53 UTC (21 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。