Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Spectral Polyhedra

View through CrossRef
AbstractA spectral convex set is a collection of symmetric matrices whose range of eigenvalues forms a symmetric convex set. Spectral convex sets generalize the Schur-Horn orbitopes studied by Sanyal–Sottile–Sturmfels (2011). We study this class of convex bodies, which is closed under intersections, polarity and Minkowski sums. We describe orbits of faces and give a formula for their Steiner polynomials. We then focus on spectral polyhedra. We prove that spectral polyhedra are spectrahedra and give small representations as spectrahedral shadows. We close with observations and questions regarding hyperbolicity cones, polar convex bodies and spectral zonotopes.
Title: Spectral Polyhedra
Description:
AbstractA spectral convex set is a collection of symmetric matrices whose range of eigenvalues forms a symmetric convex set.
Spectral convex sets generalize the Schur-Horn orbitopes studied by Sanyal–Sottile–Sturmfels (2011).
We study this class of convex bodies, which is closed under intersections, polarity and Minkowski sums.
We describe orbits of faces and give a formula for their Steiner polynomials.
We then focus on spectral polyhedra.
We prove that spectral polyhedra are spectrahedra and give small representations as spectrahedral shadows.
We close with observations and questions regarding hyperbolicity cones, polar convex bodies and spectral zonotopes.

Related Results

Analysis of Students’ Creative Thinking Errors in Solving Polyhedra Problems
Analysis of Students’ Creative Thinking Errors in Solving Polyhedra Problems
Creative thinking skills are important in mathematics learning, especially in geometry, which requires students to generate ideas, choose alternative strategies, and construct flex...
The composition and provenance analysis of materials on Chang’E-4 Yutu-2 rover traverse
The composition and provenance analysis of materials on Chang’E-4 Yutu-2 rover traverse
Introduction:  The composition and provenance of the materials in South Pole - Aitken Basin (SPA) on southern farside is essential to a number of unresolved science questi...
The Application of S‐transform Spectrum Decomposition Technique in Extraction of Weak Seismic Signals
The Application of S‐transform Spectrum Decomposition Technique in Extraction of Weak Seismic Signals
AbstractIn processing of deep seismic reflection data, when the frequency band difference between the weak useful signal and noise both from the deep subsurface is very small and h...
Space Weathering simulation on the Aubrite meteorite NWA 13278, putative analogue of Mercury
Space Weathering simulation on the Aubrite meteorite NWA 13278, putative analogue of Mercury
IntroductionThe surface of Mercury as seen by the MESSENGER spacecraft is mostly featureless in the Visible-to-Near-Infrared range (VIS-to-NIR) [1-4], except for some restricted lo...
Research on the deep learning-based exposure invariant spectral reconstruction method
Research on the deep learning-based exposure invariant spectral reconstruction method
The surface spectral reflectance of an object is the key factor for high-fidelity color reproduction and material analysis, and spectral acquisition is the basis of its application...
The most pressing issue in soil hyperspectral analysis is technical failure due to soil heterogeneity
The most pressing issue in soil hyperspectral analysis is technical failure due to soil heterogeneity
Hyperspectral technology is an efficient and practical approach for measuring soil properties. However, its predictive accuracy is often limited by spectral variability resulting f...
Design and analysis of high-spectral resolution lidar discriminator
Design and analysis of high-spectral resolution lidar discriminator
An accurate aerosol optical property can be obtained by a high spectral resolution lidar (HSRL) technique, which employs a narrow spectral filter to suppress Mie scattering in the ...
Packing Polyhedra within Convex Sets
Packing Polyhedra within Convex Sets
This work addresses two problems related to packing identical regular polyhedra, focusing on triangles and squares. The first problem seeks to maximize the number of identical regu...

Back to Top