Strong marker sets and applications

Abstract

We prove the existence of clopen marker sets with some strong regularity property. For each n≥ 1 and any integer d≥ 1, we show that there are a positive integer D and a clopen marker set M in F(2Zn) such that (1) for any distinct x,y∈ M in the same orbit, (x,y)≥ d; (2) for any 1≤ i≤ n and any x∈ F(2Zn), there are non-negative integers a, b≤ D such that a· x∈ M and -b· x∈ M. As an application, we obtain a clopen tree section for F(2Zn). Based on the strong marker sets, we get a quick proof that there exist clopen continuous edge (2n+1)-colorings of F(2Zn). We also consider a similar strong markers theorem for more general generating sets. In dimension 2, this gives another proof of the fact that for any generating set S⊂eq Z2, there is a continuous proper edge (2|S|+1)-coloring of the Schreier graph of F(2Zn) with generating set S.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…