On unavoidable obstructions in Gaussian walks

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

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

z_{j}

such that

| z_{j + 1} - z_{j} | = 1

and a pair of indices

r

and

s

, such that

z_{r} - z_{s} = n

and for all indices

t

and

u

,

z_{t} - z_{u} e q d

? If there exists such a sequence we call

n

to be

d

avoidable. Let

A_{n}

be the set of all

d i n m a t h b b N

such that

n

is not

d

avoidable. Recently, Ledoan and Zaharescu proved that

d i n m a t h b b N : d | n s u b s e t A_{n}

. We extend this result by giving a necessary and sufficient condition for

d i n A_{n}

which answers a question posed by Ledoan and Zaharescu. We also find a precise formula for the cardinality of

A_{n}

and answer three other questions raised in the same paper.

Recommendations

Cited in

(2)

This page was built for publication: On unavoidable obstructions in Gaussian walks