English

An inverse-type problem for cycles in local Cayley distance graphs

Combinatorics 2021-05-11 v2

Abstract

Let EE be a proper symmetric subset of Sd1S^{d-1}, and CFqd(E)C_{\mathbb{F}_q^d}(E) be the Cayley graph with the vertex set Fqd\mathbb{F}_q^d, and two vertices xx and yy are connected by an edge if xyEx-y\in E. Let k2k\ge 2 be a positive integer. We show that for any α(0,1)\alpha\in (0, 1), there exists q(α,k)q(\alpha, k) large enough such that if ESd1FqdE\subset S^{d-1}\subset \mathbb{F}_q^d with Eαqd1|E|\ge \alpha q^{d-1} and qq(α,k)q\ge q(\alpha, k), then for each vertex vv, there are at least c(α,k)q(2k1)d4k2c(\alpha, k)q^{\frac{(2k-1)d-4k}{2}} cycles of length 2k2k with distinct vertices in CFqd(E)C_{\mathbb{F}_q^d}(E) containing vv. This result is the inverse version of a recent result due to Iosevich, Jardine, and McDonald (2021).

Keywords

Cite

@article{arxiv.2103.11420,
  title  = {An inverse-type problem for cycles in local Cayley distance graphs},
  author = {Thang Pham},
  journal= {arXiv preprint arXiv:2103.11420},
  year   = {2021}
}

Comments

16 pages. V2 with some small changes

R2 v1 2026-06-24T00:23:51.552Z