skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Integer points in arbitrary convex cones: the case of the PSD and SOC cones
Award ID(s):
2348578 2434665
PAR ID:
10607853
Author(s) / Creator(s):
; ; ;
Publisher / Repository:
Springer
Date Published:
Journal Name:
Mathematical Programming
ISSN:
0025-5610
Page Range / eLocation ID:
1-25
Subject(s) / Keyword(s):
Keywords Integer points Convex cones Semigroups Hilbert bases Conic programming Positive semidefinite Cone Second-order cone
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    We study the connection between triangulations of a type $$A$$ root polytope and the resonance arrangement, a hyperplane arrangement that shows up in a surprising number of contexts. Despite an elementary definition for the resonance arrangement, the number of resonance chambers has only been computed up to the $n=8$ dimensional case. We focus on data structures for labeling chambers, such as sign vectors and sets of alternating trees, with an aim at better understanding the structure of the resonance arrangement, and, in particular, enumerating its chambers. Along the way, we make connections with similar (and similarly difficult) enumeration questions. With the root polytope viewpoint, we relate resonance chambers to the chambers of polynomiality of the Kostant partition function. With the hyperplane viewpoint, we clarify the connections between resonance chambers and threshold functions. In particular, we show that the base-2 logarithm of the number of resonance chambers is asymptotically $n^2$. 
    more » « less