On the honeycomb conjecture for a class of minimal convex partitions

15 Mar 2017 Bucur Dorin Fragalà Ilaria Velichkov Bozhidar Verzini Gianmaria

We prove that the planar hexagonal honeycomb is asymptotically optimal for a large class of optimal partition problems, in which the cells are assumed to be convex, and the criterion is to minimize either the sum or the maximum among the energies of the cells, the cost being a shape functional $F$ which satisfies a few assumptions. They are: monotonicity under inclusions; homogeneity under dilations; a Faber-Krahn inequality for convex hexagons; a convexity-type inequality for the map which associates with every $n \in \mathbb{N}$ the minimizers of $F$ among convex $n$-gons with given area... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • OPTIMIZATION AND CONTROL