相关论文: Enumerating limit groups

We consider whether given a simple, finite description of a group in the form of an algorithm, it is possible to algorithmically determine if the corresponding group has some specified property or not. When there is such an algorithm, we…

We prove that centralizers of elements in [f.g. free]-by-cyclic groups are computable. As a corollary we get that, given two conjugate elements in a [f.g. free]-by-cyclic group, the set of conjugators can be computed and that the conjugacy…

For Young systems, i.e. for hyperbolic systems without/with singularities satisfying Lai-Sang Young's axioms (which imply exponential decay of correlation and the CLT) a local CLT is proven. In fact, a unified version of the local CLT is…

Simple methods permit to generalize the concepts of iteration and of recursive processes. We shall see briefly on several examples what these methods generate. In additive sequences, we shall encounter not only the golden or the silver…

Our goal is to develop a limit approach for a class of problems in additive combinatorics that is analogous to the limit theory of dense graph sequences. We introduce metric, convergence and limit objects for functions on groups and for…

We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all $n\in\mathbb{N}$, a residually free group is of…

Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general…

This article gives solutions to the exercises in Bestvina and Feighn's paper on Sela's work on limit groups. We prove that all constructible limit groups are limit groups and give an account of the shortening argument of Rips and Sela.

We describe an algorithm that computes the index of a finitely generated subgroup in a finitely $L$-presented group provided that this index is finite. This algorithm shows that the subgroup membership problem for finite index subgroups in…

Foundational material on complex Lie supergroups and their radial operators is presented. In particular, Berezin's recursion formula for describing the radial parts of fundamental operators in general linear and ortho-symplectic cases is…

We construct the first examples of an algorithmically complex finitely presented residually finite groups and first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn function and depth function.…

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…

In this paper we show that the membership problems for finitely generated submonoids and for rational subsets are recursively equivalent for groups with two or more ends.

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's…

We develop the representation theory for reductive linear differential algebraic groups (LDAGs). In particular, we exhibit an explicit sharp upper bound for orders of derivatives in differential representations of reductive LDAGs, extending…

We show that an infinite residually finite boundedly generated group has an infinite chain of finite index subgroups with ranks uniformly bounded, and give (sublinear) upper bounds on the ranks of arbitrary finite index subgroups of…

The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…

We give a general lower bound on the rank of matrices of the form $\rho(h) - I$ with $\rho : G \rightarrow GL({\mathbb F}^n)$ an irreducible representation of a finite group $G$. The main tool in the proof is a (strengthening) of a…

A group $G$ is called subgroup conjugacy separable if for every pair of non-conjugate finitely generated subgroups of $G$, there exists a finite quotient of $G$ where the images of these subgroups are not conjugate. We prove that limit…