Related papers: On a probabilistic problem on finite semigroups
We consider semigroup algorithmic problems in finitely generated metabelian groups. Our paper focuses on three decision problems introduced by Choffrut and Karhum\"{a}ki (2005): the Identity Problem (does a semigroup contain a neutral…
We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…
The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…
In this paper, we consider the probability that a randomly chosen automorphism of a finite group fixes a randomly chosen element of a subgroup of that group. We obtain several new results as well as generalizations and improvements of some…
We investigate the computational complexity for determining various properties of a finite transformation semigroup given by generators. We introduce a simple framework to describe transformation semigroup properties that are decidable in…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
We present a procedure to enumerate the whole set of numerical semigroups with a given Frobenius number F, S(F). The methodology is based on the construction of a partition of S(F) by a congruence relation. We identify exactly one…
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 characterize and construct semigroups whose right regular representation is a left cancellative semigroup. These semigroups will be called left equalizer simple semigroups. For a congruence $\varrho$ on a semigroup $S$, let…
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…
In this paper we present a new approach to construct the set of numerical semigroups with a fixed genus. Our methodology is based on the construction of the set of numerical semigroups with fixed Frobenius number and genus. An equivalence…
In this paper we show the way we pass from semigroups (without order) to hypersemigroups. Moreover we show that, exactly as in semigroups, in the results of hypersemigroups based on right (left) ideals, quasi-ideals and bi-ideals, points do…
Fix a finite semigroup $S$ and let $a_1,\ldots,a_k, b$ be tuples in a direct power $S^n$. The subpower membership problem (SMP) asks whether $b$ can be generated by $a_1,\ldots,a_k$. If $S$ is a finite group, then there is a folklore…
The paper begins by exploring the various definitions of norms on semigroups and then presents a new definition of a normed semigroup. The properties of normed semigroups in the new sense are investigated. The new definition of the norm is…
Let $\frak{F}$ be a class of finite groups. A subgroup $H$ of a finite group $G$ is said to be $\mathfrak{F_{\mathrm s}}$-quasinormal in $G$ if there exists a normal subgroup $T$ of $G$ such that $HT$ is $s$-permutable in $G$ and $(H\cap…
In this paper, we present two algorithms based on the Froidure-Pin Algorithm for computing the structure of a finite semigroup from a generating set. As was the case with the original algorithm of Froidure and Pin, the algorithms presented…
The variant of a semigroup S with respect to an element a in S, denoted S^a, is the semigroup with underlying set S and operation * defined by x*y=xay for x,y in S. In this article, we study variants T_X^a of the full transformation…
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…
This paper gives a systematic construction of certain covers of finite semigroups. These covers will be used in future work on the complexity of finite semigroups.
The 5-element Brandt semigroup $B_2$ admits the structure of a naturally semilattice-ordered inverse semigroup, thus becoming an additively idempotent semiring with the operation of taking greatest lower bounds as the semiring addition. For…