Searcharxiv⌕ Search

arXiv subjects

Y. Péresse

Publications and source records attributed to Y. Péresse.

8 recordsLinked to original sources
arXiv2026

Maximal Subsemigroups of Infinite Symmetric Inverse Monoids

The symmetric inverse monoid $I_X$ on a set $X$ consists of all bijective functions whose domain and range are subsets of $X$ under the usual composition and inversion of partial functions. For an arbitrary infinite set $X$, we classify all maximal subsemigroups and maximal inverse subsemigroups of $I_X$ which contain the symmetric group Sym($X$) or any of the following subgroups of Sym($X$): the pointwise stabiliser of a finite subset of $X$, the stabiliser of an ultrafilter on $X$, or the stabiliser of a partition of $X$ into finitely many parts of equal cardinality.

math.RA↗
arXiv2026

Maximal subgroups of homeomorphism groups

We show that the homeomorphism groups of the following spaces have precisely $2^{2^{\aleph_0}}$ maximal subgroups: the rational numbers $\mathbb{Q}$, the Baire space $\mathbb{N}^{\mathbb{N}}$, the space $\mathbb{N}\times 2^{\mathbb{N}}$ where $2^{\mathbb{N}}$ is the Cantor set, the ordinal $ω^2$ under its order topology, and the Sorgenfrey line $\mathbb{S}$. More generally, we find sufficient conditions on a group $G$ acting on a topological space which imply that $G$ has at least $2^{2^{\aleph_0}}$ maximal subgroups. Moreover, if the groups $\operatorname{Homeo}(\mathbb{Q})$ and $\operatorname{Homeo}(\mathbb{N}^\mathbb{N})$ are equipped with the pointwise topology, then it is shown that $\operatorname{Homeo}(\mathbb{N}^\mathbb{N})$ has precisely $2^{\aleph_0}$ open maximal subgroups, and $\operatorname{Homeo}(\mathbb{Q})$ has precisely $\aleph_0$ open maximal subgroups and $2^{\aleph_0}$ closed maximal subgroups.

math.GR↗
arXiv2025

A note on intrinsic topologies of groups

We investigate topologies on groups which arise naturally from their algebraic structure, including the Frechét-Markov, Hausdorff-Markov, and various kinds of Zariski topologies. Answering a question by Dikranjan and Toller, we show that there exists a countable abelian group in which no bounded version of the Zariski topology coincides with the full Zariski topology. Complementing a recent result by Goffer and Greenfeld, we show that on any group with no algebraicity the semigroup Zariski topology is hyperconnected and hence, in many cases, is distinct from the group Zariski topology. Finally, we show that on the symmetric groups, the semigroup Hausdorff-Markov topology coincides with the topology of pointwise convergence.

math.GR↗
arXiv2023

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↗
arXiv2022

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↗
arXiv2018

Computing finite semigroups

Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to which these results apply include many important classes: transformation semigroups, partial permutation semigroups and inverse semigroups, partition monoids, matrix semigroups, and subsemigroups of finite regular Rees matrix and $0$-matrix semigroups over groups. For any subsemigroup of such a semigroup, it is possible to, among other things, efficiently compute its size and Green's relations, test membership, factorize elements over the generators, find the semigroup generated by the given subsemigroup and any collection of additional elements, calculate the partial order of the $\mathscr{D}$-classes, test regularity, and determine the idempotents. This is achieved by representing the given subsemigroup without exhaustively enumerating its elements. It is also possible to compute the Green's classes of an element of such a subsemigroup without determining the global structure of the semigroup.

math.RA↗
arXiv2013

Maximal subsemigroups of the semigroup of all mappings on an infinite set

In this paper we classify the maximal subsemigroups of the \emph{full transformation semigroup} $Ω^Ω$, which consists of all mappings on the infinite set $Ω$, containing certain subgroups of the symmetric group $\sym(Ω)$ on $Ω$. In 1965 Gavrilov showed that there are five maximal subsemigroups of $Ω^Ω$ containing $\sym(Ω)$ when $Ω$ is countable and in 2005 Pinsker extended Gavrilov's result to sets of arbitrary cardinality. We classify the maximal subsemigroups of $Ω^Ω$ on a set $Ω$ of arbitrary infinite cardinality containing one of the following subgroups of $\sym(Ω)$: the pointwise stabiliser of a non-empty finite subset of $Ω$, the stabiliser of an ultrafilter on $Ω$, or the stabiliser of a partition of $Ω$ into finitely many subsets of equal cardinality. If $G$ is any of these subgroups, then we deduce a characterisation of the mappings $f,g\in Ω^Ω$ such that the semigroup generated by $G\cup \{f,g\}$ equals $Ω^Ω$.

math.RA↗