论文标题
在带有$ k $角落的分区上，不包含一个楼梯的楼梯
On partitions with $k$ corners not containing the staircase with one more corner
论文作者
论文摘要
我们给出三个证明Carriegos，De Castro-garc \'ıa和MuñozCastañeda在枚举控制系统方面的工作：当$ \ binom {k+1} {2} {2} {2} {2} \ le n <\ binom {k+2}分区$（α，β）$，使得$ \ binom {k + 1} {2} + |α| + |β| = n $。
We give three proofs of the following result conjectured by Carriegos, De Castro-Garc\'ıa and Muñoz Castañeda in their work on enumeration of control systems: when $\binom{k+1}{2} \le n < \binom{k+2}{2}$, there are as many partitions of $n$ with $k$ corners as pairs of partitions $(α, β)$ such that $\binom{k+1}{2} + |α| + |β| = n$.
