E. B. Saff
Professor of Mathematics
Director, Center for Constructive Approximation
1326 Stevenson Center
Nashville, TN 37240
Tel. 615-322-2014615-322-2014 Fax 615-343-0215
International Conference on Approximation Theory and Beyond, May 15-18, 2023,
at Vanderbilt University
“Discrete Energy on Rectifiable Sets” (jointly authored with S. Borodachov and D. Hardin), Springer Monographs in Mathematics, 2019. ISBN 978-0-387-84807-5 (666 pages) https://www.springer.com/gp/book/9780387848075
Universal minima of discrete potentials for sharp spherical codes, (with P. Boyvalenkov, P. Dragnev, D.P. Hardin and M. Stoyanova), submitted,
On Polarization of Spherical Codes and Designs (with P. Boyvalenkov, P. Dragnev, D.P. Hardin and M. Stoyanova), submitted
Archetype tasks link intratumoral heterogeneity to plasticity and 2cancer hallmarks in small cell lung cancer (with Sarah M. Groves et al), Cell Systems,
Point source equilibrium problems with connections to weighted quadrature domains,
(with P. Dragnev and A. Legg), Indag. Math. accepted.
Threshold Condensation to Singular Support for a Riesz Equilibrium Problem (with Djalil Chafaï and Robert S. Womersley), submitted.
On the solution of a Riesz equilibrium problem and integral
identities for special functions (with Djalil Chafaï and Robert S. Womersley),
J. Math. Anal. and App., Volume 515, Issue 1, 1 November 2022, 126367
Asymptotics of k-nearest neighbor Riesz energies (with D.P. Hardin and O.Vlasiuk) submitted
Riesz Energy Problems with External Fields and Related Theory (with P. Dragnev, R. Orive and F. Wielonsky) submitted.
Dynamics of particles on a curve with pairwise
hyper-singular repulsion (with D. Hardin, R.
Shu, E. Tadmor), accepted.
Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances, (with P. Boyvalenkov, P. Dragnev, D.P. Hardin and M. Stoyanova), IEEE Trans. Inform Theory, accepted.
On the search for tight frames of low coherence, (with X. Chen and D. Hardin),
J. Fourier Anal Appl 27, 2 (2021).
On two problems concerning universal bounds for codes, (with P. Boyvalenkov, P. Dragnev, D.P. Hardin and M. Stoyanova) Proc. XVI International Symposium “Problems of Redundancy in Information and Control Systems”, 2019, 58-63.
Linear programming bounds for energy and cardinality of codes of given min and max distances,(with P. Boyvalenkov, P. Dragnev, D.P. Hardin and M. Stoyanova) Proc. IEEE International Symposium on Information Theory, Paris, July 2019, 1747-1751 (https://ieeexplore.ieee.org/document/8849388)
Bounds for spherical codes: the Levenshtein framework lifted (with P. Boyvalenkov, P. Dragnev, D.P. Hardin and M. Stoyanova), Math. Comp. to appear.
©2023 Vanderbilt University ·
Site Development: University Web Communications