Max filtering with reflection groups
Optimization and Control
2022-12-13 v1 Information Theory
Functional Analysis
math.IT
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.
Cite
@article{arxiv.2212.05104,
title = {Max filtering with reflection groups},
author = {Dustin G. Mixon and Daniel Packer},
journal= {arXiv preprint arXiv:2212.05104},
year = {2022}
}