English
Related papers

Related papers: Groups whose geodesics are locally testable

200 papers

We compare finiteness properties of locally compact groups that generalize the properties of being compactly generated and of being compactly presented. Three such families of properties have been proposed: Abels--Tiemeyer's type $C_n$,…

Group Theory · Mathematics 2024-10-10 Dorian Chanfi , Stefan Witzel

We show that up to commensurability there are only finitely many cocompact arithmetic Kleinian groups generated by rotations. This implies, in particular, that there exist only finitely many conjugacy classes of cocompact two generated…

Geometric Topology · Mathematics 2017-07-11 Mikhail Belolipetsky

Recently the third named author defined a 2-parametric family of groups $G_n^k$ \cite{gnk}. Those groups may be regarded as a certain generalisation of braid groups. Study of the connection between the groups $G_n^k$ and dynamical systems…

Geometric Topology · Mathematics 2019-07-01 Denis Fedoseev , Andrey Karpov , Vassily Manturov

We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…

Group Theory · Mathematics 2011-02-08 Volker Diekert , Alexei Myasnikov

If a discrete subset S of a topological group G with the identity 1 generates a dense subgroup of G and S \cup {1} is closed in G, then S is called a suitable set for G. We apply Michael's selection theorem to offer a direct,…

General Topology · Mathematics 2009-04-07 Dmitri Shakhmatov

Motivated by the structural analogies between point lattices and linear error-correcting codes, and by the mature theory on locally testable codes, we initiate a systematic study of local testing for membership in lattices. Testing…

Data Structures and Algorithms · Computer Science 2016-08-02 Karthekeyan Chandrasekaran , Mahdi Cheraghchi , Venkata Gandikota , Elena Grigorescu

The stable torsion length in a group is the stable word length with respect to the set of all torsion elements. We show that the stable torsion length vanishes in crystallographic groups. We then give a linear programming algorithm to…

Group Theory · Mathematics 2022-01-04 Chloe I. Avery , Lvzhou Chen

In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…

Group Theory · Mathematics 2011-08-12 Olga Kharlampovich , Bakhadyr Khoussainov , Alexei Miasnikov

Let A be a finite alphabet and let L contained in (A*)^n be an n-variable language over A. We say that L is regular if it is the language accepted by a synchronous n-tape finite state automaton, it is quasi-regular if it is accepted by an…

Logic · Mathematics 2010-10-18 Maria Monks

We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…

Group Theory · Mathematics 2019-04-26 Nathalie Aubrun , Sebastián Barbieri , Mathieu Sablik

Let $G$ be a reductive group, and let $X$ be a smooth quasi-projective complex variety. We prove that any $G$-irreducible, $G$-cohomologically rigid local system on $X$ with finite order abelianization and quasi-unipotent local monodromies…

Algebraic Geometry · Mathematics 2020-09-22 Christian Klevdal , Stefan Patrikis

A well known notion of $k$-rectifiable set can be formulated in any metric space using Lipschitz images of subsets of $\mathbb{R}^k$. We prove some characterizations of $k$-rectifiability, when the metric space is an arbitrary homogeneous…

Metric Geometry · Mathematics 2020-09-10 Kennedy Obinna Idu , Valentino Magnani , Francesco Paolo Maiale

We consider groups of the form $G=AB$ with two locally cyclic subgroups $A$ and $B$. The structure of these groups is determined in the cases when $A$ and $B$ are both periodic or when one of them is periodic and the other is not. Together…

Group Theory · Mathematics 2020-09-09 Bernhard Amberg , Yaroslav Sysak

Let G be a word-hyperbolic group with given finite generating set, for which various standard structures and constants have been pre-computed. A (non-practical) algorithm is described that, given as input two lists A and B, each composed of…

Group Theory · Mathematics 2011-11-10 David J. Buckley , Derek F. Holt

It was recently proven that all free and many virtually free verbally closed subgroups are algebraically closed in any group. We establish sufficient conditions for a group that is an extension of a free non-abelian group by a group…

Group Theory · Mathematics 2017-07-19 Andrey M. Mazhuga

We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining it in very few locations. We give two general results on…

Information Theory · Computer Science 2007-07-16 Eli Ben-Sasson , Madhu Sudan

I investigate modal group theory for arbitrary homomorphisms. Possibility is interpreted by the existence of a group homomorphism out of the given group, so the semantics is governed by the possibility of collapse: elements may be…

Logic · Mathematics 2026-05-15 Wojciech Aleksander Wołoszyn

We classify up to coarse equivalence all countable abelian groups of finite torsion free rank. The Q-cohomological dimension and the torsion free rank are the two invariants that give us such classification. We also prove that any countable…

Group Theory · Mathematics 2008-03-05 J. Higes

To a "stable homotopy theory" (a presentable, symmetric monoidal stable $\infty$-category), we naturally associate a category of finite \'etale algebra objects and, using Grothendieck's categorical machine, a profinite group that we call…

Category Theory · Mathematics 2016-01-08 Akhil Mathew

The characterisation of termination using well-founded monotone algebras has been a milestone on the way to automated termination techniques, of which we have seen an extensive development over the past years. Both the semantic…

Logic in Computer Science · Computer Science 2015-07-01 Joerg Endrullis , Roel de Vrijer , Johannes Waldmann