Related papers: On a probabilistic problem on finite semigroups

This paper studies transition probabilities from a Borel subset of a Polish space to a product of two Borel subsets of Polish spaces. For such transition probabilities it introduces and studies the property of semi-uniform Feller…

Necessary and sufficient conditions for finite semihypergroups to be built from groups of the same order are established

Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…

For sufficiently nice families of semigroups and monoids, the structure theorem for sets of length states that the length set of any sufficiently large element is an arithmetic sequence with some values omitted near the ends. In this paper,…

In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…

The problem of embedding an ample semigroup in an inverse semigroup as a (2, 1, 1)-type subalgebra is known to be undecidable. In this article, we investigate the problem for certain classes of ample semigroups. We also give examples of…

Let $Q$ be an inverse semigroup. A subsemigroup $S$ of $Q$ is a left I-order in $Q$ and $Q$ is a semigroup of left I-quotients of $S$ if every element in $Q$ can be written as $a^{-1}b$, where $a, b \in S$ and $a^{-1}$ is the inverse of $a$…

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…

Let $X$ be a nonempty set and $\mathcal{P}=\{X_i\colon i\in I\}$ a partition of $X$. Denote by $T(X)$ the full transformation semigroup on $X$, and $T(X, \mathcal{P})$ the subsemigroup of $T(X)$ consisting of all transformations that…

Every semigroup which is a finite disjoint union of copies of the free mono- genic semigroup (natural numbers under addition) has soluble word prob- lem and soluble membership problem. Efficient algorithms are given for both problems.

We augment the body of existing results on embedding finite semigroups of a certain type into 2-generator finite semigroups of the same type. The approach adopted applies to finite semigroups the idempotents of which form a band and also to…

In this article we consider the cycle structure of compositions of pairs of involutions in the symmetric group S_n chosen uniformly at random. These can be modeled as modified 2-regular graphs, giving rise to exponential generating…

We find a relation between the genus of a quotient of a numerical semigroup $S$ and the genus of $S$ itself. We use this identity to compute the genus of a quotient of $S$ when $S$ has embedding dimension $2$. We also exhibit identities…

Embeddings of word structures into matrix semigroups provide a natural bridge between combinatorics on words and linear algebra. However, low-dimensional matrix semigroups impose strong structural restrictions on possible embeddings.…

Let $X$ be a set and let $S$ be an inverse semigroup of partial bijections of $X$. Thus, an element of $S$ is a bijection between two subsets of $X$, and the set $S$ is required to be closed under the operations of taking inverses and…

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 study how certain invariants of numerical semigroups relate to the number of second kind gaps. Furthermore, given two fixed non-negative integers F and k, we provide an algorithm to compute all the numerical semigroups whose Frobenius…

We call a semigroup $S$ f-noetherian if every right congruence of finite index on $S$ is finitely generated. We prove that every finitely generated semigroup is f-noetherian, and investigate whether the properties of being f-noetherian and…

We provide a new way to represent numerical semigroups by showing that the position of every Ap\'ery set of a numerical semigroup $S$ in the enumeration of the elements of $S$ is unique, and that $S$ can be re-constructed from this…

A fence is a particular partial order on a (finite) set, close to the linear order. In this paper, we calculate the rank of the semigroup $\mathcal{FI}_{n}$ of all order-preserving partial injections on an $n$-element fence. In particular,…