Loading...
Loading...

Go to the content (press return)

An algorithm to compute the primitive elements of an embedding dimension three numerical semigroups

Author
Aguilo, F.; ?; Llena, D.
Type of activity
Journal article
Journal
Electronic notes in discrete mathematics
Date of publication
2014
Volume
46
First page
185
Last page
192
DOI
https://doi.org/10.1016/j.endm.2014.08.025 Open in new window
Project funding
Optimización y problemas extremales en teoria de grafos y combinatoria. Aplicacions a les redes de comunicación
Repository
http://hdl.handle.net/2117/27055 Open in new window
Abstract
We give an algorithm to compute the set of primitive elements for an embedding dimension three numerical semigroups. We show how we use this procedure in the study of the construction of L-shapes and the tame degree of the semigroup.
Citation
Aguilo, F.; ?; Llena, D. An algorithm to compute the primitive elements of an embedding dimension three numerical semigroups. "Electronic notes in discrete mathematics", 2014, vol. 46, p. 185-192.
Keywords
L-shapes, Numerical semigroup, primitive elements, tame degree
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

Attachments