Related papers: 0/1 Polytopes with Quadratic Chvatal Rank
The nonnegative and positive semidefinite (PSD-) ranks are closely connected to the nonnegative and positive semidefinite extension complexities of a polytope, which are the minimal dimensions of linear and SDP programs which represent this…
This paper explores some connections between rank one convexity, multiplicative quasiconvexity and Schur convexity. Theorem 5.1 gives simple necessary and sufficient conditions for an isotropic objective function to be rank one convex on…
This article explores additive codes with one-rank hull, offering key insights and constructions. The article introduces a novel approach to finding one-rank hull codes over finite fields by establishing a connection between self-orthogonal…
Given a directed graph D = (N, A) and a sequence of positive integers 1 <= c_1 < c_2 < ... < c_m <= |N|, we consider those path and cycle polytopes that are defined as the convex hulls of simple paths and cycles of D of cardinality c_p for…
Given an abstract $n$-polytope $\mathcal{K}$, an abstract $(n+1)$-polytope $\mathcal{P}$ is an extension of $\mathcal{K}$ if all the facets of $\mathcal{P}$ are isomorphic to $\mathcal{K}$. A chiral polytope is a polytope with maximal…
A beautiful result of Br\"ocker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every $d$-dimensional polyhedron admits a representation as the set of solutions of at most…
The rank of a hierarchically hyperbolic space is the maximal number of unbounded factors in a standard product region. For hierarchically hyperbolic groups, this coincides with the maximal dimension of a quasiflat. Examples for which the…
Let $P$ be a polytope defined by the system $A x \leq b$, where $A \in R^{m \times n}$, $b \in R^m$, and $\text{rank}(A) = n$. We give a short geometric proof of the following tight upper bound on the number of vertices of $P$: $$ n! \cdot…
The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…
Let $p(z)$ be a complex polynomial of degree $n\ge 2$. For each $c\in\mathbb{C}$, let $K_c$ denote the convex hull of the zeros of $p(z)+c$, and let $K'$ denote the convex hull of the zeros of $p'(z)$. We prove that…
We study sets defined as the intersection of a rank-1 constraint with different choices of linear side constraints. We identify different conditions on the linear side constraints, under which the convex hull of the rank-1 set is polyhedral…
The log-rank conjecture is a longstanding open problem with multiple equivalent formulations in complexity theory and mathematics. In its linear-algebraic form, it asserts that the rank and partitioning number of a Boolean matrix are…
Finite-dimensional representations of Onsager's algebra are characterized by the zeros of truncation polynomials. The Z_N-chiral Potts quantum chain hamiltonians (of which the Ising chain hamiltonian is the N=2 case) are the main known…
Consider the problem, usually called the P\'olya-Chebotarev problem, of finding a continuum in the complex plane including some given points such that the logarithmic capacity of this continuum is minimal. We prove that each connected…
For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…
For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…
Given a set P of points on the plane, a polygon with vertices in P is said to be empty if it contains no element of P in its interior. We show that every set of n points in general position on the plane determines at least…
In order to test if an unknown matrix has a given rank (null hypothesis), we consider the family of statistics that are minimum squared distances between an estimator and the manifold of fixed-rank matrix. Under the null hypothesis, every…
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…
De Loera et al. 2009, showed that when the rank is fixed the Ehrhart polynomial of a matroid polytope can be computed in polynomial time when the number of elements varies. A key to proving this is the fact that the number of simplicial…