Strong marker sets for arbitrary generating sets

Abstract

We prove the existence of clopen strong marker sets in F(2Zn) for arbitrary finite generating sets. Specifically, for any positive integers n, d0≥ 1 and any finite generating set S⊂eq Zn, we construct a clopen set M⊂eq F(2Zn) and a positive integer Δ such that (1) for any distinct x,y∈ M in the same orbit, ρ(x,y)≥ d0; (2) for any v∈ S and any x∈ F(2Zn), there are non-negative integers a,b≤ Δ such that av· x∈ M and -bv· x∈ M. Here ρ denotes the Euclidean metric. The same result then holds for the standard supremum-norm metric ρ∞ (with an adjusted constant), by the equivalence of norms on Zn. The proof introduces polyhedral packages in Rn as a generalization of the rectangular packages used in earlier work, enabling the construction to handle generating vectors with arbitrary coordinate patterns. As an application, we obtain a continuous proper edge (2|S|+1)-coloring of the Schreier graph on F(2Zn) with generating set S, recovering a result of Gao--Wang--Wang.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…