On partitions with K corners not containing the staircase with one more corner
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 ( k+1 2 ) ≤ n < ( k+2 2 ) , there are as many partitions of n with k corners as pairs of partitions (α, β) such that ( k+1 2 ) + |α| +...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2022 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/134902 |
| Acceso en línea: | https://hdl.handle.net/11441/134902 https://doi.org/10.1016/j.dam.2022.02.012 |
| Access Level: | acceso abierto |
| Palabra clave: | Integer partition |
| Sumario: | 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 ( k+1 2 ) ≤ n < ( k+2 2 ) , there are as many partitions of n with k corners as pairs of partitions (α, β) such that ( k+1 2 ) + |α| + |β| = n. |
|---|