On quasi-isometric embeddings of Lamplighter groups

We denote by the Lamplighter group of a finite group . In this article, we show that if and are two finite groups with at least two elements, then there exists a quasi-isometric embedding from to . We also prove that the quasi-isometry group of contains all finite groups. We then show that the group of automorphisms of has infinite index in .

     

拟L商群的同态与同构

HX群是由一个群向其幂集上提升的群结构．文[1]将HX群推广到一类特殊的格-原子格L上,称之为AHX群．本文研究了一类特殊的AHX群-拟L商群的同态与同构,获得与拟商群相类似的结果．     

The restricted isomorphism problem for metacyclic restricted Lie algebras

Let be a restricted Lie algebra with the restricted enveloping algebra over a perfect field of positive characteristic . The restricted isomorphism problem asks what invariants of are determined by . This problem is the analogue of the modular isomorphism problem for finite -groups. Bagiński and Sandling have given a positive answer to the modular isomorphism problem for metacyclic -groups. In this paper, we provide a positive answer to the restricted isomorphism problem in case is metacyclic and -nilpotent.

     

On finite groups with the cayley isomorphism property

Let G be a finite group, and let Cay(G, S) be a Cayley digraph of G. If, for all T ⊂ G, Cay(G, S) ≅ Cay(G, T) implies S^α = T for some α ∈ Aut(G), then Cay(G, S) is called a CI-graph of G. For a group G, if all Cayley digraphs of valency m are CI-graphs, then G is said to have the m-DCI property; if all Cayley graphs of valency m are CI-graphs, then G is said to have the m-CI property. It is shown that every finite group of order greater than 2 has a nontrivial CI-graph, and all finite groups with the m-CI property and with the m-DCI property are characterized for small values of m. A general investigation is made of the structure of Sylow subgroups of finite groups with the m-DCI property and with the m-CI property for large values of m. © 1998 John Wiley & Sons, Inc. J Graph Theory 27: 21–31, 1998     

On the word problem and the conjugacy problem for groups of the formF/V(R)

LetF be a free group with at most countable system of free generators, letR be its normal subgroup recursively enumerable with respect to , and let be a variety of groups that differs from and for which the corresponding verbal subgroupV of the free group of countable rank is recursive. It is proved that the word problem inF/V(R) is solvable if and only if this problem is solvable inF/R, and if , then there exists anR such, that the conjugacy problem inF/R is solvable, but this problem is unsolvable inF/V(R) for any Abelian variety (all algorithmic problems are regarded with respect to the images of under the corresponding natural epimorphisms). Translated fromMatematicheskie Zametki, Vol. 61, No. 1, pp. 3–9, January, 1997. Translated by M. I. Anokhin     

Nullification and cellularization of classifying spaces of finite groups

In this note we discuss the effect of the -nullification and the -cellularization over classifying spaces of finite groups, and we relate them with the corresponding functors with respect to Moore spaces that have been intensively studied in the last years. We describe by means of a covering fibration, and we classify all finite groups for which is -cellular. We also carefully study the analogous functors in the category of groups, and their relationship with the fundamental groups of and

     

Quasi-isometric rigidity of nonuniform lattices in higher rank symmetric spaces

We compute the quasi-isometry group of an irreducible nonuniform lattice in a semisimple Lie group with finite center and no rank one factors, and show that any two such lattices are quasi-isometric if and only if they are commensurable up to conjugation.

     

On the complexity of the word problem for automaton semigroups and automaton groups

In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups, which are generated by partial, yet invertible automata. We show that there is an automaton-inverse semigroup and, thus, an automaton semigroup with a PSpace-complete word problem. We also show that there is an automaton group for which the word problem with a single rational constraint is PSpace-complete. Additionally, we provide simpler constructions for the uniform word problems of these classes. For the uniform word problem for automaton groups (without rational constraints), we show NL-hardness. Finally, we investigate a question asked by Cain about a better upper bound for the length of a word on which two distinct elements of an automaton semigroup must act differently.A detailed listing of the contributions of this paper can be found at the end of this paper.     

On the homotopy groups of p-completed classifying spaces

Among the generalizations of Serre's theorem on the homotopy groups of a finite complex we isolate the one proposed by Dwyer and Wilkerson. Even though the spaces they consider must be 2-connected, we show that it can be used to both recover known results and obtain new theorems about p-completed classifying spaces. All three authors are partially supported by MEC grant MTM2004-06686. The third author is supported by the program Ramón y Cajal, MEC, Spain, and thanks the CIB (Centre Interfacultaire Bernoulli), EPFL, Lausanne for its hospitality.     

An algorithmic construction of group automorphisms and the quantum Yang-Baxter equation

The structure group G of a non-degenerate symmetric set (X,S) is a Bieberbach and a Garside group. We describe a combinatorial method to compute explicitly a group of automorphisms of G and show this group admits a subgroup that preserves the Garside structure. In some special cases, we could also prove the group of automorphisms found is an outer automorphism group.     

On the classifying space of Artin monoids

A theorem proved by Dobrinskaya [9 Dobrinskaya, N. E. (2006). Configuration spaces of labeled particles and finite Eilenberg-MacLane complexes. Proc. Steklov Inst. Math. 252(1):30–46.[Crossref] , [Google Scholar]] shows that there is a strong connection between the K(π,1) conjecture for Artin groups and the classifying spaces of Artin monoids. More recently Ozornova obtained a different proof of Dobrinskaya’s theorem based on the application of discrete Morse theory to the standard CW model of the classifying space of an Artin monoid. In Ozornova’s work, there are hints at some deeper connections between the above-mentioned CW model and the Salvetti complex, a CW complex which arises in the combinatorial study of Artin groups. In this work we show that such connections actually exist, and as a consequence, we derive yet another proof of Dobrinskaya’s theorem.     

On the isomorphism problem for integral group rings of finite groups

Partly supported by the Deutsche Forschungsgemeinschaft and the National Science Foundation.     

Recognition of subgroups of direct products of hyperbolic groups

We give examples of direct products of three hyperbolic groups in which there cannot exist an algorithm to decide which finitely presented subgroups are isomorphic.