Douglas P. Hardin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Douglas P. Hardin has a total of 64 co-authors. Here are the top co-authors by number of shared publications:
- Edward Barry Saff
Center for Constructive Approximation, Vanderbilt University, Nashville, USA
52 shared publications - Maya Stoyanova
Faculty of Mathematics and Informatics, Sofia University “St. Kliment Ohridski”, Sofia, Bulgaria
14 shared publications - Peter Boyvalenkov
Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, Bulgaria
14 shared publications - Peter D. Dragnev
Department of Mathematical Sciences, Purdue University, Fort Wayne, USA
10 shared publications - Peter D. Dragnev
Indiana-Purdue University
8 shared publications - Sergiy V. Borodachov
Department of Mathematics, Towson University, Towson, USA
8 shared publications
Latest Publications
- Open AccessUniversal polar dual pairs of spherical codes found in $E_8$ and $Λ_{24}$We identify universal polar dual pairs of spherical codes $C$ and $D$ such that for a large class of potential functions $h$ the minima of the discrete $h$-potential of $C$ on the sphere occur at the points of $D$ and vice versa. Moreover, the minimal values of their normalized potentials are equal. These codes arise from the known sharp codes embedded in the even unimodular extremal lattices $E_8$ and $Λ_{24}$ (Leech lattice). This embedding allows us to use the lattices' properties to find new universal polar dual pairs. In the process we extensively utilize the interplay between the binary Golay codes and the Leech lattice. As a byproduct of our analysis, we identify a new universally optimal (in the sense of energy) code in the projective space $\mathbb{RP}^{21}$ with $1408$ points (lines). Furthermore, we extend the Delsarte-Goethals-Seidel definition of derived codes from their seminal $1977$ paper and generalize their Theorem 8.2 to show that if a $τ$-design is enclosed in $k\leq τ$ parallel hyperplanes, then each of the hyperplane's sub-code is a $(τ+1-k)$-design in the ambient subspace.Open AccessUniversal polar dual pairs of spherical codes found in $E_8$ and $Λ_{24}$We identify universal polar dual pairs of spherical codes $C$ and $D$ such that for a large class of potential functions $h$ the minima of the discrete $h$-potential of $C$ on the sphere occur at the points of $D$ and vice versa. Moreover, the minimal values of their normalized potentials are equal. These codes arise from the known sharp codes embedded in the even unimodular extremal lattices $E_8$ and $Λ_{24}$ (Leech lattice). This embedding allows us to use the lattices' properties to find new universal polar dual pairs. In the process we extensively utilize the interplay between the binary Golay codes and the Leech lattice. As a byproduct of our analysis, we identify a new universally optimal (in the sense of energy) code in the projective space $\mathbb{RP}^{21}$ with $1408$ points (lines). Furthermore, we extend the Delsarte-Goethals-Seidel definition of derived codes from their seminal $1977$ paper and generalize their Theorem 8.2 to show that if a $τ$-design is enclosed in $k\leq τ$ parallel hyperplanes, then each of the hyperplane's sub-code is a $(τ+1-k)$-design in the ambient subspace.
- 10 June 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- p. 1-28
Bounds on discrete potentials of spherical (k, k)-designs
- 10 June 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- p. 1-28
Bounds on discrete potentials of spherical (k, k)-designs
- 28 January 2025
- Published by Springer Nature in Analysis and Mathematical Physics
- Vol. 15 (1) , 1-35
Energy bounds for weighted spherical codes and designs via linear programming
- 28 January 2025
- Published by Springer Nature in Analysis and Mathematical Physics
- Vol. 15 (1) , 1-35
Energy bounds for weighted spherical codes and designs via linear programming
- Open Access
- 20 December 2024
- Published by European Mathematical Society - EMS - Publishing House GmbH in Revista Matemática Iberoamericana
- Vol. 41 (2) , 603-650
Universal minima of discrete potentials for sharp spherical codes
This article is devoted to the study of discrete potentials on the sphere in \mathbb{R}^{n} for sharp codes. We show that the potentials of most of the known sharp codes attain the universal lower bounds for polarization for spherical \tau -designs previously derived by the authors, where “universal” is meant in the sense of applying to a large class of potentials that includes absolutely monotone functions of inner products. We also extend our universal bounds to T -designs and the associated polynomial subspaces determined by the vanishing moments of spherical configurations, and thus obtain the minima for the icosahedron, the dodecahedron, and sharp codes coming from E_{8} and the Leech lattice. For this purpose, we investigate quadrature formulas for certain subspaces of Gegenbauer polynomials P^{(n)}_{j} which we call PULB subspaces, particularly those having basis \{P_{j}^{(n)}\}_{j=0}^{2k+2}\setminus \{P_{2k}^{(n)}\}. Furthermore, for potentials with h^{(\tau+1)}<0 , we prove that the strong sharp codes and the antipodal sharp codes attain the universal bounds and their minima occur at points of the codes. The same phenomenon is established for the 600 -cell when the potential h satisfies h^{(i)}\geq 0 , i=1,\dots,15 , and h^{(16)}\leq 0 .
- 20 December 2024
- Published by European Mathematical Society - EMS - Publishing House GmbH in Revista Matemática Iberoamericana
- Vol. 41 (2) , 603-650
Open AccessUniversal minima of discrete potentials for sharp spherical codes
This article is devoted to the study of discrete potentials on the sphere in \mathbb{R}^{n} for sharp codes. We show that the potentials of most of the known sharp codes attain the universal lower bounds for polarization for spherical \tau -designs previously derived by the authors, where “universal” is meant in the sense of applying to a large class of potentials that includes absolutely monotone functions of inner products. We also extend our universal bounds to T -designs and the associated polynomial subspaces determined by the vanishing moments of spherical configurations, and thus obtain the minima for the icosahedron, the dodecahedron, and sharp codes coming from E_{8} and the Leech lattice. For this purpose, we investigate quadrature formulas for certain subspaces of Gegenbauer polynomials P^{(n)}_{j} which we call PULB subspaces, particularly those having basis \{P_{j}^{(n)}\}_{j=0}^{2k+2}\setminus \{P_{2k}^{(n)}\}. Furthermore, for potentials with h^{(\tau+1)}<0 , we prove that the strong sharp codes and the antipodal sharp codes attain the universal bounds and their minima occur at points of the codes. The same phenomenon is established for the 600 -cell when the potential h satisfies h^{(i)}\geq 0 , i=1,\dots,15 , and h^{(16)}\leq 0 .
- Open Access
Bounds on energy and potentials of discrete measures on the sphere
We establish upper and lower universal bounds for potentials of weighted designs on the sphere $\mathbb{S}^{n-1}$ that depend only on quadrature nodes and weights derived from the design structure. Our bounds hold for a large class of potentials that includes absolutely monotone functions. The classes of spherical designs attaining these bounds are characterized. Additionally, we study the problem of constrained energy minimization for Borel probability measures on $\mathbb{S}^{n-1}$ and apply it to optimal distribution of charge supported at a given number of points on the sphere. In particular, our results apply to $p$-frame energy.Open AccessBounds on energy and potentials of discrete measures on the sphere
We establish upper and lower universal bounds for potentials of weighted designs on the sphere $\mathbb{S}^{n-1}$ that depend only on quadrature nodes and weights derived from the design structure. Our bounds hold for a large class of potentials that includes absolutely monotone functions. The classes of spherical designs attaining these bounds are characterized. Additionally, we study the problem of constrained energy minimization for Borel probability measures on $\mathbb{S}^{n-1}$ and apply it to optimal distribution of charge supported at a given number of points on the sphere. In particular, our results apply to $p$-frame energy. - Open Access
Universal minima of discrete potentials for sharp spherical codes
This article is devoted to the study of discrete potentials on the sphere in $\mathbb{R}^n$ for sharp codes. We show that the potentials of most of the known sharp codes attain the universal lower bounds for polarization for spherical $\tau$-designs previously derived by the authors, where ``universal'' is meant in the sense of applying to a large class of potentials that includes absolutely monotone functions of inner products. We also extend our universal bounds to $T$-designs and the associated polynomial subspaces determined by the vanishing moments of spherical configurations and thus obtain the minima for the icosahedron, dodecahedron, and sharp codes coming from $E_8$ and the Leech lattice. For this purpose, we investigate quadrature formulas for certain subspaces of Gegenbauer polynomials $P^{(n)}_j$ which we call PULB subspaces, particularly those having basis $\{P_j^{(n)}\}_{j=0}^{2k+2}\setminus \{P_{2k}^{(n)}\}.$ Furthermore, for potentials with $h^{(\tau+1)}<0$ we prove that the strong sharp codes and the antipodal sharp codes attain the universal bounds and their minima occur at points of the codes. The same phenomenon is established for the $600$-cell when the potential $h$ satisfies $h^{(i)}\geq 0$, $i=1,\dots,15$, and $h^{(16)}\leq 0.$Open AccessUniversal minima of discrete potentials for sharp spherical codes
This article is devoted to the study of discrete potentials on the sphere in $\mathbb{R}^n$ for sharp codes. We show that the potentials of most of the known sharp codes attain the universal lower bounds for polarization for spherical $\tau$-designs previously derived by the authors, where ``universal'' is meant in the sense of applying to a large class of potentials that includes absolutely monotone functions of inner products. We also extend our universal bounds to $T$-designs and the associated polynomial subspaces determined by the vanishing moments of spherical configurations and thus obtain the minima for the icosahedron, dodecahedron, and sharp codes coming from $E_8$ and the Leech lattice. For this purpose, we investigate quadrature formulas for certain subspaces of Gegenbauer polynomials $P^{(n)}_j$ which we call PULB subspaces, particularly those having basis $\{P_j^{(n)}\}_{j=0}^{2k+2}\setminus \{P_{2k}^{(n)}\}.$ Furthermore, for potentials with $h^{(\tau+1)}<0$ we prove that the strong sharp codes and the antipodal sharp codes attain the universal bounds and their minima occur at points of the codes. The same phenomenon is established for the $600$-cell when the potential $h$ satisfies $h^{(i)}\geq 0$, $i=1,\dots,15$, and $h^{(16)}\leq 0.$ - 15 April 2023
- Published by Springer Nature in Constructive Approximation
- Vol. 59 (2) , 333-383
Asymptotics of k-nearest Neighbor Riesz Energies
- 15 April 2023
- Published by Springer Nature in Constructive Approximation
- Vol. 59 (2) , 333-383
Asymptotics of k-nearest Neighbor Riesz Energies
- Open Access
Asymptotics of $k$-nearest neighbor Riesz energies
We obtain new asymptotic results about systems of $ N $ particles governed by Riesz interactions involving $ k $-nearest neighbors of each particle as $N\to\infty$. These results include a generalization to weighted Riesz potentials with external field. Such interactions offer an appealing alternative to other approaches for reducing the computational complexity of an $ N $-body interaction. We find the first-order term of the large $ N $ asymptotics and characterize the limiting distribution of the minimizers. We also obtain results about the $ \Gamma $-convergence of such interactions, and describe minimizers on the 1-dimensional flat torus in the absence of external field, for all $ N $.Open AccessAsymptotics of $k$-nearest neighbor Riesz energies
We obtain new asymptotic results about systems of $ N $ particles governed by Riesz interactions involving $ k $-nearest neighbors of each particle as $N\to\infty$. These results include a generalization to weighted Riesz potentials with external field. Such interactions offer an appealing alternative to other approaches for reducing the computational complexity of an $ N $-body interaction. We find the first-order term of the large $ N $ asymptotics and characterize the limiting distribution of the minimizers. We also obtain results about the $ \Gamma $-convergence of such interactions, and describe minimizers on the 1-dimensional flat torus in the absence of external field, for all $ N $. - Open Access
Universal bounds for spherical codes: the Levenshtein framework lifted
Based on the Delsarte-Yudin linear programming approach, we extend Levenshtein's framework to obtain lower bounds for the minimum $h$-energy of spherical codes of prescribed dimension and cardinality, and upper bounds on the maximal cardinality of spherical codes of prescribed dimension and minimum separation. These bounds are universal in the sense that they hold for a large class of potentials $h$ and in the sense of Levenshtein. Moreover, codes attaining the bounds are universally optimal in the sense of Cohn-Kumar. Referring to Levenshtein bounds and the energy bounds of the authors as ``first level", our results can be considered as ``next level" universal bounds as they have the same general nature and imply necessary and sufficient conditions for their local and global optimality. For this purpose, we introduce the notion of Universal Lower Bound space (ULB-space), a space that satisfies certain quadrature and interpolation properties. While there are numerous cases for which our method applies, we will emphasize the model examples of $24$ points ($24$-cell) and $120$ points ($600$-cell) on $\mathbb{S}^3$. In particular, we provide a new proof that the $600$-cell is universally optimal, and in so doing, we derive optimality of the $600$-cell on a class larger than the absolutely monotone potentials considered by Cohn-Kumar.Open AccessUniversal bounds for spherical codes: the Levenshtein framework lifted
Based on the Delsarte-Yudin linear programming approach, we extend Levenshtein's framework to obtain lower bounds for the minimum $h$-energy of spherical codes of prescribed dimension and cardinality, and upper bounds on the maximal cardinality of spherical codes of prescribed dimension and minimum separation. These bounds are universal in the sense that they hold for a large class of potentials $h$ and in the sense of Levenshtein. Moreover, codes attaining the bounds are universally optimal in the sense of Cohn-Kumar. Referring to Levenshtein bounds and the energy bounds of the authors as ``first level", our results can be considered as ``next level" universal bounds as they have the same general nature and imply necessary and sufficient conditions for their local and global optimality. For this purpose, we introduce the notion of Universal Lower Bound space (ULB-space), a space that satisfies certain quadrature and interpolation properties. While there are numerous cases for which our method applies, we will emphasize the model examples of $24$ points ($24$-cell) and $120$ points ($600$-cell) on $\mathbb{S}^3$. In particular, we provide a new proof that the $600$-cell is universally optimal, and in so doing, we derive optimality of the $600$-cell on a class larger than the absolutely monotone potentials considered by Cohn-Kumar. - Open Access
Asymptotic properties of short-range interaction functionals
We describe a framework for extending the asymptotic behavior of a short-range interaction from the unit cube to general compact subsets of $ \mathbb R^d $. This framework allows us to give a unified treatment of asymptotics of hypersingular Riesz energies and optimal quantizers. We further obtain new results about the scale-invariant nearest neighbor interactions, such as the $ k $-nearest neighbor truncated Riesz energy. Our generalized approach has applications to methods for generating distributions with prescribed density: strongly-repulsive Riesz energies, centroidal Voronoi tessellations, and a popular meshing algorithm due to Persson and Strang.Open AccessAsymptotic properties of short-range interaction functionals
We describe a framework for extending the asymptotic behavior of a short-range interaction from the unit cube to general compact subsets of $ \mathbb R^d $. This framework allows us to give a unified treatment of asymptotics of hypersingular Riesz energies and optimal quantizers. We further obtain new results about the scale-invariant nearest neighbor interactions, such as the $ k $-nearest neighbor truncated Riesz energy. Our generalized approach has applications to methods for generating distributions with prescribed density: strongly-repulsive Riesz energies, centroidal Voronoi tessellations, and a popular meshing algorithm due to Persson and Strang.