We study nearest-neighbour distances and strict best returns of cyclic orbits on $(V\times G)/\Lambda$, where $V$ is a finite-dimensional real normed space, $G$ has a bi-invariant ultrametric, and $\Lambda$ is an arbitrary closed subgroup. For the quotient of the maximum product metric, the number of distinct nearest-neighbour distances in every finite orbit segment is at most $P(\overline V)+1$, where $P$ is an open-ball packing constant and $\overline V$ is obtained by factoring out the continuous real part of $\Lambda$. For inner-product norms the bound depends only on the span of the projected subgroup. This gives $2^d+1$ for the maximum norm on $\mathbb R^d$ and strong-kissing-number bounds for inner-product norms, extending the corresponding real and adelic distance bounds. Our second main result is an exact abelianization principle: every such cyclic orbit is isometric, with its integer indexing preserved, to a cyclic orbit on an abelian mixed quotient $(V\times U)/\Lambda_{\mathrm{ab}}$. The construction preserves the reduced and effective real factors. Thus noncommutativity and non-normality enlarge the class of ambient presentations but not the class of cyclic-orbit metrics. The record-count identity and its growth consequences require only an isometric embedding of a metric space. For mixed homogeneous spaces we prove packing recurrences and, using abelianization, the sharp three-step and five-step recurrences in effective Euclidean dimensions one and two, without a normalizer assumption. We also extend the purely real recurrence to noncompact quotients and give counterexamples showing why the stronger real recurrence can fail after an ultrametric factor is added.
The three gap theorem states that the points of the Kronecker sequence $\alpha,2\alpha,\ldots,N\alpha$, considered modulo one, divide the circle into intervals of at most three distinct lengths. In a two-dimensional nearest-neighbour analogue, Haynes and Marklof proved that the Kronecker sequence modulo an arbitrary un...
A resolving set in a graph is a set of landmarks whose distance vectors distinguish all vertices. We use information theory to prove lower bounds for metric dimension and class dimension in distance-regular graphs and association schemes arising from finite geometry. The core idea is that, for a fixed landmark, a rando...
The classical Hadwiger-Nelson problem asks for the chromatic number of the unit distance graph of the Euclidean plane. Over the years, this problem has been considered for a variety of other normed spaces, with higher-dimensional Euclidean space $\mathbb{R}^d$ being perhaps the most natural and well-studied. Alon, Buci...
Noga Alon, Matija Bucic, James Davies· 0 citations
This note supplies genuinely non-fibred examples for the manuscript: Rigidity on the Two-Torus and Sarnak's Conjecture. For every $0<\delta<\tfrac12$, we construct $C^\infty$ Lebesgue-area-preserving pseudo-rotations of $\mathbb{T}^2$ which satisfy the $(C,\delta)$-deviation condition but do not have bounded mean motio...
We study corank-two distributions $D$ of odd rank $2N+1$ whose associated pencil of skew-symmetric forms $\{d\alpha|_{D}(q)\mid \alpha\in\Omega^1(M),\ \alpha|_{D}=0\}$ lies, at every point, in the generic orbit of the natural $\mathrm{GL}\bigl(D(q)\bigr)$-action; equivalently, $D$ has maximal first Kronecker index. In...
We prove Breiman's conjecture under the first-moment assumption. Let $Y_1,Y_2,\ldots$ be iid nonnegative random variables with $\mathbb P\{Y_1>0\}>0$, normalized by their sum. If the resulting randomly weighted sum converges to a nondegenerate law for one fixed integrable, nonconstant mark distribution, then the tail o...
J. Lenzi· 2 citations· ⚡2
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.