Clayton Shonkwiler PRO
Mathematician and artist
/ne23
this talk!
Special Session on Applied Knot Theory, Oct. 7, 2023
Florida State University
National Science Foundation (DMS–2107700)
Simons Foundation (#709150)
University of Georgia
University of Georgia
Signal: v∈Kd, where K=R or C or H.
Design: Choose f1,…,fn∈Kd (a frame).
Measurements: ⟨f1,v⟩,…,⟨fn,v⟩.
Goal: Reconstruct the signal v from F∗v
If F=[f1⋯fn], the measurement vector is F∗v.
If f1,…,fd∈Kd form an orthonormal basis, then
v=∑⟨fk,v⟩fk=FF∗v.
⇔FF∗=Idd×d
This is fragile! What if a measurement gets lost?
Definition.
{f1,…,fn}⊂Kd is a Parseval frame if Idd×d=FF∗=f1f1∗+⋯+fnfn∗.
The rows of F form an orthonormal set in Kn, so the space of all length-n Parseval frames in Kd is the Stiefel manifold Std(Kn).
Lost measurements are still a problem:
F=[1/201/2001]
An equal-norm Parseval frame (ENP frame) is a Parseval frame f1,…,fn with ∥fi∥2=∥fj∥2 for all i and j.
Theorem [Casazza–Kovačevic, Goyal–Kovačevic–Kelner, Holmes–Paulsen]
ENP frames are optimal for signal reconstruction in the presence of white noise and erasures.
∑∥fi∥2=trF∗F=trFF∗=trIdd×d=d, so each ∥fi∥2=nd.
Defining Conditions: f1,…,fn∈Kd so that
Think of fifi∗∈H(d), the space of Hermitian d×d matrices.
Defining Conditions: f1,…,fn∈Kd so that
Think of fifi∗−n1Idd×d∈H0(d), the space of traceless Hermitian d×d matrices.
Theorem [with Cantarella]
The reconstruction map Pn×(S1)n−3→Pol(n)/SO(3) is measure-preserving.
Theorem [with Cantarella, Duplantier, and Uehara]
Rejection sampling differences of di’s from the hypercube yields random n-gons in expected time Θ(n5/2).
Theorem [with Cantarella and Schumacher]
The Progressive Action-Angle Method yields random n-gons in expected time Θ(n2).
Theorem [with Needham]
FλC(r) either (i) is empty; (ii) contains no full-spark frames; or (iii) the subset of full-spark frames has full measure.
An ENP frame F is equiangular if there exists α so that ∣⟨fi,fj⟩∣=α for all i=j. Equiangular ENP frames are usually called equiangular tight frames (ETFs).
If F∈Cd×n is an ETF, then (f1f1∗−n1Idd×d,…,fnfn∗−n1Idd×d) are the vertices of a regular (n−1)-simplex in H0(d)≃su(d)∗. In particular, this implies n≤d2.
(Weak) Zauner Conjecture
For all positive integers d, there exists an ETF F∈Cd×d2.
Such ETFs are called maximal ETFs in the math literature, and Symmetric, Informationally-Complete, Positive Operator-Valued Measures (SIC-POVMs) in quantum information theory.
A faster direct sampling algorithm for equilateral closed polygons
Jason Cantarella, Henrik Schumacher, and Clayton Shonkwiler
Symplectic geometry and connectivity of spaces of frames
Tom Needham and Clayton Shonkwiler
Advances in Computational Mathematics 47 (2021), no. 1, 5. arXiv:1804.05899
Admissibility and frame homotopy for quaternionic frames
Tom Needham and Clayton Shonkwiler
Linear Algebra and its Applications 645 (2022), 237–255. arXiv:2108.02275
Toric symplectic geometry and full spark frames
Tom Needham and Clayton Shonkwiler
Applied and Computational Harmonic Analysis 61 (2022), 254–287. arXiv:2110.11295
By Clayton Shonkwiler