SearcharxivSearch

arXiv · 1802.03598

The monoid of order isomorphisms of principal filters of a power of the positive integers

Abstract

Let $n$ be any positive integer and $\mathscr{I\!\!P\!F}(\mathbb{N}^n)$ be the semigroup of all order isomorphisms between principal filters of the $n$-th power of the set of positive integers $\mathbb{N}$ with the product order. We study algebraic properties of the semigroup $\mathscr{I\!\!P\!F}(\mathbb{N}^n)$. In particular, we show that $\mathscr{I\!\!P\!F}(\mathbb{N}^n)$ is a bisimple, $E$-unitary, $F$-inverse semigroup, describe Green's relations on $\mathscr{I\!\!P\!F}(\mathbb{N}^n)$ and its maximal subgroups. We show that the semigroup $\mathscr{I\!\!P\!F}(\mathbb{N}^n)$ is isomorphic to the semidirect product of the direct $n$-th power of the bicyclic monoid ${\mathscr{C}}^n(p,q)$ by the group of permutation $\mathscr{S}_n$. Also we prove that every non-identity congruence $\mathfrak{C}$ on the semigroup $\mathscr{I\!\!P\!F}(\mathbb{N}^n)$ is group and describe the least group congruence on $\mathscr{I\!\!P\!F}(\mathbb{N}^n)$. We show that every Hausdorff shift-continuous topology on $\mathscr{I\!\!P\!F}(\mathbb{N}^n)$ is discrete and discuss embedding of the semigroup $\mathscr{I\!\!P\!F}(\mathbb{N}^n)$ into compact-like topological semigroups.

Explore related subjects

Keep this discovery

BibTeXRIS

Oleg Gutik, Taras Mokrytskyi. 2018-02-10. The monoid of order isomorphisms of principal filters of a power of the positive integers. https://arxiv.org/abs/1802.03598

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR