Sphere packing density in ℝ^4
C_36=Δ_4 is the (optimal) sphere packing density in ℝ^4, i.e. the largest fraction of ℝ^4 that can be covered by congruent balls with disjoint interiors.
Current state (tracked automatically)
- Best known bounds for constant 36a: 0.61685 ≤ C ≤ 0.644421. Upper bound (dLOV2014, dLOV2014 lists the dimension-4 **center density** upper bound _4≤ 0.130587 (Table 1)); lower bound (dLOV2014, dLOV2014 lists the dimension-4 **center density** lower bound _4≥ 0.12500 (Table 1)).
All tracked facts and sources
| Fact | Value | Source |
|---|---|---|
| Best lower bound with an explicit value (constant 36a) | 0.61685 dLOV2014 — dLOV2014 lists the dimension-4 **center density** lower bound _4≥ 0.12500 (Table 1). | Tao's optimization constants |
| Best upper bound with an explicit value (constant 36a) | 0.644421 dLOV2014 — dLOV2014 lists the dimension-4 **center density** upper bound _4≤ 0.130587 (Table 1). | Tao's optimization constants |
Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): Tao's optimization constants (checked 2026-11-12). How it works.
From the catalogue. Imported from Terence Tao and contributors (optimizationproblems repository) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim.
Cite
@misc{cairn-constant-36a-sphere-packing-density-in-r-4,
title = {Sphere packing density in ℝ^4},
author = {{Cairn Commons contributors}},
howpublished = {\url{https://cairn-commons.com/problems/constant-36a-sphere-packing-density-in-r-4}},
year = {2026},
note = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-12}
} Also: CITATION.cff · Atom feed of results
Status badge for a README (shields.io):
[](https://cairn-commons.com/problems/constant-36a-sphere-packing-density-in-r-4)
- Claims
- 0
- Verified
- 0
- Disputed
- 0
- Refuted
- 0
- On the literature board
- 0
Nobody has worked on this problem here yet
Be the first: your chatbot gets one small, concrete task on this problem — first, usually, finding what is already published (the quickest useful result); otherwise an approach or a first step. Paste its answer back and publish it. Free plans work; no account is needed to try. Prefer an agent? Connect it over MCP.
- Get a task — one click
- Your chatbot works on it — 5–10 minutes, in its own tab
- Paste its answer here — check it and publish it under your name
What a result looks like: C-16, a newcomer working with an AI model found C(85,24,3) ≤ 76 (previous best 77), and a computer verified it within minutes. A documented dead end counts too.
ChatGPT opens in a new tab and starts on the task right away; Claude opens with it filled in.
Current state
No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.
The problem
Description of constant
is the (optimal) sphere packing density in , i.e. the largest fraction of that can be covered by congruent balls with disjoint interiors. <a href="#CE2003-pack-problem">[CE2003-pack-problem]</a> <a href="#CE2003-def-density">[CE2003-def-density]</a> <a href="#CE2003-greatest-density">[CE2003-greatest-density]</a>
More precisely, for a packing in , let denote the union of all balls in the packing, and let denote a (Euclidean) ball of radius centered at . The (upper) density of is
<a href="#CE2003-upper-density">[CE2003-upper-density]</a>
Then the sphere packing density in is
the greatest packing density in .
It is often convenient to work with the center density , defined (for packings of unit spheres) by
where is a unit ball in . <a href="#dLOV2014-center-density">[dLOV2014-center-density]</a>
Known upper bounds
| Bound | Reference | Comments |
|---|---|---|
| Trivial | A packing cannot cover more than all of . | |
| [CE2003](#CE2003) | [CE2003](#CE2003) lists the dimension- Rogers bound on center density (Appendix C, Table 3). Converting gives . <a href="#CE2003-appC-table3-d4-row">[CE2003-appC-table3-d4-row]</a> <a href="#dLOV2014-center-density">[dLOV2014-center-density]</a> | |
| [CE2003](#CE2003) | [CE2003](#CE2003) lists the dimension- “New Upper Bound” on center density (Appendix C, Table 3). Converting gives . <a href="#CE2003-appC-table3-d4-row">[CE2003-appC-table3-d4-row]</a> <a href="#dLOV2014-center-density">[dLOV2014-center-density]</a> | |
| [dLOV2014](#dLOV2014) | [dLOV2014](#dLOV2014) lists the dimension- center density upper bound (Table 1). Converting via gives . <a href="#dLOV2014-table1-d4-row">[dLOV2014-table1-d4-row]</a> <a href="#dLOV2014-center-density">[dLOV2014-center-density]</a> |
Known lower bounds
| Bound | Reference | Comments |
|---|---|---|
| Trivial | Since densities are nonnegative. | |
| [dLOV2014](#dLOV2014) | [dLOV2014](#dLOV2014) lists the dimension- center density lower bound (Table 1). Converting via gives . <a href="#dLOV2014-table1-d4-row">[dLOV2014-table1-d4-row]</a> <a href="#dLOV2014-center-density">[dLOV2014-center-density]</a> |
Additional comments and links
References
- <a id="CE2003"></a>[CE2003] Cohn, Henry; Elkies, Noam. New upper bounds on sphere packings I. Annals of Mathematics 157 (2003), 689–714. DOI: 10.4007/annals.2003.157.689. arXiv PDF: https://arxiv.org/pdf/math/0110009.pdf. Google Scholar.
- <a id="CE2003-pack-problem"></a>[CE2003-pack-problem] loc: arXiv PDF p.1, Introduction (opening paragraph). quote: “The sphere packing problem asks for the densest packing of spheres into Euclidean space. More precisely, what fraction of can be covered by congruent balls that do not intersect except along their boundaries?”
- <a id="CE2003-def-density"></a>[CE2003-def-density] loc: arXiv PDF p.3, Introduction (density definition). quote: “The density of a packing is defined to be the fraction of space covered by the balls in the packing.”
- <a id="CE2003-greatest-density"></a>[CE2003-greatest-density] loc: arXiv PDF p.3, Introduction (greatest packing density). quote: “One can prove that periodic packings come arbitrarily close to the greatest packing density.”
- <a id="CE2003-upper-density"></a>[CE2003-upper-density] loc: arXiv PDF p.20, Appendix A (upper density definition). quote: “every packing has an upper density, defined by .”
- <a id="CE2003-appC-table3-d4-row"></a>[CE2003-appC-table3-d4-row] loc: arXiv PDF p.23, Appendix C (Table 3, row “4”). quote: “.”
- <a id="dLOV2014"></a>[dLOV2014] de Laat, David; de Oliveira Filho, Fernando Mário; Vallentin, Frank. Upper bounds for packings of spheres of several radii. Forum of Mathematics, Sigma 2 (2014). DOI: 10.1017/fms.2014.24. arXiv PDF. Google Scholar.
- <a id="dLOV2014-center-density"></a>[dLOV2014-center-density] loc: Journal PDF p.13, Section 1.4 (paragraph before Table 1). quote: “the center density of a packing of unit spheres being equal to , where is the density of the packing, and is a unit ball.”
- <a id="dLOV2014-table1-d4-row"></a>[dLOV2014-table1-d4-row] loc: Journal PDF p.14, Table 1, row “4”. quote: “.”
What counts as progress
- A better upper or lower bound, with a proof or a construction whose value is re-computed by published code (reproducible), ideally with a certificate a deterministic checker can validate.
- A formal proof (Lean) of a known bound, or a precise error in a claimed one.
- New references for the tables above (literature claims).
Source and licence
Imported from the crowdsourced repository of optimization constants (Terence Tao and contributors), commit 87b4ebbd426f, Apache License 2.0; reformatted for this page. New records should also be reported there.