English
Related papers

Related papers: Computably totally disconnected locally compact gr…

200 papers

We study algebraic properties on a group G such that if the discrete group G has these properties then every locally compact shift continuous topology on G with adjoined zero is either compact, or discrete. We introduce electorally flexible…

Group Theory · Mathematics 2020-06-30 Kateryna Maksymyk

We propose the systematic study of presentations that can be generalised over a continuous open group monomorphism. Presentations with this property can turn well-known presentations such as those for as orientable surface groups, Artin…

Group Theory · Mathematics 2026-05-29 Ilaria Castellano , Bianca Marchionna , Brita Nucinkis , Yuri Santos Rego

Let $G$ be a group and let $K$ be a commensurated subgroup of $G$. Then there is a totally disconnected, locally compact (t.d.l.c.) group $\hat{G}_K$ that contains the profinite completion of $K$ as an open compact subgroup and also…

Group Theory · Mathematics 2015-09-03 Colin D. Reid

We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…

Logic · Mathematics 2023-04-17 Alec Fox

A topological group is (openly) almost-elliptic if it contains a(n open) dense subset of elements generating relatively-compact cyclic subgroups. We classify the (openly) almost-elliptic connected locally compact groups as precisely those…

Group Theory · Mathematics 2025-06-12 Alexandru Chirvasitu

A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…

Logic · Mathematics 2023-07-10 Djamel Eddine Amir , Mathieu Hoyrup

We provide new computations in bounded cohomology: A group is boundedly acyclic if its bounded cohomology with trivial real coefficients is zero in all positive degrees. We show that there exists a continuum of finitely generated…

Group Theory · Mathematics 2022-10-24 Francesco Fournier-Facio , Clara Loeh , Marco Moraschini

In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…

Logic · Mathematics 2025-12-12 Eike Neumann , Arno Pauly , Cécilia Pradic , Manlio Valenti

We classify the locally compact second-countable (l.c.s.c.) groups $A$ that are abelian and topologically characteristically simple. All such groups $A$ occur as the monolith of some soluble l.c.s.c. group $G$ of derived length at most $3$;…

Group Theory · Mathematics 2020-06-09 Colin D. Reid

Let $G$ be a locally compact group. Consider the C$^*$-algebra $C_0(G)$ of continuous complex functions on $G$, tending to 0 at infinity. The product in $G$ gives rise to a coproduct $\Delta_G$ on the C$^*$-algebra $C_0(G)$. A locally…

Operator Algebras · Mathematics 2007-05-23 M. B. Landstad , A. Van Daele

A topological group is called a pro-Lie group if it is isomorphic to a closed subgroup of a product of finite-dimensional real Lie groups. This class of groups is closed under the formation of arbitrary products and closed subgroups and…

Group Theory · Mathematics 2015-07-16 Karl H. Hofmann , Sidney A. Morris

The semidirect product $\mathbb{G}=\mathbb{L}\rtimes \mathbb{K}$ attached to a compact-group action on a connected, simply-connected solvable Lie group has a dense set of compact elements precisely when the $s\in \mathbb{K}$ operating on…

Group Theory · Mathematics 2025-07-08 Alexandru Chirvasitu

We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on the space of marked groups. We point out that several distinct…

Group Theory · Mathematics 2025-01-15 Emmanuel Rauzy

We study the algorithmic content of Pontryagin - van Kampen duality. We prove that the dualization is computable in the important cases of compact and locally compact totally disconnected Polish abelian groups. The applications of our main…

Logic · Mathematics 2021-08-24 Martino Lupini , Alexander Melnikov , Andre Nies

This thesis is devoted to the study of the interactions existing between the algebraic structure of locally compact groups and the properties of their continuous unitary representations, with a special emphasis on the Type I groups. On the…

Representation Theory · Mathematics 2023-06-08 Lancelot Semal

The Isbell, compact-open and point-open topologies on the set $C(X,\mathbb{R})$ of continuous real-valued maps can be represented as the dual topologies with respect to some collections $\alpha(X)$ of compact families of open subsets of a…

General Topology · Mathematics 2013-04-26 S. Dolecki , F. Jordan , F. Mynard

We investigate some properties of the clopen type semigroup of an action of a countable group on a compact, $0$-dimensional, Hausdorff space X. We discuss some characterizations of dynamical comparison (most of which were already known in…

Dynamical Systems · Mathematics 2024-10-04 Julien Melleray

The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…

Group Theory · Mathematics 2022-06-14 Jane Gilman

We obtain a characterization of totally disconnected, locally compact groups $G$ with the following property: given a locally normal subgroup $K$ of $G$, then there is an open subgroup of $K$ that is a direct factor of an open subgroup of…

Group Theory · Mathematics 2021-07-13 Colin D. Reid

This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces. For obtaining uniform results we…

Logic in Computer Science · Computer Science 2015-07-01 Robert Rettinger , Klaus Weihrauch