We prove that every full-dimensional compact convex body in $\mathbb R^n$ whose barycenter is its unique interior lattice point and whose volume is $(n+1)^n/n!$ is a unimodular image of the simplex $(n+1)\Delta_n-(1,\dots,1)$. This resolves the equality case of Ehrhart's volume conjecture, as a counterpart of the inequality part recently proved by OpenAI. The main result of this paper is obtained by generative AI, particularly GPT-5.6-sol, Fable 5, and the Danus system.
Let $(M^n,g)$ be a connected, closed, smooth Riemannian manifold with dimension $n\geq 3$. There exists a positive constant $\varepsilon_n<1$ such that, if Ricci curvature $\operatorname{Ric}_g\geq \varepsilon_n(n-1)g$ and the scalar curvature $R_g\geq n(n-1)$, then the volume $V_g(M^n)$ is less than or equal to the vo...
In these notes, we introduce the 50-year-old $K(\pi, 1)$ conjecture alongside Coxeter and Artin groups. Roughly speaking, the conjecture states that the complement in $\mathbb{C}^n$ of a"symmetric"configuration of hyperplanes is a $K(\pi, 1)$ space. Our end goal is to present a proof of the conjecture in the so-called...
Giovanni Paolini· Winter Braids Lecture Notes· 0 citations
We prove that the mixed volume of a convex body with its reflection about the origin is maximized by simplices. This confirms a conjecture of C. Godbersen from 1938 and refines the Rogers-Shephard inequality. We also prove that, among convex polytopes, simplices are the only extremizers. Finally, we use this inequality...
We establish Chudnovsky's Conjecture and, more generally, Demailly's Conjecture for any finite set of points in $\mathbb{P}^n_k$, where $k$ is an algebraically closed field of characteristic 0. The key idea of passing to positive characteristic, as well as the broad plan of the proof, was suggested by ChatGPT-5.6 Sol....
A well-known conjecture of Chern, do Carmo, and Kobayashi asserts that, for $n,m \geq 1$, the scalar curvature of a closed, minimally immersed $n$-submanifold of $\mathbb{S}^{n+m}$ with second fundamental form of constant length takes values in a discrete set. This property holds in every codimension when $n \in \{1,2\...
For a polynomial of degree $n$ whose zeros lie in the closed unit disk, we determine the largest possible distance from a prescribed critical point of modulus $r$ to the nearest zero. If $n$ is even, the sharp radius is $\sqrt{1-r^2}$; if $n$ is odd, the sharp radius is strictly smaller for $r\in(0,1)$ and depends on $...
Dragomir Grozev, Nikolai Nikolov· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
