Search arXivSearch

arXiv · 2405.07325

On the distance problem over finite p-adic rings

Abstract

In this paper, we study the distance problem in the setting of finite p-adic rings. In odd dimensions, our results are essentially sharp. In even dimensions, we clarify the conjecture and provide examples to support it. Surprisingly, compared to the finite field case, in this setting, we are able to provide a large family of sets such that the distance conjecture holds. By developing new restriction type estimates associated to circles and orbits, with a group theoretic argument, we will prove the $4/3$-parallel result in the two dimensions. This answers a question raised by Alex Iosevich. In a more general scenario, the existence/distribution of geometric/graph configurations will be also considered in this paper. Our results present improvements and extensions of recent results due to Ben Lichtin (2019, 2023). In comparison with Lichtin's method, our approach is much simpler and flexible, which is also one of the novelties in this paper.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thang Pham, Boqing Xue. 2026-07-12. On the distance problem over finite p-adic rings. https://arxiv.org/abs/2405.07325

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