Show simple item record

dc.contributor.authorGarcía García, Juan Ignacio 
dc.contributor.authorMoreno Frías, María Ángeles 
dc.contributor.authorVigneron Tenorio, Alberto 
dc.contributor.otherMatemáticases_ES
dc.date.accessioned2025-02-04T08:04:01Z
dc.date.available2025-02-04T08:04:01Z
dc.date.issued2013
dc.identifier.issn0747-7171
dc.identifier.urihttp://hdl.handle.net/10498/35326
dc.description.abstractIn this work we develop a framework to decrease the time complexity of well-known algorithms to compute the generator sets of a semigroup ideal by using the Hermite normal form. We introduce idea of decomposable semigroups, which fulfills that the computation of its ideal can be achieved by separately calculating over smaller semigroups, products of the decomposition. Our approach does not only decrease the time complexity of the problem, but also allows using parallel computational techniques. A combinatorial characterization of these semigroups is obtained and the concept of decomposable variety is introduced. Finally, some applications and practical results are provided. © 2013 Elsevier B.V.es_ES
dc.formatapplication/pdfes_ES
dc.language.isoenges_ES
dc.publisherElsevieres_ES
dc.sourceJournal of Symbolic Computation, Vol. 58, 2013, pp. 103-116es_ES
dc.subjectsemigroup ideales_ES
dc.subjectHermite normal formes_ES
dc.subjectdecomposable semigroupes_ES
dc.subjectdecomposable varietyes_ES
dc.titleOn decomposable semigroups and applicationses_ES
dc.typejournal articlees_ES
dc.rights.accessRightsopen accesses_ES
dc.identifier.doi10.1016/J.JSC.2013.05.009
dc.type.hasVersionVoRes_ES


Files in this item

This item appears in the following Collection(s)

Show simple item record