DSpace Collection:http://hdl.handle.net/10174/9692023-05-30T01:43:57Z2023-05-30T01:43:57ZPositioned numerical semigroups with maximal gender as function of multiplicity and Frobenius numberJ. Carlos, RosalesManuel, BrancoManuel, Fariahttp://hdl.handle.net/10174/347022023-02-24T14:51:45Z2022-01-01T00:00:00ZTitle: Positioned numerical semigroups with maximal gender as function of multiplicity and Frobenius number
Authors: J. Carlos, Rosales; Manuel, Branco; Manuel, Faria
Abstract: A C-semigroup (respectively a D-semigroup) is a positioned numerical semigroup S such that g(S)=F(S)+m(S)−12 (respectively g(S)=F(S)+m(S)−22). In this paper we study these semigroups giving formulas for the Frobenius number, pseudo-Frobenius number, and type. Furthermore, we give algorithms for computing the whole set of C-semigroups and D-semigroups.2022-01-01T00:00:00ZMinimal binomial systems of generators for the ideals of certain monomial curvesBranco, Manuel B.Isabel, ColaçoIgnacio, Ojedahttp://hdl.handle.net/10174/346782023-02-24T12:02:27Z2021-12-01T00:00:00ZTitle: Minimal binomial systems of generators for the ideals of certain monomial curves
Authors: Branco, Manuel B.; Isabel, Colaço; Ignacio, Ojeda
Abstract: Let a, b and n > 1 be three positive integers such that a and ∑n−1 j=0 bj are relatively prime. In this paper, we prove that the toric ideal I associated to the
submonoid of N generated by {∑n−1 j=0 bj } ∪ {∑n−1
j=0 bj + a ∑i−2 j=0 bj | i = 2, . . . , n} is
determinantal. Moreover, we prove that for n > 3, the ideal I has a unique minimal system of generators if and only if a < b − 1.2021-12-01T00:00:00ZPositioned Numerical Semigroups with Small GenderJ. Carlos, RosalesManuel, BrancoManuel, Fariahttp://hdl.handle.net/10174/346752023-02-24T11:59:35Z2022-03-01T00:00:00ZTitle: Positioned Numerical Semigroups with Small Gender
Authors: J. Carlos, Rosales; Manuel, Branco; Manuel, Faria
Editors: Springer
Abstract: An M-semigroup (respectively an N -semigroup) is a positioned numerical semigroup S, such that g(S) = F(S)+3/2 (respectively, g(S) = F(S)+4/2 ). In this paper, we describe and characterize this class of semigroups; in particular, we show that the type of an M-semigroup (respectively an N-semigroup) is equal to 2 or 3 (respectively 2, 3 or 4). Moreover, we give algorithms for computing the whole set of M-semigroups and N-semigroups.2022-03-01T00:00:00ZPositioned numerical semigroupsM. B., BrancoM. C., FariaJ. C., Rosaleshttp://hdl.handle.net/10174/346412023-02-17T21:17:31Z2021-01-01T00:00:00ZTitle: Positioned numerical semigroups
Authors: M. B., Branco; M. C., Faria; J. C., Rosales
Abstract: A numerical semigroup S is positioned if for all s ∈ ℕ\S we have that F(S) + m(S) − s ∈ S. In this paper, we give algorithms to compute the set of positioned semigroups and a criterium to check whether S is or not is positioned. Furthermore, we prove the Wilf’s conjecture for this type of numerical semigroups.2021-01-01T00:00:00Z