3 papers
math.SP2026
Local Optimality of the d-cube for Laplacian Eigenvalues
Braxton Osting, Robert Viator
For each we prove that the unit -cube is, on the class of convex polytopes combinatorially equivalent to a -cube, (i)…
math.OC2025
Extremal Steklov-Neumann Eigenvalues
Chiu-Yen Kao, Braxton Osting, Chee Han Tan +1
Let be a bounded open planar domain with smooth connected boundary, , that has been partitioned into two disjoint components, . We consider the Steklov-Ne…
stat.ML2022
Wasserstein Archetypal Analysis
Katy Craig, Braxton Osting, Dong Wang +1
Archetypal analysis is an unsupervised machine learning method that summarizes data using a convex polytope. In its original formulation, for fixed k, the method finds a convex pol…