On the Rank of the Semigroup TE(X)

${\cal T}_X $ denotes the full transformation semigroup on a set $ X $. For a nontrivial equivalence $E$ on $X$, let \[ T_E (X) =\{ f\in {\cal T}_X : \forall \, (a,b)\in E,\, (af,bf)\in E \} . \] Then $T_E (X) $ is exactly the semigroup of continuous selfmaps of the topological space $X$ for which the collection of all $E$-classes is a basis. In this paper, we first discuss the rank of the homeomorphism group $G$, and then consider the rank of $T_E (X)$ for a special case that the set $X$ is finite and that each class of the equivalence $E$ has the same cardinality. Finally, the rank of the closed selfmap semigroup $\Gamma(X)$ of the space $X$ is observed. We conclude that the rank of $G$ is no more than 4, the rank of $T_E (X)$ is no more than 6 and the rank of $\Gamma(X)$ is no more than 5.     

半群ASn的秩

设A_n和Sing_n分别是X_n上的交错群和奇异变换半群.考虑变换半群AS_n=A_n∪Sing_n,证明了变换半群AS_n的秩为3.     

Inverse Near Permutation Semigroups

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 G of permutations on N elements and by a set H of transformations of rank N - 1. In this paper we give necessary and sufficient conditions for a near permutation semigroup S = ‹G,H›, where H is a group, to be inverse. Moreover, we obtain conditions which guarantee that its semilattice of idempotents is generated by the idempotents of S of rank greater than N - 2 or N - 3.     

The semigroup generated by a unitary orbit of a singular matrix

We investigate the structure of the multiplicative semigroup generated by the set of matrices that are unitarily equivalent to a given singular matrix A. In particular, we give necessary and sufficient conditions, in terms of the singular values of A, for such a semigroup to consist of all matrices of rank not exceeding the rank of A.     

模糊互补判断矩阵的一个通用排序公式及其保序性研究

基于模糊互补判断矩阵的一致性转化,利用行和归一化方法,得到了模糊互补判断矩阵的一个排序公式,指出目前基于模糊加性一致的排序公式大多都是所提方法的特例,并给出了在增加一个或一组新元素时的保序性条件.     

半群OI_n(k)的秩

设OI_n是[n]上的保序严格部分一一变换半群.对任意1≤k≤n-1,研究半群OI_n(k)={α∈OI_n:(■x∈dom(α))x≤k■xα≤k}的秩,证明了半群OI_n(k)的秩为n+1.     

The semigroup generated by a unitary orbit of a singular matrix

We investigate the structure of the multiplicative semigroup generated by the set of matrices that are unitarily equivalent to a given singular matrix A. In particular, we give necessary and sufficient conditions, in terms of the singular values of A, for such a semigroup to consist of all matrices of rank not exceeding the rank of A.     

半群PO_(n,r)的秩

设POn为Xn上的保序部分变换半群.对任意的2≤r≤n一1,考虑半群PO_(n,r)={α∈PO_n:Im(α)■[r]}([r]={1,2,…,r}),证明了PO_(n,r)的秩为Σn-1k=r(nk)((k-1)(r-1))+r-1.     

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.     

The rank of the endomorphism monoid of a uniform partition

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 finite set that leave a non-trivial uniform partition invariant. That involves proving that the rank of a wreath product of two symmetric groups is two and then use the fact that the endomorphism monoid of a partition is isomorphic to a wreath product of two full transformation semigroups. The calculation of the rank of these semigroups solves an open question.     

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.     

Generating Sets of Completely 0-Simple Semigroups

ABSTRACT

A formula for the rank of an arbitrary finite completely 0-simple semigroup, represented as a Rees matrix semigroup ?⁰[G; I, Λ; P], is given. The result generalizes that of Ru?kuc concerning the rank of connected finite completely 0-simple semigroups. The rank is expressed in terms of |I|, |Λ|, the number of connected components k of P, and a number r _min, which we define. We go on to show that the number r _min is expressible in terms of a family of subgroups of G, the members of which are in one-to-one correspondence with, and determined by the nonzero entries of, the components of P. A number of applications are given, including a generalization of a result of Gomes and Howie concerning the rank of an arbitrary Brandt semigroup B(G,{1,…,n}).     

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.     

Identities of semigroup algebras of completely O-simple semigroups

Let H = M⁰(G; I, ; P) be a Rees semigroup of matrix type with sandwich matrix P over a group H⁰ with zero. If F is a subgroup of G of finite index and X is a system of representatives of the left cosets of F in G, then with the matrix P there is associated in a natural way a matrix P(F, X) over the group F⁰ with zero. Our main result: the semigroup algebra K[H] of H over a field K of characteristic 0 satisfies an identity if and only if G has an Abelian subgroup F of finite index and, for any X, the matrix P(F, X) has finite determinant rank.Translated from Matematicheskie Zametki, Vol. 18, No. 2, pp. 203–212, August, 1975.     

半群O_n(k)的秩

设O_n是有限链[n]上的保序变换半群.对任意1≤k≤n-1,研究半群O_n(k)={α∈O_n:(x∈[n]x≤k→xα≤k}的秩和幂等元秩,证明了半群O_n(k)的秩为2n-3.进一步,得到了半群O_n(k)(2≤k≤n-1)的幂等元秩为n和半群O_n(1)的幂等元秩为n-1.     

Locally compact subgroups of the spectrum of the measure algebra III

The maximal ideal space of the measure algebra of a locally compact abelian (LCA) group has the structure of a compact commutative semitopological semigroup (separately continuous multiplication). Idempotents in the semigroup correspond to certain algebraic projections on the measure algebra. In this paper we study the maximal groups about certain idempotents. This research was partially supported by NSF contract number GP-19852 and GP-31483X.     

Positivity and matrix semigroups

We study various aspects of how certain positivity assumptions on complex matrix semigroups affect their structure. Our main result is that every irreducible group of complex matrices with nonnegative diagonal entries is simultaneously similar to a group of weighted permutations. We also consider the corresponding question for semigroups and discuss the effect of the assumption that a fixed linear functional has nonnegative values when restricted to a given semigroup.     

Derived Rees Matrix Semigroups as Semigroups of Transformations

An ordered pair (e,f) of idempotents of a regular semigroup is called a skew pair if ef is not idempotent whereas fe is idempotent. Previously [1] we have established that there are four distinct types of skew pairs of idempotents. We have also described (as quotient semigroups of certain regular Rees matrix semigroups [2]) the structure of the smallest regular semigroups that contain precisely one skew pair of each of the four types, there being to within isomorphism ten such semigroups. These we call the derived Rees matrix semigroups. In the particular case of full transformation semigroups we proved in [3] that T_X contains all four skew pairs of idempotents if and only if |X| ≥ 6. Here we prove that T_X contains all ten derived Rees matrix semigroups if and only if |X| ≥ 7.     

Rank one perturbations of not semibounded operators

Rank one perturbations of selfadjoint operators which are not necessarily semibounded are studied in the present paper. It is proven that such perturbations are uniquely defined, if they are bounded in the sense of forms. We also show that form unbounded rank one perturbations can be uniquely defined if the original operator and the perturbation are homogeneous with respect to a certain one parameter semigroup. The perturbed operator is defined using the extension theory for symmetric operators. The resolvent of the perturbed operator is calculated using Krein's formula. It is proven that every rank one perturbation can be approximated in the operator norm. We prove that some form unbounded perturbations can be approximated in the strong resolvent sense without renormalization of the coupling constant only if the original operator is not semibounded. The present approach is applied to study first derivative and Dirac operators with point interaction, in one dimension.     

Semigroups and the Generalized Road Coloring Problem

The road coloring problem has been open for some 25 years. This paper shows how algebraic methods, specifically semigroup theory, can be used to both generalize and shed light on the problem. Given a strongly connected digraph, the notion of a coloring semigroup is defined. The main result shows that the existence of a coloring semigroup whose kernel is a minimum rank right group of rank t implies the digraph is periodic of order t.