ProbXiv
sign in
Problem archiveProblem record

Statement

Kusner conjectured in 1983 that the maximum number of points in Rn\mathbb{R}^n that are pairwise at ℓp\ell_p-distance one is exactly n+1n+1 for every 2<p<∞2 < p < \infty, as in the Euclidean case. False: an explicit configuration of n+2n+2 equilateral points exists for some exponent, placing the infimum of exponents at which the conjecture fails in [4,5)[4,5). The configuration is the unique solution of an explicit polynomial system with rational coefficients in a rational box, established in exact arithmetic.

Record

Comments

No person has examined this. Nothing here has been checked at all. say whether it holds →

  1. construction · #1

    Logan R. Chalmers, using GPT-5.6 Sol, Claude Fable 5

    That credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.

    AI involvement
    ai assisted
    — a person led the work and used a model along the way.

    The paper's disclosure: GPT-5.6 Sol assisted in implementing the computational search strategy in code, and Claude Fable 5 was used as a tool in drafting. No mathematical step is attributed to a model by name, but the search that produced the configuration is the load-bearing computation.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.