Numerical semigroup

Uses your system voice; voice and rate in settings.

Snapshot

≈ 7 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, a numerical semigroup is a special kind of a semigroup. Its underlying set is the set of all nonnegative integers except a finite number of integers, and the binary operation is the operation of addition of integers. Also, the integer 0 must be an element of the semigroup. For example, while the set {0, 2, 3, 4, 5, 6, ...} is a numerical semigroup, the set {0, 1, 3, 5, 6, ...} is not because 1 is in the set and 1 + 1 = 2 is not in the set. Numerical semigroups are commutative monoids and are also known as numerical monoids. The definition of numerical semigroup is intimately related to the problem of determining nonnegative integers that can be expressed in the form x 1 n 1 + x 2 n 2 + ... + x r n r for a given set {n 1 , n 2 , ..., n r } of positive integers and for arbitrary nonnegative integers x 1 , x 2 , ..., x r . This problem had been considered by several mathematicians like Frobenius (1849–1917) and Sylvester (1814–1897) at the end of the 19th century. During the second half of the twentieth century, interest in the study of numerical semigroups resurfaced because of their applications in algebraic geometry.

In mathematics, a numerical semigroup is a special kind of a semigroup. Its underlying set is the set of all nonnegative integers except a finite number of integers, and the binary operation is the operation of addition of integers. Also, the integer 0 must be an element of the semigroup. For example, while the set {0, 2, 3, 4, 5, 6, ...} is a numerical semigroup, the set {0, 1, 3, 5, 6, ...} is not because 1 is in the set and 1 + 1 = 2 is not in the set. Numerical semigroups are commutative monoids and are also known as numerical monoids. The definition of numerical semigroup is intimately related to the problem of determining nonnegative integers that can be expressed in the form x 1 n 1 + x 2 n 2 + ... + x r n r for a given set {n 1 , n 2 , ..., n r } of positive integers and for arbitrary nonnegative integers x 1 , x 2 , ..., x r . This problem had been considered by several mathematicians like Frobenius (1849–1917) and Sylvester (1814–1897) at the end of the 19th century. During the second half of the twentieth century, interest in the study of numerical semigroups resurfaced because of their applications in algebraic geometry. There is a simple method to construct numerical semigroups. Let A = {n 1 , n 2 , ..., n r } be a nonempty set of positive integers. The set of all integers of the form x 1 n 1 + x 2 n 2 + ... + x r n r is the subset of N generated by A and is denoted by ⟨ A ⟩. The following theorem fully characterizes numerical semigroups. Let S be the subsemigroup of N generated by A. Then S is a numerical semigroup if and only if gcd (A) = 1. Moreover, every numerical semigroup arises in this way. ⟨ 1 ⟩ = {0, 1, 2, 3, ...} ⟨ 1, 2 ⟩ = {0, 1, 2, 3, ...} ⟨ 2, 3 ⟩ = {0, 2, 3, 4, 5, 6, ...} Let a be a positive integer. ⟨ a, a + 1, a + 2, ... , 2a – 1 ⟩ = {0, a, a + 1, a + 2, a + 3, ...}. Let b be an odd integer greater than 1. Then ⟨ 2, b ⟩ = {0, 2, 4, . . . , b − 3 , b − 1, b, b + 1, b + 2, b + 3 , ...}. Well-tempered harmonic semigroup H={0,12,19,24,28,31,34,36,38,40,42,43,45,46,47,48,...} Let S = ⟨ 5, 7, 9 ⟩. Then we have: The set of elements in S : S = {0, 5, 7, 9, 10, 12, 14, ...}. The minimal set of generators of S : {5, 7, 9}. The embedding dimension of S : e(S) = 3. The multiplicity of S : m(S) = 5. The set of gaps in S : G(S) = {1, 2, 3, 4, 6, 8, 11, 13}. The Frobenius number of S is F(S) = 13, and its conductor is 14. The genus of S : g(S) = 8. Numerical semigroups with small Frobenius number or genus The Apéry set of S with respect to m is defined to be Ap(S,m) = \{a \in S : a - m \notin S\}. Equivalently, contains the smallest elements of S in each residue class modulo m. Typically one considers the Apéry set of S with respect to the multiplicity m(S) and in this case it is common to simply write Ap(S) instead of Ap(S,m(S)). The Frobenius number may be calculated in terms of any Apéry set, F(S) = \max(Ap(S,m)) - m. The following general results were known to Sylvester. Let a and b be positive integers such that gcd (a, b) = 1. Then F(⟨ a, b ⟩) = (a − 1) (b − 1) − 1 = ab − (a + b). g(⟨ a, b ⟩) = (a − 1)(b − 1) / 2. can be used to compute the Frobenius number of a numerical semigroup S generated by {a 1 , a 2 , a 3 } where a 1 2 3 and gcd ( a 1 , a 2 , a 3 ) = 1. Its worst-case complexity is not as good as Greenberg's algorithm but it is much simpler to describe. Let s 0 be the unique integer such that a 2 s 0 ≡ a 3 mod a 1 , 0 ≤ s 0 1 . The continued fraction algorithm is applied to the ratio a 1 /s 0 : a 1 = q 1 s 0 − s 1 , 0 ≤ s 1 0 , s 0 = q 2 s 1 − s 2 , 0 ≤ s 2 1 , s 1 = q 3 s 2 − s 3 , 0 ≤ s 3 2 , ... s m−1 = q m+1 s m , s m+1 = 0, where q i ≥ 2, s i ≥ 0 for all i. Let p −1 = 0, p 0 = 1, p i+1 = q i+1 p i − p i−1 and r i = (s i a 2 − p i a 3 )/a 1 . Let v be the unique integer number such that r v+1 ≤ 0 v , or equivalently, the unique integer such s v+1 /p v+1 ≤ a 3 /a 2 v /p v · Then, F(S) = −a 1 + a 2 (s v − 1) + a 3 (p v+1 − 1) − min{a 2 s v+1 , a 3 p v }. A numerical semigroup S is symmetric if and only if g(S) = (F(S) + 1)/2. A numerical semigroup S is pseudo-symmetric if and only if g(S) = (F(S) + 2)/2.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1373750128 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

7 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.