LCLogan R. Chalmers

Logan R. Chalmers

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Logan R. Chalmers has a total of 1 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Stapledon’s Effectiveness Conjecture Holds in Dimension Three and Fails in Dimension Four

    by Aran S. Ziegler, Logan R. Chalmers

    We disprove Stapledon's effectiveness conjecture in dimension four and prove that it holds in dimension three. Our counterexample is a reflexive lattice polytope with seven vertices and an \( S_3 \)-action. Its equivariant \( h^* \)-series is a polynomial whose quadratic coefficient contains the sign representation with multiplicity -1. We have formalised this counterexample in Lean 4, together with several algebraic and combinatorial steps in the three-dimensional proof. For every lattice polytope of dimension at most three and every finite group of affine lattice symmetries, we prove that polynomiality implies effectiveness. Thus four is the least possible dimension of a counterexample.

  • Open Access

    The Four-Dimensional Borsuk Number is Five or Six

    by Logan R. Chalmers

    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.

  • Open Access

    Petty’s Conjecture Holds in Lₚ for 2 ≤ p ≤ 4: d+1 Equidistant Points in Every Dimension d

    by Logan R. Chalmers

    We prove Petty's conjecture for all finite-dimensional real \(L_p\) subspaces with \(2\le p\le4\). Every \(d\)-dimensional real linear subspace of \(L_p\), over any measure space, contains \(d+1\) equidistant points. More strongly, every equilateral subset extends to exactly \(d+1\) points, preserving its original points and common distance. Every equilateral set is affinely independent, so every maximal equilateral set has cardinality \(d+1\). This extends the \(2\le p\le4\) case of Kusner's conjecture from coordinate spaces to arbitrary subspaces and complements the constructions of linear excess for every fixed \(p>4\). The proof combines conditional positivity of the powered distance kernel, a circumradius estimate, and Brouwer's fixed-point theorem. The main theorems are formalised in Lean.

  • Open Access

    A Real Counterexample to the Drury Permanent Conjecture

    by Logan Chalmers

    The Drury permanent conjecture, published by Zhang in 2016 and disproved over the complex numbers by Hutchinson in 2017, has remained open in the real case, where a proof would imply the real case of the Chollet conjecture. The real 5 × 5 counterexample reported by Paksoy in 2023 concerns a different inequality, whose principal submatrices have order n −1 rather than order n−2 as in the conjecture; it is verified that Paksoy’s matrix satisfies the conjectured inequality strictly, under every simultaneous permutation of its rows and columns. The real case is then settled in the negative: an 8 × 8 real positive semidefinite matrix with integer entries and rank 3 is exhibited that violates the inequality, with an exact integer certificate of the violation. Direct sums with identity matrices give counterexamples of every order n ≥ 8.

  • Open Access

    Equilateral Sets in ℓₚⁿ Beyond n + 1: Linear Excess and Dimension Cost

    by Logan R. Chalmers, Aran S. Ziegler

    How many equilateral points can ℓₚⁿ 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¹⁺ᵒ⁽¹⁾ as p → ∞. The constructions and finite bounds are formalised in Lean. Thus p = 4 marks the boundary: n + 1 is exact in every dimension for 2 ≤ p ≤ 4, while at every fixed finite p > 4 the excess grows at least linearly with dimension.