Related papers: Computing the Elementary Symmetric Polynomials in …

An element [\Phi] of the Grassmannian of n-dimensional subspaces of the Hardy space H^2, extended over the field C(x_1,..., x_n), may be associated to any polynomial basis {\phi} for C(x). The Pl\"ucker coordinates…

The extremal values of multivariate trigonometric polynomials are of interest in fields ranging from control theory to filter design, but finding the extremal values of such a polynomial is generally NP-Hard. In this paper, we develop…

We study the symmetric polynomial $\prod_{\alpha\in A_{n,d}}\bigl(1+\alpha_1 x_1+\cdots+\alpha_n x_n\bigr)$ where $A_{n,d}:=\{\alpha\in\mathbb{Z}_{\ge 0}^n:|\alpha|=d\}$, which is the total Chern class of $\mathrm{Sym}^d(\mathbb{C}^n)$,…

We bound the tensor ranks of elementary symmetric polynomials, and we give explicit decompositions into powers of linear forms. The bound is attained when the degree is odd.

Valiant's conjecture asserts that the circuit complexity classes VP and VNP are distinct, meaning that the permanent does not admit polynomial-size algebraic circuits. As it is the case in many branches of complexity theory, the…

The motivation of this work stems from the numerical approximation of bounded functions by polynomials satisfying the same bounds. The present contribution makes use of the recent algebraic characterization found in [B. Despr\'es, Numer.…

Let $N_m = x^m + y^m$ be the $m$-th Newton polynomial in two variables, for $m \geq 1$. Dvornicich and Zannier proved that in characteristic zero three Newton polynomials $N_a, N_b, N_c$ are always sufficient to generate the symmetric field…

For a bivariate $P(x,y) \in \mathbb{R}[x,y]\setminus (\mathbb{R}[x] \cup \mathbb{R}[y])$, our first result shows that for all finite $A \subseteq \mathbb{R}$, $|P(A,A)|\geq \alpha|A|^{5/4}$ with $\alpha =\alpha(\mathrm{deg} P) \in…

We present a short, purely algebraic proof of the Symmetric Bessmertny\u{i} Realization Theorem in the characteristic $2$ case recently proved in [EOW26]. Symmetric Bessmertny\u{i} realizations are Schur complements of affine linear…

The abbreviations LMI and SOS stand for `linear matrix inequality' and `sum of squares', respectively. The cone $\Sigma_{n,2d}$ of SOS polynomials in $n$ variables of degree at most $2d$ is known to have a semidefinite extended formulation…

We consider the set S(n,0) of monic complex polynomials of degree $n\ge 2$ having all their zeros in the closed unit disk and vanishing at 0. For $p\in S(n,0)$ we let $|p|_{0}$ denote the distance from the origin to the zero set of $p'$. We…

In this paper, we discuss characteristic polynomials in (Clifford) geometric algebras ${\mathcal {G}}_{p,q}$ of vector space of dimension $n=p+q$. We present basis-free formulas for all characteristic polynomial coefficients in the cases…

Circuits and extended formulations are classical concepts in linear programming theory. The circuits of a polyhedron are the elementary difference vectors between feasible points and include all edge directions. We study the connection…

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…

Recently, Okounkov, Lazarsfeld and Mustata, and Kaveh and Khovanskii have shown that the growth of a graded linear series on a projective variety over an algebraically closed field is asymptotic to a polynomial. We give a complete…

Let $M_d$ be the moduli space of one-dimensional complex polynomial dynamical systems. The escape rates of the critical points determine a critical heights map $G: M_d \to \mathbb{R}^{d-1}$. For generic values of $G$, each connected…

We investigate border ranks of twisted powers of polynomials and smoothability of symmetric powers of algebras. We prove that the latter are smoothable. For the former, we obtain upper bounds for the border rank in general and prove that…

Polynomial processes are defined by the property that conditional expectations of polynomial functions of the process are again polynomials of the same or lower degree. Many fundamental stochastic processes, including affine processes, are…

The central open question of algebraic complexity is whether VP is unequal to VNP, which is saying that the permanent cannot be represented by families of polynomial-size algebraic circuits. For symmetric algebraic circuits, this has been…

We consider the orthogonal polynomials $\{P_{n}(z)\}$ with respect to the measure $|z-a|^{2N c} {\rm e}^{-N |z|^2} \,{\rm d} A(z)$ over the whole complex plane. We obtain the strong asymptotic of the orthogonal polynomials in the complex…