English
Related papers

Related papers: $K-$Lorentzian Polynomials, Semipositive Cones, an…

200 papers

Conic optimization has recently emerged as a powerful tool for designing tractable and guaranteed algorithms for non-convex polynomial optimization problems. On the one hand, tractability is crucial for efficiently solving large-scale…

We explore the applications of Lorentzian polynomials to the fields of algebraic geometry, analytic geometry and convex geometry. In particular, we establish a series of intersection theoretic inequalities, which we call rKT property, with…

Algebraic Geometry · Mathematics 2024-05-24 Jiajun Hu , Jian Xiao

For two convex discs $K$ and $L$, we say that $K$ is $L$-convex if it is equal to the intersection of all translates of $L$ that contain $K$. In $L$-convexity the set $L$ plays a similar role as closed half-spaces do in the classical notion…

Metric Geometry · Mathematics 2026-04-09 Ferenc Fodor , Dániel I. Papvári , Viktor Vígh

The q-Catalan numbers studied by Carlitz and Riordan are polynomials in q with nonnegative coefficients. They evaluate, at q=1, to the Catalan numbers: 1, 1, 2, 5, 14,..., a log-convex sequence. We use a combinatorial interpretation of…

Combinatorics · Mathematics 2007-05-23 L. M. Butler , W. P. Flanigan

A triangle $\{a(n,k)\}_{0\le k\le n}$ of nonnegative numbers is LC-positive if for each $r$, the sequence of polynomials $\sum_{k=r}^{n}a(n,k)q^k$ is $q$-log-concave. It is double LC-positive if both triangles $\{a(n,k)\}$ and…

Combinatorics · Mathematics 2007-05-23 Yi Wang , Yeong-Nan Yeh

We give explicit polynomial-sized (in $n$ and $k$) semidefinite representations of the hyperbolicity cones associated with the elementary symmetric polynomials of degree $k$ in $n$ variables. These convex cones form a family of…

Optimization and Control · Mathematics 2016-11-17 James Saunderson , Pablo A. Parrilo

Anari, Gharan, and Vinzant proved (complete) log-concavity of the basis generating functions for all matroids. From the viewpoint of combinatorial Hodge theory, it is natural to ask whether these functions are "strictly" log-concave for…

Commutative Algebra · Mathematics 2019-05-31 Takahiro Nagaoka , Akiko Yazawa

We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…

Optimization and Control · Mathematics 2013-07-05 Vaithilingam Jeyakumar , Jean-Bernard Lasserre , G. Li

In 2022, Huh-Matherne-M\'esz\'aros-St. Dizier showed that normalized Schur polynomials are Lorentzian, thereby yielding their continuous (resp. discrete) log-concavity on the positive orthant (resp. on their support, in type $A$ root…

Representation Theory · Mathematics 2025-10-22 Apoorva Khare , Jacob P. Matherne , Avery St. Dizier

We introduce and study the notion of conic stability of multivariate complex polynomials in $\mathbb{C}[z_1,\ldots, z_n]$, which naturally generalizes the stability of multivariate polynomials. In particular, we generalize Borcea's and…

Complex Variables · Mathematics 2018-05-07 Thorsten Jörgens , Thorsten Theobald

Mason's Conjecture asserts that for an $m$--element rank $r$ matroid $\M$ the sequence $(I_k/\binom{m}{k}: 0\leq k\leq r)$ is logarithmically concave, in which $I_k$ is the number of independent $k$--sets of $\M$. A related conjecture in…

Combinatorics · Mathematics 2007-05-23 David G. Wagner

In this paper we prove that the space of differential invariants for curves with arc-length parameter in the light cone of Lorentzian $\mathbb{R}^4$, invariants under the centro-affine action of the Lorentzian group, is Poisson equivalent…

Differential Geometry · Mathematics 2017-11-02 Theresa C. Anderson , Gloria Marí Beffa

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Commutative Algebra · Mathematics 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

We provide a specific representation of convex polynomials nonnegative on a convex (not necessarily compact) basic closed semi-algebraic subset K of Rn. Namely, they belong to a specific subset of the quadratic module generated by the…

Algebraic Geometry · Mathematics 2008-07-09 Jean B. Lasserre

Let $K$ be a convex body in $\mathbb{R}^n$ and $f : \partial K \rightarrow \mathbb{R}_+$ a continuous, strictly positive function with $\int\limits_{\partial K} f(x) d \mu_{\partial K}(x) = 1$. We give an upper bound for the approximation…

Metric Geometry · Mathematics 2017-07-07 Julian Grote , Elisabeth M. Werner

The coefficients of the Kazhdan-Lusztig polynomials $P_{v,w}(q)$ are nonnegative integers that are upper semicontinuous on Bruhat order. Conjecturally, the same properties hold for $h$-polynomials $H_{v,w}(q)$ of local rings of Schubert…

Combinatorics · Mathematics 2012-02-21 Li Li , Alexander Yong

The classical as well as non commutative Korovkin-type theorems deal with convergence of positive linear maps with respect to modes of convergences such as norm convergence and weak operator convergence. In this article, Korovkin-type…

Functional Analysis · Mathematics 2012-04-10 Kiran Kumar , M. N. N. Namboodiri , Stefano Serra-Capizzano

It is well-known that measures whose density is the form $e^{-V}$ where $V$ is a uniformly convex potential on $\RR^n$ attain strong concentration properties. In search of a notion of log-concavity on the discrete hypercube, we consider…

Probability · Mathematics 2020-07-28 Ronen Eldan , Omer Shamir

We introduce families of two-parameter multivariate polynomials indexed by pairs of partitions $v,w$ -- biaxial double $(\beta,q)$-Grothendieck polynomials -- which specialize at $q=0$ and $v=1$ to double $\beta$-Grothendieck polynomials…

Combinatorics · Mathematics 2021-09-13 Ben Brubaker , Claire Frechette , Andrew Hardt , Emily Tibor , Katherine Weber

One question that we investigate in this paper is, how can we build log-concave polynomials using sparse polynomials as building blocks? More precisely, let $f = \sum\_{i = 0}^d a\_i X^i \in \mathbb{R}^+[X]$ be a polynomial satisfying the…

Computational Complexity · Computer Science 2017-01-17 Ignacio García-Marco , Pascal Koiran , Sébastien Tavenas