Codes and Expansions (CodEx) Seminar

Daniel Packer (The Ohio State University):
Max Filtering with Reflection Groups

Given a finite-dimensional real inner product space \(V\) and a finite subgroup \(G\) of linear isometries, max filtering affords a bilipschitz Euclidean embedding of the orbit space \(V/G\). Often the symmetries of concern are reflection group symmetries. In this context, we identify the max filtering maps of minimum distortion. Our analysis involves an interplay between Coxeter's classification and semidefinite programming.