Search arXivSearch

arXiv · 2608.23529

Infinite rational distance sets in affine general position: constructions in every dimension

Abstract

For every integer $d\geq 1$, we construct a countably infinite set $X_d\subset\mathbb{R}^d$ in affine general position, with all pairwise distances rational. When $d$ is odd, $X_d$ may also be chosen so that no $d+2$ points lie on a common sphere. The construction is uniform in $d$: positive Chebyshev square decompositions produce harmonic curves on spheres whose points corresponding to rational parameter values have pairwise rational distances. A divided-difference factorization of the affine determinant shows that sufficiently short arcs are locally convex, and stereographic projection produces the odd-dimensional examples. We also construct infinite rational distance sets in $\mathbb{Q}^d$ in affine general position for every even $d$, and in general position for every $d\equiv 1\pmod 4$. For every $d\geq 1$ and $n\geq d+1$, taking and rescaling suitable finite subsets gives $n$-point integral point sets in affine general position. A suitable ordered choice yields integral-distance realizations of all cyclic polytopes. In dimension three, we give an explicit rational parametrization and obtain infinitely many pairwise non-similar primitive $n_3$-clusters for every $n\geq 4$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Junkai Qiu. 2026-08-24. Infinite rational distance sets in affine general position: constructions in every dimension. https://arxiv.org/abs/2608.23529

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