Related papers: On the probability that two elements of a finite s…

Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to…

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…

Let $G$ be a real Lie group, $\Lambda\subseteq G$ a lattice, and $X=G/\Lambda$. We fix a probability measure $\mu$ on $G$ and consider the left random walk induced on $X$. It is assumed that $\mu$ is aperiodic, has a finite first moment,…

Let $R$ be a finite ring. The commuting probability of $R$ is the probability that any two randomly chosen elements of $R$ commute. In this paper, we obtain some bounds for commuting probability of $R$.

We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which seem to be necessary to make the…

Any semigroup $\mathcal{S}$ of stochastic matrices induces a semigroup majorization relation $\prec^{\mathcal{S}}$ on the set $\Delta_{n-1}$ of probability $n$-vectors. Pick $X,Y$ at random in $\Delta_{n-1}$: what is the probability that…

A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly…

In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…

The structure of transformation semigroups on a finite set is analyzed by introducing a hierarchy of functions mapping subsets to subsets. The resulting hierarchy of semigroups has a corresponding hierarchy of minimal ideals, or kernels.…

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 discuss the question of how to pick a matrix uniformly (in an appropriate sense) at random from groups big and small. We give algorithms in some cases, and indicate interesting problems in others.

We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…

We determine when an orthodox semigroup S has a permutation that sends each member of S to one of its inverses and show that if such a permutation exists, it may be taken to be an involution. In the case of a finite orthodox semigroup the…

We consider random walk on a finite group $G$ as follows. We can consider $G$ as a group of substitutions. Randomly (i.e. with probability $U(g)=|G|^{-1}$ ) we choose a substitution $g \in G$ and execute it twice in a row, i.e. execute a…

Let $S$ be a semigroup, $\Lambda$ a non-empty set and $P$ a mapping of $\Lambda$ into $S$. The set $S\times \Lambda$ together with the operation $\circ _P$ defined by $(s, \lambda)\circ _P(t, \mu )=(sP(\lambda)t, \mu )$ form a semigroup…

Let $G$ be a finite group, and let $\kappa(G)$ be the probability that elements $g$, $h\in G$ are conjugate, when $g$ and $h$ are chosen independently and uniformly at random. The paper classifies those groups $G$ such that $\kappa(G) \geq…

In this paper, we introduce a novel approach for generating random elements of a finite group given a set of generators of that. Our method draws upon combinatorial group theory and automata theory to achieve this objective. Furthermore, we…

We say that two elements of a group or semigroup are $\Bbbk$-linear conjugates if their images under any linear representation over $\Bbbk$ are conjugate matrices. In this paper we characterize $\Bbbk$-linear conjugacy for finite semigroups…

Let $G$ be a finite simple group. In this paper we consider the existence of small subsets $A$ of $G$ with the property that, if $y \in G$ is chosen uniformly at random, then with high probability $y$ invariably generates $G$ together with…

When a semigroup has a unary operation, it is possible to define two binary operations, namely, left and right division. In addition it is well known that groups can be defined in terms of those two divisions. The aim of this paper is to…