English
Related papers

Related papers: Obstructions to determinantal representability

200 papers

In 2004, Choe, Oxley, Sokal and Wagner established a tight connection between matroids and multiaffine real stable polynomials. Recently, Branden used this theory and a polynomial coming from the Vamos matroid to disprove the generalized…

Combinatorics · Mathematics 2014-11-11 Sam Burton , Cynthia Vinzant , Yewon Youm

We develop a topological approach to prove the generalized Lax conjecture using the fact that determinants of sufficiently big symmetric linear pencils are able to express the rigidly convex sets of RZ polynomials of any degree $d$.…

Algebraic Geometry · Mathematics 2026-01-21 Alejandro González Nevado

A linear polyomial non-negative on the non-negativity domain of finitely many linear polynomials can be expressed as their non-negative linear combination. Recently, under several additional assumptions, Helton, Klep, and McCullough…

Operator Algebras · Mathematics 2012-11-28 Aljaž Zalar

Hyperbolic homogeneous polynomials with real coefficients, i.e., hyperbolic real projective hypersurfaces, and their determinantal representations, play a key role in the emerging field of convex algebraic geometry. In this paper we…

Algebraic Geometry · Mathematics 2018-03-12 Eli Shamovich , Victor Vinnikov

Recently, it was proved by Anari-Oveis Gharan-Vinzant, Anari-Liu-Oveis Gharan-Vinzant and Br\"{a}nd\'{e}n-Huh that, for any matroid $M$, its basis generating polynomial and its independent set generating polynomial are log-concave on the…

Combinatorics · Mathematics 2020-03-24 Satoshi Murai , Takahiro Nagaoka , Akiko Yazawa

Viewing a bivariate polynomial f in R[x,t] as a family of univariate polynomials in t parametrized by real numbers x, we call f real rooted if this family consists of monic polynomials with only real roots. If f is the characteristic…

Algebraic Geometry · Mathematics 2016-10-24 Christoph Hanselka

Motivated by recent advances in solution methods for mixed-integer convex optimization (MICP), we study the fundamental and open question of which sets can be represented exactly as feasible regions of MICP problems. We establish several…

Optimization and Control · Mathematics 2021-10-26 Miles Lubin , Juan Pablo Vielma , Ilias Zadik

A bimatroid is a matroid-like generalization of the collection of regular minors of a matrix. In this article, we use the theory of Lorentzian polynomials to study the logarithmic concavity of natural sequences associated to bimatroids.…

Combinatorics · Mathematics 2025-08-07 Felix Röhrle , Martin Ulirsch

A set is called semidefinite representable or semidefinite programming (SDP) representable if it can be represented as the projection of a higher dimensional set which is represented by some Linear Matrix Inequality (LMI). This paper…

Optimization and Control · Mathematics 2008-07-01 Jiawang Nie

Valiant's famous determinant versus permanent problem is the flagship problem in algebraic complexity theory. Mulmuley and Sohoni (Siam J Comput 2001, 2008) introduced geometric complexity theory, an approach to study this and related…

Computational Complexity · Computer Science 2017-07-27 Fulvio Gesmundo , Christian Ikenmeyer , Greta Panova

We first show the existence of an effective determinantal representation for any univariate polynomial with real coefficients. Then, we more precisely establish that any univariate polynomial with real coefficients has an effective…

Rings and Algebras · Mathematics 2008-09-05 Ronan Quarez

This article is a survey of matroid theory aimed at algebraic geometers. Matroids are combinatorial abstractions of linear subspaces and hyperplane arrangements. Not all matroids come from linear subspaces; those that do are said to be…

Algebraic Geometry · Mathematics 2014-09-12 Eric Katz

By applying Fourier transformations to the natural orthogonal oscillator representations of special linear Lie algebras, Luo and the second author (2013) obtained a large family of infinite-dimensional irreducible representations of the…

Representation Theory · Mathematics 2025-01-20 Hengjia Zhang , Xiaoping Xu

In this paper we consider images of (ordinary) noncommutative polynomials on matrix algebras endowed with a graded structure. We give necessary and sufficient conditions to verify that some multilinear polynomial is a central polynomial, or…

Rings and Algebras · Mathematics 2023-07-10 Ivan Gonzales Gargate , Thiago Castilho de Mello

A non-singular sesquilinear form is constructed that is preserved by the Lawrence-Krammer representation. It is shown that if the polynomial variables q and t of the Lawrence-Krammer representation are chosen to be appropriate algebraically…

Geometric Topology · Mathematics 2007-05-23 Ryan Budney

Consider the closed convex hull $K$ of a monomial curve given parametrically as $(t^{m_1},\ldots,t^{m_n})$, with the parameter $t$ varying in an interval $I$. We show, using constructive arguments, that $K$ admits a lifted semidefinite…

Optimization and Control · Mathematics 2023-03-08 Gennadiy Averkov , Claus Scheiderer

In this paper, we investigate the componentwise linearity and the Castelnuovo-Mumford regularity of symbolic powers of polymatroidal ideals. For a polymatroidal ideal $I$, we conjecture that every symbolic power $I^{(k)}$ is componentwise…

Commutative Algebra · Mathematics 2025-02-28 Antonino Ficarra , Somayeh Moradi

We show that there are many (compact) convex semi-algebraic sets in euclidean space that do not have a semidefinite representation. This gives a negative answer to a question by Nemirovski, resp. it shows that the Helton-Nie conjecture is…

Optimization and Control · Mathematics 2017-12-05 Claus Scheiderer

We initiate a study of determinantal representations with symmetry. We show that Grenet's determinantal representation for the permanent is optimal among determinantal representations respecting left multiplication by permutation and…

Algebraic Geometry · Mathematics 2015-08-26 Joseph M. Landsberg , Nicolas Ressayre

Consider a finite system of non-strict real polynomial inequalities and suppose its solution set $S\subseteq\mathbb R^n$ is convex, has nonempty interior and is compact. Suppose that the system satisfies the Archimedean condition, which is…

Algebraic Geometry · Mathematics 2018-03-01 Markus Schweighofer , Tom-Lukas Kriel