English
Related papers

Related papers: Polyhedral faces in Gram spectrahedra of binary fo…

200 papers

Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We…

Combinatorics · Mathematics 2019-07-05 Lisa Berry , Stefan Forcey , Maria Ronco , Patrick Showers

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…

Optimization and Control · Mathematics 2015-07-22 Avinash Bhardwaj , Philipp Rostalski , Raman Sanyal

Let $P$ be a convex $d$-polytope and $0 \leq k \leq d-1$. In 2023, this author proved the following inequalities, resolving a question of B\'ar\'any: \[ \frac{f_k(P)}{f_0(P)} \geq \frac{1}{2}\biggl[{\lceil \frac{d}{2} \rceil \choose k} +…

Combinatorics · Mathematics 2024-01-30 Joshua Hinman

Given a planar graph, a subset of its vertices called terminals, and $k \in \mathbb{N}$, the Face Cover Number problem asks whether the terminals lie on the boundaries of at most $k$ faces of some embedding of the input graph. When a plane…

Data Structures and Algorithms · Computer Science 2026-01-08 Thekla Hamm , Sukanya Pandey , Krisztina Szilágyi

We introduce the set of framed convex polyhedra with N faces as the symplectic quotient C^2N//SU(2). A framed polyhedron is then parametrized by N spinors living in C^2 satisfying suitable closure constraints and defines a usual convex…

Mathematical Physics · Physics 2015-06-16 Etera R. Livine

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.

Optimization and Control · Mathematics 2015-04-17 Emmanuel Tsukerman

Several recent papers have examined a rational polyhedron $P_m$ whose integer points are in bijection with the numerical semigroups (cofinite, additively closed subsets of the non-negative integers) containing $m$. A combinatorial…

This paper solves the following problem about Hermitian matrices related to the theory of $2$-structures:\emph{ }Let $n$ be a positive integer and $k$ be an integer with $k\in \{3,\ldots,n-3\}$. Characterize the Hermitian matrices $A$ such…

Combinatorics · Mathematics 2021-07-28 Kawtar Attas , Abderrahim Boussaïri , Imane Souktani

In 1967, Gr\"unmbaum conjectured that any $d$-dimensional polytope with $d+s\leq 2d$ vertices has at least \[\phi_k(d+s,d) = {d+1 \choose k+1 }+{d \choose k+1 }-{d+1-s \choose k+1 } \] $k$-faces. This conjecture along with the…

Combinatorics · Mathematics 2022-07-29 Lei Xue

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

Optimization and Control · Mathematics 2016-10-27 Sander Gribling , David de Laat , Monique Laurent

The paper is motivated by the study of graded representations of Takiff algebras, cominuscule parabolics, and their generalizations. We study certain special subsets of the set of weights (and of their convex hull) of the generalized Verma…

Representation Theory · Mathematics 2015-02-02 Apoorva Khare , Tim Ridenour

The polytope $ASM_n$, the convex hull of the $n\times n$ alternating sign matrices, was introduced by Striker and by Behrend and Knight. A face of $ASM_n$ corresponds to an elementary flow grid defined by Striker, and each elementary flow…

Combinatorics · Mathematics 2025-03-17 Elizabeth A. Dinkelman , Walter D. Morris

Square Heffter arrays are $n\times n$ arrays such that each row and each column contains $k$ filled cells, each row and column sum is divisible by $2nk+1$ and either $x$ or $-x$ appears in the array for each integer $1\leq x\leq nk$.…

Combinatorics · Mathematics 2019-07-29 K. Burrage , Nicholas J. Cavenagh , D. Donovan , E. Ş. Yazıcı

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…

Optimization and Control · Mathematics 2024-08-26 Vera Roshchina , Levent Tunçel

Let $\rho$ be a metric on the set $X=\{1,2,\dots,n+1\}$. Consider the $n$-dimensional polytope of functions $f:X\rightarrow \mathbb{R}$, which satisfy the conditions $f(n+1)=0$, $|f(x)-f(y)|\leq \rho(x,y)$. The question on classifying…

Combinatorics · Mathematics 2016-08-25 J. Gordon , F. Petrov

It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…

Optimization and Control · Mathematics 2021-06-14 Yibo Xu , Warren Adams , Akshay Gupte

Skeletal polyhedra are discrete connected structures consisting of finite (planar or skew) or infinite (linear, planar, or spatial) polygons as faces, with two faces on each edge and a circular vertex figure at each vertex. The present…

Combinatorics · Mathematics 2026-02-24 Egon Schulte , Tomas Skacel

A main conjecture in the field of Positive Geometry states that amplituhedra, which are certain semi-algebraic sets in the Grassmannian, are positive geometries. It is motivated by examples showing that the canonical forms of certain…

Algebraic Geometry · Mathematics 2026-02-18 Joris Koefler , Dmitrii Pavlov , Rainer Sinn

Nestohedra are a family of convex polytopes that includes permutohedra, associahedra, and graph associahedra. In this paper, we study an extension of such polytopes, called extended nestohedra. We show that these objects are indeed the…

Combinatorics · Mathematics 2019-12-17 Quang Dao , Christina Meng , Julian Wellman , Zixuan Xu , Calvin Yost-Wolff , Teresa Yu

Assume $n=2m\geq 2$ and let $F(x)=x^{d_1}+x^{d_2}$ be a binomial vectorial function over $\F_{2^n}$ possessing the maximal number (i.e. $2^n-2^m$) of bent components. Suppose the $2$-adic Hamming weights $\wt_2(d_1)$ and $\wt_2(d_2)$ are…

Information Theory · Computer Science 2026-04-10 Xianhong Xie , Yi Ouyang , Shenxing Zhang