Tabla de Contenidos: “…16 Extensions of Smooth Small Distortions: Picking Motions -- Lemma 16.1 -- Lemma 16.2 -- 17 Extensions of Smooth Small Distortions: Unity Partitions -- 18 Extensions of Smooth Small Distortions: Function Extension -- Lemma 18.1 -- Lemma 18.2 -- 19 Equidistribution: Extremal Newtonian-like Configurations, Group Invariant Discrepancy, Finite Fields, Combinatorial Designs, Linear Independent Vectors, Matroids and the Maximum Distance Separable Conjecture -- 19.1 s-extremal Configurations and Newtonian s-energy -- 19.2 [−1, 1] -- 19.2.1 Critical Transition -- 19.2.2 Distribution of s-extremal Configurations -- 19.2.3 Equally Spaced Points for Interpolation -- 19.3 The n-dimensional Sphere, Sn Embedded in Rn +1 -- 19.3.1 Critical Transition -- 19.4 Torus -- 19.5 Separation Radius and Mesh Norm for s-extremal Configurations -- 19.5.1 Separation Radius of s&gt -- n-extremal Configurations on a Set Yn -- 19.5.2 Separation Radius of s&lt -- n − 1-extremal Configurations on Sn -- 19.5.3 Mesh Norm of s-extremal Configurations on a Set Yn -- 19.6 Discrepancy of Measures, Group Invariance -- 19.7 Finite Field Algorithm -- 19.7.1 Examples -- 19.7.2 Spherical ̂t-designs -- 19.7.3 Extension to Finite Fields of Odd Prime Powers -- 19.8 Combinatorial Designs, Linearly Independent Vectors, MDS Conjecture -- 19.8.1 The Case q=2 -- 19.8.2 The General Case -- 19.8.3 The Maximum Distance Separable Conjecture -- 20 Covering of SU(2) and Quantum Lattices -- 20.1 Structure of SU(2) -- 20.2 Universal Sets -- 20.3 Covering Exponent -- 20.4 An Efficient Universal Set in PSU(2) -- 21 The Unlabeled Correspondence Configuration Problem and Optimal Transport -- 21.1 Unlabeled Correspondence Configuration Problem -- 21.1.1 Non-reconstructible Configurations -- 21.1.2 Example -- 21.1.3 Partition Into Polygons -- 21.1.4 Considering Areas of Triangles-10-step Algorithm…”

Texto completo en Odilo