Subgroup separability of graphs of abelian groups

In the present paper we give necessary and sufficient conditions for the subgroup separability of the fundamental group of a finite graph of groups with finitely generated abelian vertex groups.

     

On monomial representations of finitely generated nilpotent groups

A result of Segal states that every complex irreducible representation of a finitely generated nilpotent group G is monomial if and only if G is abelian-by-finite. A conjecture of Parshin, recently proved affirmatively by Beloshapka and Gorchinskii (2016), characterizes the monomial irreducible representations of finitely generated nilpotent groups. This article gives a slightly shorter proof of the conjecture using ideas of Kutzko and Brown. We also give a characterization of the finite-dimensional irreducible representations of two-step nilpotent groups and describe these completely for two-step groups whose center has rank one.     

Large localizations of finite groups

We construct examples of localizations in the category of groups which take the Mathieu group M₁₁ to groups of arbitrarily large cardinality which are “abelian up to finitely many generators.” The paper is part of a broader study on the group theoretic properties which are or are not preserved by localizations.     

Quasi-isometries between groups with infinitely many ends

Let G, F be finitely generated groups with infinitely many ends and let? be graph of groups decompositions of F, G such that all edge groups are finite and all vertex groups have at most one end. We show that G, F are quasi-isometric if and only if every one-ended vertex group of is quasi-isometric to some one-ended vertex group of and every one-ended vertex group of is quasi-isometric to some one-ended vertex group of?. From our proof it also follows that if G is any finitely generated group, of order at least three, the groups: and are all quasi-isometric. Received: April 7, 2000; revised version: October 6, 2000     

Hausdorff dimension in a family of self-similar groups

For every prime p and every monic polynomial f, invertible over p, we define a group G _{p, f} of p-adic automorphisms of the p-ary rooted tree. The groups are modeled after the first Grigorchuk group, which in this setting is the group . We show that the constructed groups are self-similar, regular branch groups. This enables us to calculate the Hausdorff dimension of their closures, providing concrete examples (not using random methods) of topologically finitely generated closed subgroups of the group of p-adic automorphisms with Hausdorff dimension arbitrarily close to 1. We provide a characterization of finitely constrained groups in terms of the branching property, and as a corollary conclude that all defined groups are finitely constrained. In addition, we show that all infinite, finitely constrained groups of p-adic automorphisms have positive and rational Hausdorff dimension and we provide a general formula for Hausdorff dimension of finitely constrained groups. Further “finiteness” properties are also discussed (amenability, torsion and intermediate growth). Partially supported by NSF grant DMS-0600975.     

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.

     

On linearity of finitely generated R-analytic groups

In this paper we prove that if R is a commutative Noetherian local pro-p domain of characteristic 0, then every finitely generated R-standard group is linear. This work has been partially supported by the FEDER, the MEC Grant MTM2004-04665 and the Ramón y Cajal Program.     

Growth of relatively hyperbolic groups

We show that a finitely generated group that is hyperbolic relative to a collection of proper subgroups either is virtually cyclic or has uniform exponential growth.

     

Asymptotic properties of groups acting on complexes

We examine asymptotic dimension and property A for groups acting on complexes. In particular, we prove that the fundamental group of a finite, developable complex of groups will have finite asymptotic dimension provided the geometric realization of the development has finite asymptotic dimension and the vertex groups are finitely generated and have finite asymptotic dimension. We also prove that property A is preserved by this construction provided the geometric realization of the development has finite asymptotic dimension and the vertex groups all have property A. These results naturally extend the corresponding results on preservation of these large-scale properties for fundamental groups of graphs of groups. We also use an example to show that the requirement that the development have finite asymptotic dimension cannot be relaxed.

     

Circulation distribution on groups

The problem of expressing a symmetric measure on a countable finitely generated groupG and the corresponding random walkA _gh =({g ^–1 h}),g, hG, in terms of directed circuits is solved. Connections with transient groups are given as well.     

Palindromic Width of Finitely Generated Solvable Groups

We investigate the palindromic width of finitely generated solvable groups. We prove that every finitely generated 3-step solvable group has finite palindromic width. More generally, we show the finiteness of the palindromic width for finitely generated abelian-by-nilpotent-by-nilpotent groups. For arbitrary solvable groups of step ≥3, we prove that if G is a finitely generated solvable group that is an extension of an abelian group by a group satisfying the maximal condition for normal subgroups, then the palindromic width of G is finite. We also prove that the palindromic width of ??? with respect to the set of standard generators is 3.     

Finitely additive random walks on infinitely generated free groups

We consider any purely finitely additive probability measure supported on the generators of an infinitely generated free group and the Markov strategy with stationary transition probability . As well as for the case of random walks (with countably additive transition probability) on finitely generated free groups, we prove that all bounded sets are transient. Finally, we consider any finitely additive measure (supported on the group generators) and we prove that the classification of the state space depends only on the continuous part of .     

Subgroup Separability and Linearity of Certain Graphs of Groups

We show that if the fundamental group of a finite graph of groups with finitely generated Abelian vertex groups is subgroup separable, then it is linear.     

Subgroup properties of fully residually free groups

We prove that fully residually free groups have the Howson property, that is the intersection of any two finitely generated subgroups in such a group is again finitely generated. We also establish some commensurability properties for finitely generated fully residually free groups which are similar to those of free groups. Finally we prove that for a finitely generated fully residually free group the membership problem is solvable with respect to any finitely generated subgroup.

     

JSJ-Decompositions of finitely presented groups and complexes of groups

A JSJ-splitting of a group G over a certain class of subgroups is a graph of groups decomposition of G which describes all possible decompositions of G as an amalgamated product or an HNN extension over subgroups lying in the given class. Such decompositions originated in 3-manifold topology. In this paper we generalize the JSJ-splitting constructions of Sela, Rips–Sela and Dunwoody–Sageev, and we construct a JSJ-splitting for any finitely presented group with respect to the class of all slender subgroups along which the group splits. Our approach relies on Haefliger’s theory of group actions on CAT(0) spaces. Submitted: October 2003 Revision: February 2005 Accepted: June 2005     

On a Class of Supersoluble Groups

This paper identifies a class of supersoluble groups, called finitely generated hallsoging groups. The main result states that the product of a normal finitely generated hall-soging subgroup and a subnormal supersoluble subgroup is always supersoluble.AMS Subject Classification (1991): 20F16, 20F19, 20E25.     

Polynomial structures for nilpotent groups

If a polycyclic-by-finite rank- group admits a faithful affine representation making it acting on properly discontinuously and with compact quotient, we say that admits an affine structure. In 1977, John Milnor questioned the existence of affine structures for such groups . Very recently examples have been obtained showing that, even for torsion-free, finitely generated nilpotent groups , affine structures do not always exist. It looks natural to consider affine structures as examples of polynomial structures of degree one. We introduce the concept of a canonical type polynomial structure for polycyclic-by-finite groups. Using the algebraic framework of the Seifert Fiber Space construction and a nice cohomology vanishing theorem, we prove the existence and uniqueness (up to conjugation) of canonical type polynomial structures for virtually finitely generated nilpotent groups. Applying this uniqueness to a result going back to Malcev, it follows that, for torsion-free, finitely generated nilpotent groups, each canonical polynomial structure is expressed in polynomials of limited degree. The minimal degree needed for obtaining a polynomial structure will determine the ``affine defect number'. We prove that the known counterexamples to Milnor's question have the smallest possible affine defect, i.e. affine defect number equal to one.

     

Characterization of generalized Chernikov groups among groups with involutions

The class of generalized Chernikov groups is characterized, i.e., the class of periodic locally solvable groups with the primary ascending chain condition. The name of the class is related to the fact that the structure of such groups is close to that of Chernikov groups. Namely, a Chernikov group is defined as a finite extension of a direct product of finitely many quasi-cyclic groups, and a generalized Chernikov group is a layer-finite extension of a direct productA of quasi-cyclicp-groups with finitely many factors for each primep such that each of its elements does not commute elementwise with only finitely many Sylow subgroups ofA. A theorem that characterizes the generalized Chernikov groups in the class of groups with involution is proved. Translated fromMatematicheskie Zametki, Vol. 62, No 4, pp. 577–587, October, 1997. Translated by A. I. Shtern     

Hilbert space compression and exactness of discrete groups

We show that the Hilbert space compression of any (unbounded) finite-dimensional CAT(0) cube complex is 1 and deduce that any finitely generated group acting properly, co-compactly on a CAT(0) cube complex is exact, and hence has Yu's Property A. The class of groups covered by this theorem includes free groups, finitely generated Coxeter groups, finitely generated right angled Artin groups, finitely presented groups satisfying the B(4)-T(4) small cancellation condition and all those word-hyperbolic groups satisfying the B(6) condition. Another family of examples is provided by certain canonical surgeries defined by link diagrams.     

Statistical properties of subgroups of free groups

The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so‐called word‐based distribution: subgroups are generated (finite presentations are determined) by randomly chosen k ‐tuples of reduced words, whose maximal length is allowed to tend to infinity. In this paper we adopt a different, though equally natural point of view: we investigate the statistical properties of the same objects, but with respect to the so‐called graph‐based distribution, recently introduced by Bassino, Nicaud and Weil. Here, subgroups (and finite presentations) are determined by randomly chosen Stallings graphs whose number of vertices tends to infinity. Our results show that these two distributions behave quite differently from each other, shedding a new light on which properties of finitely generated subgroups can be considered frequent or rare. For example, we show that malnormal subgroups of a free group are negligible in the graph‐based distribution, while they are exponentially generic in the word‐based distribution. Quite surprisingly, a random finite presentation generically presents the trivial group in this new distribution, while in the classical one it is known to generically present an infinite hyperbolic group. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013