Related papers: Embedding in a finite 2-generator semigroup

Let $G$ be a finite solvable group. Then $G$ always has a useful presentation, which we call a "long presentation". Using a "long presentation" of $G$, we present an inductive method of constructing the irreducible representations of $G$…

We construct integrable modifications of 2d lattice gauge theories with finite gauge groups.

We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…

We show that the semigroup of real linear fractional transformations on a proper subinterval of the real line does not admit any 2-generator dense subsemigroups, and then we construct a 3-parameter family of examples of 3-generator dense…

We derive "numerical" criteria for the existence of embeddings of representations of finite dimensional algebras.

In these notes we will survey recent results on various finitary approximation properties of infinite groups. We will discuss various restrictions on groups that are approximated for example by finite solvable groups or finite-dimensional…

Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…

In this paper we study grouplike monoids, these are monoids that contain a group to which we add an ordered set of idempotents. We classify finite categories with two objects having grouplike endomorphism monoids, and we give a count of…

Here we show that a finite nilpotent group is 2-closed if and only if it is either cyclic or a direct product of a generalized quaternion group with a cyclic group of odd order.

We classify the twisted tensor products of a finite set algebra with a two elements set algebra using colored quivers obtained through considerations analogous to Ore extensions. This provides also a classification of entwining structures…

We describe the primitive central idempotents of the group algebra over a number field of finite monomial groups. We give also a description of the Wedderburn decomposition of the group algebra over a number field for finite strongly…

We show that double cosets of the infinite symmetric group with respect to some special subgroups admit natural structures of semigroups. We interpret elements of such semigroups in combinatorial terms (chips, colored graphs,…

We investigate various groupoids associated to an arbitrary inverse semigroup with zero. We show that the groupoid of filters with respect to the natural partial order is isomorphic to the groupoid of germs arising from the standard action…

We indicate a natural generalization of the concept of subgroup commutativity degree of a finite group and a list of open problems on these new concepts.

In this paper we discuss various aspects of the problem of determining the minimal dimension of an injective linear representation of a finite semigroup over a field. We outline some general techniques and results, and apply them to…

In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…

Regular abelian semigroups are isomorphic to a direct product of an abelian group and a rectangular band (Warne, 1994). Seeking for a similar result for nilpotency, solvability and supernilpotency of regular semigroups, we obtain that…

We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…

We describe the structure of finite Boolean inverse monoids and apply our results to the representation theory of finite inverse semigroups. We then generalize to semisimple Boolean inverse semigroups.

In this note we study the finite groups whose subgroup lattices are dismantlable.