On unavoidable obstructions in Gaussian walks
Abstract
In this paper we investigate a problem about certain walks in the ring of Gaussian integers. Let n,d be two natural numbers. Does there exist a sequence of Gaussian integers zj such that |zj+1-zj|=1 and a pair of indices r and s, such that zr-zs=n and for all indices t and u, zt-zu≠ d? If there exists such a sequence we call n to be d avoidable. Let An be the set of all d∈ N such that n is not d avoidable. Recently, Ledoan and Zaharescu proved that \d ∈ N : d|n\⊂ An. We extend this result by giving a necessary and sufficient condition for d∈ An which answers a question posed by Ledoan and Zaharescu. We also find a precise formula for the cardinality of An and answer three other questions raised in the same paper.
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.