Searcharxiv⌕ Search

arXiv subjects

J. Jonušas

Publications and source records attributed to J. Jonušas.

4 recordsLinked to original sources

Automatic continuity, unique Polish topologies, and Zariski topologies on monoids and clones

In this paper we explore the extent to which the algebraic structure of a monoid $M$ determines the topologies on $M$ that are compatible with its multiplication. Specifically we study the notions of automatic continuity; minimal Hausdorff or Polish semigroup topologies; and we formulate a notion of the Zariski topology for monoids. If $M$ is a topological monoid such that every homomorphism from $M$ to a second countable topological monoid $N$ is continuous, then we say that $M$ has \emph{automatic continuity}. We show that many well-known monoids have automatic continuity with respect to a natural semigroup topology, namely: the full transformation monoid $\mathbb{N}^\mathbb{N}$; the full binary relation monoid $B_{\mathbb{N}}$; the partial transformation monoid $P_{\mathbb{N}}$; the symmetric inverse monoid $I_{\mathbb{N}}$; the monoid Inj$(\mathbb{N})$ consisting of the injective functions on $\mathbb{N}$; and the monoid $C(2^{\mathbb{N}})$ of continuous functions on the Cantor set. We show that the pointwise topology on $\mathbb{N}^\mathbb{N}$, and its analogue on $P_{\mathbb{N}}$, are the unique Polish semigroup topologies on these monoids. The compact-open topology is the unique Polish semigroup topology on $C(2^\mathbb{N})$ and $C([0, 1]^\mathbb{N})$. There are at least 3 Polish semigroup topologies on $I_{\mathbb{N}}$, but a unique Polish inverse semigroup topology. There are no Polish semigroup topologies $B_{\mathbb{N}}$ nor on the partitions monoids. At the other extreme, Inj$(\mathbb{N})$ and the monoid Surj$(\mathbb{N})$ of all surjective functions on $\mathbb{N}$ each have infinitely many distinct Polish semigroup topologies. We prove that the Zariski topologies on $\mathbb{N}^\mathbb{N}$, $P_{\mathbb{N}}$, and Inj$(\mathbb{N})$ coincide with the pointwise topology; and we characterise the Zariski topology on $B_{\mathbb{N}}$. In Section 7: clones.

math.RA↗

Polish topologies on endomorphism monoids of relational structures

In this paper we present general techniques for characterising minimal and maximal semigroup topologies on the endomorphism monoid $\operatorname{End}(\mathbb{A})$ of a countable relational structure $\mathbb{A}$. As applications, we show that the endomorphism monoids of several well-known relational structures, including the random graph, the random directed graph, and the random partial order, possess a unique Polish semigroup topology. In every case this unique topology is the subspace topology induced by the usual topology on the Baire space $\mathbb{N} ^ \mathbb{N}$. We also show that many of these structures have the property that every homomorphism from their endomorphism monoid to a second countable topological semigroup is continuous; referred to as automatic continuity. Many of the results about endomorphism monoids are extended to clones of polymorphisms on the same structures.

math.GR↗

Two variants of the Froiduire-Pin Algorithm for finite semigroups

In this paper, we present two algorithms based on the Froidure-Pin Algorithm for computing the structure of a finite semigroup from a generating set. As was the case with the original algorithm of Froidure and Pin, the algorithms presented here produce the left and right Cayley graphs, a confluent terminating rewriting system, and a reduced word of the rewriting system for every element of the semigroup. If $U$ is any semigroup, and $A$ is a subset of $U$, then we denote by $\langle A\rangle$ the least subsemigroup of $U$ containing $A$. If $B$ is any other subset of $U$, then, roughly speaking, the first algorithm we present describes how to use any information about $\langle A\rangle$, that has been found using the Froidure-Pin Algorithm, to compute the semigroup $\langle A\cup B\rangle$. More precisely, we describe the data structure for a finite semigroup $S$ given by Froidure and Pin, and how to obtain such a data structure for $\langle A\cup B\rangle$ from that for $\langle A\rangle$. The second algorithm is a lock-free concurrent version of the Froidure-Pin Algorithm.

math.GR↗

Topological 2-generation of automorphism groups of countable ultrahomogeneous graphs

A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random graph; infinite disjoint unions of complete graphs $K_n$ with $n\in \mathbb{N}$ vertices; the $K_n$-free graphs; finite unions of the infinite complete graph $K_ω$; and duals of such graphs. The groups $\operatorname{Aut}(Γ)$ of automorphisms of such graphs $Γ$ have a natural topology, which is compatible with multiplication and inversion, i.e.\ the groups $\operatorname{Aut}(Γ)$ are topological groups. We consider the problem of finding minimally generated dense subgroups of the groups $\operatorname{Aut}(Γ)$ where $Γ$ is ultrahomogeneous. We show that if $Γ$ is ultrahomogeneous, then $\operatorname{Aut}(Γ)$ has 2-generated dense subgroups, and that under certain conditions given $f \in \operatorname{Aut}(Γ)$ there exists $g\in \operatorname{Aut}(Γ)$ such that the subgroup generated by $f$ and $g$ is dense. We also show that, roughly speaking, $g$ can be chosen with a high degree of freedom. For example, if $Γ$ is either an infinite disjoint unions of $K_n$ or a finite union of $K_ω$, then $g$ can be chosen to have any given finite set of orbit representatives.

math.GR↗