On Symmetric Numerical Semigroups
نویسندگان
چکیده
A numerical semigroup is a subset S of N such that is closed under sums, contains the zero and generates Z as a group. From this definition Ž w x. Ž one obtains see, for example, 2 that S has a conductor C i.e., the . maximum among all the natural numbers not belonging to S . A numerical semigroup S is called symmetric if for every integer z f S, C y z g S. The study of the subsemigroups of N is a classical problem, which is equivalent to study of the sets of natural solutions of linear equations with w x coefficients in N. From 1970 and after the works 5, 6 and others, the study of the subsemigroups of N is also motivated by its applications to algebraic geometry. An example arises when we consider an analytically irreducible one-dimensional Noetherian local domain R, the integral closure V of R in the quotient field of R is a discrete valuation ring, if we assume that R and V have the same residue class field and we denote by Ž . ̈ the valuation attached to V, then S s ̈ R is a numerical semigroup. R Then properties on the semigroup S imply properties of the ring R. For R w x Ž w x. example, 6 proves that R is Gorenstein see 1 if and only if S is R symmetric. The close relation between numerical semigroups and monomial curves has produced the usage of algebraic geometry terminology in the field of numerical semigroups. For example, the smallest integer m greater than zero in S is usually called the multiplicity of S, the cardinal e of a minimal system of generators for S is called the embedding dimension of S, and a finite presentation for S is called a relation for S.
منابع مشابه
Almost Symmetric Numerical Semigroups Generated by Four Elements
In this paper, we study almost symmetric numerical semigroups generated by 4-elements. Rosales and Garćıa-Sánchez [RG2] proved that every almost symmetric numerical semigroup can be constructed by removing some minimal generators from an irreducible numerical semigroup with the same Frobenius number. Using this result, we concretely construct almost symmetric numerical semigroups generated by 4...
متن کاملSymmetric Numerical Semigroups Generated by Fibonacci and Lucas Triples
The symmetric numerical semigroups S (Fa, Fb, Fc) and S (Lk, Lm, Ln) generated by three Fibonacci (Fa, Fb, Fc) and Lucas (Lk, Lm, Ln) numbers are considered. Based on divisibility properties of the Fibonacci and Lucas numbers we establish necessary and sufficient conditions for both semigroups to be symmetric and calculate their Hilbert generating series, Frobenius numbers and genera.
متن کاملOn Numerical Experiments with Symmetric Semigroups Generated by Three Elements and Their Generalization
We give a simple explanation of numerical experiments of V. Arnold with two sequences of symmetric numerical semigroups, S(4, 6 + 4k, 87− 4k) and S(9, 3 + 9k, 85− 9k) generated by three elements. We present a generalization of these sequences by numerical semigroups S(r 1 , r1r2 + r 2 1k, r3 − r 2 1k), k ∈ Z, r1, r2, r3 ∈ Z , r1 ≥ 2 and gcd(r1, r2) = gcd(r1, r3) = 1, and calculate their univers...
متن کاملDuality Relation for the Hilbert Series of Almost Symmetric Numerical Semigroups
We derive the duality relation for the Hilbert series H (d; z) of almost symmetric numerical semigroup S (d) combining it with its dual H ( d; z ) . On this basis we establish the bijection between the multiset of degrees of the syzygy terms and the multiset of the gaps Fj , generators di and their linear combinations. We present the relations for the sums of the Betti numbers of even and odd i...
متن کاملChomp on numerical semigroups
We consider the two-player game chomp on posets associated to numerical semigroups and show that the analysis of strategies for chomp is strongly related to classical properties of semigroups. We characterize which player has a winning-strategy for symmetric semigroups, semigroups of maximal embedding dimension and several families of numerical semigroups generated by arithmetic sequences. Furt...
متن کاملSymmetric Numerical Semigroups with Arbitrary Multiplicity and Embedding Dimension
We construct symmetric numerical semigroups S for every minimal number of generators μ(S) and multiplicity m(S), 2 ≤ μ(S) ≤ m(S) − 1. Furthermore we show that the set of their defining congruence is minimally generated by μ(S)(μ(S) − 1)/2 − 1 elements.
متن کامل