Related papers: Spectrahedral representation of polar orbitopes

Number Decision Diagrams (NDD) provide a natural finite symbolic representation for regular set of integer vectors encoded as strings of digit vectors (least or most significant digit first). The convex hull of the set of vectors…

The article deals with operations defined on convex polyhedra or polyhedral convex functions. Given two convex polyhedra, operations like Minkowski sum, intersection and closed convex hull of the union are considered. Basic operations for…

The coadjoint orbits of compact Lie groups each carry a canonical (positive definite) K\"ahler structure, famously used to realize the group's irreducible representations in holomorphic sections of appropriate line bundles (Borel-Weil…

We consider the convex quadratic optimization problem with indicator variables and arbitrary constraints on the indicators. We show that a convex hull description of the associated mixed-integer set in an extended space with a quadratic…

We reinterpret an inequality, due originally to Sidorenko, for linear extensions of posets in terms of convex subsets of the symmetric group $\mathfrak{S}_n$. We conjecture that the analogous inequalities hold in arbitrary…

Let $G:= (C^*)^k\times SL_2(C)$ act linearly on a vector space or its projectivisation. We obtain an effective criterion to detect whether a number of orbits in an orbit-closure is finite or not.

A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron we are interested in the question of the smallest possible size $r$ of the matrices in the description by linear matrix inequalities. We show that for the…

We prove two results on convex subsets of Euclidean spaces invariant under an orthogonal group action. First, we show that invariant spectrahedra admit an equivariant spectrahedral description, i.e., can be described by an equivariant…

We explore the separability of point sets in the plane by a restricted-orientation convex hull, which is an orientation-dependent, possibly disconnected, and non-convex enclosing shape that generalizes the convex hull. Let $R$ and $B$ be…

Let G be a complex semisimple Lie group, K a maximal compact subgroup and V an irreducible representation of K. Denote by M the unique closed orbit of G in P(V) and by O its image via the moment map. For any measure on M we construct a map…

Using elementary graded automorphisms of polytopal algebras (essentially the coordinate rings of projective toric varieties) polyhedral versions of the group of elementary matrices and the Steinberg and Milnor groups are defined. They…

Let $X\subset\A^{2r}$ be a real curve embedded into an even-dimensional affine space. In the main result of this paper, we characterise when the r-th secant variety to $X$ is an irreducible component of the algebraic boundary of the convex…

Hyperbolic polynomials elegantly encode a rich class of convex cones that includes polyhedral and spectrahedral cones. Hyperbolic polynomials are closed under taking polars and the corresponding cones, the derivative cones, yield…

In this note we investigate the convex hull of those $n \times n$-permutation matrices that correspond to symmetries of a regular $n$-gon. We give the complete facet description. As an application, we show that this yields a Gorenstein…

A classic theorem by Steinitz states that a graph G is realizable by a convex polyhedron if and only if G is 3-connected planar. Zonohedra are an important subclass of convex polyhedra having the property that the faces of a zonohedron are…

We study moduli spaces of lattice-polarized K3 surfaces in terms of orbits of representations of algebraic groups. In particular, over an algebraically closed field of characteristic 0, we show that in many cases, the nondegenerate orbits…

The goal of this diploma thesis is to give a detailed description of Kirillov's Orbit Method for the case of compact connected Lie groups. The theory of Kirillov aims at finding all irreducible unitary representations of a given Lie group…

A quadratically constrained quadratic program (QCQP) is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadratic constraints. Solving non-convex QCQP to global…

The Birkhoff polytope $B_n$ is the convex hull of all $n\times n$ permutation matrices in $\mathbb{R}^{n\times n}$. We compute the combinatorial symmetry group of the Birkhoff polytope. A representation polytope is the convex hull of some…

Let $A$ be a polytope in $\mathbb{R}^d$ (not necessarily convex or connected). We say that $A$ is spectral if the space $L^2(A)$ has an orthogonal basis consisting of exponential functions. A result due to Kolountzakis and Papadimitrakis…