Related papers: Every numerical semigroup arises as an automaton m…
We study numerical semigroups with the property "multiplicity= embedding dimension+1", generated by concatenation of arithmetic sequences.
A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating…
We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty…
In this thesis we explore natural procedures through which topological structure can be constructed from specific semigroups. We will do this in two ways: 1) we equip the semigroup object itself with a topological structure, and 2) we find…
In this paper we compute the Frobenius number of certain {\em Fibonacci numerical semigroups}, that is, numerical semigroups generated by a set of Fibonacci numbers, in terms of Fibonacci numbers.
For every non-trivial finite abelian group $A$, we exhibit a bireversible automaton generating the lamplighter group $A \wr \mathbb{Z}$.
A numerical semigroup is a co-finite submonoid of the monoid of non-negative integers under addition. Many properties of numerical semigroups rely on some fundamental invariants, such as, among others, the set of gaps (and its cardinality),…
In this paper, the complete algebraic structure of finite semisimple group algebra of a normally monomial group is described. The main result is illustrated by computing the explicit Wedderburn decomposition of finite semisimple group…
The construction of bases for quotients is an important problem. In this paper, applying the method of rewriting systems, we give a unified approach to construct sections---an alternative name for bases in semigroup theory---for quotients…
In this paper, we extend recent results about the distribution of even and odd gaps of a numerical semigroup. We find that, for any numerical semigroup, the distribution can be computed in terms of the numbers of or the sums of odd and even…
We describe the infinite dihedral group as automaton group. We collect basic results and give full proofs in details for all statements.
The main results of this paper is to give a complete characterization of the automaticity of one-relator semigroups with length less than or equal to three. Let $S=sgp\langle A|u=v\rangle$ be a semigroup generated by a set…
We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order…
In this paper we present and study the numerical duplication of a numerical semigroup, a construction that, starting with a numerical semigroup $S$ and a semigroup ideal $E\subseteq S$, produces a new numerical semigroup, denoted by…
We investigate numerical semigroups generated by any quadratic sequence with initial term zero and an infinite number of terms. We find an efficient algorithm for calculating the Ap\'ery set, as well as bounds on the elements of the Ap\'ery…
For the elements of a numerical semigroup which are larger than the Frobenius number, we introduce the definition of, seed, by broadening the notion of generator. This new concept allows us to explore the semigroup tree in an alternative…
We study maximal subsemigroups of the monoid T(X) of all full transformations on the set X=N of natural numbers containing a given subsemigroup W of T(X) where each element of a given set $U$ is a generator of T(X) modulo W. This note…
In this paper we give an algorithm for the computation of all the Arf numerical semigroups with a given genus. Moreover, we generalize the concept of genus of a numerical semigroup to good semigroups of $\mathbb{N}^r$ and we give a…
We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of…
Generalizing the idea of self-similar groups defined by Mealy automata, we itroduce the notion of a self-similar automaton and a self-similar group over a changing alphabet. We show that every finitely generated residually-finite group is…