2018
DOI: 10.48550/arxiv.1805.08972
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Almost Maximal Numerical Semigroups formed by Concatenation of Arithmetic Sequences

Abstract: Given integer e ≥ 4, we have constructed a class of symmetric numerical semigroups of embedding dimension e and proved that the cardinality of a minimal presentation of the semigroup is a bounded function of the embedding dimension e. This generalizes the examples given by J.C. Rosales.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…We calculate the Apéry set in order to prove that the cardinality of minimal presentation is a bounded function of the embedding dimension e and in turn give an affirmative answer to the question on the boundedness of the number of minimal relations for a symmetric numerical semigroup. Numerical semigroups with the property "multiplicity= embedding di-mension+1" has been studied before in [12], where it was proved that the minimal number of generators for the defining ideal of this class of numerical semigroups is a bounded function of e. In [8] we have examined numerical semigroups formed by concatenation together with the condition "multiplicity= embedding dimension+1"; we call this the almost maximal concatenation. We have explicitly calculated the Apéry set, the Frobenius number.…”
Section: Concatenation Of Arithmetic Sequencesmentioning
confidence: 99%
“…We calculate the Apéry set in order to prove that the cardinality of minimal presentation is a bounded function of the embedding dimension e and in turn give an affirmative answer to the question on the boundedness of the number of minimal relations for a symmetric numerical semigroup. Numerical semigroups with the property "multiplicity= embedding di-mension+1" has been studied before in [12], where it was proved that the minimal number of generators for the defining ideal of this class of numerical semigroups is a bounded function of e. In [8] we have examined numerical semigroups formed by concatenation together with the condition "multiplicity= embedding dimension+1"; we call this the almost maximal concatenation. We have explicitly calculated the Apéry set, the Frobenius number.…”
Section: Concatenation Of Arithmetic Sequencesmentioning
confidence: 99%
“…What is certainly interesting is that n 1 + n 2 = n 3 + n 4 , for the sequence of integers n = (n 1 , n 2 , n 3 , n 4 ) given by Bresinsky. We have initiated a study of numerical semigroups defined by a sequence of integers formed by concatenation of two arithmetic sequences and we believe that such semigroups with correct conditions would finally give us a good model of numerical semigroups in arbitrary embedding dimension with unbounded Betti numbers; see [10], [11].…”
mentioning
confidence: 99%