Max filtering with reflection groups
Abstract: 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. We identify the max filtering maps of minimum distortion in the setting where G is a reflection group. Our analysis involves an interplay between Coxeter's classification and semidefinite programming.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.