相关论文: Dimensions of faces of Gram spectrahedra
The Gram spectrahedron of a real form $f\in\mathbb{R}[\underline{x}]_{2d}$ parametrizes all sum of squares representations of $f$. It is a compact, convex, semi-algebraic set, and we study its facial structure in the case of ternary…
The Gram Spectrahedron of a polynomial parametrizes its sums-of-squares representations. In this note, we determine the dimension of Gram Spectrahedra of univariate polynomials.
The Gram spectrahedron $\text{Gram}(f)$ of a form $f$ with real coefficients parametrizes the sum of squares decompositions of $f$, modulo orthogonal equivalence. For $f$ a sufficiently general positive binary form of arbitrary degree, we…
Representations of nonnegative polynomials as sums of squares are central to real algebraic geometry and the subject of active research. The sum-of-squares representations of a given polynomial are parametrized by the convex body of…
We analyze both the facial structure of the Gram spectrahedron $\mathrm{Gram}(f)$ and of the Hermitian Gram spectrahedron $\mathcal{H}^{\scriptscriptstyle+}(f)$ of a nonnegative binary form $f \in \mathbb{R}[x, y]_{2d}$. We show that if $F…
Given a linear map on the vector space of symmetric matrices, every fiber intersected with the set of positive semidefinite matrices is a spectrahedron. Using the notion of the fiber body we can build the average over all such fibers and…
Let f(n,m) be the maximum of the sum of the squares of degrees of a graph with n vertices and m edges. Summarizing earlier research, we present a concise, asymptotically sharp upper bound on f(n,m), better than the bound of de Caen for…
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…
Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…
This paper explores the geometric structure of the spectrahedral cone, called the symmetry adapted PSD cone, and the symmetry adapted Gram spectrahedron of a symmetric polynomial. In particular, we determine the dimension of the symmetry…
Spectrahedra are linear sections of the cone of positive semidefinite matrices that, as convex bodies, generalize the class of polyhedra. In this paper we investigate the problem of recognizing when a spectrahedron is polyhedral. We reprove…
A $\textit{regular polygon surface}$ $M$ is a surface graph $(\Sigma, \Gamma)$ together with a continuous map $\psi$ from $\Sigma$ into Euclidean 3-space which maps faces to regular Euclidean polygons. When $\Sigma$ is homeomorphic to the…
A well known upper bound for the spectral radius of a graph, due to Hong, is that $\mu_1^2 \le 2m - n + 1$. It is conjectured that for connected graphs $n - 1 \le s^+ \le 2m - n + 1$, where $s^+$ denotes the sum of the squares of the…
Given a subspace $U\subset\mathbb{C}[x_1,\dots,x_n]_d$ we consider the closure of the image of the rational map $\mathbb{P}^{n-1}\dashrightarrow\mathbb{P}^{\dim U-1}$ given by $U$. Its coordinate ring is isomorphic to $\bigoplus_{i\ge 0}…
For a graph $G$ of order $n$, the spectral sum of $G$ is defined to be the sum $\lambda_1(G) + \lambda_2(G)$, where $\lambda_1(G)$ (resp. $\lambda_2(G)$) is the largest (resp. second largest) adjacency eigenvalue of $G$. Ebrahimi, Mohar,…
Let S be a subset of the unit disk, and let F(s) denote the class of completely multiplicative functions f such that f(p) is in S for all primes p. The authors' main concern is which numbers arise as mean-values of functions in F(s). More…
The genus spectrum of a finite group $G$ is the set of all $g\geq 2$ such that $G$ acts faithfully and orientation-preserving on a closed compact orientable surface of genus $g$. This article is an overview of some results relating the…
Given n >= 4 positive real numbers, we prove in this note that they are the face areas of a convex polyhedron if and only if the largest number is not more than the sum of the others.
We realize many sharp spectral bounds of the spectral radius of a nonnegative square matrix $C$ by using the largest real eigenvalues of suitable matrices of smaller sizes related to $C$ that are very easy to find. As applications, we give…
We will study the angle sums of polytopes, listed in the $\alpha$-vector, working to exploit the analogy between the f-vector of faces in each dimension and the alpha-vector of angle sums. The Gram and Perles relations on the…