Infinite chains in the tree of numerical semigroups

Identificador:  imarina:9392515

Handle: https://hdl.handle.net/20.500.11797/imarina9392515

Autors:  Rosas-Ribeiro, M; Bras-Amorós, M

Resum:
One major problem in the study of numerical semigroups is determining the growth of the semigroup tree. We study infinite chains of numerical semigroups in the semigroup tree, firstly introduced by Bras-Amor & oacute;s (Semigroup Forum, 71:561-574, 2009). Computational results show that these chains are rare, but without them the tree would not be infinite. It is proved that for each genus g >= 5\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$g\ge 5$$\end{document} there are more semigroups of that genus not belonging to infinite chains than semigroups belonging. Bras-Amor & oacute;s (Semigroup Forum, 71:561-574, 2009) presented a characterization of the semigroups that belong to infinite chains in terms of the coprimality of the left elements of the semigroup as well as a result on the cardinality of the set of infinite chains to which a numerical semigroup belongs in terms of the primality of the greatest common divisor of these left elements. We revisit these results and fix an imprecision on the cardinality of the set of infinite chains to which a semigroup belongs in the case when the greatest common divisor of the left elements is a prime number. We then look at infinite chains in subtrees with fixed multiplicity. When the multiplicity is a prime number there is only one infinite chain in the tree of semigroups with such multiplicity. When the multiplicity is 4 or 6 we prove a self-replication behavior in the subtree and provide a formula for the number of semigroups in infinite chains of a given genus and multiplicity 4 and 6, respectively.