Minimum-Link Covering Trails for any Hypercubic Lattice

Marco Ripà

Home/Archive/arXiv

arXiv · 2208.01699

Minimum-Link Covering Trails for any Hypercubic Lattice

Marco Ripà

View original source ↗Read source document ↗Export metadata ↓

Abstract

In 1994, Kranakis et al. published a conjecture about the minimum link-length of every rectilinear covering path for the $k$-dimensional grid $P(n,k) := \{0,1, \dots, n-1\} \times \{0,1, \dots, n-1\} \times \cdots \times \{0,1, \dots, n-1\}$. In this paper, we consider the general, NP-complete, Line-Cover problem, where the edges are not required to be axis-parallel, showing that the original Theorem 1 by Kranakis et al. no longer holds when the aforementioned constraint is disregarded. Furthermore, for any $n$ greater than two, as $k$ approaches infinity, the link-length of any minimal (non-rectilinear) polygonal chain does not exceed Kranakis' conjectured value of $\frac{k}{k-1} \cdot n^{k-1}+O(n^{k-2})$ only if we introduce a multiplicative constant $c \geq 1.5$ for the lower order terms (e.g., if we select $n=3$ and assume that $c<1.5$, starting from a sufficiently large $k$, it is not possible to visit all the nodes of $P(n,k)$ with a trail of link-length $\frac{k}{k-1} \cdot n^{k-1}+c \cdot n^{k-2}$).

Explore related subjects

math.GM

Keep this discovery

BibTeX RIS

Marco Ripà. 2022-06-22. Minimum-Link Covering Trails for any Hypercubic Lattice. https://arxiv.org/abs/2208.01699

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗

arXiv2026

The decrease in sectional curvature of the Fisher--Rao manifold of beta distributions

In the paper, the author develops a general convexity lemma and applies it to demonstrate the monotonic decrease of a function involving polygamma functions, arising from the sectional curvature of the Fisher--Rao manifold of beta distributions.

math.GM↗

arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗