ProbXiv
sign in
Problem archiveProblem record

Statement

How many pairwise non-overlapping infinite circular cylinders of unit radius can simultaneously touch a unit ball? Kuperberg conjectured in 1990 that the maximum is six.

Record

Comments

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

  1. computation · #1

    Ivan Matić and Radoš Radoičić, using Claude (version not disclosed)

    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 co developed
    — a person and a model developed the result together.

    The proof reduces the upper bound to 2,954,984 exact rational-polynomial cases, each an elementary arithmetic check by a deterministic verifier; the reduction and certificates were developed with Claude.

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.