Pith. sign in

REVIEW 3 major objections 7 minor 65 references

Neural Discovery in Mathematics: Do Machines Dream of Colored Planes?

T0 review · 3 major / 7 minor · reviewed 2026-08-09 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper claims that a neural-network-based continuous relaxation of the Hadwiger-Nelson problem discovers new plane colorings, extending the off-diagonal six-coloring continuum to $[0.354,0.657]$ and improving the almost 5-coloring…

desk verdict A solid ML-for-math paper with one formalized improvement fully in-house, while the headline six-colorings are deferred to a companion paper and thus not checkable here. read the letter →

arxiv 2501.18527 v3 pith:A2MOXZTK submitted 2025-01-30 cs.LG math.CO

Konrad Mundinger , Max Zimmer , Aldo Kiem , Christoph Spiegel , Sebastian Pokutta This is my paper · ORCID
classification cs.LGmath.CO MSC 05C1552C10
keywords Hadwiger-Nelsonproblemchromaticnumberoftheplaneoff-diagonalcoloringsalmostneural-guidedmathematicaldiscoveryprobabilisticcoloringrelaxationunit-distancegraphgradient-basedoptimization
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish that neural networks, trained with a differentiable, probabilistic relaxation of the Hadwiger-Nelson problem, can discover new mathematical constructions for coloring the Euclidean plane. The authors reformulate the search for colorings with prescribed forbidden distances as minimization of a loss that measures the probability that a random unit-distance pair shares a color, then use gradient descent on the network parameters. On this basis they report two novel six-colorings that extend the known continuum of off-diagonal colorings of type $(1,1,1,1,1,d)$ from $[0.415,0.447]$ to $[0.354,0.657]$, the first such improvement in thirty years, with formal proofs deferred to a companion paper. They also obtain a formalized almost 5-coloring covering all but $3.7356\%$ of the plane, improving the previous $4.0060\%$ bound, and a 14-coloring of $\mathbb{R}^3$ covering all but $3.46\%$. If these constructions hold, neural-network search becomes a viable source of rigorous or rigorously formalizable results in discrete geometry.

What carries the argument

The central object is the probabilistic coloring $p:\mathbb{R}^2\to\Delta_c$ together with the conflict loss $L_R(p)=\int_{[-R,R]^2}\int_{\partial B_1(x)} p(x)^T p(y)\,d\nu(y)\,d\mu(x)$, where $p(x)^T p(y)$ is the probability that independently sampled colors at $x$ and $y$ coincide. Minimizing this loss over a large finite box turns the hard unit-distance constraint into a continuous, differentiable objective that gradient descent can explore without assuming symmetry or periodicity. Two auxiliary mechanisms carry the formal results: a Lagrangian relaxation that adds a penalized 'bonus' color for almost colorings, and Algorithm 1, which extracts the periodicity of a trained network, retrains with exact periodicity, discretizes the fundamental parallelogram, and eliminates residual unit-distance conflicts to produce a provably valid almost coloring.

What would settle it

Take the formal six-coloring from the companion paper and, over one fundamental period, check by exact computation such as interval arithmetic whether any two same-colored points are at distance 1 for colors 1 through 5 or at distance $d$ for color 6, with a value such as $d=0.354$ or $d=0.657$. A single monochromatic pair at a forbidden distance would refute the claimed continuum extension, because the formal construction is supposed to certify it.

Watch

Extended reading notes

Core claim

The central discovery is a method, not a theorem: a hard combinatorial-geometric existence question about coloring the plane is replaced by a continuous optimization problem over probabilistic colorings $p:\mathbb{R}^2\to\Delta_c$, with loss $L_R(p)=\int_{[-R,R]^2}\int_{\partial B_1(x)} p(x)^T p(y)\,d\nu(y)\,d\mu(x)$, which equals the expected probability of a unit-distance conflict. Minimizing this loss by gradient descent on a neural network yields numerical colorings that the authors then interpret and formalize. For the off-diagonal variant where five colors must avoid distance 1 and the sixth must avoid distance $d$, this pipeline produced two new six-colorings that realize $(1,1,1,1,1,d)$ for all $d\in[0.354,0.657]$, expanding the previously known interval, and an almost 5-coloring with uncovered fraction $3.7356\%$. The paper emphasizes that numerical outputs are not proofs: the six-colorings are formally described in a companion paper, while the almost colorings are made rigorous by an automated periodicity-extraction and discrete-conflict-elimination procedure referred to as Algorithm 1.

Load-bearing premise

The whole discovery depends on assuming that the clean, nearly conflict-free patterns a neural network finds inside a finite window really do continue to a coloring of the entire infinite plane; the paper does not prove that continuation for its main six-colorings, which are formalized in a separate companion paper.

Editorial extensions

If this is right

  • For every $d$ in $[0.354,0.657]$, the plane admits a six-coloring of type $(1,1,1,1,1,d)$, a direct corollary of the two formalized constructions.
  • The almost 5-coloring bound of $3.7356\%$ answers the explicit challenge, posed for the previous $4.0060\%$ construction, to push the uncovered fraction below $4\%$.
  • The same pipeline yields a 14-coloring covering all but $3.4622\%$ of $\mathbb{R}^3$, with numerical evidence that no conflict-free 14-coloring of $\mathbb{R}^3$ exists.
  • The framework recovers known constructions, such as the pentagonal-rod six-color almost coloring, when applied to familiar variants, supporting its reliability as a discovery tool.
  • The negative results, including the absence of a five-color solution for the polychromatic number and the absence of a six-color solution for the original problem, are consistent with the conjectures that $\chi(\mathbb{R}^2)=7$ and $\chi_p(\mathbb{R}^2)=6$, though the paper does not claim to prove them.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial inference: because the trained colorings vary smoothly with the free distance $d$, the realizable set of $d$ may be connected, and re-running the search on finer distance grids near the endpoints $0.354$ and $0.657$ could extend the continuum further.
  • Editorial inference: the paper's negative evidence on the polychromatic number is a numerical local minimum at roughly $4.9\%$ conflict rate; a more conclusive test would apply the same pipeline with larger architectures or different loss schedules to see whether that minimum can be driven toward zero.
  • Editorial inference: the automated almost-coloring pipeline is the part of the framework that requires no human pattern-reading, so applying the same automated formalization to other geometric coloring problems with a bonus color, such as avoiding several distances at once, is a direct and testable next step.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 7 minor

Summary. This paper presents a machine-learning framework for exploring colorings of the Euclidean plane that avoid monochromatic unit-distance pairs (the Hadwiger-Nelson problem and its variants). The authors relax the discrete coloring constraint to probabilistic colorings and minimize a differentiable loss on a finite box [-R,R]^2, using neural networks as function approximators. They apply this framework to four variants: almost colorings, off-diagonal colorings of type (d1,...,dk), higher-dimensional spaces, and triangle-avoiding colorings. The paper claims two novel six-colorings that extend the known continuum of off-diagonal colorings to [0.354,0.657], a formalized almost 5-coloring covering all but 3.7356% of the plane, a formalized almost 14-coloring in R^3, and several improved triangle-avoidance bounds. The main mathematical claims for the six-colorings are deferred to a companion paper (Mundinger et al., 2024a), while the almost colorings are claimed to be verified by an automated pipeline (Algorithm 1).

Significance. The core relaxation (Section 3, Eq. (2)) is clean and Proposition 3.1 provides a correct statement of when an exact zero-loss probabilistic coloring yields a discrete coloring almost everywhere. The paper is honest about the distinction between numerical results and formal proofs, and it ships code that should facilitate reproduction. If the claimed colorings are valid, the results would be substantial improvements to long-standing variants of the Hadwiger-Nelson problem, particularly the extension of the off-diagonal continuum after thirty years. However, the headline six-coloring result is not verifiable from this manuscript, and the verification of the almost colorings is asserted rather than demonstrated. This limits the paper's significance as a mathematical contribution; as a machine-learning-for-discovery contribution, the framework is useful and well described.

major comments (3)
  1. [Section 2 (Variant 2), Section 4.2, Figures 1, 3, 11] The central claim of two novel six-colorings and the expanded continuum [0.354,0.657] is not supported in this manuscript. The colorings are only shown as renderings; no formal definition or proof is given, and Proposition 3.1 applies only to exact zero loss, while the training only approximates the loss on a finite box. Footnote 1 explicitly acknowledges that a box coloring need not extend to the plane. Since the text refers to Mundinger et al. (2024a) for 'a complete description,' the existence of these colorings and the 'first improvement in thirty years' assertion cannot be checked by a reader of this paper. The authors should include the formal constructions and proofs in an appendix, or provide a machine-checkable certificate, or re-scope the contribution statement to candidate colorings that are proven in the companion paper and clearly mark the numerical evidence as non-verifying.
  2. [Section 3.3 (Algorithm 1) and Table 1] The paper states that Algorithm 1 yields an almost coloring that 'provably satisfies all unit-distance constraints,' but no correctness theorem is given. The algorithm's periodicity extraction (step 2) and discrete conflict resolution (step 5) are heuristics; the paper does not specify the measure of the set assigned to the additional color in the final output, nor the sense in which the periodic extension is conflict-free at tile boundaries. The 'formalized' values in Table 1 (e.g., 3.7356%) are stated without a precise definition of the computed measure or a verification certificate. Please provide a formal statement of the output, a proof of conflict-freeness, and a reproducible verification procedure.
  3. [Section 4.4 and Figure 4] The claimed formalized improvements for the triangle-avoidance variant are not described in the text; Figure 4 shows regions of the parameter space but the paper does not give the underlying colorings or the exact ranges of (a,b) for which the new bounds hold. Since these are listed as a contribution, the constructions need to be specified or referenced to a public source.
minor comments (7)
  1. [Equation (6)] The measure ν_k is defined as U(B_{d_k}(x)), but the integral is over the sphere ∂B_{d_k}(x); it should be the uniform distribution on the sphere, not the ball.
  2. [Section 3.3, Variant 2] 'corresponding do the distances' should read 'corresponding to the distances.'
  3. [Figure 8 and Section 4.4] The criterion for whether a point is 'achievable' with a given color count (top 3% of runs with less than 0.1% monochromatic sampled triangles) is arbitrary; please provide robustness information or justify the thresholds.
  4. [References] The reference Mundinger et al. (2024a) should state whether it is a published article, accepted manuscript, or preprint, so readers can access the formal constructions.
  5. [Section 2, Variant 2] The phrase 'first improvement in thirty years' should be qualified (e.g., 'to our knowledge') or substantiated with a citation to a survey.
  6. [Section 4.2] The description 'the second coloring is constant' is ambiguous; what is constant is the coloring as d varies over [0.418,0.657].
  7. [Sections 4.2 and 4.3] The negative results are phrased as 'additional evidence' for conjectures about the chromatic and polychromatic numbers; a failed search is a heuristic observation and should be described as such.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity; the headline colorings are deferred to a formal companion paper, which is a verifiability gap rather than a by-construction reduction.

full rationale

The paper's core derivation chain is a search procedure: Equation (2) defines a loss that directly penalizes violations of the target constraints, and Proposition 3.1 gives a measure-zero argument converting zero loss into a valid coloring of almost all unit-distance pairs. This is not circular because the loss is the objective being optimized, not a fitted proxy for the answer. The headline six-colorings extending the continuum to [0.354,0.657] are asserted in Section 2 with the statement 'A complete description of these constructions is given by Mundinger et al. (2024a)', and the abstract attributes the improvement to that same companion paper. This is a prominent self-citation that is load-bearing for the mathematical existence claim, but it is a deferral or verifiability point rather than a reduction of the present derivation to its own inputs; the companion paper is presented as an external formalization, not as a consequence of the loss minimization presented here. The paper explicitly disclaims that numerical results are proofs ('numerical results do not constitute formal proofs but rather provide guidance that must be formalized'), and the formalized almost-coloring in Section 4.1 is produced by an explicit constructive pipeline (Algorithm 1) whose reported value is measured from the constructed coloring, not fitted to reproduce the claimed bound. No fitted parameter is relabeled as a prediction, no uniqueness theorem is imported from the authors' prior work, and no ansatz is smuggled in by citation. The finite-box extension limitation is openly stated in footnote 1 ('A coloring of a finite box [−R,R]^2 does not necessarily extend to a valid coloring of the entire plane R^2'), which further indicates that the numerical search is a heuristic guide rather than a circular derivation. Overall, the central ML framework and the formalized almost-coloring are self-contained, while the strongest claim's proof lives in the companion paper; this raises a verification concern but not a circularity finding.

Assumptions & free parameters 3 free parameters · 3 assumptions · 0 invented entities

The paper does not introduce new physical or mathematical entities; it introduces a probabilistic relaxation of colorings and a training procedure. The free parameters listed are computational choices that affect the reported formalized values, and the axioms are the unproved background assumptions on which the numerical-to-formal bridge rests.

free parameters (3)
  • Lagrangian penalty lambda = between 1e-3 and 1e-1
    Used in Equation (5) to trade off conflict rate against the area assigned to the extra color in almost colorings. Tuned by hand, not derived; the formalized almost 5-coloring value depends on this tradeoff.
  • Discretization resolution (k, l) = unspecified
    Algorithm 1 subdivides the fundamental parallelogram into k by l cells. The choice determines which cells are treated as unit-distance conflicts and affects the formalized values in Table 1.
  • Achievability thresholds for triangle regions = top 3% of runs, under 0.1% conflicts
    Figure 8 and Appendix E declare a triangle-side region achievable if the top 3% of trained networks report less than 0.1% conflicting triangles. This is a post-hoc selection rule, not a theorem.
assumptions (3)
  • domain assumption Neural networks with sine activations can approximate the relevant probabilistic colorings well enough for the loss to guide discovery.
    The paper relies on universal approximation (Cybenko 1989) and spectral bias (Rahaman et al. 2019) as background, but does not prove that this specific architecture family can represent the needed 6-colorings with sufficient accuracy.
  • ad hoc to paper A near-zero loss on a finite box [−R,R]^2 reveals patterns that extend to valid colorings of the entire plane.
    Stated in footnote 1 as the objective of the method. The paper acknowledges finite-box colorings may not extend, but the discovery pipeline depends on this extendability for the headline results.
  • ad hoc to paper Algorithm 1's periodicity extraction and discrete repair produce a rigorously verified coloring.
    The paper asserts that the periodic extension of the discrete solution provably satisfies all unit-distance constraints, but the correctness of the periodicity detection and the conflict repair heuristic is not proven in the text and no machine-checked certificate is supplied.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Neural Discovery in Mathematics: Do Machines Dream of Colored Planes?." pith.science (2026). https://pith.science/paper/A2MOXZTK

@misc{pith2026250118527,
  author       = {Pith},
  title        = {Pith review of: Neural Discovery in Mathematics: Do Machines Dream of Colored Planes?},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/A2MOXZTK}},
  note         = {Machine review of arXiv:2501.18527}
}
read the original abstract

We demonstrate how neural networks can drive mathematical discovery through a case study of the Hadwiger-Nelson problem, a long-standing open problem at the intersection of discrete geometry and extremal combinatorics that is concerned with coloring the plane while avoiding monochromatic unit-distance pairs. Using neural networks as approximators, we reformulate this mixed discrete-continuous geometric coloring problem with hard constraints as an optimization task with a probabilistic, differentiable loss function. This enables gradient-based exploration of admissible configurations that most significantly led to the discovery of two novel six-colorings, providing the first improvement in thirty years to the off-diagonal variant of the original problem. Here, we establish the underlying machine learning approach used to obtain these results and demonstrate its broader applicability through additional numerical insights.

Figures

Figures reproduced from arXiv: 2501.18527 by the authors.

Figure 1
Figure 1. Neural network output (left) that inspired our for [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. The formalized almost 5-coloring obtained using [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 4
Figure 4. Location of the vertex C of triangles ABC with side AB of length 1 for which a coloring avoiding monochromatic copies of such a triangle is known to exist for between three and six colors. The previously known results due to Aichholzer & Perz (2019) are shown on the left and the results including our improvements on the right. Note that [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗
Figures from the paper (12 more)
Figure 5
Figure 5. Figure 5: The almost coloring due to Pritikin (1998) and Parts (2020b) (left) and the coloring suggest by our approach (right). The wavy lines are caused by the inherent degrees of freedom present in many colorings. 4. Experimental results In this section we present our numerica…
Figure 6
Figure 6. Figure 6: Fraction of conflicting points versus the free dis [PITH_FULL_IMAGE:figures/full_fig_p008_6.png]
Figure 7
Figure 7. Figure 7: The fraction of conflicts in (1, 1, 1, 1, d1, d2) col￾orings as a function of d1 and d2 (center, showing minimum over sixteen networks). Three regions of minimal conflicts emerge: symmetric regions near (d1, 1) and (1, d2) with d1, d2 ≈ 0.5, and one near (0.5, 0.5). Sa…
Figure 8
Figure 8. Figure 8: Numerical results showing the achievable color [PITH_FULL_IMAGE:figures/full_fig_p009_8.png]
Figure 9
Figure 9. Figure 9: Colorings found for the Hadwiger-Nelson problem with seven colors. Left and middle: Rather structured colorings. [PITH_FULL_IMAGE:figures/full_fig_p013_9.png]
Figure 10
Figure 10. Figure 10: Almost colorings for k = 1, . . . , 6 obtained through Algorithm 1. The parallelograms indicate the fundamental domain along which periodicity is enforced. In the case of almost colorings, we designed a fully automated pipeline to generate rigorously verified coloring…
Figure 12
Figure 12. Figure 12: A more detailed view of the colorings generated by a single model for different values of the last distance. Upper [PITH_FULL_IMAGE:figures/full_fig_p015_12.png]
Figure 13
Figure 13. Figure 13: The best five-coloring with d1 = 1, d2 ≈ d3 ≈ 1 and d4 ≈ d5 ≈ 0.56 and approximately 5% of conflicts in a box of size [−3, 3]2 . family of implicit neural representations. Instead of viewing this as a function of both coordinates and distances as in Equation (7), we c…
Figure 14
Figure 14. Figure 14: Three different distance configurations generated by the same model: [PITH_FULL_IMAGE:figures/full_fig_p017_14.png]
Figure 15
Figure 15. Figure 15: A three-dimensional coloring found by our approach. We only show four out of the fourteen colors. [PITH_FULL_IMAGE:figures/full_fig_p018_15.png]
Figure 16
Figure 16. Figure 16: Numerical results showing the achievable color bounds when avoiding monochromatic triangles. We trained [PITH_FULL_IMAGE:figures/full_fig_p019_16.png]
Figure 17
Figure 17. Figure 17: Colorings found for the L 1 norm. Left: The trivial grid coloring. Middle and right: Colorings which utilize the degrees of freedom present in the coloring. 20 [PITH_FULL_IMAGE:figures/full_fig_p020_17.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

65 extracted references · 47 canonical work pages

  1. [1]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION format.date year duplicate empty "emp...

  2. [2]

    and Perz, D

    Aichholzer, O. and Perz, D. Triangles in the colored E uclidean plane. In 35th European Workshop on Computational Geometry (EuroCG 2019), 2019

    work page 2019

  3. [3]

    Global lyapunov functions: a long-standing open problem in mathematics, with symbolic transformers

    Alfarano, A., Charton, F., and Hayat, A. Global lyapunov functions: a long-standing open problem in mathematics, with symbolic transformers. Advances in Neural Information Processing Systems, 37: 0 93643--93670, 2024

    work page 2024

  4. [4]

    A probabilistic approach to the geometry of the _p^n -ball

    Barthe, F., Guédon, O., Mendelson, S., and Naor, A. A probabilistic approach to the geometry of the _p^n -ball. The Annals of Probability, 33 0 (2): 0 480–513, March 2005. ISSN 0091-1798, 2168-894X. doi:10.1214/009117904000000874

    doi:10.1214/009117904000000874 2005

  5. [5]

    and Wagner, A

    B \'e rczi, G. and Wagner, A. Z. A note on small percolating sets on hypercubes via generative AI . arXiv preprint arXiv:2411.19734, 2024

    arXiv 2024

  6. [6]

    Geometry-informed neural networks

    Berzins, A., Radler, A., Sanokowski, S., Hochreiter, S., and Brandstetter, J. Geometry-informed neural networks. In ICML 2024 Workshop on Geometry-grounded Representation Learning and Generative Modeling, 2024

    work page 2024

  7. [7]

    S., Wagner, A

    Charton, F., Ellenberg, J. S., Wagner, A. Z., and Williamson, G. PatternBoost : Constructions in mathematics with a little help from AI . arXiv preprint arXiv:2411.00566, 2024

    arXiv 2024

  8. [8]

    and Zhang, H

    Chen, Z. and Zhang, H. Learning implicit fields for generative shape modeling. pp.\ 5932–5941, June 2019. doi:10.1109/CVPR.2019.00609

    work page arXiv 2019

Show all 65 references
  1. [9]

    A 15-colouring of 3-space omitting distance one

    Coulson, D. A 15-colouring of 3-space omitting distance one. Discrete mathematics, 256 0 (1-2): 0 83--90, 2002

    2002

  2. [10]

    Croft, H. T. Incidence incidents. Eureka (Cambridge), 0 (30): 0 22--26, 1967

    1967

  3. [11]

    S., Giampaolo, F., Rozza, G., Raissi, M., and Piccialli, F

    Cuomo, S., Di Cola, V. S., Giampaolo, F., Rozza, G., Raissi, M., and Piccialli, F. Scientific machine learning through physics--informed neural networks: Where we are and what’s next. Journal of Scientific Computing, 92 0 (3): 0 88, 2022

    2022

  4. [12]

    Currier, G., Moore, K., and Yip, C. H. Any two-coloring of the plane contains monochromatic 3-term arithmetic progressions. Combinatorica, 44 0 (6): 0 1367–1380, December 2024. ISSN 1439-6912. doi:10.1007/s00493-024-00122-2

    2024 doi

  5. [13]

    Approximation by superpositions of a sigmoidal function

    Cybenko, G. Approximation by superpositions of a sigmoidal function. Mathematics of control, signals and systems, 2 0 (4): 0 303--314, 1989

    1989

  6. [14]

    Advancing mathematics by guiding human intuition with AI

    Davies, A., Veli c kovi \'c , P., Buesing, L., Blackwell, S., Zheng, D., Toma s ev, N., Tanburn, R., Battaglia, P., Blundell, C., Juh \'a sz, A., et al. Advancing mathematics by guiding human intuition with AI . Nature, 600 0 (7887): 0 70--74, 2021

    2021

  7. [15]

    The signature and cusp geometry of hyperbolic knots

    Davies, A., Juh \'a sz, A., Lackenby, M., and Toma s ev, N. The signature and cusp geometry of hyperbolic knots. Geometry & Topology, 28 0 (5): 0 2313--2343, 2024

    2024

  8. [16]

    de Grey, A. D. The chromatic number of the plane is at least 5. Geombinatorics Quarterly, XXVIII 0 (1): 0 18--31, 2018

    2018

  9. [17]

    de Grey, A. D. N. J. A small 6-chromatic unit-distance graph in R ^3 . Geombinatorics Quarterly, XXX 0 (1): 0 5--13, 2020

    2020

  10. [18]

    and Ismailescu, D

    Exoo, G. and Ismailescu, D. The chromatic number of the plane is at least 5: a new proof. Discrete & Computational Geometry, 64 0 (1): 0 216--226, 2020

    2020

  11. [19]

    J., Schrittwieser, J., Swirszcz, G., et al

    Fawzi, A., Balog, M., Huang, A., Hubert, T., Romera-Paredes, B., Barekatain, M., Novikov, A., R Ruiz, F. J., Schrittwieser, J., Swirszcz, G., et al. Discovering faster matrix multiplication algorithms with reinforcement learning. Nature, 610 0 (7930): 0 47--53, 2022

    2022

  12. [20]

    Problem 58: Monochromatic triangles

    Graham, R. Problem 58: Monochromatic triangles. The Open Problems Project (TOPP), 2003. Available at http://cs.smith.edu/ orourke/TOPP/P58.html#Problem.58

    2003

  13. [21]

    and Stavrianos, J

    Gwyn, H. and Stavrianos, J. A finite graph approach to the probabilistic H adwiger- N elson problem. arXiv preprint arXiv:2008.07987, 2020

    2008 arXiv

  14. [22]

    Heule, M. J. Computing small unit-distance graphs with chromatic number 5. Geombinatorics Quarterly, XXVIII 0 (1): 0 32--50, 2018

    2018

  15. [23]

    and Soifer, A

    Hoffman, I. and Soifer, A. Almost chromatic number of the plane. Geombinatorics, 3 0 (2): 0 38--40, 1993

    1993

  16. [24]

    and Soifer, A

    Hoffman, I. and Soifer, A. Another six-coloring of the plane. Discrete Mathematics, 150 0 (1-3): 0 427--429, 1996

    1996

  17. [25]

    Jumper, J., Evans, R., Pritzel, A., Green, T., Figurnov, M., Ronneberger, O., Tunyasuvunakool, K., Bates, R., Žídek, A., Potapenko, A., Bridgland, A., Meyer, C., Kohl, S. A. A., Ballard, A. J., Cowie, A., Romera-Paredes, B., Nikolov, S., Jain, R., Adler, J., Back, T., Petersen...

    2021

  18. [26]

    and Loukas, A

    Karalias, N. and Loukas, A. Erd o s goes neural: an unsupervised learning framework for combinatorial optimization on graphs. Advances in Neural Information Processing Systems, 33: 0 6659--6672, 2020

    2020

  19. [27]

    Kingma, D. P. and Ba, J. Adam: A method for stochastic optimization. In International Conference on Learning Representations (ICLR), 2015

    2015

  20. [28]

    B., Lanthaler, S., and Stuart, A

    Kovachki, N. B., Lanthaler, S., and Stuart, A. M. Operator learning: Algorithms and analysis. Handbook of Numerical Analysis, 25: 0 419--467, 2024

    2024

  21. [29]

    Y., Aldeghi, M., Cervera-Lierta, A., Friederich, P., dos Passos Gomes, G., H \"a se, F., Jinich, A., Nigam, A., et al

    Krenn, M., Pollice, R., Guo, S. Y., Aldeghi, M., Cervera-Lierta, A., Friederich, P., dos Passos Gomes, G., H \"a se, F., Jinich, A., Nigam, A., et al. On scientific understanding with A rtificial I ntelligence. Nature Reviews Physics, 4 0 (12): 0 761--769, 2022

    2022

  22. [30]

    Budgeted training: Rethinking deep neural network training under resource constraints

    Li, M., Yumer, E., and Ramanan, D. Budgeted training: Rethinking deep neural network training under resource constraints. In International Conference on Learning Representations (ICLR), 2020

    2020

  23. [31]

    Lu, L., Jin, P., Pang, G., Zhang, Z., and Karniadakis, G. E. Learning nonlinear operators via deeponet based on the universal approximation theorem of operators. Nature Machine Intelligence, 3 0 (3): 0 218–229, March 2021. ISSN 2522-5839. doi:10.1038/s42256-021-00302-5

    2021 doi

  24. [32]

    Finding increasingly large extremal graphs with A lpha Z ero and T abu search

    Mehrabian, A., Anand, A., Kim, H., Sonnerat, N., Balog, M., Comanici, G., Berariu, T., Lee, A., Ruoss, A., Bulanova, A., et al. Finding increasingly large extremal graphs with A lpha Z ero and T abu search. In Proceedings of the Thirty-Third International Joint Conference on A...

    2024

  25. [33]

    Occupancy networks: Learning 3 D reconstruction in function space

    Mescheder, L., Oechsle, M., Niemeyer, M., Nowozin, S., and Geiger, A. Occupancy networks: Learning 3 D reconstruction in function space. In 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp.\ 4455–4465, June 2019. doi:10.1109/CVPR.2019.00459. URL h...

    2019

  26. [34]

    and Moser, W

    Moser, L. and Moser, W. Solution to problem 10. Canad. Math. Bull, 4: 0 187--189, 1961

    1961

  27. [35]

    Extending the continuum of six-colorings

    Mundinger, K., Pokutta, S., Spiegel, C., and Zimmer, M. Extending the continuum of six-colorings. Geombinatorics Quarterly, 2024 a

    2024

  28. [36]

    Neural parameter regression for explicit representations of PDE solution operators, 2024 b

    Mundinger, K., Zimmer, M., and Pokutta, S. Neural parameter regression for explicit representations of PDE solution operators, 2024 b

    2024

  29. [37]

    Nash, J. F. and Rassias, M. T. Open problems in mathematics. Springer, 2016

    2016

  30. [38]

    On the space chromatic number

    Nechushtan, O. On the space chromatic number. Discrete mathematics, 256 0 (1-2): 0 499--507, 2002

    2002

  31. [39]

    Z., Shirobokov, S., Kozlovskii, B., Ruiz, F

    Novikov, A., Vũ, N., Eisenberger, M., Dupont, E., Huang, P.-S., Wagner, A. Z., Shirobokov, S., Kozlovskii, B., Ruiz, F. J. R., Mehrabian, A., Kumar, M. P., See, A., Chaudhuri, S., Holland, G., Davies, A., Nowozin, S., Kohli, P., and Balog, M. A lpha E volve: A coding agent for...

    2025

  32. [40]

    Fully computer-assisted proofs in extremal combinatorics

    Parczyk, O., Pokutta, S., Spiegel, C., and Szab \'o , T. Fully computer-assisted proofs in extremal combinatorics. In Proceedings of the AAAI Conference on A rtificial I ntelligence , volume 37, pp.\ 12482--12490, 2023

    2023

  33. [41]

    J., Florence, P., Straub, J., Newcombe, R., and Lovegrove, S

    Park, J. J., Florence, P., Straub, J., Newcombe, R., and Lovegrove, S. Deepsdf: Learning continuous signed distance functions for shape representation. In 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp.\ 165–174, June 2019. doi:10.1109/CVPR.2019...

    2019

  34. [42]

    Graph minimization, focusing on the example of 5-chromatic unit-distance graphs in the plane

    Parts, J. Graph minimization, focusing on the example of 5-chromatic unit-distance graphs in the plane. arXiv preprint arXiv:2010.12665, 2020 a

    2010 arXiv

  35. [43]

    What percent of the plane can be properly 5-and 6-colored? arXiv preprint arXiv:2010.12668, 2020 b

    Parts, J. What percent of the plane can be properly 5-and 6-colored? arXiv preprint arXiv:2010.12668, 2020 b

    2010 arXiv

  36. [44]

    M., Schwartz, M., Saatchi, S., Ciais, P., Pokutta, S., Brandt, M., and Gieseke, F

    Pauls, J., Zimmer, M., Kelly, U. M., Schwartz, M., Saatchi, S., Ciais, P., Pokutta, S., Brandt, M., and Gieseke, F. Estimating Canopy Height at Scale . Proceedings of ICML, 5 2024

    2024

  37. [45]

    On the chromatic number of circular disks and infinite strips in the plane

    Polymath, D. On the chromatic number of circular disks and infinite strips in the plane. Geombinatorics Quarterly, XXX 0 (4): 0 190--201, 2021

    2021

  38. [46]

    All unit-distance graphs of order 6197 are 6-colorable

    Pritikin, D. All unit-distance graphs of order 6197 are 6-colorable. Journal of Combinatorial Theory, Series B, 73 0 (2): 0 159--163, 1998

    1998

  39. [47]

    On the spectral bias of neural networks

    Rahaman, N., Baratin, A., Arpit, D., Draxler, F., Lin, M., Hamprecht, F., Bengio, Y., and Courville, A. On the spectral bias of neural networks. In International conference on machine learning, pp.\ 5301--5310. PMLR, 2019

    2019

  40. [48]

    Raiskii, D. E. Realization of all distances in a decomposition of the space rn into n+1 parts. Mathematical notes of the Academy of Sciences of the USSR, 7 0 (3): 0 194--196, 1970 a . doi:10.1007/BF01093113. URL https://doi.org/10.1007/BF01093113

    1970 doi

  41. [49]

    Raiskii, D. E. Realization of all distances in a decomposition of the space R ^n into n+1 parts. Mathematical notes of the Academy of Sciences of the USSR, 7: 0 194--196, 1970 b

    1970

  42. [50]

    Raissi, M., Perdikaris, P., and Karniadakis, G. E. Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations. Journal of Computational Physics, 378: 0 686–707, February 2019. ISSN 002...

    2019 doi

  43. [51]

    P., Dupont, E., Ruiz, F

    Romera-Paredes, B., Barekatain, M., Novikov, A., Balog, M., Kumar, M. P., Dupont, E., Ruiz, F. J., Ellenberg, J. S., Wang, P., Fawzi, O., et al. Mathematical discoveries from program search with large language models. Nature, 625 0 (7995): 0 468--475, 2024

    2024

  44. [52]

    and Cazenave, T

    Roucairol, M. and Cazenave, T. Refutation of spectral graph theory conjectures with Monte Carlo search. In International Computing and Combinatorics Conference, pp.\ 162--176. Springer, 2022

    2022

  45. [53]

    Implicit neural representations with periodic activation functions

    Sitzmann, V., Martel, J., Bergman, A., Lindell, D., and Wetzstein, G. Implicit neural representations with periodic activation functions. Advances in neural information processing systems, 33: 0 7462--7473, 2020

    2020

  46. [54]

    Relatives of chromatic number of the plane I

    Soifer, A. Relatives of chromatic number of the plane I . Geombinatorics, 1 0 (4): 0 13--17, 1992 a

    1992

  47. [55]

    A six-coloring of the plane

    Soifer, A. A six-coloring of the plane. Journal of Combinatorial Theory, Series A, 61 0 (2): 0 292--294, 1992 b

    1992

  48. [56]

    Six-realizable set X_6

    Soifer, A. Six-realizable set X_6 . Geombinatorics, III 0 (4): 0 140--145, 1994 a

    1994

  49. [57]

    An infinite class of six-colorings of the plane

    Soifer, A. An infinite class of six-colorings of the plane. Congressus Numerantium, pp.\ 83--86, 1994 b

    1994

  50. [58]

    The mathematical coloring book: Mathematics of coloring and the colorful life of its creators

    Soifer, A. The mathematical coloring book: Mathematics of coloring and the colorful life of its creators. Springer, 2009

    2009

  51. [59]

    H., Wu, Y., Le, Q

    Trinh, T. H., Wu, Y., Le, Q. V., He, H., and Luong, T. Solving olympiad geometry without human demonstrations. Nature, 625 0 (7995): 0 476--482, 2024

    2024

  52. [60]

    Wagner, A. Z. Constructions in combinatorics via neural networks. arXiv preprint arXiv:2104.14516, 2021

    2021 arXiv

  53. [61]

    Scientific discovery in the age of A rtificial I ntelligence

    Wang, H., Fu, T., Du, Y., Gao, W., Huang, K., Liu, Z., Chandak, P., Liu, S., Van Katwyk, P., Deac, A., et al. Scientific discovery in the age of A rtificial I ntelligence. Nature, 620 0 (7972): 0 47--60, 2023 a

    2023

  54. [62]

    Learning the solution operator of parametric partial differential equations with physics-informed deeponets

    Wang, S., Wang, H., and Perdikaris, P. Learning the solution operator of parametric partial differential equations with physics-informed deeponets. Science Advances, 7 0 (40): 0 eabi8605, September 2021. doi:10.1126/sciadv.abi8605

    2021 doi

  55. [63]

    An expert's guide to training physics-informed neural networks

    Wang, S., Sankaran, S., Wang, H., and Perdikaris, P. An expert's guide to training physics-informed neural networks. CoRR, 2023 b

    2023

  56. [64]

    Is deep learning a useful tool for the pure mathematician? arXiv preprint arXiv:2304.12602, 2023

    Williamson, G. Is deep learning a useful tool for the pure mathematician? arXiv preprint arXiv:2304.12602, 2023

    2023 arXiv

  57. [65]

    Woodall, D. R. Distances realized by sets covering the plane. Journal of Combinatorial Theory, Series A, 14 0 (2): 0 187--200, 1973

    1973

Pith tools

Reviewed August 9, 2026 · model on record in the stance chip above.