The longest branch of the tree of irreducible numerical semigroups with odd Frobenius number
Taryn Laird
Northern Arizona University
Jose Martinez
Northern Arizona University
Abstract
A 2011 paper by Blanco and Rosales describes an algorithm for constructing a directed tree graph of irreducible numerical semigroups of fixed Frobenius numbers. In this paper we show that for odd Frobenius numbers the corresponding tree has a unique longest branch.
