May 17, 2024Open Access

Unboundedness of irreducible decompositions of numerical semigroups

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

We present two families of numerical semigroups and show that for each family, the number of required components in an irreducible decomposition cannot be bounded by any given integer. This gives a negative answer to a question raised by Delgado, Garc\'ia-S\'anchez and Rosales.

Leer artículo completoexternamente

Preguntar a la IA

Me gusta

Guardar

Ver artículo completo

Cite This Study

Bogart et al. (Fri,) studied this question.

synapsesocial.com/papers/68e69aefb6db643587620721 https://doi.org/https://doi.org/10.48550/arxiv.2405.11080

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Unrefinable partitions into distinct parts and numerical semigroups2026
2Semi-covariety of numerical semigroups2024
3On the automorphisms of the power semigroups of a numerical semigroup2026
4On a conjecture of Moreno-Frías and Rosales for numerical semigroups2024
5On some non MED symmetric numerical semigroups2025

Preguntar a la IA

Me gusta

Guardar

Ver artículo completo