Related papers: Dimensional Differences between Nonnegative Polyno…
The underlying algebra for a noncommutative geometry is taken to be a matrix algebra, and the set of derivatives the adjoint of a subset of traceless matrices. This is sufficient to calculate the dual 1-forms, and show that the space of…
We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…
We consider multidimensional random walks in pyramidal cones (or multidimensional orthants), which are intersections of a finite number of half-spaces. We explore the connection between the existence of (positive) discrete harmonic…
We argue that dimensionality is not absolute, but that it depends on the scale of resolution, from the Planck to the macro scale.
The Jacobi polynomial has been advocated by many authors as a useful tool to evolve non-singlet structure functions to higher $Q^2$. In this work, it is found that the convergence of the polynomial sum is not absolute, as there is always a…
We link the study of positive quantum maps, block positive operators, and entanglement witnesses with problems related to multivariate polynomials. For instance, we show how indecomposable block positive operators relate to biquadratic…
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
One may associate several frames to a given polytope, such as its collection of vertices, edges, or facet normal vectors. In this note, we use these frames to generate geometric inequalities for the simplex in $\mathbb{R}^d$ and polytopes…
The numerical dimension is a numerical measure of the positivity of a pseudo-effective divisor $L$. There are several proposed definitions of the numerical dimension due to Nakayama (2004) and Boucksom et al. (2004). We prove the equality…
First a formula for the number of zeros of the orthogonal polynomial in the intervals is presented. Then a criteria about the appearance of a zero in a gap is given. Finally a necessary and sufficient condition is derived such that the…
The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov have proved that any real zero polynomial in two variables has a determinantal…
The goal of this article is to prove the Sum of Squares Conjecture for real polynomials $r(z,\bar{z})$ on $\mathbb{C}^3$ with diagonal coefficient matrix. This conjecture describes the possible values for the rank of $r(z,\bar{z}) \|z\|^2$…
In 2010, Marshall settled the strip conjecture, according to which every polynomial in $\mathbb{R}[x,y]$, nonnegative on the strip $[-1,1]\times\mathbb{R}$, is a sum of squares and of squares times $1-x^2$. We consider affine nonsingular…
Given n >= 4 positive real numbers, we prove in this note that they are the face areas of a convex polyhedron if and only if the largest number is not more than the sum of the others.
We prove that the space of smooth rational curves of degree $e$ in a general complete intersection of multidegree $(d_1, ..., d_m)$ in $\PP^n$ is irreducible of the expected dimension if $\sum_{i=1}^m d_i <\frac{2n}{3}$ and $n$ is large…
Computation of polynomial relative invariants is a classical tool in algebra. Relative differential invariants are central for the equivalence problem of geometric structures. We address the fundamental problem of finite generation of their…
We classify the faces of copositive and completely positive cones over a second-order cone and investigate their dimension and exposedness properties. Then we compute two parameters related to chains of faces of both cones. At the end, we…
In this paper, we prove that every SONC polynomial decomposes into a sum of nonnegative circuit polynomials with the same support, which reveals the advantage of SONC decompositions for certifying nonnegativity of sparse polynomials…
We present explicit constructions of centrally symmetric polytopes with many faces: first, we construct a d-dimensional centrally symmetric polytope P with about (1.316)^d vertices such that every pair of non-antipodal vertices of P spans…
Motivated by scheme theory, we introduce strong nonnegativity on real varieties, which has the property that a sum of squares is strongly nonnegative. We show that this algebraic property is equivalent to nonnegativity for nonsingular real…