Closed subsets of compact-like topological spaces

<p>We investigate closed subsets (subsemigroups, resp.) of compact-like topological spaces (semigroups, resp.). We show that each Hausdorff topological space is a closed subspace of some Hausdorff ω-bounded pracompact topological space and describe open dense subspaces of<br />countably pracompact topological spaces. We construct a pseudocompact topological semigroup which contains the bicyclic monoid as a closed subsemigroup. This example provides an affirmative answer to a question posed by Banakh, Dimitrova, and Gutik in [4]. Also, we show that the semigroup of ω×ω-matrix units cannot be embedded into a Hausdorff topological semigroup whose space is weakly H-closed.</p>

On the lattice of weak topologies on the bicyclic monoid with adjoined zero

A Hausdorff topology τ on the bicyclic monoid with adjoined zero C0 is called weak if it is contained in the coarsest inverse semigroup topology on C0. We show that the lattice W of all weak shift-continuous topologies on C0 is isomorphic to the lattice SIF1×SIF1 where SIF1 is the set of all shift-invariant filters on ω with an attached element 1 endowed with the following partial order: F≤G if and only if G=1 or F⊂G. Also, we investigate cardinal characteristics of the lattice W. In particular, we prove that W contains an antichain of cardinality 2c and a well-ordered chain of cardinality c. Moreover, there exists a well-ordered chain of first-countable weak topologies of order type t.

On locally compact shift-continuous topologies on the α-bicyclic monoid

A topology τ on a monoid S is called shift-continuous if for every a, b ∈ S the two-sided shift S → S, x ↦ axb, is continuous. For every ordinal α ≤ ω, we describe all shift-continuous locally compact Hausdorff topologies on the α-bicyclic monoid Bα. More precisely, we prove that the lattice of shift-continuous locally compact Hausdorff topologies on Bα is anti-isomorphic to the segment of [1, α] of ordinals, endowed with the natural well-order. Also we prove that for each ordinal α the α + 1-bicyclic monoid Bα+1 is isomorphic to the Bruck extension of the α-bicyclic monoid Bα.

THE FINITE BASIS PROBLEM FOR THE MONOID OF TWO-BY-TWO UPPER TRIANGULAR TROPICAL MATRICES

For each positive $n$, let $\mathbf{u}_{n}\approx \boldsymbol{v}_{n}$ denote the identity obtained from the Adjan identity $(xy)(yx)(xy)(xy)(yx)\approx (xy)(yx)(yx)(xy)(yx)$ by substituting $(xy)\rightarrow (x_{1}x_{2}\ldots x_{n})$ and $(yx)\rightarrow (x_{n}\ldots x_{2}x_{1})$. We show that every monoid which satisfies $\mathbf{u}_{n}\approx \boldsymbol{v}_{n}$ for each positive $n$ and generates a variety containing the bicyclic monoid is nonfinitely based. This implies that the monoid $U_{2}(\mathbb{T})$ (respectively, $U_{2}(\overline{\mathbb{Z}})$) of two-by-two upper triangular tropical matrices over the tropical semiring $\mathbb{T}=\mathbb{R}\cup \{-\infty \}$ (respectively, $\overline{\mathbb{Z}}=\mathbb{Z}\cup \{-\infty \}$) is nonfinitely based.

On surjunctive monoids

A monoid M is called surjunctive if every injective cellular automata with finite alphabet over M is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all residually finite monoids, all finitely generated linear monoids, and all cancellative one-sided amenable monoids are surjunctive. We also prove that every limit of marked surjunctive monoids is itself surjunctive. On the other hand, we show that the bicyclic monoid and, more generally, all monoids containing a submonoid isomorphic to the bicyclic monoid are non-surjunctive.

Automata with Counters that Recognize Word Problems of Free Products

An M-automaton is a finite automaton with a blind counter that mimics a monoid M. The finitely generated groups whose word problems (when viewed as formal languages) are accepted by M-automata play a central role in understanding the family 𝔏(M) of all languages accepted by M-automata. If G1 and G2 are finitely generated groups whose word problems are languages in 𝔏(M), in general, the word problem of the free product G1 * G2 is not necessarily in 𝔏(M). However, we show that if M is enlarged to the free product M*P2, where P2 is the polycyclic monoid of rank two, then this closure property holds. In fact, we show more generally that the special word problem of M1 * M2 lies in 𝔏(M * P2) whenever M1 and M2 are finitely generated monoids with special word problems in 𝔏(M * P2). We also observe that there is a monoid without zero, denoted by CF2, that can be used in place of P2 for this purpose. The monoid CF2 is the rank two case of what we call a monoid with right invertible basis and its Rees quotient by its maximal ideal is P2. The fundamental theory of monoids with right invertible bases is completely analogous to that of free groups, and thus they are very convenient to use. We also investigate the questions of whether there is a group that can be used instead of the monoid P2 in the above result and under what circumstances P1 (or the bicyclic monoid) is enough to do the job of P2.