Families of modular arithmetic progressions with an interval of distance multiplicities

Abstract

Given a family F=\A1,…,As\ of subsets of Zn, define F to be the multiset of all (cyclic) distances dist(x,y), where \x,y\ ⊂ Ai, x ≠ y, for some i=1,…,s. Taking inspiration from a Euclidean distance problem of Erdos, we say that F is Erdos-deep if the multiplicities of distances that occur in F are precisely 1,2,…,k-1 for some integer k. In the case s=1, it is known that a modular arithmetic progression in Zn achieves this property (under mild conditions); conversely, APs are the only such sets, except for one sporadic case when n=6. Here, we consider in detail the case s=2. In particular, we classify Erdos-deep pairs \A1,A2\ when each Ai is an arithmetic progression in Zn. We also give a construction of a much wider class of Erdos-deep families \A1,…,As\ when s is a square integer.

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…