Arama Sonuçları

Listeleniyor 1 - 3 / 3
  • Öğe
    Bazı saturated sayısal yarıgruplar üzerine
    (Dicle Üniversitesi, 2016-12) Süer, Meral; İlhan, Sedat; Çelik, Ahmet
  • Öğe
    On the numerical semigroups with generated by two elements with multiplicity 3
    (Harran Üniversitesi, 2017-05) Süer, Meral; İlhan, Sedat; Çelik, Ahmet
    Throughout this study, we assume that ¥ and ¢ be the sets of nonnegative integers and integers, respectively. The subset S of ¥ is a numerical semigroup if 0 Î S , x + y Î S, for all x, y Î S , and Card(¥ \S)< ¥ ( this condition is equivalent to gcd(S)= 1 , gcd(S)= greatest common divisor the element of S ) . Let S be a numerical semigroup, then F(S) = max(¢ \S) and m(S) = min{s Î S: s > 0} are called Frobenius number and multiplicity of S , respectively. Also, n(S) = Card ({0,1,2,...,F(S)}ÇS)is called the number determine of S . If S is a numerical semigroup such that 1 2 , ,..., r S = < a a a > , then we observe that { } 1 2 0 , 2 1 , ,..., 0, , ,..., , ( ) 1, ... r n n S a a a s s s s s F S - = < > = = = + ® where 1 , ( ) i i s s n n S + < = , and the arrow means that every integer greater than F(S) + 1 belongs to S , for i = 1,2,...,n = n(S) . If a Î ¥ and a Ï S , then a is called gap of S . We denote the set of gaps of S , by H(S) , i.e, H(S) = ¥ \S .The G(S) = Card(H(S)) is called the genus of S . Also, It is known that G(S) = F(S) + 1- n(S) . Let S be a numerical semigroup andm Î S ,m > 0 . Then Ap(S,m)  xS :x mS  is called Apery set of S according to m . A numerical semigroup S is Arf if a+ b- c Î S , for all a,b,c Î S such that a ³ b ³ c. The intersection of any family of Arf numerical semigroups is again an Arf numerical semigroup. Thus, since ¥ is an Arf numerical semigroup, one can consider the smallest Arf numerical semigroup containing a given numerical semigroup. The smallest Arf numerical semigroup containing a numerical semigroup S is called the Arf closure of S , and it is denoted by Arf (S) . In this presentation, we will give some results about gaps, the determine number, Apery set and Arf closure of S numerical semigroup such that S = 3, x .
  • Öğe
    On Arf closures of some numerical semigroups generated by three elements
    (Harran Üniversitesi, 2017-05) Süer, Meral; İlhan, Sedat; Çelik, Ahmet
    A numerical semigroup is a subset of the set of nonnegative integers (denoted here by ¥ ) closed under addition, containing the zero element and with finite complement in ¥ . A numerical semigroup is a set of the form 1, 2 , , 1 2 ... p p S = u u ¼ u = u ¥ + u ¥ + + u ¥ where are positive integers, such that ( ) 1 2 gcd , , , 1 p u u ¼ u = . The condition is saying that S has finite complement in ¥ (where short gcd is the greatest common divisor),( Barucci, Dobbs & Fontana, 1997; .Fröberg, Gottlieb & Haggkvist, 1987; . Rosales &Garcia-Sanchez, 2009). If S is a numerical semigroup, then F(S) = max(¢ \S) is called Frobenius number of S . Any numerical semigroup write this form { } 1 2 0 1 2 , ,..., 0 , , ,..., ( ) 1, ... n n S = < a a a > = = s s s s = F S + ® . Where “® ” means that every integer greater than F(S)+ 1 belongs to the set. A numerical semigroup S is called Arf if x + y - z Î S for all x, y, z Î S , where x ³ y ³ z . The smallest Arf numerical semigroup containing a numerical semigroup S is called the Arf closure of S , and it is denoted by Arf (S) . Arf numerical semigroup and their applications to algebraic error corerecting codes have been a special interest in recent times (Brass-Amaros, 2004; Campillo, Farran & Munuera, 2000). The families of Arf numerical semigroups are related with the problem solution of singularities in curve.In this presentation, we will give some results between numerical semigroups and theirs Arf closure. Also, we will obtain some relation for Arf closure of these numerical semigroups.