Abstract:In this paper we investigate locally compact semitopological graph inverse semigroups. Our main result is the following: if a directed graph E is strongly connected and has finitely many vertices, then any Hausdorff shift-continuous locally compact topology on the graph inverse semigroup G(E) is either compact or discrete. This result generalizes results of Gutik and Bardyla who proved the above dichotomy for Hausdorff locally compact shift-continuous topologies on polycyclic monoids P 1 and P λ , respectively. Show more
“…For instance, in [23] it was proved that a Hausdorff locally compact semitopological bicyclic semigroup with an adjoined zero C 0 is either compact or discrete. In [6] and [8] this result was extended for polycyclic monoids and graph inverse semigroups over strongly connected graphs with finitely many vertices, respectively. Similar dichotomy also holds for other generalizations of the bicyclic monoid (see [9,24,30]).…”
A Hausdorff topology τ on the bicyclic monoid with adjoined zero C 0 is called weak if it is contained in the coarsest inverse semigroup topology on C 0 . We show that the lattice W of all weak shift-continuous topologies on C 0 is isomorphic to the lattice SIF 1 ×SIF 1 where SIF 1 is a set of all shift-invariant filters on ω with an attached element 1 endowed with the following partial order: F ≤ G iff G = 1 or F ⊂ G. Also, we investigate cardinal characteristics of the lattice W. In particular, we proved that W contains an antichain of cardinality 2 c and a well-ordered chain of cardinality c. Moreover, there exists a well-ordered chain of first-countable weak topologies of order type t.
“…For instance, in [23] it was proved that a Hausdorff locally compact semitopological bicyclic semigroup with an adjoined zero C 0 is either compact or discrete. In [6] and [8] this result was extended for polycyclic monoids and graph inverse semigroups over strongly connected graphs with finitely many vertices, respectively. Similar dichotomy also holds for other generalizations of the bicyclic monoid (see [9,24,30]).…”
A Hausdorff topology τ on the bicyclic monoid with adjoined zero C 0 is called weak if it is contained in the coarsest inverse semigroup topology on C 0 . We show that the lattice W of all weak shift-continuous topologies on C 0 is isomorphic to the lattice SIF 1 ×SIF 1 where SIF 1 is a set of all shift-invariant filters on ω with an attached element 1 endowed with the following partial order: F ≤ G iff G = 1 or F ⊂ G. Also, we investigate cardinal characteristics of the lattice W. In particular, we proved that W contains an antichain of cardinality 2 c and a well-ordered chain of cardinality c. Moreover, there exists a well-ordered chain of first-countable weak topologies of order type t.
“…A dichotomy for the bicyclic monoid with an adjoined zero C 0 = C (p, q)⊔{0} was proved in [11]: every locally compact semitopological bicyclic monoid C 0 with an adjoined zero is either compact or discrete. The above dichotomy was extended by Bardyla in [5] to locally compact λ-polycyclic semitopological monoids, in [6] to locally compact semitopological graph inverse semigroups in [13] to locally compact semitopological interassociates of the bicyclic monoid with an adjoined zero and are extended in [12] to locally compact semitopological 0-bisimple inverse ω semigroups with compact maximal subgroups.…”
Let n be any positive integer and IPF (N n ) be the semigroup of all order isomorphisms between principal filters of the n-th power of the set of positive integers N with the product order. We prove that a Hausdorff locally compact semitopological semigroup IPF (N n ) with an adjoined zero is either compact or discrete.
“…Algebraic theory of graph inverse semigroups is well developed (see [2,8,10,26,27,30,32]). Topological properties of graph inverse semigroups were investigated in [9,11,12,13,33].…”
Section: Preliminariesmentioning
confidence: 99%
“…Let G(E) be an arbitrary semitopological GIS. Observe that each non-zero element of G(E) is isolated (see [12,Theorem 4]). For an arbitrary GIS G(E) by τ c we denote the topology on G(E) which is defined as follows: each non-zero element is isolated in (G(E), τ c ) and open neighbourhood base of the point 0 consists of cofinite subsets of G(E) which contain 0.…”
Section: Graph Inverse Semigroups Which Admit Compact Semigroup Topologymentioning
In this paper we investigate graph inverse semigroups which are subsemigroups of compactlike topological semigroups. More precisely, we characterise graph inverse semigroups which admit compact semigroup topology and describe graph inverse semigroups which can be embeded densely into d-compact topological semigroups.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.