Sharp \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N^{3/4}$$\end{document}N3/4 Law for the Minimizers of the Edge-Isoperimetric Problem on the Triangular Lattice

We investigate the edge-isoperimetric problem (EIP) for sets of n points in the triangular lattice by emphasizing its relation with the emergence of the Wulff shape in the crystallization problem. By introducing a suitable notion of perimeter and area, EIP minimizers are characterized as extremizers of an isoperimetric inequality: they attain maximal area and minimal perimeter among connected configurations. The maximal area and minimal perimeter are explicitly quantified in terms of n. In view of this isoperimetric characterizations, EIP minimizers \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M_n$$\end{document}Mn are seen to be given by hexagonal configurations with some extra points at their boundary. By a careful computation of the cardinality of these extra points, minimizers \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M_n$$\end{document}Mn are estimated to deviate from such hexagonal configurations by at most \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_t\, n^{3/4}+\mathrm{o}(n^{3/4})$$\end{document}Ktn3/4+o(n3/4) points. The constant \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_t$$\end{document}Kt is explicitly determined and shown to be sharp.


Introduction
This paper is concerned with the edge-isoperimetric problem (EIP) in the triangular lattice L t := {m t 1 + nt 2 : m, n ∈ Z} for t 1 := (1, 0) and t 2 := 1 2 , Let C n be the family of sets C n containing n distinct elements x 1 , . . . , x n in L t . The edge perimeter | (C n )| of a set C n ∈ C n is the cardinality of the edge boundary of C n defined by Note that, with a slight abuse of notation, the symbol | · | denotes, according to the context, both the cardinality of a set and the euclidean norm in R 2 . The EIP over the family C n consists in characterizing the solutions to the minimum problem: Our main aim is to provide a characterization of the minimizers M n of (2) as extremizers of a suitable isoperimetric inequality (see Theorem 1.1) and to show that there exists a hexagonal Wulff shape in L t from which M n differs by at most K t n 3/4 + o(n 3/4 ) points (see Theorem 1.2). A crucial issue of our analysis is that both the exponent and the constant in front of the leading term in (3) are explicitly determined and optimal (see Theorem 1.4). The EIP is a classical combinatorial problem. We refer to Bezrukov (1999), Harper (2004) for the description of this problem in various settings and for a review of the corresponding results available in the literature. The importance of the EIP is however not only theoretical, since the edge perimeter (and similar notions) bears relevance in problems from machine learning, such as classification and clustering (see Trillos and Slepcev 2016 and references therein). Note, however, that in this other more statistical setting the edge perimeter is not defined for configurations contained in a specific lattice, but for point clouds obtained as random samples.
We shall emphasize the link between the EIP and the Crystallization Problem (CP). For this reason, we will often refer to the sets C n ∈ C n as configurations of particles in L t and to minimal configurations as ground states. The CP consists in analytically explaining why particles at low temperature arrange in periodic lattices by proving that the minima of a suitable configurational energy are subsets of a regular lattice. At low temperatures, particle interactions are expected to be essentially determined by particle positions. In this classical setting, all available CP results in the literature with respect to a finite number n of particles are in two dimensions for a phenomenological energy E defined from R 2n , the set of possible particle positions, to R ∪ {+∞}. In Heitmann and Radin (1980), Radin (1981) the energy E takes the form E({y 1 , . . . , y n }) := 1 2 for specific potentials v 2 : [0, ∞) → R ∪ {+∞} representing two-body interactions. Additional three-body interaction terms have been included in the energy in Mainini and Stefanelli (2014), Mainini et al. (2014a, b). We also refer the reader to E and Li (2009), Flatley and Theil (2015), Theil (2006) for results in the thermodynamic limit with a Lennard-Jones-like potential v 2 not vanishing at a certain distance and to Blanc and Lewin (2015) for a general review on the CP. The link between the EIP on L t and the CP resides on the fact that when only twobody and short-ranged interactions are considered, the minima of E are expected to be subsets of a triangular lattice. The fact that ground states are subsets of L t has been analytically shown in Heitmann and Radin (1980) and Radin (1981), respectively, with v 2 := v sticky , where v sticky is the sticky-disk potential, i.e., v sticky ( ) := and v 2 := v soft , where v soft is the soft-disk potential, i.e., In particular with both the choices (5) and (6) for v 2 , we have that for every C n ∈ C n . Here, the set represents the bonds of C n ∈ C n . Note that the definition of B(C n ) in (8) is independent of the order in which the elements of C n are labeled. The number of bonds of C n with an endpoint in x i will be instead denoted by b(x i ) = |{ j ∈ {1, . . . , n} : (x i , x j ) ∈ B(C n ) or (x j , x i ) ∈ B(C n )}| for every x i ∈ C n . The link between the EIP and the CP consists in the fact that by (1), (7), and (9) we have that for every C n ∈ C n , since the degree of L t is 6. In view of (10) minimizing E among configurations in C n is equivalent to the EIP (2), and since for both the choices (5) and (6) for v 2 by Heitmann and Radin (1980), Radin (1981) ground states belong to C n , the ground states of the CP correspond to the minimizers of the EIP. Furthermore, in Heitmann and Radin (1980), Radin (1981) the energy of ground states with n particles has been also explicitly quantified in terms of n to be equal to where x := max{z ∈ Z : z ≤ x} and x := min{z ∈ Z : x ≤ z} denote the standard right-and left-continuous functions, respectively. Therefore, (10) and (11) entails also a characterization of θ n in terms of n, i.e., A first property of the minimizers of (2) has been provided in Harper (2004), Theorem 7.2 where it is shown that the EIP has the nested-solution property, i.e., there exists a total order τ : N → L t such that for all n ∈ N the configuration is a solution of (2) (see Proposition 2.1 and the discussion below for the definition of τ ). Given the symmetry of the configurations D n , we will refer to them as daisies in the following. Since solutions of the EIP are in general nonunique, the aim of this paper is to characterize them all.
In this paper, we provide a first characterization of the minimizers M n of the EIP by introducing an isoperimetric inequality in terms of suitable notions of area and perimeter of configurations in C n and by showing that the connected minimizers M n of the EIP are optimal with respect to it. We refer here the reader to (25) and (26) for the definition of the area A(C n ) and the perimeter P(C n ) of a configuration C n ∈ C n . Note also that we say that a configuration C n is connected if given any two points x i , x j ∈ C n then there exists a sequence y k of points in C n with k = 1, . . . , K for some K ∈ N such that y 1 = x i , y K = x j , and either (y k , y k+1 ) or (y k+1 , y k ) is in B(C n ) for every k = 1, . . . , K − 1. It easily follows that minimizers of the EIP need to be connected. Our isoperimetric characterization reads as follows.
Theorem 1.1 (Isoperimetric characterization) Every connected configuration C n ∈ C n satisfies where k n := Moreover, connected minimizers M n ∈ C n of the EIP correspond to those configurations for which (13) holds with the equality. Finally, connected minimizers attain the maximal area a n := −θ n /2 + 2n + 1 and the minimal perimeter p n := θ n /2 − 3.
Notice that a similar isoperimetric result has been already achieved in the square lattice in Mainini et al. (2014a) with a different method, based on introducing a rearrangement of the configurations. Theorem 1.1 is instead proved by assigning to each element x of a configuration C n ∈ C n a weight ω C n (x) that depends on C n and on the above-mentioned order τ [see (32)].
Furthermore, we observe that the isoperimetric constant k n given by (14) satisfies with k n = 1/ √ 6 if and only if n = 1 + 3s + 3s 2 for some s ∈ N. Note that for n = 1 + 3s + 3s 2 , as already observed in Harper (2004), the hexagonal daisy D 1+3s+3s 2 is the unique minimizer of the EIP.
In the following, we will often refer to lattice translations of D 1+3s+3s 2 as hexagonal configurations with radius s ∈ N since each configuration D 1+3s+3s 2 can be seen as the intersection of L t and a regular hexagon with side s. In order to further characterize the solutions of the EIP, we associate to every minimizer M n a maximal hexagonal configuration H r Mn that is contained in M n and we evaluate how much M n differs from H r Mn (see Sect. 3).
In view of the isoperimetric characterization of the ground states provided by Theorem 1.1, we are able to sharply estimate the distance of M n to H r Mn both in terms of the cardinality of M n \ H r Mn and by making use of empirical measures. We associate to every configuration C n = {x 1 , . . . , x n } the empirical measure denoted by and we denote by · and · F the total variation norm and the flat norm, respectively (see Whitney 1957 and (72) for the definition of flat norm). Our second main result is the following.
Furthermore, the following assertions hold true: and where H r Mn is the maximal hexagon associated to M n , and The proof of Theorem 1.2 is based on the isoperimetric characterization of the minimizers provided by Theorem 1.1 and relies in a fundamental way on the maximality of the radius r M n of the maximal hexagonal configuration H r Mn . The latter is essential to carefully estimate the number of particles of M n that reside outside H r Mn in terms of r M n itself and the minimal perimeter p n . Thanks to this fine estimate we are able to find a lower bound on r M n in terms of n only [see (69)]. In particular, the method provides a lower bound for the radius r M n that allows us also to estimate from above the discrepancy between the sets M n and H r Mn in the Hausdorff distance that is defined by We observe that in view also of Theorem 1.1 estimates (15) - (18) and (20) provide a measure in different topologies of the fluctuation of the isoperimetric configurations in L t with respect to corresponding maximal hexagons. Similar estimates have been studied in the context of isoperimetric Borel sets with finite Lebesgue measure in R d , d ≥ 2. We refer the reader to Fusco et al. (2008) for the first complete proof of the quantitative isoperimetric inequality in such setting, and to Cicalese andLeonardi (2012), Figalli et al. (2010) for subsequent proofs employing different techniques.
Moreover, Theorem 1.2 appears to be an extension of analogous results obtained in Au Yeung et al. (2012), Schmidt (2013) by using a completely different method hinged on -convergence. In that context, the set W is the asymptotic Wulff shape and we will also often refer to W in this way. More precisely the minimization problem (4) is reformulated in Au Yeung et al. (2012), Schmidt (2013) in terms of empirical measures by introducing the energy functional defined on the set of nonnegative Radon measures in R 2 with mass 1, where v 2 is (a quantified small perturbation of) the sticky-disk potential (Heitmann and Radin 1980). In Au Yeung et al. (2012), Schmidt (2013) it is proved that the rescaled sequence of functionals n −1/2 (2E n + 6n) -converges with respect to the weak * convergence of measures to the anisotropic perimeter where ∂ * S is the reduced boundary of S, ν S is the outward-pointing normal vector to S, L 2 (S) is the two-dimensional Lebesgue measure of S, H 1 is the one-dimensional measure, and the anisotropic density ϕ is defined by for every ν = (ν 1 , ν 2 ) with ν 1 = − sin α and ν 2 = cos α for α ∈ [0, π/6].
Let us note here that the -convergence result provided in Au Yeung et al. (2012) can be restated as a -convergence result for the edge perimeter. In fact, since the energy functional E n is such that for every C n ∈ C n , by (10) we have that the functional T n := E n (μ) + 6n is such that and n −1/2 T n -converges with respect to the weak * convergence of measures to the anisotropic perimeter P(μ).
Besides the completely independent method, the main achievement of this paper with respect to Au Yeung et al. (2012), Schmidt (2013) is that of sharply estimating the constant K t in formulas (15), (16), and (17). The deviation of the minimizers from the Wulff shape of order n 3/4 was exhibited in Schmidt (2013) and referred to as the n 3/4 -law. Here we sharpen the result from Schmidt (2013) by determining the optimal constant in estimates (15), (16), and (17). We have the following.

Theorem 1.4 (Sharpness of the estimates) A sequence of minimizers M n i satisfying (15) -(17) with equalities can be explicitly constructed for n
The proof of Theorem 1.4 is based on the estimate: which holds true for the explicitly determined constant K n introduced in (73). Estimate (24) is a consequence of the lower bound for the radius r M n established in the proof of Theorem 1.2, see (69). In fact, a sequence of minimizersM n satisfying (24) with equality can be explicitly constructed. Note that such configurationsM n are singled out among configurations that present extra elements outside their maximal hexagon HM n in correspondence of only two consecutive faces of HM n (see Fig. 6). Therefore, to establish Theorem 1.4 is enough to show that lim sup n→∞ K n = K t and to exhibit a subsequence n i that realizes the limit.
Finally, we notice that our method appears to be implementable in other settings possibly including three-body interactions. This is done for the crystallization problem in the hexagonal lattice L h in a companion paper (Davoli et al. 2016). Furthermore, we observe that analogous results to Theorem 1.2 were obtained in the context of the crystallization problem in the square lattice in Mainini et al. (2014a, b) with a substantially different method (even though also based on an isoperimetric characterization of the minimizers) resulting only in suboptimal estimates.
The paper is organized as follows. In Sect. 2, we introduce the notions of area A and perimeter P of configurations C n ∈ C n , we define the order τ in L t , and we introduce the notion of weight ω C n . Furthermore, in Sect. 2.1 we provide the proof of Theorem 1.1. In Sect. 3, we introduce the notion of maximal hexagons H r Mn associated to minimizers M n of (2) and we carefully estimate r M n from below in terms of n. In Sect. 4, we use the latter lower bound in order to study the convergence to the Wulff shape by providing the proof of Theorems 1.2 and 1.4 in Sects. 4.1 and 4.2, respectively.

Isoperimetric Inequality
In this section, we introduce the notion of area and perimeter of a configuration in C n and we deduce various relations between its area, perimeter, energy and its edge boundary including a isoperimetric inequality.
We define the area A of a configuration C n ∈ C n by where T (C n ) is the family of ordered triples of elements in C n forming triangles with unitary edges, i.e., The definition of A(C n ) is invariant with respect to any relabeling of the particles of C n . In order to introduce the perimeter of a configuration in C n let us denote by F(C n ) ⊂ R 2 the closure of the union of the regions enclosed by the triangles with vertices in T (C n ), and by G(C n ) ⊂ R 2 the union of all bonds which are not included in F(C n ). The perimeter P of a regular configuration C n ∈ C n is defined as where H 1 is the one-dimensional Hausdorff measure. Note in particular that Since every triangle with vertices in T (C n ) contributes with 3 bonds to B(C n ), by (7) and (25) we have that Thus, by recalling (26) and (27) the equality and we conclude that Notice that (28) allows to express the energy of a configuration C n as a linear combinations of its area and its perimeter, and that by (10) an analogous relation can be deduced for the edge boundary, namely As already discussed in the introduction, in view of (10) we are able to combine the exact quantification of the ground-state energy E established in Heitmann and Radin (1980), Radin (1981) with the nested-solution property provided by Harper (2004), Theorem 7.2. We record this fact in the following result that we state here without proof.
Proposition 2.1 There exists a total order τ : N → L t such that for all n ∈ N the configuration D n defined by D n := {x τ (1) , . . . , x τ (n) } which we refer to as daisy with n points is a solution of (2), i.e., where θ n is given by (12).
We remark that the sequence of daisy ground states {D n } satisfies the property that In particular, within the class of daisy configurations one can pass from a ground state to another by properly adding atoms at the right place, determined by the order τ . The total order provided by Theorem 2.1 is not unique. We will consider here the total order τ on L t defined by moving clockwise on concentric daisies centered at a fixed point, as the radius of the daisies increases. To be precise, let x τ (1) be the origin (0, 0) and let x τ (2) be a point in L t such that there is an active bond between x τ (2) and x τ (1) . For i = 3, . . . , 7, we define the points x τ (i) ∈ L t as the vertices of the hexagon H k with center x τ (1) and radius 1, numbered clockwise starting from x τ (2) . We then consider the regular hexagons H k that are centered at x τ (1) , and have radius k and one side parallel to the vector x τ (2) − x τ (1) , and proceed by induction on the radius k ∈ N. To this aim, notice that the number of points of L t contained in H k is n k := 1 + 3k + 3k 2 . Assume that all the points x τ (i) , with i ≤ n k , have been Fig. 1 The total order τ is defined by considering the concentric hexagons centered in x τ (1) with increasing radii, and by ordering the points clockwise within each hexagon (1) , and passing through the point x τ (n k ) . For i ∈ (n k + 1, n k+1 ], we then define x τ (i) by clockwise numbering the points of L t on the boundary of H k (see Fig. 1). We will write x < τ y referring to the total order τ described above. A weight function ω is defined on L t by the following ω(x) := |{y ∈ L t : |x − y| = 1 and y < τ x}|, for every x ∈ L t . We observe that ω assumes value 0 at the point x τ (1) , value 1 at x τ (2) (that is a point bonded to x τ (1) ), and values 2 or 3 at all the other points in L t (see Fig. 2). Furthermore, we have that and Moreover, for every configuration C n we introduce a weight function ω C n defined by ω C n (x) := |{y ∈ C n : |x − y| = 1 and y < τ x}|, for every x ∈ C n (and thus depending on C n ). In this way C n can be rewritten as the union The first elements of L t with respect to the order τ are shown with their weight assigned by the value of the function ω appearing below them for k = 0, . . . , 3. We notice that ω C n (x) ≤ ω(x) for every x ∈ C n and that |C 0 n | is the number of connected components of C n .
In order to prove the isoperimetric inequality (13), we first express the energy, the perimeter, the edge perimeter, and the area of a regular configuration C n as a function of the cardinality of the sets C k n . Proposition 2.2 Let C n be a regular configuration in L t . Then for every n ∈ N.
Proof Fix n ∈ N, and let C n be a regular configuration in L t . In analogy to (31) there holds For i = 0, . . . , n − 1, denote by C i the subset of C n containing the first i points of C n , according to the total order τ . If x τ (i) ∈ C 0 n , then if x τ (i) ∈ C 1 n , then whereas, if x τ (i) ∈ C 3 n , we have In view of (38)- (41), we obtain (34)-(37).
We notice that from (34), (35), and (36) we also recover (28), which in turn, together with (37), yields for every configuration C n . Moreover, from the equality , and (36) it follows that Note that in particular if C n = D n then and by (42) and (43) we obtain for every n > 1.

Proposition 2.3
The following assertions are equivalent and hold true for every connected configuration C n : Proof The first assertion follows directly from (30) and is equivalent to the second by (36) and (37). The second assertion is equivalent to the third by (29) and (30).

Proof of Theorem 1.1
In this subsection, we prove Theorem 1.1 by characterizing the minimizers of EIP as the solutions of a discrete isoperimetric problem. We proceed in two steps.
Inequality (13) is a direct consequence of (48) and Proposition 2.3. By Proposition 2.3 we also deduce that the maximal area and the minimal perimeter among connected configurations are realized by A(D n ) = −θ n /2 + 2n + 1 and P(D n ) = θ n /2 − 3, respectively.
Step 2 We prove the characterization statement of Theorem 1.1. Let C n be a connected configuration satisfying We claim that C n is a minimizer. In fact, the claim follows from where we used (30)

Maximal Hexagons Associated to EIP Minimizers
In this section, we introduce the notion of maximal hexagons H r Mn associated to minimizers M n and we provide a uniform lower estimate of r M n in terms of n [see (69) We will refer to H r Mn as the maximal hexagon associated to M n . Notice that the number of atoms of M n contained in H r Mn is n(r M n ) := 1 + 3 r M n + 3 r M n 2 . In the following, we will often denote the minimal regular hexagon containing H r Mn byĤ r Mn (see Fig. 3), i.e.,Ĥ r Mn := F(H r Mn ) Following the notation introduced in Sect. 2 in (33), we decompose M n as In the following proposition, we observe that if n > 6, then there exists a nondegenerate maximal hexagon for every minimizer.
Proposition 3.1 For n ≤ 6, then the maximal hexagon H r Mn is degenerate for every minimizer M n of (2). If n > 6, then the maximal radius r M n of every minimizer M n of (2) satisfies r M n ≥ 1.
We claim that for n ≥ 7 the radius r M n satisfies r M n ≥ 1. Indeed, assume that M n is such that r M n = 0. Then M n does not contain any hexagon with radius 1 and hence, for every x ∈ M n we have that b(x) ≤ 5.
Property (57) is equivalent to claiming that every element of M n contributes to the overall perimeter of M n , and the contribution of each element is at least 1. Therefore, P(M n ) ≥ n.
In view of Proposition 3.1 for every minimizer M n with n > 6, we can fix a vertex V 0 of its (non-degenerate) hexagonĤ r Mn and denote by V 1 , . . . , V 5 the other vertices ofĤ r Mn numbered counterclockwise starting from V 0 . For k = 0, . . . , 4, let us also denote by s k the line passing through the side ofĤ r Mn with endpoints V k and V k+1 , and let s 5 be the line passing through V 5 and V 0 .
In the following we will need to consider the number of levels of atoms in L t around H r Mn containing at least one element of M n . Denote by e k the outer unit normal to the side s k ofĤ r Mn and define for j ∈ Z. Let also π k be the open half-plane with boundary s k and not intersecting the interior ofĤ r Mn . We first show that M n satisfies a connectedness property with respect to the directions determined by the lattice L t . To this purpose, we introduce the notion of 3-convexity with respect to L t .
We say that a set S ⊂ L t is 3-convex if for every p, q ∈ S such that q := m t i + p for some m ∈ N and i ∈ {1, 2, 3} one has that q := m t i + p ∈ S for every integer m ∈ (0, m). Furthermore, we refer to the lines p i := {q ∈ R 2 : q = r t i + p for some r ∈ R} as the lines of the lattice L t at p.

Note that by Definition 3.2 a set S is 3-convex if there is no line
p i of the lattice L t at a point p ∈ L t \ S that is separated by p in two half-lines both containing points of the set S.

Proposition 3.3 Let M n be a minimizer. Then M n is 3-convex.
Proof For the sake of contradiction assume that the minimizer M n is a not 3-convex. Then there exist a point p ∈ L t \ M n and i ∈ {1, 2, 3} such that the line p i (see Definition 3.2) is divided by p in two half-lines both containing points of M n . We claim that we can rearrange the n points of M n in a new 3-convex configurationM n such that | (M n )| < | (M n )| thus contradicting optimality.
Denote for simplicity 0 := p i and let 1 , . . . , m be all the other lines parallel to 0 that intersect M n . Furthermore, let c k = |M n ∩ k | for k = 1, . . . , m. Starting from the elements of the sequence {c k }, we rearrange them in a decreasing order, constructing another set {d k } with the property that d 0 ≥ d 1 ≥ · · · ≥ d m . Finally, we separate the elements of {d k } having odd indexes from those having even indexes and we rearrange them in a new set { f k } obtained by first considering the elements of {d k } with even indexes, in decreasing order with respect to their indexes, and then the elements of {d k } having odd indexes, with increasing order with respect to their indexes. The set { f k } constructed as above has the property that the two central elements have the maximal value, and the values of the elements decrease in an alternated way by moving toward the sides of the ordered set. Letk be the index corresponding to the central element of the set { f k }, if m is even, and to the maximum between the two central elements of { f k }, if m is odd.
Fix a point Pk ∈ L t and an angular sector S of amplitude 2π/3, with vertex in Pk, whose sides σ 1 and σ 2 lay on the two lines departing from Pk which are not parallel to 0 . Consider the points P 0 , . . . , Pk −1 ∈ σ 1 ∩ M n , such that Analogously, consider the points Pk +1 , . . . , P m ∈ σ 2 ∩ M n , satisfying For k = 0, . . . , m, let˜ k be the line parallel to 0 and passing through P k . To construct the setM n , we consider f k consecutive points on each line˜ k , starting from P k . We note that |M n | = |M n | = n, the number of bonds in each line parallel to 0 has increased. On the other hand, the number of bonds between different lines has not decreased. Indeed, given two parallel lines with a and b points, respectively, the maximal number of bonds between these two lines is either 2a if a < b, or 2a − 1 if a = b. This maximal value is achieved by construction by the modified configuration. Hence, providing a contradiction to the optimality of M n .
Since every minimizer M n is 3-convex, the quantity λ k introduced in (59) for k = 0, . . . , 5 provides the number of non-empty levels of atoms in M n ∩ π k for n > 6. In fact, by the definition of τ each partially full level contains at least one point in On the other hand, Therefore, by (60) and (61), In the remaining part of this section, we provide a characterization of the geometry of M n \ H r Mn for n > 6, by subdividing this set into good polygons P k and bad polygons T k , and by showing that the cardinality of M n \ H r Mn is, roughly speaking, of the same order of magnitude as the one of the union of good polygons.
Given a minimizer M n and its maximal hexagon H r Mn , we denote by H r Mn +1 the hexagon with side r M n + 1 and having the same center as H r Mn . In the following, we denote the hexagon containing H r Mn +1 bŷ H r Mn +1 := F(H r Mn +1 ).
We first show that, by the optimality of H r Mn , there exists an angular sector of 2π/3, and centered in one of the vertices ofĤ r Mn +1 , which does not intersect M n . To this end, we denote by V i , i = 0, . . . , 5 the vertices of the hexagonĤ r Mn +1 , with the convention that V i lies on the half-line starting from the center of H r Mn and passing through V i .

Lemma 3.4 Let M n be a minimizer with r M n > 0. Then
(i) The hexagonĤ r Mn +1 presents at least a vertex, say V j with j ∈ {0, . . . , 5}, that does not belong to M n .
(ii) There exists k ∈ {0, . . . , 5} such that the open angular sector S k of amplitude 2π/3, centered in V k , and with sides s 1 k and s 1 k−1 (with the convention that s 1 −1 := s 1 5 ) is such that S k ∩ M n = ∅. (iii) Every translationĤ ofĤ r Mn +1 by a vector t := nt 1 +m t 2 with n, m ∈ Z that has a vertex v / ∈ M n admits a vertex w / ∈ M n (possibly different from v) and an open angular sector S of amplitude 2π/3 and centered in w such that S ∩ M n = ∅.
Proof We begin by showing assertion (i). In view of the maximality of H r Mn there exists a point p ∈ L t on the boundary ofĤ r Mn +1 such that p / ∈ M n . Either p is already a vertex ofĤ r Mn +1 or p is an internal point on the side ofĤ r Mn +1 parallel to s j for some j. In this latter case, by the 3-convexity of M n , either V j or V j+1 does not belong to M n and hence, also in this case assertion (i) holds true. We now denote by V j the missing vertex of the hexagonĤ r Mn +1 and prove assertion (ii). Let us consider the two half-lines in which V j divides the line s 1 j . By the 3convexity of M n , at least one of them does not intersect M n . Analogously, if we consider the two half-lines in which V j divides the line s 1 j−1 , by the 3-convexity of M n at least one of them does not intersect M n . Finally, if we consider the line s passing through the center of H r Mn and V j , the 3-convexity of M n implies that the points of s whose distance from the center of H r Mn is bigger than r M n + 1 do not belong to M n . In view of the geometric position of such three half-lines departing from V j , we can conclude that the claim holds true by using once again the 3-convexity of M n .
Let us conclude by observing that assertion (iii) follows by a similar argument to the one employed to prove assertion (ii). If the center ofĤ is in M n , then the same argument works and we can chose w = v. If the center ofĤ is not in M n , then the line passing through the missing vertex v and the center ofĤ does not intersect M n outsideĤ either for v or for the opposite vertex w with respect to the center ofĤ .
In the following, we assume without loss of generality that the vertex V 0 has been chosen so that the index k in assertion (ii) of Lemma 3.4 is 0. Therefore, by assertion (ii) of Lemma 3.4 we obtain that the open angular sector S 0 of 2π/3, centered in V 0 , and with sides s 1 0 and s 1 5 is such that S 0 ∩ M n = ∅. Let us use the definition of the levels λ k for k = 0, . . . , 5 introduced in (59) to define a regionR that contains all extra points of M n , i.e., points of M n not contained in H r Mn . We already know that we can takeR ⊂ (R 2 \Ĥ r Mn ) ∩ (R 2 \ S 0 ). We define the regionR as follows (see Fig. 4): The setP 0 in (63) is the polygon delimited by the lines s 5 , s 1 0 , s λ 0 0 , s −r +1 5 and the setŝ P k in (63) is defined bŷ Fig. 4 Representation of the regionR given by the union of the polygonsP j with j = 0, . . . , 5 drawn in the lightest color (yellow) and the polygonsT j with j = 1, . . . , 5 drawn in the middle color (green). Note that this picture has a mere illustrative purpose (the configuration is not a EIP minimizer) (Color figure online)Ĥ r M n 4T 5 for every k = 1, . . . , 5, where for every a ∈ [−2 r M n , 2 r M n ] we denote byP 1 k (a) the polygon contained between s 1 k , s a k , s k+1 , s −r +1 k+1 , and byP 2 k (a) the set delimited by s a k , Finally the setsT k are the region betweenP k−1 andP k or, more precisely, Note thatT 1 by definition (64) reduces to a segment contained in the line s −r Mn 2 such that Furthermore, we consider the configurations P k :=P k ∩ L t for k = 0, . . . , 5, T k :=T k ∩ L t for k = 1, . . . , 5, and R :=R ∩ L t . We notice that M n ⊂ H r Mn ∪ R and that n = |H r Mn | + |R| − |R \ M n |, where |H r Mn | = 1 + 3 r M n + 3 r M n 2 , and where in the last equality we used that |P k | = r M n λ k for k = 0, . . . , 5. Furthermore, for every x ∈ R and every k = 0, . . . , 5 there exists j k ∈ [−λ k − 2r, λ k ] with k := (k + 3) mod 6 and k ∈ {0, . . . , 5} such that x ∈ s j k k . Hence, in particular, every x ∈ R is uniquely determined by a pair of indexes ( j k , j k ), with k = k + 3 in Z 6 . We remark that the thesis will follow once we prove the assertion for m = h. The claim holds for m = 1 by reasoning in the same way as in the first assertion of Lemma 3.4. Assume now that the claim is satisfied for m =m. Consider a family Hm +1 = {H 1 , . . . , Hm +1 } ⊂ H, and the polygon Furthermore, let us definePm We subdivide the remaining part of the proof into 4 steps.
Step 1 There exists a vertexṽ ofPm +1 that is not in M n . Indeed, if all vertices ofPm +1 belong to M n , by 3-convexityPm +1 ⊂ M n , and hence Hm +1 ⊂ Pm +1 ⊂ M n , which would contradict the maximality of r M n .
Step 2 By assertion (iii) of Lemma 3.4 there exists a vertex w ofPm +1 not in M n and an open angular sector S centered in w, amplitude 2π/3, and sides σ 1 , σ 2 ⊂ L t such thatS ∩ M n = ∅.
Step 3 There exists a vertex v ofPm +1 that is not in M n and that corresponds to an interior angle ofPm +1 of 2π/3. In fact,Pm +1 can have vertices with angles of 2π/3, 4π/3, and 5π/3 only. If the vertex w detected in Step 2 corresponds to an angle of 2π/3, there is nothing to prove. If w corresponds to an angle of 4π/3 or 5π/3, then we have two cases.

Case 1
The intersection between S and the closure ofPm +1 is empty. Then, for every j = 1, 2, there exists v j ∈ σ j such that the segment with endpoints w and v j denoted by wv j is contained in ∂Pm +1 and v j is a vertex ofPm +1 . Furthermore, v j / ∈ M n because v j ∈ S, and v j is associated to an angle of 2π/3, since S∩Pm +1 = ∅. The proof follows by taking v = v 1 .

Case 2
The intersection between S and the closure ofPm +1 is nonempty. Without loss of generality, we can assume that the two sides of the angular sector S are given by for k ∈ N. Since Pm +1 ∩ S is bounded, we can find For j = 1, 2, the intersection σ k j j ∩ ∂Pm +1 ∩ S is a segment with at least one endpoint v ∈ S corresponding to a vertex of ∂Pm +1 associated to an angle of 2π/3.
Step 4 Let v be the vertex provided by Step 3. Then, there exists a uniqueĤ¯j ∈ Hm +1 having v among its vertices. By the induction hypothesis on {Ĥ 1 , . . . ,Ĥm +1 } \ {Ĥ¯j } there exists a family of vertices {v j } j=1,...,m+1, j =j ⊂ R \ M n such that v j is a vertex ofĤ j and for every i = j, v j is not a vertex ofĤ i . The thesis follows then by setting v¯j = v, and by taking V Hm +1 = {v 1 , . . . , vm +1 }.
In view of Proposition 3.5 in order to estimate from below the cardinality of R \ M n , it suffices to estimate the cardinality of H. To this end, we denote in the following by U k the closure of the region in R 2 containing H r Mn and delimited, respectively, by s 3 , s 4 , and s 5 for k = 2, s 4 , s 5 , and s 0 for k = 3, s 5 , s 0 , and s 1 for k = 4, and s 0 , s 1 , and s 2 for k = 5. Notice that T k ⊂Û k (see Fig. 5).

Fig. 5
The regionÛ 2 is shown and the boundary ∂ F(H x ) of a hexagon H x ∈ H 2 with vertex x ∈ T 2 is represented by a continuous (red) line. Note that this picture has a mere illustrative purpose (the configuration is not a EIP minimizer) (Color figure online) then H x ⊂Û k . By the definition of the sets T k [see (64)], the previous properties are fulfilled by every x ∈ T k , apart from those points belonging to the portion of the boundary ofT k which is adjacent either toP k−1 or toP k . Denoting byT k this latter set, claim (68) follows once we observe that Moving from Proposition 3.5 and Lemma 3.6, we deduce the lower estimate on the maximal radii r M n of the minimizers M n of (2).
A direct consequence of (69) is the upper bound on the Hausdorff distance between the sets M n and H r Mn introduced in Corollary 1.3.
Proof of Corollary 1.3 Let M n be a minimizer. We assume with no loss of generality that n > 6 so that by Proposition 3.1 the maximal hexagon H r Mn is not degenerate. Then Therefore, by (62) and (70) we obtain that ≤ 2 · 3 1/4 n 1/4 + O (1) where we used Proposition 3.7 in the second inequality.
where we used Proposition 3.7 in the inequality. Therefore, by (73) and (74) (24) we also obtain that We now define d n := 1 + 3 r M n + 3 r M n 2 and consider the empirical measure μ D dn associated to the daisy D d n . For every point x i ∈ D d n , we denote by Z i the Voronoi cell in L t related to x i that is the regular hexagon centered in x i with side 1/ √ 3 and edges orthogonal to the three lattice directions. Furthermore, let Z n i := {x/ √ n : x ∈ Z i }. We observe that and For every ϕ ∈ W 1,∞ (R 2 ), we obtain that where we used (76) and (77) in the third and the last inequality, respectively. By combining (75) with (78), we obtain that and where M n := M n − q n , with q n ∈ L t such that H r Mn = D 1+3r Mn +3r 2 Mn + q n .
Step 2 Assertions (15)-(18) directly follow from (24), (75), and (80) since by (70) and (73) a direct computation shows that We notice here that Theorem 1.2 implies in particular the convergence (up to translations) of the empirical measures associated with the minimizers to the measure μ not only with respect to the weak * -converge of measures, but also with respect to the flat norm [see (72)]. We remark that an alternative approach to the one adopted in Theorem 1.2 is that of defining a unique n-configurational Wulff shape W n for all the minimizer with n atoms. For example, we could define whereŴ n is the hexagon with side p n /6 and center x τ (1) . We remark that the O(n 1/4 ) estimate on the Hausdorff distance and the O(n 3/4 )-law still hold true by replacing the maximal hexagon H r Mn with W n .
More precisely, by Proposition 3.7 we have that d H (W n , H r Mn ) ≤ 6 p n 6 − r ≤ α n 2 − (α n ) 2 + O(1) (82) Fig. 6 The form of a minimizer M n constructed in the proof of Theorem 1.4 is shown. The configuration M n is contained in the union of the hexagonĤ r n drawn in the darkest color (blue) and the regionÂ n constructed on two of its sides drawn in the lightest color (yellow) (Color figure online)Â n H r n h n h n r n and we consider the region A n := {x + h n t 2 : x ∈Ĥ r n } \Ĥ r n that consists of two parallelograms of height h n constructed on two consecutive sides of H r n (see Fig. 6). Let c := |(Ĥ r n ∪Â n ) ∩ L t |. We denote by C c the configuration defined by C c := Ĥ r n ∪Â n ∩ L t and we observe that, by construction, the perimeter of C c satisfies P(C c ) = p n .
We subdivide the remaining proof of the claim into two substeps. Substep 1.1. We claim that for every n big enough there exists a minimizer M n such that H r n ⊆ M n ⊆ C c and |C c \ M n | ≤ 2r n − 1.
We now observe that by the definition of C c it is possible to remove up to 2r n − 1 points from C c \ H r n without changing the perimeter of the configuration. In view of (90), we construct M n by removing in such a way c − n points from C c . It follows from (86) that P(M n ) = p n and hence, the claim holds true. Substep 1.2. Let M n be the sequence of ground states constructed in the previous substep. In view of (90), and of the definition of α n and p n , there holds |C n \ H r n | = (2r n + 1)h n = −6(r n ) 2 − 3r n + p n r n + 1 + p n 2 = α n 6 α n 2 − (α n ) 2 + o(n 3/4 ).
The thesis follows from combining (91) and (92) since H r n is by construction the maximal hexagon of M n .
Step 2 In this last step, we remark that lim sup and that for those n j ∈ N of the form n j = 2 + 3 j + 3 j 2 there holds K n j → 2 3 1/4 =: K t as j → +∞.
It is remarkable that the leading terms in the estimates (24), (75), and (80) established in Step 1 of Theorem 1.2 are optimal for every n ∈ N as it follows from Step 1 of the proof of Theorem 1.4.
Finally, we notice that the bounded quantities K n defined in (73) are 0 for every n ∈ N that can be written as n = 1 + 3k + 3k 2 for some k ∈ N. This reflects the fact that for those n the daisy D n is the unique minimizer, whose maximal hexagon H r Dn is the daisy itself. Therefore, Theorem 1.4 also entails that, by adding a point to every EIP (2) with n = 1 + 3i + 3i 2 for some i ∈ N, we pass not only from a problem characterized by uniqueness of solutions to a problem with nonuniqueness, but also from a situation of zero deviation of the minimizer from its maximal hexagon to the situation in which minimizers include one that attains the maximal deviation.