A proof of Gromov's cube inequality on scalar curvature

Gromov proved a cube inequality on the bound of distances between opposite faces of a cube equipped with a positive scalar curvature metric in dimension $\leq 8$ using a minimal surface method. He conjectured that the cube inequality also holds in dimension $\geq 9$. In this paper, we prove Gromov’s cube inequality in all dimensions with the optimal constant via a Dirac operator method.

Authors

Institutions

Publication Details

Journal
Journal of Differential Geometry
Published
2024-10-16
DOI
https://doi.org/10.4310/jdg/1729092460
Citations
4
Primary Topic
Mathematics and Applications
Type
article
Field-Weighted Citation Impact
3.04
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A proof of Gromov's cube inequality on scalar curvature

Zhizhang Xie, Jinmin Wang, Guoliang Yu
4 citations
Journal of Differential Geometry
Mathematics and Applications
3.04
article

A proof of Gromov's cube inequality on scalar curvature

Zhizhang Xie, Jinmin Wang, Guoliang Yu
article en
4 citations

Abstract

Gromov proved a cube inequality on the bound of distances between opposite faces of a cube equipped with a positive scalar curvature metric in dimension $\leq 8$ using a minimal surface method. He conjectured that the cube inequality also holds in dimension $\geq 9$. In this paper, we prove Gromov’s cube inequality in all dimensions with the optimal constant via a Dirac operator method.

Journal of Differential GeometryVol. 128(3)
Texas A&M University (US)
No poverty
Openalex Percentile: Top 8%
Mathematics and Applications
3.04
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.