Factorizations of the same length in numerical semigroups

dc.contributor.author	García García, José Ignacio
dc.contributor.author	Marín Aragón, Daniel
dc.contributor.author	Moreno Frías, María Ángeles
dc.contributor.other	Matemáticas	es_ES
dc.date.accessioned	2025-02-18T13:57:21Z
dc.date.available	2025-02-18T13:57:21Z
dc.date.issued	2019
dc.identifier.issn	2511-2521
dc.identifier.uri	http://hdl.handle.net/10498/35497
dc.description.abstract	In this work we give a bound for computing the least element with m ≥ 2 factorizations of same length in a numerical semigroup with embedding dimension p, being p ≥ 3 and we present an algorithm to obtain it.	es_ES
dc.format	application/pdf	es_ES
dc.language.iso	eng	es_ES
dc.publisher	Taylor & Francis	es_ES
dc.source	International Journal of Computer Mathematics, Vol. 96, Núm. 12, 2019, pp. 2511-2521	es_ES
dc.subject	Non-unique factorization	es_ES
dc.subject	numerical semigroup	es_ES
dc.subject	factorization	es_ES
dc.subject	length of a factorization	es_ES
dc.subject	delta set	es_ES
dc.title	Factorizations of the same length in numerical semigroups	es_ES
dc.type	journal article	es_ES
dc.rights.accessRights	closed access	es_ES
dc.identifier.doi	10.1080/00207160.2019.1575370
dc.type.hasVersion	VoR	es_ES