Abstract:Let $\cpsi_{2,a}(n)$ denote the number of $(2,a)$-colored Frobenius partitions of weight $n$, where the two rows have prescribed length difference. We study the two cases $a=0$ and $a=1$ and connect them with minimal-excludant statistics on bipartitions. Let $\sigma\mex_2(n)$ be the sum of the Lin--Liu bipartition minimal excludants over all bipartitions of $n$, and let $E_2(n)$ be the number of bipartitions whose two component minimal excludants are equal. For all $n\geq 0$, we give a combinatorial proof of \[ \cpsi_{2,0}(n)=2\sigma\mex_2(n) \qquad\text{and}\qquad \cpsi_{2,1}(n)=2\sigma\mex_2(n)-E_2(n). \] These identities give direct combinatorial interpretations of two-colored Frobenius partition functions in terms of bipartition minimal-excludant sums.
From: Rong Chen [view email]
[v1]
Thu, 18 Jun 2026 01:48:09 UTC (8 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。