首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
Summary IfS→2 X is a surjective semigroup homomorphism, then the ultrafilters onX correspond biunivocally to the minimal prime ideals to the kernel. Some examples are given.
Riassunto SeS→2 X è un omormorfismo surgettivo di semigruppi, allora gli ultrafiltri suX corrispondono biunivocamente agli ideali primi minimali del nucleo. Vengono dati degli esempi.
  相似文献   

2.
3.
The Ore sufficient condition for imbedding of a semigroup in a group is extended to the case of topological semigroups. Imbedding conditions for a locally compact topological semigroup in a locally bicompact topological group are studied.Translated from Matematicheskie Zametki, Vol. 6, No. 4, October, 1969, pp. 401–409.  相似文献   

4.
In this paper we propose and explore a general notion of chaos in the abstract context of continuous actions of topological semigroups and show that any chaotic action on a Hausdorff uniform space is sensitive to initial conditions.  相似文献   

5.
We prove that a countably compact Clifford topological semigroup S is metrizable if and only if the set E={eS:ee=e} of idempotents of S is a metrizable G δ -set in S.  相似文献   

6.
7.
8.
We find strong relationships between the zero-divisor graphs of apparently disparate kinds of nilpotent-free semigroups by introducing the notion of an Armendariz map between such semigroups, which preserves many graph-theoretic invariants. We use it to give relationships between the zero-divisor graph of a ring, a polynomial ring, and the annihilating-ideal graph. Then we give relationships between the zero-divisor graphs of certain topological spaces (so-called pearled spaces), prime spectra, maximal spectra, tensor-product semigroups, and the semigroup of ideals under addition, obtaining surprisingly strong structure theorems relating ring-theoretic and topological properties to graph-theoretic invariants of the corresponding graphs.  相似文献   

9.
The undirected power graph G(S) of a semigroup S is an undirected graph whose vertex set is S and two vertices a,bS are adjacent if and only if ab and a m =b or b m =a for some positive integer m. In this paper we characterize the class of semigroups S for which G(S) is connected or complete. As a consequence we prove that G(G) is connected for any finite group G and G(G) is complete if and only if G is a cyclic group of order 1 or p m . Particular attention is given to the multiplicative semigroup ℤ n and its subgroup U n , where G(U n ) is a major component of G(ℤ n ). It is proved that G(U n ) is complete if and only if n=1,2,4,p or 2p, where p is a Fermat prime. In general, we compute the number of edges of G(G) for a finite group G and apply this result to determine the values of n for which G(U n ) is planar. Finally we show that for any cyclic group of order greater than or equal to 3, G(G) is Hamiltonian and list some values of n for which G(U n ) has no Hamiltonian cycle.  相似文献   

10.
《Journal of Algebra》2005,283(1):190-198
The zero divisor graph of a commutative semigroup with zero is a graph whose vertices are the nonzero zero divisors of the semigroup, with two distinct vertices joined by an edge in case their product in the semigroup is zero. We continue the study of this construction and its extension to a simplicial complex.  相似文献   

11.
A remarkable subclass of linearly ordered semigroups, called interval semigroups, defined on connected and compact sets is studied. Particularly, a generalized notion of o-isomorphism, called weak o-embedding, of such semigroups into the real numbers with standard operations is given. A representation theorem for the weak o-embedding of topological Archimedean interval semigroups with no zero divisors is provided. Such characterization is shown to be the best one possible.  相似文献   

12.
Boolean planarity characterization of graphs   总被引:1,自引:0,他引:1  
Although many criteria for testing the planarity of a graph have been found since the beginning of the thirties, this paper presents a new criterion described by Boolean technique which is proved in an independent way without any use of the criteria obtained before. This research was supported by the U.S. National Science Foundation under Grant Number ECS 85 03212 and by the National Natural Science Foundation of China as well. And, the author is greatly indebted to Professor Peter L. Hammer for many helpful discussions, suggestions, and comments.  相似文献   

13.
14.
15.
16.
17.
Araújo, Kinyon and Konieczny (2011) pose several problems concerning the construction of arbitrary commuting graphs of semigroups.We observe that every star-free graph is the commuting graph of some semigroup. Consequently, we suggest modifications for some of the original problems, generalized to the context of families of semigroups with a bounded number of generators, and pose related problems.We construct monomial semigroups with a bounded number of generators, whose commuting graphs have an arbitrary clique number. In contrast to that, we show that the diameter of the commuting graphs of semigroups in a wider class (containing the class of nilpotent semigroups), is bounded by the minimal number of generators plus two.We also address a problem concerning knit degree.  相似文献   

18.
Following Zhu (Semigroup Forum, 2011, doi:), we study generalized Cayley graphs of semigroups. The Cayley D-saturated property, a particular combinatorial property, of generalized Cayley graphs of semigroups is considered and most of the results in Kelarev and Quinn (Semigroup Forum 66:89–96, 2003), Yang and Gao (Semigroup Forum 80:174–180, 2010) are extended. In addition, for some basic graphs and their complete fission graphs, we describe all semigroups whose universal Cayley graphs are isomorphic to these graphs.  相似文献   

19.
We introduce the concept of generalized Cayley graphs of semigroups and discuss their fundamental properties, and then study a special case, the universal Cayley graphs of semigroups so that some general results are given and the universal Cayley graph of a -partial order of complete graphs with loops is described.  相似文献   

20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号