arXiv Machine Learning By Tom\'as S. R. Silva

A penalised Saito functional for heuristic search of free line arrangements

Read the original on arXiv Machine Learning →

arXiv:2604. 02995v3 Announce Type: replace-cross Abstract: We introduce the penalised Saito functional $\mathfrak S_{\lambda,\beta}(\mathcal{A};d_1,d_2)$ for a reduced arrangement $\mathcal{A}$ of $n$ lines and a prescribed pair $d_1+d_2=n-1$.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Jun 3

Optimizing Explicit Unit-Distance Lower-Bound Certificates

arXiv:2606. 03419v1 Announce Type: cross Abstract: The 2026 disproof of Erd\H{o}s's unit-distance conjecture and Sawin's subsequent explicit quantitative refinement show that the maximum number $u(n)$ of unit distances among $n$ planar points can exceed $n^{1+\varepsilon}$ for a fixed positive $\varepsilon$.

By Michael T. M. Emmerich
arXiv AI
Jun 12

Real-rootedness of the Poincar\'e polynomials of $\overline{\mathcal M}_{0,n}$: an AI-assisted proof

arXiv:2605. 29151v2 Announce Type: replace-cross Abstract: We prove real-rootedness for the Poincar\'e polynomial \[ P_n(t)=\sum_{i=0}^{n-3} \dim H^{2i}(\overline{\mathcal M}_{0,n};\mathbb{Q})t^i \] of the Deligne--Mumford moduli space $\overline{\mathcal M}_{0,n}$ of stable $n$-pointed rational curves, proving a conjecture of Aluffi--Chen--Marcolli.

By Gergely B\'erczi, Young-Hoon Kiem
arXiv AI
Jul 28

Formalizing Flag Algebras in Lean

arXiv:2607. 23500v1 Announce Type: cross Abstract: Razborov's flag algebra method is a powerful tool for proving asymptotic inequalities in extremal graph theory, often reducing the task to finding a finite certificate by semidefinite programming.

By Gyeongwon Jeong, Seonghun Park, Jihoon Hyun, Sang-il Oum, Hongseok Yang