Indexed metadata

Equidistant Affine Subspaces: Explicit Bounds, Codimension-Two Reduction, and Transverse Products

Jia Li

Source record

Source: arXiv

Published: Oct 27, 2026

arXiv: 2610.37421

Open original source ↗

Source abstract

Let N(k,n)\mathcal{N}(k,n) be the largest size of a family of affine kk-planes in Rn\R^n at pairwise separation distance one. We develop a unified treatment of upper bounds, dimension reduction, and product constructions. Orthogonal-projection coordinates give a rank-stratified distance identity; a Veronese lifting converts its polynomial consequences into simultaneous total isotropy. Connected Nash decomposition and an analytic diagonal argument replace the linear-independence step in Höfer's three-dimensional method. An explicit cylindrical decomposition estimate yields N(k,n)⩽2 2 3(k+1)(n−k)\mathcal{N}(k,n)\leqslant 2^{\,2^{\,3(k+1)(n-k)}}. For configurations whose direction sums have dimension at most k+1k+1, we prove the exact reduction N⩽k+1(k,n)=N(1,n−k+1)\mathcal{N}_{\leqslant k+1}(k,n)=\mathcal{N}(1,n-k+1). Every codimension-two equidistant configuration splits off a common linear factor, giving N(n−2,n)=N(1,3)\mathcal{N}(n-2,n)=\mathcal{N}(1,3). We also determine the sharp bound 2(n−k)2(n-k) when all directions lie in a fixed (k+1)(k+1)-dimensional subspace. A transverse product construction gives multiplicative inequalities and makes S(c)=N(c−1,2c−1)S(c)=\mathcal{N}(c-1,2c-1) supermultiplicative. In particular, S(c)⩾2c mod 27⌊c/2⌋S(c)\geqslant 2^{c\bmod 2}7^{\lfloor c/2\rfloor}. The structural results and constructions do not depend on the exact value of N(1,3)\mathcal{N}(1,3).

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Equidistant Affine Subspaces: Explicit Bounds, Codimension-Two Reduction, and Transverse Products — Mathematical Frontier Network