scholarly journals On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups

2016 ◽  
Vol 653 ◽  
pp. 87-96
Author(s):  
Tom Bourne ◽  
Nik Ruškuc
Keyword(s):  
Zero Matrix ◽  
Matrix Semigroups

A Perron-Frobenius-type Theorem for Positive Matrix Semigroups

Positivity ◽  
2016 ◽  
Vol 21 (1) ◽  
pp. 61-72
Author(s):  
L. Livshits ◽  
G. MacDonald ◽  
H. Radjavi
Keyword(s):  
Type Theorem ◽  
Positive Matrix ◽  
Matrix Semigroups

scholarly journals Complex representations of matrix semigroups

1991 ◽  
Vol 323 (2) ◽  
pp. 563-581 ◽  
Author(s):  
Jan Okniński ◽  
Mohan S. Putcha
Keyword(s):  
Matrix Semigroups

Complex Representations of Matrix Semigroups

1991 ◽  
Vol 323 (2) ◽  
pp. 563 ◽  
Author(s):  
Jan Okninski ◽  
Mohan S. Putcha
Keyword(s):  
Matrix Semigroups

scholarly journals On bisimple semigroups generated by a finite number of idempotents

1982 ◽  
Vol 33 (1) ◽  
pp. 92-101 ◽  
Author(s):  
Karl Byleen
Keyword(s):  
Finite Number ◽  
Partial Order ◽  
Natural Partial Order ◽  
Rees Matrix Semigroups ◽  
Matrix Semigroups ◽  
Completely Simple

AbstractNon-completely simple bisimple semigroups S which are generated by a finite number of idempotents are studied by means of Rees matrix semigroups over local submonoids eSe, e = e2 ∈ S. If under the natural partial order on the set Es of idempotents of such a semigroup S the sets ω(e) = {ƒ ∈ Es: ƒ ≤ e} for each e ∈ Es are well-ordered, then S is shown to contain a subsemigroup isomorphic to Sp4, the fundamental four-spiral semigroup. A non-completely simple hisimple semigroup is constructed which is generated by 5 idempotents but which does not contain a subsemigroup isomorphic to Sp4.

scholarly journals Generators and relations of Rees matrix semigroups

1999 ◽  
Vol 42 (3) ◽  
pp. 481-495 ◽  
Author(s):  
H. Ayik ◽  
N. Ruškuc
Keyword(s):  
Rees Matrix Semigroup ◽  
Finitely Generated ◽  
Finite Generation ◽  
Generators And Relations ◽  
Rees Matrix Semigroups ◽  
Finite Presentability ◽  
Matrix Semigroup ◽  
Finitely Presented ◽  
Matrix Semigroups ◽  
The Ideal

In this paper we consider finite generation and finite presentability of Rees matrix semigroups (with or without zero) over arbitrary semigroups. The main result states that a Rees matrix semigroup M[S; I, J; P] is finitely generated (respectively, finitely presented) if and only if S is finitely generated (respectively, finitely presented), and the sets I, J and S\U are finite, where U is the ideal of S generated by the entries of P.

Certain rees matrix semigroups with universal properties

1981 ◽  
Vol 22 (1) ◽  
pp. 101-118 ◽  
Author(s):  
Mario Petrich ◽  
Norman R. Reilly
Keyword(s):  
Rees Matrix Semigroups ◽  
Universal Properties ◽  
Matrix Semigroups

scholarly journals Coherency and Constructions for Monoids

2020 ◽  
Vol 71 (4) ◽  
pp. 1461-1488
Author(s):  
Yang Dandan ◽  
Victoria Gould ◽  
Miklós Hartmann ◽  
Nik Ruškuc ◽  
Rida-E Zenab
Keyword(s):  
Finiteness Condition ◽  
Direct Products ◽  
Finitely Generated ◽  
Rees Matrix Semigroups ◽  
The Relationship ◽  
Brandt Semigroups ◽  
Finitely Presented ◽  
Matrix Semigroups

Abstract A monoid S is right coherent if every finitely generated subact of every finitely presented right S-act is finitely presented. This is a finiteness condition, and we investigate whether or not it is preserved under some standard algebraic and semigroup theoretic constructions: subsemigroups, homomorphic images, direct products, Rees matrix semigroups, including Brandt semigroups, and Bruck–Reilly extensions. We also investigate the relationship with the property of being weakly right noetherian, which requires all right ideals of S to be finitely generated.

Sign in / Sign up

Export Citation Format

Share Document