Relation modules of infinite groups, II

2014 ◽  
Vol 12 (3) ◽  
Author(s):  
Martin Evans

AbstractLet F n denote the free group of rank n and d(G) the minimal number of generators of the finitely generated group G. Suppose that R ↪ F m ↠ G and S ↪ F m ↠ G are presentations of G and let $$\bar R$$ and $$\bar S$$ denote the associated relation modules of G. It is well known that $$\bar R \oplus (\mathbb{Z}G)^{d(G)} \cong \bar S \oplus (\mathbb{Z}G)^{d(G)}$$ even though it is quite possible that . However, to the best of the author’s knowledge no examples have appeared in the literature with the property that . Our purpose here is to exhibit, for each integer k ≥ 1, a group G that has presentations as above such that . Our approach depends on the existence of nonfree stably free modules over certain commutative rings and, in particular, on the existence of certain Hurwitz-Radon systems of matrices with integer entries discovered by Geramita and Pullman. This approach was motivated by results of Adams concerning the number of orthonormal (continuous) vector fields on spheres.

Author(s):  
Martin J. Evans

Let Fn be the free group of rank n freely generated by x1, x2,…, xn and write d(G) for the minimal number of generators of the finitely generated group G.


2011 ◽  
Vol 21 (04) ◽  
pp. 595-614 ◽  
Author(s):  
S. LIRIANO ◽  
S. MAJEWICZ

If G is a finitely generated group and A is an algebraic group, then RA(G) = Hom (G, A) is an algebraic variety. Define the "dimension sequence" of G over A as Pd(RA(G)) = (Nd(RA(G)), …, N0(RA(G))), where Ni(RA(G)) is the number of irreducible components of RA(G) of dimension i (0 ≤ i ≤ d) and d = Dim (RA(G)). We use this invariant in the study of groups and deduce various results. For instance, we prove the following: Theorem A.Let w be a nontrivial word in the commutator subgroup ofFn = 〈x1, …, xn〉, and letG = 〈x1, …, xn; w = 1〉. IfRSL(2, ℂ)(G)is an irreducible variety andV-1 = {ρ | ρ ∈ RSL(2, ℂ)(Fn), ρ(w) = -I} ≠ ∅, thenPd(RSL(2, ℂ)(G)) ≠ Pd(RPSL(2, ℂ)(G)). Theorem B.Let w be a nontrivial word in the free group on{x1, …, xn}with even exponent sum on each generator and exponent sum not equal to zero on at least one generator. SupposeG = 〈x1, …, xn; w = 1〉. IfRSL(2, ℂ)(G)is an irreducible variety, thenPd(RSL(2, ℂ)(G)) ≠ Pd(RPSL(2, ℂ)(G)). We also show that if G = 〈x1, . ., xn, y; W = yp〉, where p ≥ 1 and W is a word in Fn = 〈x1, …, xn〉, and A = PSL(2, ℂ), then Dim (RA(G)) = Max {3n, Dim (RA(G′)) +2 } ≤ 3n + 1 for G′ = 〈x1, …, xn; W = 1〉. Another one of our results is that if G is a torus knot group with presentation 〈x, y; xp = yt〉 then Pd(RSL(2, ℂ)(G))≠Pd(RPSL(2, ℂ)(G)).


1998 ◽  
Vol 08 (01) ◽  
pp. 23-34 ◽  
Author(s):  
Susan Garner Garille ◽  
John Meier

Let G be a finitely generated group. The Bieri–Neumann–Strebel invariant Σ1(G) of G determines, among other things, the distribution of finitely generated subgroups N◃G with G/N abelian. This invariant can be quite difficult to compute. Given a finite presentation 〈S:R〉 for G, there is an algorithm, introduced by Brown and extended by Bieri and Strebel, which determines a space Σ(R) that is always contained in, and is sometimes equal to, Σ1(G). We refine this algorithm to one which involves the local structure of the universal cover of the standard 2-complex of a given presentation. Let Ψ(R) denote the space determined by this algorithm. We show that Σ(R) ⊆ Ψ ⊆ Σ1(G) for any finitely presented group G, and if G admits a staggered presentation, then Ψ = Σ1(G). By casting this algorithm in terms of connectivity properties of graphs, it is shown to be computationally feasible.


1992 ◽  
Vol 45 (3) ◽  
pp. 513-520 ◽  
Author(s):  
Ron Hirshon ◽  
David Meier

We prove that given a finitely generated group G with a homomorphism of G onto G × H, H non-trivial, or a finitely generated group G with a homomorphism of G onto G × G, we can always find normal subgroups N ≠ G such that G/N ≅ G/N × H or G/N ≅ G/N × G/N respectively. We also show that given a finitely presented non-Hopfian group U and a homomorphism φ of U onto U, which is not an isomorphism, we can always find a finitely presented group H ⊇ U and a finitely generated free group F such that φ induces a homomorphism of U * F onto (U * F) × H. Together with the results above this allows the construction of many examples of finitely generated groups G with G ≅ G × H where H is finitely presented. A finitely presented group G with a homomorphism of G onto G × G was first constructed by Baumslag and Miller. We use a slight generalisation of their method to obtain more examples of such groups.


1999 ◽  
Vol 59 (2) ◽  
pp. 271-295
Author(s):  
Victor Brunsden

Stowe's Theorem on the stability of the fixed points of a C2 action of a finitely generated group Γ is generalised to C1 actions of such groups on Banach manifolds. The result is then used to prove that if φ is a Cr action on a smooth, closed, manifold M satisfying H1(Γ, Dr−1(M)) = 0, then φ is locally rigid. Here, r ≥ 2 and Dk(M) is the space of Ck tangent vector fields on M. This generalises a local rigidity result of Weil for representations of a finitely generated group Γ in a Lie group.


2011 ◽  
Vol 76 (4) ◽  
pp. 1307-1321 ◽  
Author(s):  
Christian Rosendal

AbstractGiven a finitely generated group Γ we study the space Isom(Γ, ) of all actions of Γ by isometries of the rational Urysohn metric space , where Isom (Γ, ) is equipped with the topology it inherits seen as a closed subset of Isom . When Γ is the free group on n generators this space is just Isom , but is in general significantly more complicated. We prove that when Γ is finitely generated Abelian there is a generic point in Isom(Γ, ), i.e., there is a comeagre set of mutually conjugate isometric actions of Γ on .


1986 ◽  
Vol 29 (1) ◽  
pp. 69-73 ◽  
Author(s):  
M. H. Albert ◽  
J. Lawrence

The Ehrenfeucht Conjecture [5] states that if Μ is a finitely generated free monoid with nonempty subset S, then there is a finite subset T⊂S (a “test set”) such that given two endomorphisms f and g on Μ, f and g agree on S if and only if they agree on T. In[4], the authors prove that the above conjecture is equivalent to the following conjecture: a system of equations in a finite number of unknowns in Μ is equivalent to a finite subsystem. Since a finitely generated free monoid embeds naturally into the free group with the same number of generators, it is natural to ask whether a free group of finite rank has the above property on systems of equations. A restatement of the question motivates the following.


2018 ◽  
Vol 28 (01) ◽  
pp. 97-113
Author(s):  
Luc Guyot

The Andrews–Curtis conjecture claims that every normally generating [Formula: see text]-tuple of a free group [Formula: see text] of rank [Formula: see text] can be reduced to a basis by means of Nielsen transformations and arbitrary conjugations. Replacing [Formula: see text] by an arbitrary finitely generated group yields natural generalizations whose study may help disprove the original and unsettled conjecture. We prove that every finitely generated soluble group satisfies the generalized Andrews–Curtis conjecture in the sense of Borovik, Lubotzky and Myasnikov. In contrast, we show that some soluble Baumslag–Solitar groups do not satisfy the generalized Andrews–Curtis conjecture in the sense of Burns and Macedońska.


Author(s):  
Michele Rossi ◽  
Lea Terracini

AbstractLet X be a $$\mathbb {Q}$$ Q -factorial complete toric variety over an algebraic closed field of characteristic 0. There is a canonical injection of the Picard group $$\mathrm{Pic}(X)$$ Pic ( X ) in the group $$\mathrm{Cl}(X)$$ Cl ( X ) of classes of Weil divisors. These two groups are finitely generated abelian groups; while the first one is a free group, the second one may have torsion. We investigate algebraic and geometrical conditions under which the image of $$\mathrm{Pic}(X)$$ Pic ( X ) in $$\mathrm{Cl}(X)$$ Cl ( X ) is contained in a free part of the latter group.


2019 ◽  
Vol 18 (02) ◽  
pp. 1950035 ◽  
Author(s):  
M. Behboodi ◽  
Z. Fazelpour

We define prime uniserial modules as a generalization of uniserial modules. We say that an [Formula: see text]-module [Formula: see text] is prime uniserial ([Formula: see text]-uniserial) if its prime submodules are linearly ordered by inclusion, and we say that [Formula: see text] is prime serial ([Formula: see text]-serial) if it is a direct sum of [Formula: see text]-uniserial modules. The goal of this paper is to study [Formula: see text]-serial modules over commutative rings. First, we study the structure [Formula: see text]-serial modules over almost perfect domains and then we determine the structure of [Formula: see text]-serial modules over Dedekind domains. Moreover, we discuss the following natural questions: “Which rings have the property that every module is [Formula: see text]-serial?” and “Which rings have the property that every finitely generated module is [Formula: see text]-serial?”.


Sign in / Sign up

Export Citation Format

Share Document