Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2303.06369

The product of Lindel\"of groups and $\mathbb R$-factorizability

Evgeny Reznichenko
View original source ↗Read source document ↗Export metadata ↓

Abstract

Lindel\"of topological groups $G_1$ , $H_1$, $G_2$, $H_2$ are constructed in such a way that the products of $G_1 \times H_1$ and $G_2 \times H_2$ are not $\mathbb R$-factorizable groups and (1) the group $G_1 \times H_1$ is not pseudo-$\aleph_1$-compact; (2) the group $G_2 \times H_2$ is a separable not normal group and contains a discrete closed subset of the cardinality continuum.

Explore related subjects

math.GRmath.GN

Keep this discovery

BibTeXRIS

Evgeny Reznichenko. 2023-03-11. The product of Lindel\"of groups and $\mathbb R$-factorizability. https://arxiv.org/abs/2303.06369

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

KEEP EXPLORING

Related papers

arXiv2026

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

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

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↗