2000 character limit reached
Almost symmetric numerical semigroups (1807.00134v1)
Published 30 Jun 2018 in math.AC
Abstract: We study almost symmetric numerical semigroups and semigroup rings. We describe a characteristic property of the minimal free resolution of the semigroup ring of an almost symmetric numerical semigroup. For almost symmetric semigroups generated by $4$ elements we will give a structure theorem by using the \lq\lq row-factorization matrices", introduced by Moscariello. As a result, we give a simpler proof of Komeda's structure theorem of pseudo-symmetric numerical semigroups generated by $4$ elements. Row-factorization matrices are also used to study shifted families of numerical semigroups.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.