2000 character limit reached
The tree of irreducible numerical semigroups with fixed Frobenius number
Published 11 May 2011 in math.NT, math.AC, and math.CO | (1105.2147v1)
Abstract: In this paper we present a procedure to build the set of irreducible numerical semigroups with a fixed Frobenius number. The construction gives us a rooted tree structure for this set. Furthermore, by using the notion of Kunz-coordinates vector we translate the problem of finding such a tree into the problem of manipulating 0-1 vectors with as many component as the Frobenius number.
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.