Max filtering with reflection groups

12/09/2022
by   Dustin G. Mixon, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/21/2022

Injectivity, stability, and positive definiteness of max filtering

Given a real inner product space V and a group G of linear isometries, m...
research
05/27/2022

Group-invariant max filtering

Given a real inner product space V and a group G of linear isometries, w...
research
11/24/2022

Communication Complexity of Inner Product in Symmetric Normed Spaces

We introduce and study the communication complexity of computing the inn...
research
05/28/2018

The reflection distance between zigzag persistence modules

By invoking the reflection functors introduced by Bernstein, Gelfand, an...
research
07/25/2023

Good codes from twisted group algebras

In this paper, we shall give an explicit proof that constacyclic codes o...
research
11/10/2022

Streaming Euclidean Max-Cut: Dimension vs Data Reduction

Max-Cut is a fundamental problem that has been studied extensively in va...
research
12/23/2018

Learning finite-dimensional coding schemes with nonlinear reconstruction maps

This paper generalizes the Maurer--Pontil framework of finite-dimensiona...

Please sign up or login with your details

Forgot password? Click here to reset