2018
DOI: 10.1007/s11856-018-1765-2
|View full text |Cite
|
Sign up to set email alerts
|

Polish topologies for graph products of cyclic groups

Abstract: We give a complete characterization of the graph products of cyclic groups admitting a Polish group topology, and show that they are all realizable as the group of automorphisms of a countable structure. In particular, we characterize the right-angled Coxeter groups (resp. Artin groups) admitting a Polish group topology. This generalizes results from [7], [9] and [4].

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
7
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(7 citation statements)
references
References 9 publications
(15 reference statements)
0
7
0
Order By: Relevance
“…Since S is countable, false|Isfalse|false|Gfalse| and (G,d) is Polish, it suffices to show that false|Isfalse|>0 implies false|Isfalse|=20. Note that the case s=(p,n) is actually taken care of by [, Lemma 18 and Observation 19], but for completeness of exposition we give a direct proof also in the case s=(p,n). For sS and tIs, let gtGtfalse{efalse} be such that gt satisfies no further demands in the case s=, and gt generates Gt in the case s=(p,n).…”
Section: First Venuementioning
confidence: 99%
See 1 more Smart Citation
“…Since S is countable, false|Isfalse|false|Gfalse| and (G,d) is Polish, it suffices to show that false|Isfalse|>0 implies false|Isfalse|=20. Note that the case s=(p,n) is actually taken care of by [, Lemma 18 and Observation 19], but for completeness of exposition we give a direct proof also in the case s=(p,n). For sS and tIs, let gtGtfalse{efalse} be such that gt satisfies no further demands in the case s=, and gt generates Gt in the case s=(p,n).…”
Section: First Venuementioning
confidence: 99%
“…In fact, Dudley's work proves more strongly that any homomorphism from a Polish group G into a right‐angled Artin group H is continuous with respect to the discrete topology on H. The setting of has then been further generalized by the authors in to the class of graph products of groups G(Γ,Ga) in which all the factor groups Ga are cyclic, or, equivalently, cyclic of order a power of prime or infinity. In this case the situation is substantially more complicated, and the solution of the problem establishes that G=G(Γ,Ga) admits a Polish group topology if and only if it admits a non‐Archimedean Polish group topology if and only if G=G1G2 with G1 a countable graph product of cyclic groups and G2 a direct sum of finitely many continuum‐sized vector spaces over a finite field.…”
Section: Introductionmentioning
confidence: 99%
“…These groups have received much attention in combinatorial and geometric group theory. In [9] the authors characterized the graph products of cyclic groups admitting a Polish group topology, showing that G has to have the form G 1 ⊕ G 2 with G 1 a countable graph product of cyclic groups and G 2 a direct sum of finitely many continuum sized vector spaces over a finite field. In the present study we complement the work of [9] with the following results: Theorem 2.…”
Section: Introductionmentioning
confidence: 99%
“…
We complement the characterization of the graph products of cyclic groups G(Γ, p) admitting a Polish group topology of [9] with the following result. Let G = G(Γ, p), then the following are equivalent:(i) there is a metric on Γ which induces a separable topology in which E Γ is closed; (ii) G(Γ, p) is embeddable into a Polish group; (iii) G(Γ, p) is embeddable into a non-Archimedean Polish group.
…”
mentioning
confidence: 99%
See 1 more Smart Citation