English
Related papers

Related papers: A random copositive matrix is completely positive …

200 papers

We study the cone of completely positive (cp) matrices for the first interesting case $n = 5$. This is a semialgebraic set, which means that the polynomial equalities and inequlities that define its boundary can be derived. We characterize…

Optimization and Control · Mathematics 2021-09-02 Max Pfeffer , Jose Alejandro Samper

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

Optimization and Control · Mathematics 2016-10-27 Sander Gribling , David de Laat , Monique Laurent

Let R=(r_1, ..., r_m) and C=(c_1, ..., c_n) be positive integer vectors such that r_1 +... + r_m=c_1 +... + c_n. We consider the set Sigma(R, C) of non-negative mxn integer matrices (contingency tables) with row sums R and column sums C as…

Combinatorics · Mathematics 2009-11-25 Alexander Barvinok

We focus on copositive and completely positive cones over symmetric cones of rank at least $5$, and in particular investigate whether these cones are spectrahedral shadows. We extend known results for nonnegative orthants of dimension at…

Optimization and Control · Mathematics 2026-03-02 Mitsuhiro Nishijima

A multidimensional nonnegative matrix is called polystochastic if the sum of entries in each of its lines equals $1$. The set of all polystochastic matrices of order $n$ and dimension $d$ is a convex polytope $\Omega_n^d$ known as the…

Combinatorics · Mathematics 2025-02-14 Anna A. Taranenko

In this paper, we consider copositive cones over symmetric cones and show that they are never facially exposed when the underlying cone has dimension at least 2. We do so by explicitly exhibiting a non-exposed extreme ray. Our result…

Optimization and Control · Mathematics 2024-12-05 Mitsuhiro Nishijima , Bruno F. Lourenço

Two retractions $M$ and $N$ on convex cones $\bf M$ and respectively $\bf N$ of a real vector space $X$ are called mutually polar if $M+N=I$ and $MN=NM=0.$ In this note it is shown, that if the cones $\bf M$ and $\bf N$ are generating,…

Functional Analysis · Mathematics 2023-04-11 A. B. Németh

A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. We consider the completely positive tensor decomposition problem. A semidefinite algorithm is presented for checking whether a…

Optimization and Control · Mathematics 2014-11-20 Jinyan Fan , Anwa Zhou

A combinatorial structure, $\mathcal{F}$, with counting sequence $\{a_n\}_{n\ge 0}$ and ordinary generating function $G_\mathcal{F}=\sum_{n\ge0} a_n x^n$, is positive algebraic if $G_\mathcal{F}$ satisfies a polynomial equation…

Combinatorics · Mathematics 2019-09-23 R. Brak , N. Mahony

A linear map $\Phi :\mathbb{M}_n \to \mathbb{M}_k$ is called completely copositive if the resulting matrix $[\Phi (A_{j,i})]_{i,j=1}^m$ is positive semidefinite for any integer $m$ and positive semidefinite matrix $[A_{i,j}]_{i,j=1}^m$. In…

Functional Analysis · Mathematics 2020-01-09 Yongtao Li , Yang Huang , Lihua Feng , Weijun Liu

In this paper, we present an algorithm of simple exponential growth called COPOMATRIX for determining the copositivity of a real symmetric matrix. The core of this algorithm is a decomposition theorem, which is used to deal with simplicial…

Rings and Algebras · Mathematics 2011-08-16 Jia Xu , Yong Yao

An oriented graph is said positively multiplicative when its adjacency matrix $A$ embeds in a matrix algebra admitting a basis $\mathsf{B}$ with nonnegative structure constants in which the matrix of the multiplication by $A$ coincides with…

Combinatorics · Mathematics 2025-02-25 Jérémie Guilhot , Cédric Lecouvey , Pierre Tarrago

We define ''convergence'' for noncommutative power series and construct two topologies on the algebra of power series, convergent with respect to a positive radius. We indicate all finite dimensional continuous representations of this…

Quantum Algebra · Mathematics 2007-05-23 Frank Schuhmacher

Let $A=[a_{n,k}]_{n,k\ge 0}$ be an infinite lower triangular matrix defined by the recurrence $$a_{0,0}=1,\quad a_{n+1,k}=r_{k}a_{n,k-1}+s_{k}a_{n,k}+t_{k+1}a_{n,k+1},$$ where $a_{n,k}=0$ unless $n\ge k\ge 0$ and $r_k,s_k,t_k$ are all…

Combinatorics · Mathematics 2016-01-22 Xi Chen , Huyile Liang , Yi Wang

As was detailed by Loewy and London in [Linear and Multilinear Algebra 6 (1978/79), no.~1, 83--90], the cone of polynomials that preserve the nonnegativity of matrices may play an important role in the solution to the nonnegative inverse…

Rings and Algebras · Mathematics 2024-08-12 Jared J. L. Brannan , Benjamin J. Clark , Garrett J. Kepler

We study metric properties of the cone of homogeneous non-negative multivariate polynomials and the cone of sums of powers of linear forms, and the relationship between the two cones. We compute the maximum volume ellipsoid of the natural…

Combinatorics · Mathematics 2007-05-23 Grigoriy Blekherman

Let $\mathbb{P}_{\kappa}(n)$ be the probability that $n$ points $z_1,\ldots,z_n$ picked uniformly and independently in $\mathfrak{C}_\kappa$, a regular $\kappa$-gon with area $1$, are in convex position, that is, form the vertex set of a…

Probability · Mathematics 2024-10-16 Ludovic Morin

In this paper, we shall discuss topics in geometry of numbers in the positive characteristic setting, such as covering radii. We find a closed form for covering radii with respect to convex bodies, which will lead to a proof of the positive…

Number Theory · Mathematics 2024-10-16 Noy Soffer Aranov

We study three families of polyhedral cones whose sections are regular simplices, cubes, and crosspolytopes. We compute solid angles and conic intrinsic volumes of these cones. We show that several quantities appearing in stochastic…

Probability · Mathematics 2021-01-01 Zakhar Kabluchko , Hauke Seidel

A multidimensional nonnegative matrix is called polystochastic if the sum of its entries over each line is equal to $1$. The permanent of a multidimensional matrix is the sum of products of entries over all diagonals. We prove that if $d$…

Combinatorics · Mathematics 2025-12-01 A. L. Perezhogin , V. N. Potapov , A. A. Taranenko , S. Yu. Vladimirov