2026-04-18T00:19:43Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/1927322026-01-30T08:40:26Zcom_2072_1033col_2072_452950

urn:hdl:2117/192732 The right-generators descendant of a numerical semigroup Bras Amorós, Maria Fernández González, Julio Àrees temàtiques de la UPC::Matemàtiques i estadística::Àlgebra Frobenius algebras Algorithms Frobenius, Àlgebres de Algorismes For a numerical semigroup, we encode the set of primitive elements that are larger than its Frobenius number and show how to produce in a fast way the corresponding sets for its children in the semigroup tree. This allows us to present an efficient algorithm for exploring the tree up to a given genus. The algorithm exploits the second nonzero element of a numerical semigroup and the particular pseudo-ordinary case in which this element is the conductor Peer Reviewed Postprint (author's final draft) 2020-01-01 Article https://www.ams.org/journals/mcom/2020-89-324/S0025-5718-2020-03502-9/ http://creativecommons.org/licenses/by-nc-nd/3.0/es/ Open Access Attribution-NonCommercial-NoDerivs 3.0 Spain