Related papers: Some Extremal Symmetric Inequalities

We give several new lower bounds on size of homogeneous non-commutative circuits. We present an explicit homogeneous bivariate polynomial of degree $d$ which requires homogeneous non-commutative circuit of size $\Omega(d/\log d)$. For an…

We present a new family of sine polynomials that are nonnegative for all $x$ in $[0,\pi]$. We also characterize all nonnegative sine polynomials of degree 3 and all nonnegative cosine polynomials of degree 2. In the latest version, typos in…

Let $\mathfrak{g}$ be a finite-dimensional simple Lie algebra of rank $\ell$ over an algebraically closed field $\Bbbk$ of characteristic zero, and let $(e,h,f)$ be an $\mathfrak{sl}_2$-triple of g. Denote by $\mathfrak{g}^{e}$ the…

We consider the convex geometry of the cone of nonnegative quadratics over Stanley-Reisner varieties. Stanley-Reisner varieties (which are unions of coordinate planes) are amongst the simplest real projective varieties, so this is…

The cone $\mathcal{P}_{n+1,2d}$ ($n,d\in\mathbb{N}$) of all positive semidefinite (PSD) real forms in $n+1$ variables of degree $2d$ contains the subcone $\Sigma_{n+1,2d}$ of those that are representable as finite sums of squares (SOS) of…

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

Let $x_1$ and $x_k$ be the least and the largest zeros of the Laguerre or Jacobi polynomial of degree $k.$ We shall establish sharp inequalities of the form $x_1 <A, x_k >B,$ which are uniform in all the parameters involved. Together with…

A scheme $X\subset \PP^{n+c}$ of codimension $c$ is called {\em standard determinantal} if its homogeneous saturated ideal can be generated by the maximal minors of a homogeneous $t \times (t+c-1)$ matrix and $X$ is said to be {\em good…

The global symmetry algebras of partially-massless (PM) higher-spin (HS) fields in (A)dS$_{d+1}$ are studied. The algebras involving PM generators up to depth $2\,(\ell-1)$ are defined as the maximal symmetries of free conformal scalar…

We consider a polynomial $P\in \mathbb{R}[x_{1},\cdots, x_{d}]$ of degree $ \delta $ that depends non-trivially on each of $x_1,...,x_d$ with $d\geq 2$. For any integer $t$ with $2\leq t\leq d$, any natural number $n \in \mathbb{N}$, and…

In this paper, the concepts of Pareto $H$-eigenvalue and Pareto $Z$-eigenvalue are introduced for studying constrained minimization problem and the necessary and sufficient conditions of such eigenvalues are given. It is proved that a…

Let $A$ be an associative simple (central) superalgebra over ${\mathbb C}$ and $L$ an invariant linear functional on it (trace). Let $a\mapsto a^t$ be an antiautomorphism of $A$ such that $(a^t)^ t=(-1)^{p(a)}a$, where $p(a)$ is the parity…

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

We define eventually symmetric functions to be those power series of bounded degree in infinitely many variables that are invariant under interchanging all the variables with large enough indices. We show how this ring $\tilde{\Lambda}$ is…

Many important problems in extremal combinatorics can be be stated as proving a pure binomial inequality in graph homomorphism numbers, i.e., proving that…

We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against…

Let $\mathrm{R}$ be a real closed field. We prove that for any fixed $d$, the equivariant rational cohomology groups of closed symmetric semi-algebraic subsets of $\mathrm{R}^k$ defined by polynomials of degrees bounded by $d$ vanishes in…

We define a proportionally dense subgraph (PDS) as an induced subgraph of a graph with the property that each vertex in the PDS is adjacent to proportionally as many vertices in the subgraph as in the graph. We prove that the problem of…

We study the problem of maximizing the geometric mean of $d$ low-degree non-negative forms on the real or complex sphere in $n$ variables. We show that this highly non-convex problem is NP-hard even when the forms are quadratic and is…

We initiate a systematic study of nonnegative polynomials $P$ such that $P^k$ is not a sum of squares for any odd $k\geq 1$, calling such $P$ \emph{stubborn}. We develop a new invariant of a real isolated zero of a nonnegative polynomial in…