scholarly journals STABILITY, COHOMOLOGY VANISHING, AND NONAPPROXIMABLE GROUPS

2020 ◽  
Vol 8 ◽  
Author(s):  
MARCUS DE CHIFFRE ◽  
LEV GLEBSKY ◽  
ALEXANDER LUBOTZKY ◽  
ANDREAS THOM

Several well-known open questions (such as: are all groups sofic/hyperlinear?) have a common form: can all groups be approximated by asymptotic homomorphisms into the symmetric groups $\text{Sym}(n)$ (in the sofic case) or the finite-dimensional unitary groups $\text{U}(n)$ (in the hyperlinear case)? In the case of $\text{U}(n)$ , the question can be asked with respect to different metrics and norms. This paper answers, for the first time, one of these versions, showing that there exist finitely presented groups which are not approximated by $\text{U}(n)$ with respect to the Frobenius norm $\Vert T\Vert _{\text{Frob}}=\sqrt{\sum _{i,j=1}^{n}|T_{ij}|^{2}},T=[T_{ij}]_{i,j=1}^{n}\in \text{M}_{n}(\mathbb{C})$ . Our strategy is to show that some higher dimensional cohomology vanishing phenomena implies stability, that is, every Frobenius-approximate homomorphism into finite-dimensional unitary groups is close to an actual homomorphism. This is combined with existence results of certain nonresidually finite central extensions of lattices in some simple $p$ -adic Lie groups. These groups act on high-rank Bruhat–Tits buildings and satisfy the needed vanishing cohomology phenomenon and are thus stable and not Frobenius-approximated.

1985 ◽  
Vol 50 (3) ◽  
pp. 743-772 ◽  
Author(s):  
Fritz Grunewald ◽  
Daniel Segal

This paper is a continuation of our previous work in [12]. The results, and some applications, have been described in the announcement [13]; it may be useful to discuss here, a little more fully, the nature and purpose of this work.We are concerned basically with three kinds of algorithmic problem: (1) isomorphism problems, (2) “orbit problems”, and (3) “effective generation”.(1) Isomorphism problems. Here we have a class of algebraic objects of some kind, and ask: is there a uniform algorithm for deciding whether two arbitrary members of are isomorphic? In most cases, the answer is no: no such algorithm exists. Indeed this has been one of the most notable applications of methods of mathematical logic in algebra (see [26, Chapter IV, §4] for the case where is the class of all finitely presented groups). It turns out, however, that when consists of objects which are in a certain sense “finite-dimensional”, then the isomorphism problem is indeed algorithmically soluble. We gave such algorithms in [12] for the following cases: = {finitely generated nilpotent groups}; = {(not necessarily associative) rings whose additive group is finitely generated}; = {finitely Z-generated modules over a fixed finitely generated ring}.Combining the methods of [12] with his own earlier work, Sarkisian has obtained analogous results with the integers replaced by the rationals: in [20] and [21] he solves the isomorphism problem for radicable torsion-free nilpotent groups of finite rank and for finite-dimensional Q-algebras.


2014 ◽  
Vol 06 (02) ◽  
pp. 167-192 ◽  
Author(s):  
Hao Liang

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 of hyperbolic groups is solvable.


2009 ◽  
Vol 01 (01) ◽  
pp. 1-12 ◽  
Author(s):  
INDIRA CHATTERJI ◽  
MARTIN KASSABOV

We give an explicit finite presentation of a group normally generated by SL∞(ℤ). As a consequence, such a group cannot act on e.g. a finite dimensional contractible manifold or on a compact manifold.


2008 ◽  
Vol 14 (4) ◽  
pp. 449-480 ◽  
Author(s):  
Vladimir G. Pestov

AbstractThis is an introductory survey of the emerging theory of two new classes of (discrete, countable) groups, called hyperlinear and sofic groups. They can be characterized as subgroups of metric ultraproducts of families of, respectively, unitary groups U(n) and symmetric groups Sn, n ∈ ℕ. Hyperlinear groups come from theory of operator algebras (Connes' Embedding Problem), while sofic groups, introduced by Gromov, are motivated by a problem of symbolic dynamics (Gottschalk's Surjunctivity Conjecture). Open questions are numerous, in particular it is still unknown if every group is hyperlinear and/or sofic.


2014 ◽  
Vol 70 (a1) ◽  
pp. C1-C1 ◽  
Author(s):  
Ted Janssen ◽  
Aloysio Janner

2014 is the International Year of Crystallography. During at least fifty years after the discovery of diffraction of X-rays by crystals, it was believed that crystals have lattice periodicity, and crystals were defined by this property. Now it has become clear that there is a large class of compounds with interesting properties that should be called crystals as well, but are not lattice periodic. A method has been developed to describe and analyze these aperiodic crystals, using a higher-dimensional space. In this lecture the discovery of aperiodic crystals and the development of the formalism of the so-called superspace will be described. There are several classes of such materials. After the incommensurate modulated phases, incommensurate magnetic crystals, incommensurate composites and quasicrystals were discovered. They could all be studied using the same technique. Their main properties of these classes and the ways to characterize them will be discussed. The new family of aperiodic crystals has led also to new physical properties, to new techniques in crystallography and to interesting mathematical questions. Much has been done in the last fifty years by hundreds of crystallographers, crystal growers, physicists, chemists, mineralogists and mathematicians. Many new insights have been obtained. But there are still many questions, also of fundamental nature, to be answered. We end with a discussion of these open questions.


1968 ◽  
Vol 33 (2) ◽  
pp. 296-297
Author(s):  
J. C. Shepherdson

1991 ◽  
Vol 01 (03) ◽  
pp. 339-351
Author(s):  
ROBERT H. GILMAN

This paper is concerned with computation in finitely presented groups. We discuss a procedure for showing that a finite presentation presents a group with a free subgroup of finite index, and we give methods for solving various problems in such groups. Our procedure works by constructing a particular kind of partial groupoid whose universal group is isomorphic to the group presented. When the procedure succeeds, the partial groupoid can be used as an aid to computation in the group.


2017 ◽  
Vol 11 (1) ◽  
pp. 291-310
Author(s):  
Daniele Ettore Otera ◽  
Valentin Poénaru

Sign in / Sign up

Export Citation Format

Share Document