scholarly journals Inverse limits of finite rank free groups

2012 ◽  
Vol 15 (6) ◽  
Author(s):  
Gregory R. Conner ◽  
Curtis Kent
Keyword(s):  
Homomorphic Image ◽  
Free Group ◽  
Finite Rank ◽  
Inverse Limit ◽  
Free Groups ◽  
Inverse System ◽  
Inverse Limits ◽  
Universal Group ◽  
Hawaiian Earring ◽  
Constant System

Abstract.We will show that the inverse limit of finite rank free groups with surjective connecting homomorphism is isomorphic either to a finite rank free group or to a fixed universal group. In other words, any inverse system of finite rank free groups which is not equivalent to an eventually constant system has the universal group as its limit. This universal inverse limit is naturally isomorphic to the first shape group of the Hawaiian earring. We also give an example of a homomorphic image of the Hawaiian earring group which lies in the inverse limit of free groups but is neither a free group nor isomorphic to the Hawaiian earring group.

scholarly journals On the generic type of the free group

2011 ◽  
Vol 76 (1) ◽  
pp. 227-234 ◽  
Author(s):  
Rizos Sklinos
Keyword(s):  
Free Group ◽  
Finite Rank ◽  
Free Groups ◽  
Primitive Elements ◽  
Generic Type

AbstractWe answer a question raised in [9], that is whether the infinite weight of the generic type of the free group is witnessed in Fω. We also prove that the set of primitive elements in finite rank free groups is not uniformly definable. As a corollary, we observe that the generic type over the empty set is not isolated. Finally, we show that uncountable free groups are not ℵ1-homogeneous.

A Note on Inverse Limits of Finite Spaces

1970 ◽  
Vol 13 (1) ◽  
pp. 69-70
Author(s):  
S. B. Nadler
Keyword(s):  
Finite Groups ◽  
Inverse Limit ◽  
Inverse System ◽  
Inverse Limits ◽  
Hausdorff Spaces ◽  
Finite Spaces

The following lemma, which appears as Lemma 4 in [5], was used to determine certain multicoherence properties of inverse limits of continua.Lemma. Let X denote the inverse limit of an inverse system {Xλ, fλμ, Λ} of compact Hausdorff spaces Xλ. If Xλ has no more than k components (where k < ∞ is fixed) for each λ ∊ Λ, then X has no more than k components.In this paper we give a set theoretic analogue of this lemma and an extension which was suggested to the author by Professor F. W. Lawvere. An application to inverse limits of finite groups is then given.

AUTOMORPHISMS OF RELATIVELY FREE GROUPS IN THE VARIETY N2A ∧ AN2 ∧ Nc

2001 ◽  
Vol 63 (3) ◽  
pp. 607-622 ◽  
Author(s):  
ATHANASSIOS I. PAPISTAS
Keyword(s):  
Automorphism Group ◽  
Free Group ◽  
Finite Index ◽  
Finite Rank ◽  
Free Groups ◽  
Finite Set ◽  
Tame Automorphism ◽  
Positive Integers ◽  
Relatively Free Group

For positive integers n and c, with n [ges ] 2, let Gn, c be a relatively free group of finite rank n in the variety N2A ∧ AN2 ∧ Nc. It is shown that the subgroup of the automorphism group Aut(Gn, c) of Gn, c generated by the tame automorphisms and an explicitly described finite set of IA-automorphisms of Gn, c has finite index in Aut(Gn, c). Furthermore, it is proved that there are no non-trivial elements of Gn, c fixed by every tame automorphism of Gn, c.

scholarly journals Generating groups of certain soluble varieties

1974 ◽  
Vol 17 (2) ◽  
pp. 222-233 ◽  
Author(s):  
Narain Gupta ◽  
Frank Levin
Keyword(s):  
Free Group ◽  
Finite Rank ◽  
Free Groups ◽  
Infinite Rank ◽  
Variety Of Groups ◽  
Countably Infinite

Any variety of groups is generated by its free group of countably infinite rank. A problem that appears in various forms in Hanna Neumann's book [7] (see, for intance, sections 2.4, 2.5, 3.5, 3.6) is that of determining if a given variety B can be generated by Fk(B), one of its free groups of finite rank; and if so, if Fn(B) is residually a k-generator group for all n ≧ k. (Here, as in the sequel, all unexplained notation follows [7].)

COMMUTATOR SUBGROUPS OF FREE NILPOTENT GROUPS

2007 ◽  
Vol 17 (05n06) ◽  
pp. 1021-1031
Author(s):  
N. GUPTA ◽  
I. B. S. PASSI
Keyword(s):  
Nilpotent Group ◽  
Free Group ◽  
Finite Rank ◽  
Free Groups ◽  
Nilpotent Groups ◽  
Finite Chain ◽  
Free Nilpotent Group ◽  
Infinite Rank ◽  
Derived Subgroup ◽  
Finite Set

For fixed m, n ≥ 2, we examine the structure of the nth lower central subgroup γn(F) of the free group F of rank m with respect to a certain finite chain F = F(0) > F(1) > ⋯ > F(l-1) > F(l) = {1} of free groups in which F(k) is of finite rank m(k) and is contained in the kth derived subgroup δk(F) of F. The derived subgroups δk(F/γn(F)) of the free nilpotent group F/γn(F) are isomorphic to the quotients F(k)/(F(k) ∩ γn(F)) and admit presentations of the form 〈xk,1,…,xk,m(k): γ(n)(F(k))〉, where γ(n)(F(k)), contained in γn(F), is a certain partial lower central subgroup of F(k). We give a complete description of γn(F) as a staggered product Π1 ≤ k ≤ l-1(γ〈n〉(F(k))*γ[n](F(k)))F(k+1), where γ〈n〉(F(k)) is a free factor of the derived subgroup [F(k),F(k)] of F(k) having countable infinite rank and generated by a certain set of reduced commutators of weight at least n, and γ[n](F(k)) is the subgroup generated by a certain finite set of products of non-reduced ordered commutators of weight at least n. There are some far-reaching consequences.

scholarly journals AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK

2011 ◽  
Vol 21 (01n02) ◽  
pp. 329-354 ◽  
Author(s):  
BENJAMIN STEINBERG ◽  
MARIYA VOROBETS ◽  
YAROSLAV VOROBETS
Keyword(s):  
Free Group ◽  
Finite Rank ◽  
Finite Automata ◽  
Free Groups ◽  
Free Products ◽  
Cyclic Groups ◽  
Binary Alphabet

We construct automata over a binary alphabet with 2n states, n ≥ 2, whose states freely generate a free group of rank 2n. Combined with previous work, this shows that a free group of every finite rank can be generated by finite automata over a binary alphabet. We also construct free products of cyclic groups of order two via such automata.

scholarly journals Topological n-cells and Hilbert cubes in inverse limits

2018 ◽  
Vol 19 (1) ◽  
pp. 9
Author(s):  
Leonard R. Rubin
Keyword(s):  
Set Theory ◽  
Weak Topology ◽  
Inverse Limit ◽  
Metrizable Space ◽  
Inverse System ◽  
Inverse Limits ◽  
Hilbert Cube ◽  
Compact Metrizable Space ◽  
Metric Topology

<p>It has been shown by S. Mardešić that if a compact metrizable space X has dim X ≥ 1 and X is the inverse limit of an inverse sequence of compact triangulated polyhedra with simplicial bonding maps, then X must contain an arc.  We are going  to prove that  if X = (|K<sub>a</sub>|,p<sup>b</sup><sub>a</sub>,(A,)<a href="http://www.codecogs.com/eqnedit.php?latex=\preceq" target="_blank"><img title="\preceq" src="http://latex.codecogs.com/gif.latex?\preceq" alt="" /></a>)is an inverse system in set theory of triangulated polyhedra|K<sub>a</sub>|with simplicial  bonding  functions p<sup>b</sup><sub>a</sub> and X = lim X,  then  there  exists  a uniquely determined sub-inverse system X<sub>X</sub>= (|L<sub>a</sub>|, p<sup>b</sup><sub>a</sub>|L<sub>b</sub>|,(A,<a href="http://www.codecogs.com/eqnedit.php?latex=\preceq" target="_blank"><img title="\preceq" src="http://latex.codecogs.com/gif.latex?\preceq" alt="" /></a>)) of X where for each a, L<sub>a</sub> is a subcomplex of K<sub>a</sub>, each p<sup>b</sup><sub>a</sub>|L<sub>b</sub>|:|L<sub>b</sub>| → |L<sub>a</sub>| is  surjective,  and lim X<sub>X</sub> = X. We shall use this to generalize the Mardešić result by characterizing when the inverse limit of an inverse sequence of triangulated polyhedra with simplicial bonding maps must contain a topological n-cell and do the same in the case of an inverse system of finite triangulated polyhedra with simplicial bonding maps. We shall also characterize when the inverse limit of an inverse sequence of triangulated polyhedra with simplicial bonding maps must contain an embedded copy of the Hilbert cube. In each of the above settings, all the polyhedra have the weak topology or all have the metric topology(these topologies being identical when the polyhedra are finite).</p>

Finitely generated subgroups of free groups as formal languages and their cogrowth

2021 ◽  
Vol volume 13, issue 2 ◽  
Author(s):  
Arman Darbinyan ◽  
Rostislav Grigorchuk ◽  
Asif Shaikh
Keyword(s):  
Free Group ◽  
Finite Automaton ◽  
Finite Rank ◽  
Regular Language ◽  
Free Groups ◽  
Formal Languages ◽  
Finitely Generated ◽  
Deterministic Finite Automaton ◽  
Method Of Calculation ◽  
Reduced Words

For finitely generated subgroups $H$ of a free group $F_m$ of finite rank $m$, we study the language $L_H$ of reduced words that represent $H$ which is a regular language. Using the (extended) core of Schreier graph of $H$, we construct the minimal deterministic finite automaton that recognizes $L_H$. Then we characterize the f.g. subgroups $H$ for which $L_H$ is irreducible and for such groups explicitly construct ergodic automaton that recognizes $L_H$. This construction gives us an efficient way to compute the cogrowth series $L_H(z)$ of $H$ and entropy of $L_H$. Several examples illustrate the method and a comparison is made with the method of calculation of $L_H(z)$ based on the use of Nielsen system of generators of $H$.

Sign in / Sign up

Export Citation Format

Share Document