On the Cayley graphs of completely simple semigroups. (Q535219): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Yan-Feng Luo / rank | |||
Property / author | |||
Property / author: Yan-Feng Luo / rank | |||
Normal rank | |||
Property / review text | |||
This paper deals with the geometric objects ``Cayley graphs'' over the special algebraic structure ``completely simple semigroups'' \(S=\mathcal M[G;I,\Lambda;P]\). The definition and detailed properties of the semigroup \(S\) can be found in Howie's famous book under the name of ``Rees Theorem''. Up to isomorphism, all completely simple semigroups can be defined as \(S\) above. As depicted in the introduction part of this paper, there are so many studies of Cayley graphs of (infinite) semigroups. For a completely simple semigroup \(S=\mathcal M[G;I,\Lambda;P]\) and for a non-empty subset \(A\) of \(S\), the authors present the following main results in the paper under review: i) A sufficient condition for a Cayley graph \(\text{Cay}(S,A)\) of \(S\) to be a disjoint union of complete graphs. ii) Necessary and sufficient condition for the special subgraphs (related to \(\mathcal L\)-classes, \(\mathcal R\)-classes and \(\mathcal H\)-classes) of \(\text{Cay}(S,A)\) to be strongly connected bipartite. Honestly it is quite a well written and important paper. However, I have some doubts about the first result. It is well known that the following are equivalent: \(\bullet\) \(S\) is a completely simple semigroup. \(\bullet\) \(S\) contains a minimal right (left) ideal. \(\bullet\) \(S\) is the union of all its minimal right and left ideals. (In fact, detailed references about the proof of this can be found in [Proc. Camb. Philos. Soc. 57, 234-236 (1961; Zbl 0239.20077)], written by \textit{R. McFadden} and \textit{H. Schneider}.) In this paper, the first result basically states that each of the subgraphs \(T_\lambda\) is complete. But, since \(S\) is a completely simple semigroup and since it is the union of all its left and right ideals, I suspect this first result can be seen directly by following the definitions of left (and right) ideals in any semigroup and the definition of \(T_\lambda\) as in here. I mean the problem can be simplified as ``whether the minimal left (or right) ideal of a semigroup represented by a complete graph'', and so the answer seems clear to me. | |||
Property / review text: This paper deals with the geometric objects ``Cayley graphs'' over the special algebraic structure ``completely simple semigroups'' \(S=\mathcal M[G;I,\Lambda;P]\). The definition and detailed properties of the semigroup \(S\) can be found in Howie's famous book under the name of ``Rees Theorem''. Up to isomorphism, all completely simple semigroups can be defined as \(S\) above. As depicted in the introduction part of this paper, there are so many studies of Cayley graphs of (infinite) semigroups. For a completely simple semigroup \(S=\mathcal M[G;I,\Lambda;P]\) and for a non-empty subset \(A\) of \(S\), the authors present the following main results in the paper under review: i) A sufficient condition for a Cayley graph \(\text{Cay}(S,A)\) of \(S\) to be a disjoint union of complete graphs. ii) Necessary and sufficient condition for the special subgraphs (related to \(\mathcal L\)-classes, \(\mathcal R\)-classes and \(\mathcal H\)-classes) of \(\text{Cay}(S,A)\) to be strongly connected bipartite. Honestly it is quite a well written and important paper. However, I have some doubts about the first result. It is well known that the following are equivalent: \(\bullet\) \(S\) is a completely simple semigroup. \(\bullet\) \(S\) contains a minimal right (left) ideal. \(\bullet\) \(S\) is the union of all its minimal right and left ideals. (In fact, detailed references about the proof of this can be found in [Proc. Camb. Philos. Soc. 57, 234-236 (1961; Zbl 0239.20077)], written by \textit{R. McFadden} and \textit{H. Schneider}.) In this paper, the first result basically states that each of the subgraphs \(T_\lambda\) is complete. But, since \(S\) is a completely simple semigroup and since it is the union of all its left and right ideals, I suspect this first result can be seen directly by following the definitions of left (and right) ideals in any semigroup and the definition of \(T_\lambda\) as in here. I mean the problem can be simplified as ``whether the minimal left (or right) ideal of a semigroup represented by a complete graph'', and so the answer seems clear to me. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20M10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20M18 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20M05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20M35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5886836 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Cayley graphs | |||
Property / zbMATH Keywords: Cayley graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
completely simple semigroups | |||
Property / zbMATH Keywords: completely simple semigroups / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
complete graphs | |||
Property / zbMATH Keywords: complete graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
subgraphs | |||
Property / zbMATH Keywords: subgraphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
bipartite graphs | |||
Property / zbMATH Keywords: bipartite graphs / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Ahmet Sinan Cevik / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00233-010-9267-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2021255209 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Cayley graphs of bands / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2716030 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5581680 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Directed graphs and combinatorial properties of completely regular semigroups. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Semigroups satisfying minimal conditions II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4846425 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4445976 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Cayley graphs of inverse semigroups. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On transitive Cayley graphs of groups and semigroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A combinatorial property and Cayley graphs of semigroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cayley graphs as classifiers for data mining: the influence of asymmetries / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the isomorphism problem for finite Cayley graphs of bounded valency / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: SELF-COMPLEMENTARY VERTEX-TRANSITIVE GRAPHS NEED NOT BE CAYLEY GRAPHS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterizations of Clifford semigroup digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4352275 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite normal edge-transitive Cayley graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3950553 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(D\)-saturated property of the Cayley graphs of semigroups. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs of semigroups / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:39, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the Cayley graphs of completely simple semigroups. |
scientific article |
Statements
On the Cayley graphs of completely simple semigroups. (English)
0 references
11 May 2011
0 references
This paper deals with the geometric objects ``Cayley graphs'' over the special algebraic structure ``completely simple semigroups'' \(S=\mathcal M[G;I,\Lambda;P]\). The definition and detailed properties of the semigroup \(S\) can be found in Howie's famous book under the name of ``Rees Theorem''. Up to isomorphism, all completely simple semigroups can be defined as \(S\) above. As depicted in the introduction part of this paper, there are so many studies of Cayley graphs of (infinite) semigroups. For a completely simple semigroup \(S=\mathcal M[G;I,\Lambda;P]\) and for a non-empty subset \(A\) of \(S\), the authors present the following main results in the paper under review: i) A sufficient condition for a Cayley graph \(\text{Cay}(S,A)\) of \(S\) to be a disjoint union of complete graphs. ii) Necessary and sufficient condition for the special subgraphs (related to \(\mathcal L\)-classes, \(\mathcal R\)-classes and \(\mathcal H\)-classes) of \(\text{Cay}(S,A)\) to be strongly connected bipartite. Honestly it is quite a well written and important paper. However, I have some doubts about the first result. It is well known that the following are equivalent: \(\bullet\) \(S\) is a completely simple semigroup. \(\bullet\) \(S\) contains a minimal right (left) ideal. \(\bullet\) \(S\) is the union of all its minimal right and left ideals. (In fact, detailed references about the proof of this can be found in [Proc. Camb. Philos. Soc. 57, 234-236 (1961; Zbl 0239.20077)], written by \textit{R. McFadden} and \textit{H. Schneider}.) In this paper, the first result basically states that each of the subgraphs \(T_\lambda\) is complete. But, since \(S\) is a completely simple semigroup and since it is the union of all its left and right ideals, I suspect this first result can be seen directly by following the definitions of left (and right) ideals in any semigroup and the definition of \(T_\lambda\) as in here. I mean the problem can be simplified as ``whether the minimal left (or right) ideal of a semigroup represented by a complete graph'', and so the answer seems clear to me.
0 references
Cayley graphs
0 references
completely simple semigroups
0 references
complete graphs
0 references
subgraphs
0 references
bipartite graphs
0 references