Papers for

geometric analysis software developers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Proof confirms limit for space partitions and removes computer aid

On the Propeller Conjecture

Abstract: We simplify and improve OpenAI's proof of the propeller conjecture of Khot and Naor from 2008: the sum of the squared lengths of the Gaussian moments of any partition of Euclidean space is at most $9/(8π)$. We show equality only occurs for three 120 degree sectors in the plane (up to symmetries, measure zero changes, and taking orthogonal cross products with Euclidean space). We also remove computer assistance from the three-dimensional case of the conjecture, which previously used an epsilon net traversal.

Fri 23 OctComputational Complexity
The gist
This work deals with a math problem about dividing space into parts and measuring certain properties of those parts. The authors improved a previous proof by simplifying it and removing the need for computer help in one case. They showed the best possible way to divide the plane into three equal parts at 120-degree angles. This confirms that their result holds true in higher dimensions without relying on computers.
Open → 2610.32158v1