Related papers: Limit Semigroups with 2 Generators
This paper deals with the number of subgroups of a given exponent in a finite abelian group. Explicit formulas are obtained in the case of rank two and rank three abelian groups. An asymptotic formula is also presented.
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…
We classify all of the groups with twelve or fewer subgroups. This paper is the proof of the entries in a submission to the Online Encyclopedia of Integer Sequences.
We characterise the numerical semigroups with a monotone Ap\'ery set (MANS-semigroups for abbreviate). Moreover, we describe the families of MANS-semigroups when we set the multiplicity and the ratio.
In this paper, we prove that the numerical-semigroup-gap counting problem is #NP-complete as a main theorem. A numerical semigroup is an additive semigroup over the set of all nonnegative integers. A gap of a numerical semigroup is defined…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
We introduce a ring and a field, generated by a semigroup, and we investigate some of their properties.
Machine learning is applied to find proofs, with smaller or smallest numbers of nodes, for the classification of 4-nilpotent semigroups.
We collect some open problems about minimal presentations of numerical semigroups and, more generally, about defining ideals and free resolutions of their semigroup rings and associated graded rings. We emphasize both long-standing problems…
We give a topological framework for the study of Sela's limit groups: limit groups are limits of free groups in a compact space of marked groups. Many results get a natural interpretation in this setting. The class of limit groups is known…
We present procedures to calculate the set of Arf numerical semigroups with given genus, given conductor and given genus and conductor. We characterize the Kunz coordinates of an Arf numerical semigroup. We also describe Arf numerical…
The syntactic semigroup problem is to decide whether a given finite semigroup is syntactic or not. This work investigates the syntactic semigroup problem for both the semigroup reducts of $A^+(B_n)$, the affine near-semiring over a Brandt…
In this note a very simple example is given which shows that if the sum of two semigroup generators is itself a generator, the generated semigroup in general can not be rapresented by the Lie-Trotter product formula.
We describe a bound on the degree of the generators for some adjoint rings on surfaces and threefolds.
For a semigroup $S$, the covering number of $S$ with respect to semigroups, $\sigma_s(S)$, is the minimum number of proper subsemigroups of $S$ whose union is $S$. This article investigates covering numbers of semigroups and analogously…
In this paper we study the number of finite topologies on an $n$-element set subject to various restrictions.
The existence of an infinite simple boundedly generated 2-generated group and the existence of a boundedly simple 2-generated group containing a free non-cyclic subgroup are proved.
We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite…
The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…
We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…