Criterion for the weak potency of certain HNN extensions

In this paper, we shall establish a criterion for the weak potency of certain HNN extensions of weakly potent groups. Then, using this criterion, we shall prove certain HNN extensions of weakly potent group with finite subgroup, infinite cyclic subgroup, direct product of an infinite subgroup and a finite subgroup, or finite extensions of a central subgroup as the associated subgroups are again weakly potent.

Co-induction in dynamical systems

If a countable amenable group G contains an infinite subgroup Γ, one may define, from a measurable action of Γ, the so-called co-induced measurable action of G. These actions were defined and studied by Dooley, Golodets, Rudolph and Sinelsh’chikov. In this paper, starting from a topological action of Γ, we define the co-induced topological action of G. We establish a number of properties of this construction, notably, that the G-action has the topological entropy of the Γ-action and has uniformly positive entropy (completely positive entropy, respectively) if and only if the Γ-action has uniformly positive entropy (completely positive entropy, respectively). We also study the Pinsker algebra of the co-induced action.

Conjugacy, orbit equivalence and classification of measure-preserving group actions

We prove that if G is a countable discrete group with property (T) over an infinite subgroup H≤G which contains an infinite Abelian subgroup or is normal, then G has continuum-many orbit-inequivalent measure-preserving almost-everywhere-free ergodic actions on a standard Borel probability space. Further, we obtain that the measure-preserving almost-everywhere-free ergodic actions of such a G cannot be classified up to orbit equivalence by a reasonable assignment of countable structures as complete invariants. We also obtain a strengthening and a new proof of a non-classification result of Foreman and Weiss for conjugacy of measure-preserving ergodic almost-everywhere-free actions of discrete countable groups.

ON A GENERALIZATION OF DEHN'S ALGORITHM

Viewing Dehn's algorithm as a rewriting system, we generalize to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to include finitely generated nilpotent groups, many relatively hyperbolic groups including geometrically finite groups and fundamental groups of certain geometrically decomposable 3-manifolds. The class has several nice closure properties. We also show that if a group has an infinite subgroup and one of exponential growth, and they commute, then it does not admit such an algorithm. We dub these Cannon's algorithms.

On the Decomposition of Groups

The problem in which we are interested is the following. Call an additively written group G finitely decomposable if G = Σ Gi is the weak sum of finite groups Gi, Consider the following property.Property P. Each subgroup of G having cardinality less than G is contained in a finitely decomposable direct summand of G.Does Property P imply that G is finitely decomposable? We shall demonstrate that the answer is negative even in the commutative case. Our question is closely related to (1, Problem 5). In (4), an abelian group is called a Fuchs 5-group if every infinite subgroup of the group can be embedded in a direct summand of the same cardinality. The question of whether or not a Fuchs 5-group is in fact a direct sum of countable groups has been open for several years.