Search arXiv⌕ Search

arXiv · math/0603470

Centralizers of Lie Algebras Associated to the Descending Central Series of Certain Poly-Free Groups

Abstract

Poly-free groups are constructed as iterated semidirect products of free groups. The class of poly-free groups includes the classical pure braid groups, fundamental groups of fiber-type hyperplane arrangements, and certain subgroups of the automorphism groups of free groups. The purpose of this article is to compute centralizers of certain natural Lie subalgebras of the Lie algebra obtained from the descending central series of poly-free groups G including some of the geometrically interesting classes of groups mentioned above. The main results here extend results of Cohen and Prassidis for such groups. These results imply that a homomorphism out of G is faithful, essentially, if it is faithful when restricted to the level of Lie algebras obtained from the descending central series for the product F x Z, where F is the "top" free group in the semidirect products of free groups and Z is the center of G. The arguments use a mixture of homological, and Lie algebraic methods applied to certain choices of extensions. The limitations of these methods are illustrated using the "poison groups" of Formanek and Procesi, poly-free groups whose Lie algebras do not have certain properties considered here.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniel C. Cohen, F. R. Cohen, Stratos Prassidis. 2007-01-21. Centralizers of Lie Algebras Associated to the Descending Central Series of Certain Poly-Free Groups. https://arxiv.org/abs/math/0603470

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Strongly Regular Graphs of Rank Four

Strongly regular graphs are regular graphs with a constant number of common neighbours between adjacent vertices, and a constant number of common neighbours between non-adjacent vertices. These graphs have been of great interest over the last few decades and often give rise to interesting groups of automorphisms. In this paper we take a reverse approach, and leverage strong classification results on rank four permutation groups to classify the strongly regular graphs which yield such groups as a group of automorphisms.

math.GR↗

Every finite group admits a just finite presentation

A finite presentation < X | R > of a finite group is called `just finite' if removing any relation from R results in a presentation for an infinite group. It has been an open question (Kourovka Notebook, Problem 21.10) whether every finite group admits such a presentation. We resolve this conjecture in the affirmative.

math.GR↗

Assouad--Nagata dimension of systolic complexes with almost flat intervals

We introduce the notion of systolic complexes with almost flat intervals. They constitute a subclass of fit systolic complexes and arise naturally in the study of graphical C(3)--T(6) small cancellation complexes. We prove that their Assouad--Nagata dimension is bounded above by a universal constant. As consequences, we obtain universal bounds on the Assouad--Nagata dimension of tame simply connected graphical C(3)--T(6) small cancellation complexes and of finitely generated groups defined by graphical C(3)--T(6) small cancellation presentations. In the appendix, we observe that the proof of finiteness of asymptotic dimension for buildings due to Dymara and Schick also yields finiteness of their asymptotic Assouad--Nagata dimension.

math.GR↗