Trends

The record tables as data. Every point is a configuration on this site, exactly verified; larger dots are proven optimal, and each point carries its value on hover.

Best known A(n), unit-area container10.30.10.030.010.0035101520253035nA(n), log scalesquare, n=3: A = 0.5 (proven)square, n=4: A = 0.5 (proven)square, n=5: A = 0.19245 (proven)square, n=6: A = 0.125 (proven)square, n=7: A = 0.083859 (proven)square, n=8: A = 0.0723764 (proven)square, n=9: A = 0.054876 (proven)square, n=10: A = 0.0465374square, n=11: A = 0.037037square, n=12: A = 0.0325989square, n=13: A = 0.0270199square, n=14: A = 0.024304square, n=15: A = 0.0212105square, n=16: A = 0.0205279square, n=17: A = 0.0172617square, n=18: A = 0.0155261square, n=19: A = 0.0139479square, n=20: A = 0.0129382square, n=21: A = 0.0114738square, n=22: A = 0.0106729square, n=23: A = 0.00975729square, n=24: A = 0.00908901square, n=25: A = 0.00823007square, n=26: A = 0.00757759square, n=27: A = 0.0071024square, n=28: A = 0.00690052square, n=29: A = 0.00627594square, n=30: A = 0.00603853square, n=31: A = 0.00583707square, n=32: A = 0.0058109square, n=33: A = 0.00507134square, n=34: A = 0.00483489square, n=35: A = 0.00443229square, n=36: A = 0.00418489triangle, n=3: A = 1 (proven)triangle, n=4: A = 0.333333 (proven)triangle, n=5: A = 0.171573 (proven)triangle, n=6: A = 0.125 (proven)triangle, n=7: A = 0.0972222 (proven)triangle, n=8: A = 0.0677892 (proven)triangle, n=9: A = 0.0548469triangle, n=10: A = 0.0433767triangle, n=11: A = 0.0365299triangle, n=12: A = 0.0310048triangle, n=13: A = 0.0265565triangle, n=14: A = 0.0237758triangle, n=15: A = 0.0210908triangle, n=16: A = 0.0183555triangle, n=17: A = 0.0162423triangle, n=18: A = 0.0148943triangle, n=19: A = 0.0134819triangle, n=20: A = 0.0126094triangle, n=21: A = 0.011396triangle, n=22: A = 0.0102661triangle, n=23: A = 0.00926978triangle, n=24: A = 0.00898515triangle, n=25: A = 0.00780264triangle, n=26: A = 0.00747157triangle, n=27: A = 0.00702933triangle, n=28: A = 0.00669434triangle, n=29: A = 0.00612369triangle, n=30: A = 0.0059574triangle, n=31: A = 0.00516128triangle, n=32: A = 0.00480076triangle, n=33: A = 0.00472821triangle, n=34: A = 0.00443091triangle, n=35: A = 0.00403268convex, n=3: A = 1 (proven)convex, n=4: A = 0.5 (proven)convex, n=5: A = 0.276393 (proven)convex, n=6: A = 0.166667 (proven)convex, n=7: A = 0.111111 (proven)convex, n=8: A = 0.0800001 (proven)convex, n=9: A = 0.0640648convex, n=10: A = 0.0519931convex, n=11: A = 0.0425532convex, n=12: A = 0.0392157convex, n=13: A = 0.0309372convex, n=14: A = 0.0278356convex, n=15: A = 0.0245641convex, n=16: A = 0.0222729convex, n=17: A = 0.0190573convex, n=18: A = 0.0182389convex, n=19: A = 0.0159311convex, n=20: A = 0.0144642convex, n=21: A = 0.0131911convex, n=22: A = 0.012255convex, n=23: A = 0.0110825convex, n=24: A = 0.0107126convex, n=25: A = 0.00931611convex, n=26: A = 0.00871479convex, n=27: A = 0.00802912convex, n=28: A = 0.00771884convex, n=29: A = 0.00728912convex, n=30: A = 0.00716018convex, n=31: A = 0.00630967convex, n=32: A = 0.00585071convex, n=33: A = 0.00547014convex, n=34: A = 0.00520622convex, n=35: A = 0.00477381convexsquaretriangle
Best known values fall roughly like n−2 — the straight-line decay on the log scale. The three variants order as convex > triangle ≥ square for small n and converge as n grows.
n²·A(n) — the asymptotic view02468105101520253035nn²·A(n)square, n=3: n²A = 4.5square, n=4: n²A = 8square, n=5: n²A = 4.811square, n=6: n²A = 4.5square, n=7: n²A = 4.109square, n=8: n²A = 4.632square, n=9: n²A = 4.445square, n=10: n²A = 4.654square, n=11: n²A = 4.481square, n=12: n²A = 4.694square, n=13: n²A = 4.566square, n=14: n²A = 4.764square, n=15: n²A = 4.772square, n=16: n²A = 5.255square, n=17: n²A = 4.989square, n=18: n²A = 5.03square, n=19: n²A = 5.035square, n=20: n²A = 5.175square, n=21: n²A = 5.06square, n=22: n²A = 5.166square, n=23: n²A = 5.162square, n=24: n²A = 5.235square, n=25: n²A = 5.144square, n=26: n²A = 5.122square, n=27: n²A = 5.178square, n=28: n²A = 5.41square, n=29: n²A = 5.278square, n=30: n²A = 5.435square, n=31: n²A = 5.609square, n=32: n²A = 5.95square, n=33: n²A = 5.523square, n=34: n²A = 5.589square, n=35: n²A = 5.43square, n=36: n²A = 5.424triangle, n=3: n²A = 9triangle, n=4: n²A = 5.333triangle, n=5: n²A = 4.289triangle, n=6: n²A = 4.5triangle, n=7: n²A = 4.764triangle, n=8: n²A = 4.339triangle, n=9: n²A = 4.443triangle, n=10: n²A = 4.338triangle, n=11: n²A = 4.42triangle, n=12: n²A = 4.465triangle, n=13: n²A = 4.488triangle, n=14: n²A = 4.66triangle, n=15: n²A = 4.745triangle, n=16: n²A = 4.699triangle, n=17: n²A = 4.694triangle, n=18: n²A = 4.826triangle, n=19: n²A = 4.867triangle, n=20: n²A = 5.044triangle, n=21: n²A = 5.026triangle, n=22: n²A = 4.969triangle, n=23: n²A = 4.904triangle, n=24: n²A = 5.175triangle, n=25: n²A = 4.877triangle, n=26: n²A = 5.051triangle, n=27: n²A = 5.124triangle, n=28: n²A = 5.248triangle, n=29: n²A = 5.15triangle, n=30: n²A = 5.362triangle, n=31: n²A = 4.96triangle, n=32: n²A = 4.916triangle, n=33: n²A = 5.149triangle, n=34: n²A = 5.122triangle, n=35: n²A = 4.94convex, n=3: n²A = 9convex, n=4: n²A = 8convex, n=5: n²A = 6.91convex, n=6: n²A = 6convex, n=7: n²A = 5.444convex, n=8: n²A = 5.12convex, n=9: n²A = 5.189convex, n=10: n²A = 5.199convex, n=11: n²A = 5.149convex, n=12: n²A = 5.647convex, n=13: n²A = 5.228convex, n=14: n²A = 5.456convex, n=15: n²A = 5.527convex, n=16: n²A = 5.702convex, n=17: n²A = 5.508convex, n=18: n²A = 5.909convex, n=19: n²A = 5.751convex, n=20: n²A = 5.786convex, n=21: n²A = 5.817convex, n=22: n²A = 5.931convex, n=23: n²A = 5.863convex, n=24: n²A = 6.17convex, n=25: n²A = 5.823convex, n=26: n²A = 5.891convex, n=27: n²A = 5.853convex, n=28: n²A = 6.052convex, n=29: n²A = 6.13convex, n=30: n²A = 6.444convex, n=31: n²A = 6.064convex, n=32: n²A = 5.991convex, n=33: n²A = 5.957convex, n=34: n²A = 6.018convex, n=35: n²A = 5.848convexsquaretriangle
Plotting the normalized product n² · A(n) highlights the gap between asymptotic theory and finite-n behavior. In 1982, Komlós, Pintz, and Szemerédi proved that A(n) ≥ c · (log n) / n², establishing that n² · A(n) must eventually grow without bound. Meanwhile, the sharpest known upper bound, A(n) ≤ n−8/7 − 1/2000 (Cohen, Pohoata, and Zakharov, 2023), leaves substantial room between logarithmic growth and polynomial decay. Within our computational window (n ≤ 36), the normalized curve hovers in a stable band, demonstrating that asymptotic regimes remain distant at small n.
Tied minimal triangles per configuration0102030405060705101520253035ncount of tied minimasquare, n=3: 1 tied minimal trianglessquare, n=4: 4 tied minimal trianglessquare, n=5: 4 tied minimal trianglessquare, n=6: 6 tied minimal trianglessquare, n=7: 8 tied minimal trianglessquare, n=8: 12 tied minimal trianglessquare, n=9: 11 tied minimal trianglessquare, n=10: 16 tied minimal trianglessquare, n=11: 28 tied minimal trianglessquare, n=12: 20 tied minimal trianglessquare, n=13: 20 tied minimal trianglessquare, n=14: 26 tied minimal trianglessquare, n=15: 25 tied minimal trianglessquare, n=16: 64 tied minimal trianglessquare, n=17: 27 tied minimal trianglessquare, n=18: 30 tied minimal trianglessquare, n=19: 31 tied minimal trianglessquare, n=20: 42 tied minimal trianglessquare, n=21: 37 tied minimal trianglessquare, n=22: 42 tied minimal trianglessquare, n=23: 40 tied minimal trianglessquare, n=24: 48 tied minimal trianglessquare, n=25: 44 tied minimal trianglessquare, n=26: 50 tied minimal trianglessquare, n=27: 47 tied minimal trianglessquare, n=28: 52 tied minimal trianglessquare, n=29: 51 tied minimal trianglessquare, n=30: 54 tied minimal trianglessquare, n=31: 56 tied minimal trianglessquare, n=32: 64 tied minimal trianglessquare, n=33: 56 tied minimal trianglessquare, n=34: 62 tied minimal trianglessquare, n=35: 64 tied minimal trianglessquare, n=36: 65 tied minimal trianglestriangle, n=3: 1 tied minimal trianglestriangle, n=4: 3 tied minimal trianglestriangle, n=5: 4 tied minimal trianglestriangle, n=6: 6 tied minimal trianglestriangle, n=7: 9 tied minimal trianglestriangle, n=8: 11 tied minimal trianglestriangle, n=9: 13 tied minimal trianglestriangle, n=10: 14 tied minimal trianglestriangle, n=11: 17 tied minimal trianglestriangle, n=12: 21 tied minimal trianglestriangle, n=13: 20 tied minimal trianglestriangle, n=14: 23 tied minimal trianglestriangle, n=15: 15 tied minimal trianglestriangle, n=16: 24 tied minimal trianglestriangle, n=17: 28 tied minimal trianglestriangle, n=18: 33 tied minimal trianglestriangle, n=19: 30 tied minimal trianglestriangle, n=20: 35 tied minimal trianglestriangle, n=21: 39 tied minimal trianglestriangle, n=22: 39 tied minimal trianglestriangle, n=23: 42 tied minimal trianglestriangle, n=24: 48 tied minimal trianglestriangle, n=25: 42 tied minimal trianglestriangle, n=26: 48 tied minimal trianglestriangle, n=27: 49 tied minimal trianglestriangle, n=28: 54 tied minimal trianglestriangle, n=29: 53 tied minimal trianglestriangle, n=30: 57 tied minimal trianglestriangle, n=31: 57 tied minimal trianglestriangle, n=32: 59 tied minimal trianglestriangle, n=33: 66 tied minimal trianglestriangle, n=34: 60 tied minimal trianglestriangle, n=35: 65 tied minimal trianglesconvex, n=3: 1 tied minimal trianglesconvex, n=4: 4 tied minimal trianglesconvex, n=5: 5 tied minimal trianglesconvex, n=6: 6 tied minimal trianglesconvex, n=7: 9 tied minimal trianglesconvex, n=8: 10 tied minimal trianglesconvex, n=9: 11 tied minimal trianglesconvex, n=10: 16 tied minimal trianglesconvex, n=11: 28 tied minimal trianglesconvex, n=12: 36 tied minimal trianglesconvex, n=13: 19 tied minimal trianglesconvex, n=14: 21 tied minimal trianglesconvex, n=15: 25 tied minimal trianglesconvex, n=16: 28 tied minimal trianglesconvex, n=17: 28 tied minimal trianglesconvex, n=18: 36 tied minimal trianglesconvex, n=19: 33 tied minimal trianglesconvex, n=20: 40 tied minimal trianglesconvex, n=21: 39 tied minimal trianglesconvex, n=22: 38 tied minimal trianglesconvex, n=23: 38 tied minimal trianglesconvex, n=24: 48 tied minimal trianglesconvex, n=25: 45 tied minimal trianglesconvex, n=26: 46 tied minimal trianglesconvex, n=27: 48 tied minimal trianglesconvex, n=28: 48 tied minimal trianglesconvex, n=29: 52 tied minimal trianglesconvex, n=30: 55 tied minimal trianglesconvex, n=31: 55 tied minimal trianglesconvex, n=32: 56 tied minimal trianglesconvex, n=33: 61 tied minimal trianglesconvex, n=34: 62 tied minimal trianglesconvex, n=35: 70 tied minimal trianglesconvexsquaretriangle
The number of triangles that simultaneously achieve the minimal area (the critical set). Understanding how the size of this tie set scales with n is an active open problem highlighted by Sudermann-Merx (arXiv:2603.11107). Occasional drops below the general upward trend typically indicate candidate configurations that have not yet fully converged to their highest-symmetry optimal tie configurations, rather than genuine structural decreases in the mathematical optimum.

State of the frontier