Related papers: Groups whose geodesics are locally testable

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…

A locally normal subgroup in a topological group is a subgroup whose normaliser is open. In this paper, we provide a detailed description of the large-scale structure of closed locally normal subgroups of complete Kac-Moody groups over…

By a recent result of Juh\'{a}sz and van Mill, a locally compact topological group whose dense subspaces are all separable is metrizable. In this note we investigate the following question: is every locally compact group having all dense…

The group isomorphism problem asks whether two finite groups given by their Cayley tables are isomorphic or not. Although there are polynomial-time algorithms for some specific group classes, the best known algorithm for testing isomorphism…

Let $G$ be a locally compact Abelian group, and $w: G\to (0, \infty)$ be a Borel measurable weighted function. In this paper, the algebraic and topological properties of group algebra are studied and assessed. We show that the weighted…

We present a quick approach to computing the $K$-theory of the category of locally compact modules over any order in a semisimple $\mathbb{Q}$-algebra. We obtain the $K$-theory by first quotienting out the compact modules and subsequently…

A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…

Friedl and L\"oh (2021, Confl. Math.) prove that testing whether or not there is an epimorphism from a finitely presented group to a virtually cyclic group, or to the direct product of an abelian and a finite group, is decidable. Here we…

We derive a lower and an upper bound for the rank of the finite part of operator $K$-theory groups of maximal and reduced $C^*$-algebras of finitely generated groups. The lower bound is based on the amount of polynomially growing conjugacy…

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…

We work in the category of locally definable groups in an o-minimal expansion of a field. Eleftheriou and Peterzil conjectured that every definably generated abelian connected group G in this category is a cover of a definable group. We…

We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…

It is known that the bounded Geodesic Length Problem in free metabelian groups is NP-complete (in particular, the Geodesic Problem is NP-hard). We construct a 2-approximation polynomial time deterministic algorithm for the Geodesic Problem.…

By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a…

Tree-controlled grammars are context-free grammars where the derivation process is controlled in such a way that every word on a level of the derivation tree must belong to a certain control language. We investigate the generative capacity…

Let $w$ be a multilinear commutator word, that is, a commutator of weight $n$ in $n$ different group variables. It is proved that if $G$ is a profinite group in which all pronilpotent subgroups generated by $w$-values are periodic, then the…

Suppose G is a topological group containing a (closed) topological copy of the Frechet-Urysohn fan. If G is a perfectly normal sequential space (a normal k-space) then every closed metrizable subset in $G$ is locally compact. Applying this…

We show that a large class of languages in the standard finite generating set X = {$x_0, x_1, x_0^{-1}, x_1^{-1}$} cannot be part of an automatic structure for Thompson's Group F. These languages are ones that accept at least one…

We investigate how often geodesics have homology in a fixed set of the homology lattice of a compact Riemann surface. We prove that closed geodesics are equidistributed on any sets with asymptotic density with respect to a specific norm. We…

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…