Search arXivSearch

arXiv · 2208.05527

Families of modular arithmetic progressions with an interval of distance multiplicities

Abstract

Given a family $\mathcal{F}=\{A_1,\dots,A_s\}$ of subsets of $\mathbb{Z}_n$, define $Δ\mathcal{F}$ to be the multiset of all (cyclic) distances dist$(x,y)$, where $\{x,y\} \subset A_i$, $x \neq y$, for some $i=1,\dots,s$. Taking inspiration from a Euclidean distance problem of Erdős, we say that $\mathcal{F}$ is Erdős-deep if the multiplicities of distances that occur in $Δ\mathcal{F}$ are precisely $1,2,\dots,k-1$ for some integer $k$. In the case $s=1$, it is known that a modular arithmetic progression in $\mathbb{Z}_n$ 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 Erdős-deep pairs $\{A_1,A_2\}$ when each $A_i$ is an arithmetic progression in $\mathbb{Z}_n$. We also give a construction of a much wider class of Erdős-deep families $\{A_1,\dots,A_s\}$ when $s$ is a square integer.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter J Dukes, Tao Gaede. 2022-08-10. Families of modular arithmetic progressions with an interval of distance multiplicities. https://arxiv.org/abs/2208.05527

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO