2000 character limit reached
On Row-Factorization relations of certain numerical semigroups
Published 2 May 2021 in math.AC | (2105.00383v3)
Abstract: Let $H$ be a numerical semigroup minimally generated by an almost arithmetic sequence. We give a description of a possible row-factorization $(\RF)$ matrix for each pseudo-Frobenius element of $H.$ Further, when $H$ is symmetric and has embedding dimension 4 or 5, we prove that the defining ideal is minimally generated by $\RF$-relations.
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.