arXiv math/07026912007-02-23math.RA

The loop problem for Rees matrix semigroups

Mark Kambites

备注：: 13 pages

英文摘要：

We study the relationship between the loop problem of a semigroup, and that of a Rees matrix construction (with or without zero) over the semigroup. This allows us to characterize exactly those completely zero-simple semigroups for which the loop problem is context-free. We also establish some results concerning loop problems for subsemigroups and Rees quotients.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Automatic Rees matrix semigroups over categories

We consider the preservation of the properties of automaticity and prefix-automaticity in Rees matrix semigroups over semigroupoids and small categories. Some of our results are new or improve upon existing results in the single-object case of Rees matrix semigroups over semigroups.

2005-09-14math.RA

Rees quotients of numerical semigroups

We introduce a class of finite semigroups obtained by considering Rees quotients of numerical semigroups. Several natural questions concerning this class, as well as particular subclasses obtained by considering some special ideals, are answered while others remain open. We exhibit nice presentations for these semigroups and prove that the Rees quotients by ideals of N, the positive integers under addition, constitute a set of generators for the pseudovariety of commutative and nilpotent semigroups.

2012-10-09math.RA

Complexity problems associated with matrix rings, matrix semigroups and Rees matrix semigroups

Complexity problems associated with finite rings and finite semigroups, particularly semigroups of matrices over a field and the Rees matrix semigroups, are examined. Let M_nF be the ring of n x n matrices over the finite field F and let T_nF be the multiplicative semigroup of n x n matrices over the finite field F. It is proved that for any finite field F and positive integer n >= 2, the polynomial equivalence problem for the T_n F is co-NPcomplete, thus POL-EQ_Σ(M_n F) (POL-EQ_Σis a polynomial equivalence problem for which polynomials are presented as sums of monomials) is also co-NP-complet…

1997-11-03math.RA

Uniform decision problems in automatic semigroups

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 problem well-defined, the uniform word problem for semigroups described by automatic structures is decidable. Under the same conditions, we show that one can also decide whether the semigroup is completely simple or completely zero-simple; in the case that it is, one can compute a Rees matrix representation for the semigroup, in the form of a Rees matrix to…

2005-09-15math.RA

Morita equivalence of inverse semigroups

We describe how to construct all inverse semigroups Morita equivalent to a given inverse semigroup. This is done by taking the maximum inverse images of the regular Rees matrix semigroups over the inverse semigroup where the sandwich matrix satisfies what we call the McAlister conditions.

2011-04-13math.RA

完全简单半群的交换图

Commuting graphs of completely simple semigroups

本研究刻画群上Rees矩阵半群的交换图及其多项性质，推导完全简单半群交换图的性质与对应图类，还限定了群交换图部分性质的取值范围。

2024-12-09math.COmath.GRmath.RA

更多相关论文收起更多论文

Primitive representations of finite semigroups I

Primitive representations of finite groups as well as primitive finite groups were classified in the O'Nan-Scott Theorem. In this paper we classify faithful finite primitive semigroup representations. To each finite primitive representation, we associate an invariant, a finite dimensional matirix with entries in a primitive finite groups representation. To a large extent, this matrix determines the representation. In later papers in this series the invariant is further explored. Our primitivity resoullts rely on two main ideas, one of which is a small but important part of the theory of tame a…

1997-11-22math.RA

Computing finite semigroups

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 which these results apply include many important classes: transformation semigroups, partial permutation semigroups and inverse semigroups, partition monoids, matrix semigroups, and subsemigroups of finite regular Rees matrix and $0$-matrix semigroups over groups. For any subsemigroup of such a semigroup, it is possible to, among other things, efficiently co…

2018-08-23math.RA

The loop problem for monoids and semigroups

We propose a way of associating to each finitely generated monoid or semigroup a formal language, called its loop problem. In the case of a group, the loop problem is essentially the same as the word problem in the sense of combinatorial group theory. Like the word problem for groups, the loop problem is regular if and only if the monoid is finite. We study also the case in which the loop problem is context-free, showing that a celebrated group-theoretic result of Muller and Schupp extends to describe completely simple semigroups with context-free loop problems. We consider also right cancella…

2006-09-11math.RA

On the Classification of Finite Semigroups and RA-loop with the Hyperbolic Property

We classify the finite semigroups S, for which all the Z-orders O of the rational Q-algebra QS, is such that the unit group U(O) is hyperbolic. We also classify the RA-loops L, for which the unit loop U(ZL) does not contain any free abelian subgroup of rank two.

2007-04-20math.GMmath.RA

环半群的仿射Schur--Weyl理论与多项式表示

Affine Schur--Weyl theory for loop Semigroups and polynomial representations

Tongji University（同济大学）

针对Laurent多项式环半群发展仿射Schur-Weyl理论，证明相关代数同态的满射性、双中心化子性质，确定仿射Schur代数中心，分类其有限维不可约多项式表示，得到不可约特征的显式公式。

2026-10-09math.RA