pith. sign in

arxiv: 0810.1619 · v1 · submitted 2008-10-09 · 🧮 math.CO · math.AC

Towards a Better Understanding of the Semigroup Tree

classification 🧮 math.CO math.AC
keywords treesemigroupbehaviornumbersemigroupstypesadmitappear
0
0 comments X
read the original abstract

In this paper we elaborate on the structure of the semigroup tree and the regularities on the number of descendants of each node observed earlier. These regularites admit two different types of behavior and in this work we investigate which of the two types takes place in particular for well-known classes of semigroups. Also we study the question of what kind of chains appear in the tree and characterize the properties (like being (in)finite) thereof. We conclude with some thoughts that show how this study of the semigroup tree may help in solving the conjecture of Fibonacci-like behavior of the number of semigroups with given genus.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.