Searcharxiv⌕ Search

arXiv subjects

Logan R. Chalmers

Publications and source records attributed to Logan R. Chalmers.

5 recordsLinked to original sources

Kusner's conjecture on equilateral sets is false

We disprove Kusner's 1983 conjecture that every equilateral set in $\ell_p^n$ with $2 57$. This is the first equilateral set of more than $n+1$ points in $\ell_p^n$ for any finite $p\ge2$. The construction persists on an open interval of exponents around $5$. The configuration is specified by the unique solution of an explicit polynomial system with rational coefficients in a rational box; existence and uniqueness are proved by exact integer inequalities. The existence of the $58$-point equilateral set in $\ell_5^{56}$ has been formalised in Lean from standard axioms.

math.MG↗

Isometric embeddings of trees: why 32 leaves can require six dimensions, and bounds for every tree

We identify the first failure of the $\lceil\log_2 t\rceil$ leaf-count bound for isometric embeddings of $t$-leaf trees under the maximum norm. Every tree with at most $31$ leaves attains the bound, but a $32$-leaf tree requires six dimensions. This answers a question of Fitzpatrick and Nowakowski and disproves a conjecture of Aksoy, Kılıç and Koçak. We explain this failure by showing how requirements within and between branches force an additional coordinate. For a family of three-branch trees, we prove that the leaf bound is attained exactly when the two larger branches have equal leaf counts; otherwise, one additional coordinate is necessary. We also prove that every tree embeds in $\lceil 1.162832\log_2 t\rceil$ dimensions, improving the coefficient of approximately $1.44042$ established in 2005. These results hold for arbitrary positive edge lengths and the entire metric realization. We also construct infinite families in which the excess persists under repeated leaf expansion. Both main theorems are formalised in Lean using only standard axioms.

math.MG↗

The four-dimensional Borsuk number is five or six

Can every set of diameter one in four dimensions be split into at most five parts of smaller diameter? Three parts suffice in the plane and four in three-dimensional space. In four dimensions five parts are sometimes necessary. We prove that six always suffice, improving the previous upper bound of seven. For small circumradius we use six cones. For large circumradius five balls meet every diametral pair of a compact set. At intermediate radii we bound the diameter of each part by the diameter of a rational polytope. The theorem is formalised in Lean.

math.MG↗

The Bapat-Sunder eigenvalue conjecture fails over the reals

In 1986 Bapat and Sunder asked whether $\operatorname{per}(A)$ is the largest eigenvalue of $F_A=[a_{i,j}\operatorname{per}(A(i,j))]$ for every positive semidefinite Hermitian $A$, where $A(i,j)$ deletes row $i$ and column $j$. Drury disproved this over the complex field in 2018 and conjectured that the property holds for real positive semidefinite matrices. We disprove Drury's conjecture with a rank-$4$, $32\times32$ integer Gram matrix and an integer vector whose Rayleigh quotient exceeds $\operatorname{per}(A)$; verification uses integer arithmetic. Together, the two counterexamples resolve the Bapat-Sunder eigenvalue conjecture negatively over both fields. Counterexamples exist of every order $n\ge32$. As an application to quantum optics, the violation yields a $36$-mode orthogonal interferometer and a direction of relative arrival-time delays among $32$ photons with identical-variance Gaussian wave packets along which every sufficiently small nonzero delay increases the probability that all photons are detected within four designated output modes.

quant-ph↗

Equilateral sets in $\ell_p^n$ beyond $n+1$: Linear excess and dimension cost

How many equilateral points can $\ell_p^n$ contain beyond $n+1$? For every fixed real $p>4$, we construct equilateral sets for which the number of points beyond $n+1$ grows at least linearly with $n$. For every fixed dimension, we prove that the maximum is $n+1$ at all sufficiently large finite $p$, with an explicit threshold. The least dimension admitting any fixed number of extra points is $p^{1+o(1)}$ as $p\to\infty$. The constructions and finite bounds are formalised in Lean. Thus $p=4$ marks the boundary: $n+1$ is exact in every dimension for $2\leq p\leq4$, while at every fixed finite $p>4$ the excess grows at least linearly with dimension.

math.MG↗