Related papers: Automatic structures for subsemigroups of Baumslag…
This paper introduces a notion of presentation for locally inverse semigroups and develops a graph structure to describe the elements of locally inverse semigroups given by these presentations. These graphs will have a role similar to the…
Let S be a semigroup and let T be a subsemigroup of S. Then T acts on S by left- and by right multiplication. This gives rise to a partition of the complement of T in S, and to each equivalence class of this partition we naturally associate…
Given $m\in \mathbb{N},$ a numerical semigroup with multiplicity $m$ is called packed numerical semigroup if its minimal generating set is included in $\{m,m+1,\ldots, 2m-1\}.$ In this work, packed numerical semigroups are used to built the…
In this paper we continue the investigations on the algebraic structure of a finite semigroup $S$ that is determined by its associated upper non-nilpotent graph $\mathcal{N}_{S}$. The vertices of this graph are the elements of $S$ and two…
This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…
We generalize the notion of a graph automatic group introduced by Kharlampovich, Khoussainov and Miasnikov (arXiv:1107.3645) by replacing the regular languages in their definition with more powerful language classes. For a fixed language…
The binary products of right, left or double division in semigroups that are semilattices of groups give interesting groupoid structures that are in one to one correspondence with semigroups that are semilattices of groups. This work is…
Let n_g denote the number of numerical semigroups of genus g. Bras-Amoros conjectured that n_g possesses certain Fibonacci-like properties. Almost all previous attempts at proving this conjecture were based on analyzing the semigroup tree.…
We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…
A semigroup $S$ is right noetherian if every right congruence on $S$ is finitely generated. In this paper we present some fundamental properties of right noetherian semigroups, discuss how semigroups relate to their substructures with…
We show that an automaton group or semigroup is infinite if and only if it admits an $\omega$-word (i. e. a right-infinite word) with an infinite orbit, which solves an open problem communicated to us by Ievgen V. Bondarenko. In fact, we…
We survey results concerning automatic structures for semigroup constructions, providing references and describing the corresponding automatic structures. The constructions we consider are: free products, direct products, Rees matrix…
Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial…
We show that all residually finite generalized Baumslag-Solitar groups of rank $n \geq 1$, defined on a finite and connected graph, are self-similar. Furthermore we prove that all residually finite fundamental groups of (finite, connected)…
Motivated by recent appearance of multivalued structures in categorification, tropical geometry and other areas, we study basic properties of abstract multisemigroups. We give many new and old examples and general constructions for…
The notion of automatic selfadjointness of all ideals in a multiplicative semigroup of the bounded linear operators on a separable Hilbert space B(H) arose in a 2015 discussion with Heydar Radjavi who pointed out that B(H) and the finite…
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…
A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…
We determine the structure of equilibrium states for a natural dynamics on the boundary quotient diagram of $C^*$-algebras for a large class of right LCM semigroups. The approach is based on abstract properties of the semigroup and covers…
Recent research of the author has given an explicit geometric description of free (two-sided) adequate semigroups and monoids, as sets of labelled directed trees under a natural combinatorial multiplication. In this paper we show that there…