2013
DOI: 10.4064/fm223-2-2
|View full text |Cite
|
Sign up to set email alerts
|

Fundamental groups of one-dimensional spaces

Abstract: Abstract. Let X be a metrizable one-dimensional continuum. In the present paper we describe the fundamental group of X as a subgroup of itsČech homotopy group. In particular, the elements of theČech homotopy group are represented by sequences of words. Among these sequences the elements of the fundamental group are characterized by a simple stabilization condition. This description of the fundamental group is used to give a new algebro-combinatorial proof of a result due to Eda on continuity properties of homo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
9
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(9 citation statements)
references
References 15 publications
0
9
0
Order By: Relevance
“…for sufficiently large k, and obtain commutative diagrams with injective functions ω n = (ω n,k ) k n−1 that output stabilized word sequences. (See, for example, [12] or [24].) For k 2n + 1, let D n : W + n,k → W + n+1,k be the monomorphism that replaces every occurrence of the letter n by ρ n,1 2n ρ −1 n,1 ρ n,2 2n+1 ρ −1 n,2 and every occurrence of the letter…”
Section: An Inverse Limit Of Finitely Generated Free Monoidsmentioning
confidence: 99%
See 3 more Smart Citations
“…for sufficiently large k, and obtain commutative diagrams with injective functions ω n = (ω n,k ) k n−1 that output stabilized word sequences. (See, for example, [12] or [24].) For k 2n + 1, let D n : W + n,k → W + n+1,k be the monomorphism that replaces every occurrence of the letter n by ρ n,1 2n ρ −1 n,1 ρ n,2 2n+1 ρ −1 n,2 and every occurrence of the letter…”
Section: An Inverse Limit Of Finitely Generated Free Monoidsmentioning
confidence: 99%
“…For every nN, xπ1false(Hn+,b0false), and mn1, the sequence false(Rn,mRn,m+1Rn,k1(gn,kfalse(xfalse))false)km of (unreduced) words is eventually constant, so that we may define functions ωn,m:π1false(Hn+,b0false)scriptWn,m+ by ωn,mfalse(xfalse)=Rn,mRn,m+1Rn,k1false(gn,k(x)false),for sufficiently large k, and obtain commutative diagrams with injective functions ωn=(ωn,k)kn1 that output stabilized word sequences. (See, for example, [12] or [24]. )…”
Section: An Inverse Limit Of Finitely Generated Free Monoidsmentioning
confidence: 99%
See 2 more Smart Citations
“…n } with R n−1 deleting the letters n and −1 n from every word [12,22]. This raises the following Question: Is there a space which has all of the above properties, with the exception of π 1 injecting into π1 ?…”
Section: Introductionmentioning
confidence: 99%