Related papers: On a probabilistic problem on finite semigroups

In this paper we present a complete description of a stochastic semigroup of finite-dimensional projections in Hilbert space. The geometry of such semigroups is characterized by the asymptotic behavior of the widths of compact subsets with…

Inspired by results for graph $C^*$-algebras, we investigate connections between the ideal structure of an inverse semigroup $S$ and that of its tight $C^*$-algebra by relating ideals in $S$ to certain open invariant sets in the associated…

Let $R$ be a finite ring and $r \in R$. The aim of this paper is to study the probability that the commutator of a randomly chosen pair of elements of $R$ equals $r$.

The rank of a semigroup is the cardinality of a smallest generating set. In this paper we compute the rank of the endomorphism monoid of a non-trivial uniform partition of a finite set, that is, the semigroup of those transformations of a…

The $\mathcal{R}$-height of a semigroup $S$ is the height of the poset of $\mathcal{R}$-classes of $S,$ i.e. the supremum of the lengths of chains of $\mathcal{R}$-classes. Given a semigroup $S$ with finite $\mathcal{R}$-height, we…

The (.)_reg construction was introduced in order to make an arbitrary semigroup S divide a regular semigroup (S)_reg which shares some important properties with S (e.g., finiteness, subgroups, torsion bounds, J-order structure). We show…

In this paper we consider a number of finiteness conditions for semigroups related to their ideal structure, and ask whether such conditions are preserved by sub- or supersemigroups with finite Rees or Green index. Specific properties under…

A method to construct in explicit form the generators of the simple roots of an arbitrary finite-dimensional representation of a quantum or standard semisimple algebra is found. The method is based on general results from the global theory…

We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of…

We give a characterization of a variation of constants type estimate relating two positive semigroups on (possibly different) $L_p$-spaces to one another in terms of corresponding estimates for the respective generators and of estimates for…

A subset of a group invariably generates the group if it generates even when we replace the elements by any of their conjugates. In a 2016 paper, Pemantle, Peres and Rivin show that the probability that four randomly selected elements…

We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value…

We prove that a nonempty subset $B$ of a regular hypersemigroup $H$ is a bi-ideal of $H$ if and only if it is represented in the form $B=A*C$ where $A$ is a right ideal and $C$ a left ideal of $H$. We also show that an hypersemigroup $H$ is…

We use an interpretation of projective planes to show the inherent nondualisability of some finite semigroups. The method is sufficiently flexible to demonstrate the nondualisability of (asymptotically) almost all finite semigroups as well…

In this paper, the complete algebraic structure of finite semisimple group algebra of a normally monomial group is described. The main result is illustrated by computing the explicit Wedderburn decomposition of finite semisimple group…

A smallest generating set of a semigroup is a generating set of the smallest cardinality. Similarly, an irredundant generating set $X$ is a generating set such that no proper subset of $X$ is also a generating set. A semigroup $S$ is…

For any numerical semigroup $S$, there are infinitely many numerical symmetric semigroups $T$ such that $S=\frac{T}{2}$ is their half. We are studying the Betti numbers of the numerical semigroup ring $K[T]$ when $S$ is a 3-generated…

In this paper, our aim is twofold: First, by using the technique of gluing semigroups, we give infinitely many families of a projective closure with the Cohen-Macaulay (Gorenstein) property. Also, we give an effective technique for…

We first obtain explicit upper bounds for the proportion of elements in a finite classical group G with a given characteristic polynomial. We use this to complete the proof that the proportion of elements of a finite classical group G which…

We show how to efficiently count and generate uniformly at random finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$ of a given isomorphism type. The method to achieve these results relies on a natural map of…