{'fraction_non_alphanumeric': 0.056839048554468974, 'fraction_numerical': 0.014519366272366229, 'mean_word_length': 3.800738007380074, 'pattern_counts': {'":': 1, '<': 8, '<?xml version=': 0, '>': 9, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 3, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Packings, sausages and catastrophes

In this survey we give an overview about some of the main results on parametric densities, a concept which unifies the theory of finite (free) packings and the classical theory of infinite packings.


Introduction
The theory of infinite packings of convex bodies, in particular, lattice packings of spheres is a fundamental and classical topic in mathematics which plays a role in various branches of mathematics as number theory, group theory, geometry of numbers, algebra, and which has numerous applications to coding theory, cryptography, crystallography and more. Here the main problem is to arrange infinitely many non-overlapping (lattice-) translative copies of a given convex body such that the whole space is covered as much as possible, i.e., packed as densely a possible.
On the other hand one may say, that all packings in real world are finite, even the atoms in crystals or sand at the beach, and in the theory of finite packings we want to arrange finitely many non-overlapping (lattice-) translative copies of a convex body as good as possible. Roughly speaking, there are two different ways to specify "as good as possible": The first one leads to so called bin packings where a container (bin) of a prescribed shape (ball, simplex, cube, etc.) but of minimal size (volume) is looked for containing a given number of non-overlapping (lattice-) translative copies of the given convex body. In contrast to this, we consider here so called free (finite) packings where the goal is to minimize the volume of the convex hull of a given number of non-overlapping (lattice-) translative copies of the convex body.
The volume-based free packing approach was introduced in 1892 by the Norwegian mathematician Axel Thue. For a given number of circles, he considered all possible packings and their convex hulls and asked for the minimal volume of these convex hulls. Thue's approach was further developed between 1940 and 1972 by many prominent mathematicians, e.g., by L. Fejes Tóth, R.P. Bambah, C.A. Rogers, H. Groemer and H. Zassenhaus. They also established a joint theory of finite and infinite packings (and coverings) in the plane. However, for higher dimensions, Thue's approach does not yield a joint theory of finite and infinite packings.
For the most interesting case of (free) finite sphere packings, L. Fejes Tóth formulated in 1975 his famous sausage conjecture, claiming that for dimensions ≥ 5 and any(!) number of unit balls, a linear arrangement of the balls, i.e., all midpoints are on a line and two consecutive balls touch each other, minimizes the volume of their convex hull. Currently, the sausage conjecture has been confirmed for all dimensions ≥ 42. The sausage conjecture shows already that finite packings have nothing or only little to do with classical infinite packings. This motivated the natural question to replace or to generalize Thue's density by a more general density, which permits a joint theory of finite and infinite packings for all dimensions and which also explains strange phenomena of finite packings as so-called sausage catastrophes.
We will show in this note, that the parametric density found in 1993 is the right answer to this question; it contains, in particular, Thue's density as a special case. As the name indicates, the parametric density depends on a parameter ρ > 0, and it turns out that for small ρ sausage-like arrangements are optimal, whereas for large ρ densest infinite packing arrangements are optimal. The parametric density, in particular, allows to obtain results on infinite packings via (limit) results on finite packings. Still, these results are, with a few exceptions, weaker than their classical infinite counterparts, but it is a tempting and interesting task to improve them and we kindly invite the reader to do so.
There is also an analogous theory of parametric densities for finite and infinite covering problems of convex bodies, introduced in [7]. In this survey, however, we just consider packing problems and for a thorough treatment of finite and covering problems, including the parametric densities, we refer to the book of K. Brczky, Jr. [10]. As a general reference to packing and covering of convex bodies see, e.g., [17,24], and for sphere packings, e.g., [15,16,47].
The paper is organized as follows: After providing the necessary definitions and notations regarding infinite and finite packings in the next section, the parametric densities will be introduced in Section 3. In Section 4 we will discuss the small parameter range and in Chapter 5 the large one. Finite lattice packings with respect to parametric densities are discussed in the last section.

Notations and preliminaries
We are working in the d-dimensional Euclidean space R d , equipped with the standard inner product x, y = x y for x, y ∈ R d and Euclidean norm |x| = x, x . B d = {x ∈ R d : |x| ≤ 1} is the Euclidean (unit) ball centered at the origin 0 of radius 1; its boundary bd B d is called unit sphere and will be denoted by S d−1 . The set of all convex bodies K ⊂ R d is denoted by K d , i.e., K ∈ K d , if K is convex, closed, bounded and int (K), the interior of K is non-empty. The dimension of a set S is the dimension of its affine hull aff (S) and it will be denoted by dim S. For K ∈ K d let be the set of all packing sets of K. For C ∈ P(K), the arrangement C + K is called a packing of K. In order to define the density of such a packing we denote by vol (S) the volume, i.e., the d-dimensional Lebesgue measure of a measurable set S ⊂ R d . For a finite set S ⊂ R d its cardinality is denoted by #S, and let W d = [−1, 1] d be the cube of edge length 2 centered at the origin. Then for K ∈ K d , C ∈ P(K), is called the density of the packing C + K and is called the density of a densest packing of K.
Obviously, for any finite packing set C we have δ(K, C) = 0. The idea of the quantity δ(K, C) is to measure how much of the space R d is occupied by C + K, i.e., we would like to measure vol (C + K)/vol (R d ), and we do it mathematically by approximating R d via the sequence λ W d . In particular, δ(K, C) may depend on the gauge body (here W d ) by which we approximate R d . It was shown by Groemer [23], however, that the definition of δ(K) is independent of this gauge body, and that there exists an optimal packing set C K ∈ P(K) such that Now we turn to finite (free) packings and to this end we consider for an integer n ∈ N, P n (K) = {C ∈ P(K) : #C} the set of all packing sets of cardinality n. Here we want to find a packing set C K,n ∈ P n (K) minimizing vol (conv C + K) among all C ∈ P n (K), where conv denotes the convex hull. Hence, in analogy to (2.2), (2.3) we denote for K ∈ K d and C ∈ P(K) with #C < ∞ by the density of the finite packing C + K and (2.5) δ 1 (K, n) = sup{δ 1 (K, C) : C ∈ P n (K)} is called the density of a densest n-packing of K. The role of the index 1 will become clear soon, and it not hard to see that for any n there exists an optimal finite packing set C n,K such that δ 1 (K, n) = δ 1 (K, C K (n)).
Of particular interest are here finite packing sets C = {x 1 , . . . , x n } ∈ P n (K) with dim C = 1, i.e., all points are collinear. Since we also want to minimize vol (conv {x 1 , . . . , x n } + K) we may assume that for two consecutive points on this line, x i , x j , say, the translates x i + K and x j + K touch. Hence, without loss of generality the points of such a packing set can be represented as where u ∈ S d−1 is the direction of the line and with |u| K we denote the norm induced by the origin symmetric body 1 2 (K − K), i.e., Packing sets S n (K, u) are called sausage configurations, where the name was coined by L. Fejes Tóth [25] in the special setting K = B d . Obviously, in this case the density of such a sausage configuration is independent of the direction u and therefore, it will be only denoted by S n (B d ) and it is The famous sausage conjecture of L. Fejes Tóth [25] claims that for any number of balls, a sausage configuration is always best possible, provided d ≥ 5.
In the plane a sausage is never optimal for n ≥ 3 and for "almost all" n ∈ N optimal packing configurations are known (see [30,42,44] and the references within).
In dimension 3 and 4 the situation is more complicated: In [3,4] it was shown that among those finite packings sets C satisfying dim C ≤ min{9, d− 1} or dim C ≤ (7/12)(d − 1) only sausages are optimal. Hence, in particular, for dimensions 3 and 4, no packings sets of intermediate dimensions are optimal, i.e., optimal packings sets are either 1-dimensional (sausages) or ddimensional (clusters). It is easy to see that for small n sausages are optimal while for large n clusters are optimal and so the interesting question is: when, i.e., for which "magic" numbers n does it happen? In dimension 3, results of Wills [45,46], Gandini and Wills [20] and Scholl [40] show that certain clusters are denser than sausage configurations when n = 56 or n ≥ 58. In fact, it is conjectured that for n < 56 and n = 57 sausages are optimal. In dimension 4 it was shown by Gandini and Zucco [21], Gandini [19] that a cluster is better than a sausage configuration for n ≥ 375,769. This large number of spheres motivated the name sausage catastrophe given in [46] referring to the abrupt change of the optimal shape of an optimal packing set. For a German popular science article about the catastrophe and the conjecture see [18].
Obtaining a unified theory for finite and infinite packings covering also these phenomena of sausage conjecture and sausage catastrophe was one motivation for the parametric density which we will define in the next section.
L. Fejes Tóth's sausage conjecture was first proved via the parametric density approach in dimensions ≥ 13,387 by Betke et al. [6] which was later improved to d ≥ 42 by Betke and Henk [5].
The sausage conjecture, in particular, implies that in general and, in fact, this is known to be true for all dimensions d ≥ 3. Thus, large optimal finite packing sets do not "approximate" optimal infinite packing sets. However, as we will see next, this will be corrected via the parametric density.

The parametric density
The concept of a parametric density was introduced by Betke et al. in [6], and the definitions and results presented in this section are taken from this paper.
is called the parametric density of C with respect to K and the pa- is called the parametric density of a densest n-packing of K with respect to the parameter ρ. iii) is called the parametric limit density of K with respect to the parameter ρ.
Apparently, for ρ = 1, the definitions in i) and ii) coincide with the previous given definitions of δ 1 (K, C) (2.4) and δ 1 (K, n) (2.5), and again it is easy to see that the sup in ii) may be replaced by a max.
It is also easy to check, that δ ρ (K, C), δ ρ (K, n) and δ ρ (K) are monotonously decreasing and continuous in ρ. Moreover, δ ρ (K, n) and δ ρ (K) are invariant with respect to regular affine transformations of K. By calculating the finite parametric density of large clusters of a densest infinite packing one gets for all ρ > 0 In order to understand the role of the parameter ρ we briefly recall some basic facts about mixed volumes, which implicitly appear in the denominator of (3.1), and for a detailed account we refer, e.g., to [24,38]. It is a classical fact from Convex Geometry, that the volume of conv C + ρK can be written as a polynomial in ρ of degree d, the so-called generalized Steiner-polynomial : where the coefficients V i (conv C; K) are called mixed volumes. In particular, we have V d (conv C; K) = vol (K), V 0 (conv C; K) = vol (conv C) and for over all C ∈ P n (K). A large parameter ρ gives a strong weight on the mixed volumes with a high index i. So it seems preferable to make mixed volumes with a small index rather large, which means that optimal packing set should be of dimensions d. Hence, we can expect that for large ρ and large n, optimal finite parametric densities converge to the density of a densest infinite packing. Therefore, we define  On the other hand, a small ρ gives a strong weight to the mixed volumes with a small index, and so low-dimensional packing sets C are better, with the extreme case dim C = 1. Now for such a sausage configuration S n (u, K) we have where vol n−1 (K|u ⊥ ) is the (n − 1)-dimensional volume of the orthogonal porjection of K on the hyperplane orthogonal to u. Hence, in order to have a sausage configuration of maximal density let u k ∈ S n−1 be such that With this notation let be the parametric limit density of an optimal sausage configuration of K with respect to the parameter ρ. This density may be regarded as the 1dimensional counterpart to δ(K). In particular, for K = B d we have In analogy to the critical parameter we define These two parameters devide the range of all parameters into three relevant areas and provide us with an simple bound on δ(K) as the next theorem shows.
Theorem 3.4. Let K ∈ K d and assume that 0 < ρ s (K), ρ c (K) < ∞. Then In other words, below the sausage parameter infinite sausages, i.e., 1dimensional packings, are optimal, above the critical parameter densest infinite packing arrangements are optimal, and what happens in between is (in general) rather unknown. Moreover, the parametric density of infinite sausages with respect to critical and sausage parameter yields lower and upper bounds on δ(K) (cf. (3.3)) .
In particular, for the unit ball B d , Theorem 3.4 iv) gives (cf. (3.4)) Here useful estimates are (see, e.g., [22], [4]) In general, we have ρ s (K) < ρ c (K) for d ≥ 3 (cf. [10, Theorem 10.7.1]), but in case of the ball it is tempting to conjecture that ρ c (B d ) = ρ s (B d ). In fact, for the ball it is even conjectured in [6]  Let us briefly point out that this conjecture also covers (essentially) L. Fejes Tóth's sausage conjecture as for ρ = 1 and d ≥ 5 a (maybe large) sausage has a larger density than δ(B d ). This conjecture would also imply the equivalence of determining δ(B d ), ρ c (B d ) and ρ s (B d ). In the next sections we will briefly present what is known about these two parameters.

The planar case
In the planar case and for centrally symmetric convex domains we have a rather complete picture. Based on classical results of Rogers [34,35] and Oler [32] it was shown in [6] that where equality on the left is attained only for an affinely regular non-degenerate hexagon and on the right only for a parallelogram. ii) δ ρ (K, n) = δ ρ (K, S n (K)) for 0 < ρ ≤ ρ s (K).
For instance, for the circle B 2 we have δ s 1 (B 2 ) = π/4 (cf. (3.4)) and by a well-known and classical result of Thue [43] we also know δ(B 2 ) = π/(2 √ 3). Hence In particular, Theorem 4.1 ii) shows that for ρ < ρ s (K) and any n ∈ N only sausage configurations are optimal. Such a strong statement is not true for arbitrary convex domains in the plane as it was shown by Brczky, Jr. and Schnell in [12], where they also proved that Theorem 4.1 i) holds true for any convex body in the plane.
For ρ ≥ ρ s (K) various optimal configurations might be possible as our running example below shows.

Small parameters and sausages
First we focus on the most prominent convex body, the ball. Here the main result verifies the sausage conjecture in high dimensions in a very strong form, i.e., not only for ρ = 1.
Even for parameters ≥ 1 sausages are optimal packing configurations for any n ∈ N, provided the dimension is large enough. Of course, this result implies The proof of Theorem 5.1 is based on a local approach by comparing the volume of conv (C + ρB d ) contained in a Dirichlet-Voronoi cell of an arbitrary packing set C ∈ P n (B d ) to the corresponding volumes of a sausage S n (B d ) + ρB d . The bound of √ 2 corresponds to the minimum distance between a vertex of a Dirichlet-Voronoi cell at c, say, and the center c. It was shown by Rogers [36,Chapter 7] that the distance between an i-dimensional face of such a cell and its center is at least 2(n − i)/(n − i + 1). In fact, in [6], Theorem 5.1 was proved for ρ < 2/ √ 3 since only the (n − 2)-dimensional faces of the cell were "used." It is easy to see that not all vertices of a Dirichlet-Voronoi cell of a packing set C ∈ P n (B d ) can be as close as √ 2, but it seems to be hard to take advantage of this fact.
This bound is asymptotically of the same order as the classical bounds of Blichfeldt [9] and Rogers [36,Chapter 7]. Though this is much weaker than the best known upper bound for δ(B d ) (cf. [29]), it shows that finite parameterized packings are also a tool to study infinite packings.
In view of L. Fejes Tóth's sausage conjecture the dimension d 1 of the theorem above is of particular interest. The reason for 42 is given here [1]. The sausage conjecture has also been verified with respect to certain restriction on the packings sets, e.g., among those which are lower-dimensional [3,4], or close to sausage-like arrangements [31], of whose inradius is rather large [11]. For detailed information we refer to [10,Section 8.3]. Now regarding the sausage parameter of arbitrary convex bodies the best bound is due to K. Brczky, Jr.; he showed Then for all n ∈ N δ ρ (K, n) = δ(B d , S n (K)).
A weaker upper bound of 1/(32 d 2 ) was frist proved in [8]. By the theorem above we get Corollary 5.6. Let K ∈ K d . Then ρ s (K) ≥ 1 32d . It is tempting to conjecture that ρ s (K) is bounded from below by an absolute constant.

Large parameters and densest infinite packings
Here the main result is captured by the next theorem. Theorem 6.1. Let K ∈ K d and let ρ ∈ R >0 such that K − K ⊆ ρK. Then for each n ∈ N δ ρ (K, n) ≤ δ(K).
Hence, for such a ρ we have ρ c (K) ≤ ρ (cf. (3.2)). In order to estimate ρ we may assume by the translation invariance of the densities that the centroid of K is at the origin. Then, it is known that K − K ⊆ (d + 1)K and if K is origin symmetric then, of course, K − K = 2 K. So we have The general bound of d + 1 was slightly improved to ρ c (K) ≤ d in [10,Lemma 10.5.2], but also here it might be true that ρ c (K) is bounded from above by an absolute constant.
The proof of Theorem 6.1 is based on an average argument: We assume that there exists a C ∈ P n (K) with δ ρ (K, n) > δ(K). For each x ∈ [0, γ] n , for some large γ, a finite packing set C x contained in a large cube λ W d is constructed consisting of suitable translates of C and of points of a densest infinite packing of K. For this superposition the property K − K ⊂ ρ K is used. In order to determine the cardinality of this new packing set C x it is averaged over all x ∈ [0, γ] n . This yields the existence of a packing set C x of K such that #C x vol (K) vol (λ W d ) > δ(K), which contradicts the definition of δ(K).
Regarding infinite packings, the corollary above together with (3.5) with (3.6) gives for K ∈ K d , K = −K, the bound This is up to a factor of 1/d of the same order than the best known lower bounds on δ(B d ) (cf., e.g., [36,Theorem 2.2]). In order to present results regarding the shape of optimal finite packings, we denote for ρ ∈ R >0 and n ∈ N by C ρ,n,K an optimal n-packing set of K with respect to the parameter ρ. Schnell and Wills [39] proved that optimal sphere packing sets are never two-dimensional. More precisely, Theorem 6.3. For any d ≥ 3, ρ > 0 and n ≥ 4 we have dim C ρ,n,B d = 2.
A direct consequence is that for d = 3 and all ρ ∈ (ρ c , 1) sausage catastrophes occur for n ρ ≥ 56 balls. Exact values of these "magic" numbers n ρ are not known, but they grow when ρ approches ρ c .
For large ρ and arbitrary convex bodies it was shown by Brczky, Jr. and Schnell [12] that conv C ρ,n,K resembles the shape of K; more precisely: where r K (conv C ρ,n,K ) is the (relative) inradius with respect to K. i.e., r K (conv C ρ,n,K ) = max{r : t + rK ⊂ conv C ρ,n,K for some t ∈ R d }.

(Finite) lattice packings
In this section we will restrict the finite and infinite packings to lattice packings. Lattice packings of convex bodies have a long and famous history for which we refer to [24]. Here we just briefly recall a few facts which are relevant for finite parameterized lattice packings.
We will understand by a lattice Λ ⊂ R d a regular linear image of the integral lattice Z d , i.e., there exists a regular matrix B ∈ R d×d such that Λ = BZ d . The determinant of the lattice, denoted by det Λ, is the volume of the parallelepiped spanned by the columns of B, i.e., det Λ = | det B|.
Confirming a conjecture of Minkowski, Hlawka [28] proved a lower bound on δ * (K) of order to 2 −d , which was subsequently (slightly) improved by various authors. The current record is still due to W. Schmidt [37] with where c is an absolute constant. For the ball B d there are even better bounds available and here we refer to the survey of H. Cohn [14] and the references within.
In order to deal with finite lattice packings we restrict now all given definitions in Section 3 to lattices, i.e., we set for K ∈ K d , ρ ∈ R >0 P n (K) * = {C ∈ P n (K) : there exits a Λ ∈ P(K) * with C ⊂ Λ} : δ * ρ (K) = δ s ρ (K)} and we call all these quantities as in the general case except that we add the word "lattice".
Since P n (K) * ⊂ P n (K) it is ρ * s (K) ≥ ρ s (K), and so all bounds presented in Section 5 for ρ s (K) are valid for ρ * s (K) as well. Regarding the critical lattice parameter ρ * c (K) the situation is different; in particular, the superposition argument leading to Theorem 6.1 and to the lower bounds on ρ c (K) does not work in the lattice case since the superposition may destroy the lattice property.
Here the idea is to use a lattice refinement argument which goes back to Rogers [33]. It implies that for K = −K and C ⊂ P n (K) * one can always find a lattice Λ ⊂ P(K) * containing C such that all points in space are close to some lattice points; more precisely, at most at distance 3 measured with respect to the norm induced by K. Hence, the circumradius of the Dirichlet-Voronoi cells of this refined lattice Λ is at most 3. Together with some improvements for the case K = B d , one gets, roughly speaking, the following theorem: In combination with (7.1) we obtain For a detailed account to Rogers lattice refinement method as well as improvements for l p -ball packings we refer to [27] and the references within.
Regarding the structure of optimal finite lattice packings we first point out that Theorem 6.3 has also been proven by Schnell and Wills in the lattice case, i.e., Theorem 7.3 ([39]). For any d ≥ 3, ρ > 0 and n ≥ 4 we have dim C * ρ,n,B d = 2.
Regarding optimal packing sets for d = 3 and n small we refer to [41]. For large ρ and n, the asymptotic shape of optimal finite lattice packings of convex bodies is closely related to the problem to understand crystal growth and to the so called Wulff shape. We are not going to enter this subject, instead we refer to [10,Section 10.11]. However, as a strong counterpart to Theorem 6.4 i), we mention a result of Arhelger et al. on origin symmetric convex boides showing that for ρ beyond the critical lattice parameter the asymptotic shape is cluster like.
In other words, the shape of conv C * ρ,n is not far from being a ball. In the same paper, it was also shown that for the 3-dimensional ball indicating that also a lattice analogue of the Strong Sausage Conjecture 3.5 could be true (as well). Further evidence is contained in the paper [13].