An isoperimetric inequality for planar triangulations (Q1650791): Difference between revisions

In [Differ. Geom. Appl. 43, 95--101 (2015; Zbl 1329.52009)], \textit{I. Izmestiev} proved that the isoperimetric inequalities in the Euclidean and hyperbolic plane hold for all Euclidean and hyperbolic, respectively, cone-metric on a disk with singularities of non-positive curvature. This result is a discrete analogue of the theorems of \textit{A. Weil} [C. R. Acad. Sci., Paris 182, 1069--1071 (1926; JFM 52.0712.05)] and \textit{G. Bol} [Jahresber. Dtsch. Math.-Ver. 51, 219--257 (1941; JFM 67.0697.02)] that deal with Riemannian metrics of curvatures bounded from above by 0, respectively by \(-1\). A more stronger version was proved by Alexandrov and which can be found in the paper of Izmestiev [loc. cit.]. The proof of Izmestiev uses discrete conformal deformations of the metric that eliminates the singularities and increases the area. In this article, the authors prove a discretized version of Weil's theorem using of combinatorial arguments. They show that hexagons in the triangular lattice have maximal volume among all sets of a given boundary in any triangulation with minimal degree 6. We know from [\textit{O. Häggström} et al., Ann. Probab. 30, No. 1, 443--473 (2002; Zbl 1025.60044)] that in the hyperbolic lattice balls solve the isoperimetric problem. In this article, it is shown that hyperbolic balls are optimal among all triangulations with minimal degree \(\delta>6\). At the end of this article, other problems concerning plane triangulations are proposed.