Regularity on Near Permutation Semigroups

Abstract

A transformation semigroup over a set X with N elements is said to be a near permutation semigroup if it is generated by a group of permutations on N elements and by a set of transformations of rank N ? 1. The aim of this paper is to determine computationally efficient conditions to test whether or not a near permutation semigroup is regular.     

Semigroups generated by a group and an idempotent

It is well known that the semigroup of all transformations on a finite set X of order n is generated by its group of units, the symmetric group, and any idempotent of rank n ? 1. Similarly, the symmetric inverse semigroup on X is generated by its group of units and any idempotent of rank n ? 1 while the analogous result is true for the semigroup of all n × n matrices over a field.

In this paper we begin a systematic study of the structure of a semigroup S generated by its group G of units and an idempotent ? . The first section consists of preliminaries while the second contains some general results which provide the setting for those which follow.

In the third section we shall investigate the situation where G is a permutation group on a set X of order n and ? is an idempotent of rank n ? 1. In particular, we shall show that any such semigroup S is regular. Furthermore we shall determine when S is an inverse or orthodox semigroup or completely regular semigroup.

The fourth section deals with a special case, that in which G is cyclic. The fifth, and last, deals with the situation where G is dihedral. In both cases, the resulting semigroup has a particularly delicate structure which is of interest in its own right. Both situations are replete with interesting combinatorial gems.

The author was led to the results of this paper by considering the output of a computer program he was writing for generating and analyzing semigroups.     

正则半群的局部化及应用

证明了正则半群S在其幂等元素E（S）所生成的子半群＜E（S）＞上的局部化在同构意义下存在惟一，其为其最大群同态象，同时也给出了其最小群同余。     

On module cohomology of the Fourier algebra of an inverse semigroup

Semigroup Forum - For an inverse semigroup S with the set of idempotents E, we find necessary and sufficient conditions for the Fourier algebra A(S) to be module amenable, module character...     

Congruences on regular semigroups

The kernel of a congruence on a regular semigroup S may be characterized as a set of subsets of S which satisfy the Teissier-Vagner-Preston conditions. A simple construction of the unique congruence associated with such a set is obtained. A more useful characterization of the kernel of a congruence on an orthodox semigroup (a regular semigroup whose idempotents form a subsemigroup) is provided, and the minimal group congruence on an orthodox semigroup is determined.     

Orthodox semigroups whose idempotents satisfy a certain identity

An orthodox semigroup S is called a left [right] inverse semigroup if the set of idempotents of S satisfies the identity xyx=xy [xyx=yx]. Bisimple left [right] inverse semigroups have been studied by Venkatesan [6]. In this paper, we clarify the structure of general left [right] inverse semigroups. Further, we also investigate the structure of orthodox semigroups whose idempotents satisfy the identity xyxzx=xyzx. In particular, it is shown that the set of idempotents of an orthodox semigroup S satisfies xyxzx=xyzx if and only if S is isomorphic to a subdirect product of a left inverse semigroup and a right inverse semigroup.     

Nilpotent Ranks of Semigroups of Partial Transformations

A subset U of a semigroup S is a generating set for S if every element of S may be written as a finite product of elements of U. The rank of a finite semigroup S is the size of a minimal generating set of S, and the nilpotent rank of S is the size of a minimal generating set of S consisting of nilpotents in S. A partition of a q-element subset of the set X_n = {1,2,..., n} is said to be of type τ if the sizes of its classes form the partition τ of the positive integer q ≤ n. A non-trivial partition τ of q consists of k < q elements. For a non-trivial partition τ of q < n, the semigroup S(τ), generated by all the transformations with kernels of type τ, is nilpotent-generated. We prove that if τ is a non-trivial partition of q < n, then the rank and the nilpotent rank of S(τ) are both equal to the number of partitions X_n of type τ.     

E-unitaryR-unipotent semigroups

By making use of McAlister’s P-theorem [4] O’Carroll proved in [5] that every E-unitary inverse semigroup can be embedded into a semidirect product of a semilattice by a group. Recently an alternative proof of this result was published by Wilkinson [10]. In this paper we generalize this theorem by proving that every E-unitaryR-unipotent semigroup S can be embedded into a semidirect product of a band B by a group where B belongs to the variety of bands generated by the band of idempotents of S.     

平衡范畴与半群的双序

研究范畴与半群通过幂等元双序建立的一种自然联系.对每个有幂等元的半群S,其幂等元生成的左、右主理想之集通过双序ω~e,ω~r自然确定两个有子对象、有像且每个包含都右可裂的范畴L(S),R(S),其中态射的性质与S中元素的富足性、正则性有自然对应.利用这个联系,我们定义了"平衡(富足、正规)范畴"概念.对任一平衡(富足、正规)范畴■,我们构造其"锥半群"■,证明■左富足(富足、正则),且每个平衡(富足、正规)范畴■都与某左富足(富足、正则)半群S的左主理想范畴L(S)(作为有子对象的范畴)同构.     

Every group is a maximal subgroup of a naturally occurring free idempotent generated semigroup

The study of the free idempotent generated semigroup IG(E) over a biordered set E has recently received a deal of attention. Let G be a group, let \(n\in\mathbb{N}\) with n≥3 and let E be the biordered set of idempotents of the wreath product \(G\wr \mathcal{T}_{n}\) . We show, in a transparent way, that for e∈E lying in the minimal ideal of \(G\wr\mathcal{T}_{n}\) , the maximal subgroup of e in IG(E) is isomorphic to G. It is known that \(G\wr\mathcal{T}_{n}\) is the endomorphism monoid End F _n (G) of the rank n free G-act F _n (G). Our work is therefore analogous to that of Brittenham, Margolis and Meakin for rank 1 idempotents in full linear monoids. As a corollary we obtain the result of Gray and Ru?kuc that any group can occur as a maximal subgroup of some free idempotent generated semigroup. Unlike their proof, ours involves a natural biordered set and very little machinery.     

Color Lie superalgebras and hopf algebras

We give a generalization of the well-known theorem stating that the category of primitively generated Hopf algebras is equivalent to the category of (restricted) Lie algebras. In so doing, instead of Lie algebras, we consider color Lie superalgebras, and instead of a primitively generated Hopf algebra, we take a Hopf algebra H whose semigroup elements form an Abelian group G =G(H), and H is generated by its relatively primitive elements which supercommute with the elements of G. Translated fromAlgebra i Logika, Vol. 34, No. 4, pp. 420–436, July-August, 1995.Supported by the Russian Foundation for Fundamental Research, grant No. 93-01-16171.     

On (0,1)-matrix semigroups

In this paper we count the number of elements and idempotents in certainD-classes of the semigroup B_n of all binary relations on a set of n elements, namely whose those row and column rank do not exceed 3. This is an announcement of the results; detailed proofs of all results are contained in [2]. The author presented the abstract of this paper in person at Tacoma, Washington, the 676 Meeting of the Amer. Math. Soc., June 20, 1970.     

Finitely approximable regular semigroups

In this note it is proved that a regular semigroup whose subgroups are all finitely approximable is finitely approximable and that the set of idempotents of each principal factor is finite. As a corollary necessary and sufficient conditions are found for certain classes of regular semigroups to be finitely approximable.Translated from Matematicheskie Zametki, Vol. 17, No. 3, pp. 423–432, March, 1975.The author is grateful to L. N. Shevrin and Yu. N. Mukhin for their valuable observations and helpful discussions.     

Positive matrix semigroups with binary diagonals

We show that a semigroup of positive matrices (all entries greater than or equal to zero) with binary diagonals (diagonal entries either 0 or 1) is either decomposable (all matrices in the semigroup have a common zero entry) or is similar, via a positive diagonal matrix, to a binary semigroup (all entries 0 or 1). In the case where the idempotents of minimal rank in S{\mathcal{S}} satisfy a “diagonal disjointness” condition, we obtain additional structural information. In the case where the semigroup is not necessarily positive but has binary diagonals we show that either the semigroup is reducible or the minimal rank ideal is a binary semigroup. We also give generalizations of these results to operators acting on the Hilbert space of square-summable sequences.     

Completely Simple Semigroups,Lie Algebras,and the Road Coloring Problem

Consider a semigroup generated by matrices associated with an edge-coloring of a strongly connected, aperiodic digraph. We call the semigroup Lie-solvable if the Lie algebra generated by its elements is solvable. We show that if the semigroup is Lie-solvable then its kernel is a right group. Next, we study the Lie algebra generated by the kernel. Lie algebras generated by two idempotents are analyzed in detail. We find that these have homomorphic images that are generalized quaternion algebras. We show that if the kernel is not a direct product, then the Lie algebra generated by the kernel is not solvable by describing the structure of these algebras. Finally, we discuss an infinite class of examples that are shown to always produce strongly connected aperiodic digraphs having kernels that are not right groups.     

自同构群是循环群被交换群扩张的有限群

设Ｃ是有限群，ＡｕｔＧ＝ＡＢ，，Ａ是交换群且每Ｓｙｌｏｗ子群的秩≤２，Ｂ是循环群，本文得出了Ｇ的结构，特别地，证明了ＡｕｔＧ是秩≤２的交换群时，Ｇ循环。     

Semigroups generated by nilpotent transformations

In a seminal paper published in 1966, John Howie characterised the elements of _x, the semigroup (under composition) of all total transformations of a set X into itself, which can be written as a product of idempotents in _x. We now initiate the study of the subsemigroup of _x, the semigroup of all partial transformations of X, which is generated by the nilpotents of _x     

Fully invariant transformations and associated groups

It is well known that the symmetric group S _ntogether with one idempotent of rank n- 1 on a finite n-element set Nserves as a set of generators for the semigroup T _nof all the total transformations on N. It is also well known that the singular part Sing _n of T _n can be generated by a set of idempotents of rank n- 1. The purpose of this paper is to begin an investigation of the way in which Sing_nand its subsemigroups can be generated by the conjugates of a subset of elements of T _n by a subgroup of S _n . We look for the smallest subset of elements of T _n that will serve and, correspondingly, for a characterization of those subgroups of S _n that will serve. Using some techniques from graph theory we prove our main result:the conjugates of a single transformation of rank n- 1 under Gsuffice to generate Sing_nif and only if Gis what we define to be a 2-block transitive subgroup of S _n .     

Factor-powers of finite symmetric groups

To a transformation semigroup (S, M) we assign a new semigroupFP(S) called the factor-power of the semigroup (S, M). Then we apply this construction to the symmetric groupS _n. Some combinatorial properties of the semigroupFP(S _n) are studied; in particular, we investigate its relationship with the semigroup of 2-stochastic matrices of ordern and the structure of its idempotents. The idempotents are used in characterizingFP(S _n) as an extremal subsemigroup of the semigroupB _n of all binary relations of ann-element set and also in the proof of the fact thatFP(S _n) contains almost all elements ofB _n.Translated fromMatematicheskie Zametki, Vol. 58, No. 2, pp. 176–188, August, 1995.This work was partially supported by the Foundation for Basic Research of the Ukrainian State Committee on Science and Technology.