Almost symmetric numerical semigroups with high type
Abstract:We establish a one-to-one correspondence between numerical semigroups of genus g and almost symmetric numerical semigroups with Frobenius number F and type F − 2g , provided that F is greater than or equal to 4g − 1 .
“…Corollary 3.2.1. (Proved in [1]) Given positive integers F, β such that F > 8β − 6. There is a bijection between the set of almost symmetric numerical semigroups with Frobenius number F and type F − 2β and the number of numerical semigroups with genus β.…”
Section: The T-set Of a Numerical Semigroupmentioning
confidence: 99%
“…In [1] it was proved that for a fixed α, the function T 1 (F, F − 2α) remains constant once F > 4α + 1. This was done by finding a bijection between the set of almost symmetric numerical semigroups S with F (S) = F , t(S) = F − 2α and the set of numerical semigroups with genus g. Following a similar method we show in Theorem 3.2 and Theorem 3.4 that Theorem 1.7.…”
A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. Some of the key properties of a numerical semigroup are its Frobenius number F, genus g and type t. It is known that for any numerical semigroup g F +1−g ≤ t ≤ 2g − F . Numerical semigroups with t = 2g − F are called almost symmetric, we introduce a new property that characterises them. We give an explicit characterisation of numerical semigroups with t = g F +1−g . We show that for a fixed α the number of numerical semigroups with Frobenius number F and type F − α is eventually constant for large F . Also the number of numerical semigroups with genus g and type g − α is also eventually constant for large g.
“…Corollary 3.2.1. (Proved in [1]) Given positive integers F, β such that F > 8β − 6. There is a bijection between the set of almost symmetric numerical semigroups with Frobenius number F and type F − 2β and the number of numerical semigroups with genus β.…”
Section: The T-set Of a Numerical Semigroupmentioning
confidence: 99%
“…In [1] it was proved that for a fixed α, the function T 1 (F, F − 2α) remains constant once F > 4α + 1. This was done by finding a bijection between the set of almost symmetric numerical semigroups S with F (S) = F , t(S) = F − 2α and the set of numerical semigroups with genus g. Following a similar method we show in Theorem 3.2 and Theorem 3.4 that Theorem 1.7.…”
A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. Some of the key properties of a numerical semigroup are its Frobenius number F, genus g and type t. It is known that for any numerical semigroup g F +1−g ≤ t ≤ 2g − F . Numerical semigroups with t = 2g − F are called almost symmetric, we introduce a new property that characterises them. We give an explicit characterisation of numerical semigroups with t = g F +1−g . We show that for a fixed α the number of numerical semigroups with Frobenius number F and type F − α is eventually constant for large F . Also the number of numerical semigroups with genus g and type g − α is also eventually constant for large g.
“…Several equivalent conditions are given for AS -semigroups. For details, we refer to [4,5,9,13]. In Proposition 2.1, we explicitly describe the elements of P F (S) with respect to gap numbers of S .…”
In this paper, we introduce almost symmetric Arf partitions (for short, ASA-partitions) and using properties of partitions of positive integers, we give the number of almost symmetric Arf semigroups of genus g .
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.