2012
DOI: 10.1016/j.jalgebra.2012.02.010
|View full text |Cite
|
Sign up to set email alerts
|

Genus of numerical semigroups generated by three elements

Abstract: Let H = a, b, c be a numerical semigroup generated by three elements and let R = k[H] be its semigroup ring over a field k. We assume H is not symmetric and assume that the definig ideal of R is defined by maximal minorsThen we will show that the genus of H is determined by the Frobenius number F(H) and αβγ or α ′ β ′ γ ′ . In particular, we show that H is pseudo-symmetric if and only if αβγ = 1 or α ′ β ′ γ ′ = 1.Also, we will give a simple algorithm to get all the pseudo-symmetric numerical semigroups H = a,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
8
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
5
3
2

Relationship

2
8

Authors

Journals

citations
Cited by 16 publications
(9 citation statements)
references
References 7 publications
1
8
0
Order By: Relevance
“…In Section 4 we will explore 3-generated numerical semigroup rings over a field and their almost Gorenstein property. Corollary 4.2 has been reported by H. Nari [14] (see [15] also) at the 32-nd Symposium on Commutative Algebra in Japan (Hayama, 2010). Our research is independent of [14,15].…”
Section: Introductionsupporting
confidence: 53%
“…In Section 4 we will explore 3-generated numerical semigroup rings over a field and their almost Gorenstein property. Corollary 4.2 has been reported by H. Nari [14] (see [15] also) at the 32-nd Symposium on Commutative Algebra in Japan (Hayama, 2010). Our research is independent of [14,15].…”
Section: Introductionsupporting
confidence: 53%
“…This can also be seen as follows. According to Nari et al [29], the structure matrix A j for an almost…”
Section: This Implies Thatmentioning
confidence: 99%
“…, (n − 1)α} ⊆ PF(H). If n = 3. then {α, 2α} = PF(H), so that by [4,13] the implication (3) ⇒ (2) follows (see Proposition 2.3 also). Therefore, in order to show the implication, we may assume that n ≥ 4 and that Theorem 1.2 holds true for n − 1.…”
Section: Proof Of Theorem 12mentioning
confidence: 91%