English
Related papers

Related papers: Low Dimensional Test Sets for Nonnegativity of Eve…

200 papers

We prove the existence of similar and multi-similar point configurations (or simplexes) in sets of fractional Hausdorff measure in Euclidean space. These results can be viewed as variants, for thin sets, of theorems for sets of positive…

Classical Analysis and ODEs · Mathematics 2021-04-28 Allan Greenleaf , Alex Iosevich , Sevak Mkrtchyan

In this paper, it is proved that (strict) copositivity of a symmetric tensor $\mathcal{A}$ is equivalent to the fact that every principal sub-tensor of $\mathcal{A}$ has no a (non-positive) negative $H^{++}$-eigenvalue. The necessary and…

Optimization and Control · Mathematics 2022-02-09 Yisheng Song , Liqun Qi

In this paper we consider the uniformity testing problem for high-dimensional discrete distributions (multinomials) under sparse alternatives. More precisely, we derive sharp detection thresholds for testing, based on $n$ samples, whether a…

Statistics Theory · Mathematics 2022-02-17 Bhaswar B. Bhattacharya , Rajarshi Mukherjee

Our main theoretical result is that, if a simple polytope has a pair of complementary vertices (i.e., two vertices with no facets in common), then it has at least two such pairs, which can be chosen to be disjoint. Using this result, we…

Combinatorics · Mathematics 2012-08-28 Benjamin A. Burton

It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global…

Optimization and Control · Mathematics 2019-03-14 Amir Ali Ahmadi , Georgina Hall

We obtain computational hardness results for f-vectors of polytopes by exhibiting reductions of the problems DIVISOR and SEMI-PRIME TESTABILITY to problems on f-vectors of polytopes. Further, we show that the corresponding problems for…

Combinatorics · Mathematics 2021-09-20 Eran Nevo

A real symmetric matrix (resp., tensor) is said to be copositive if the associated quadratic (resp., homogeneous) form is greater than or equal to zero over the nonnegative orthant. The problem of detecting their copositivity is NP-hard.…

Optimization and Control · Mathematics 2017-11-13 Jiawang Nie , Zi Yang , Xinzhen Zhang

We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…

Algebraic Geometry · Mathematics 2017-05-01 Saugata Basu , Cordian Riener

We show that the spectral norm of a $d$-mode real or complex symmetric tensor in $n$ variables can be computed by finding the fixed points of the corresponding polynomial map. For a generic complex symmetric tensor the number of fixed…

Optimization and Control · Mathematics 2020-01-17 Shmuel Friedland , Li Wang

We present a unified approach to goodness-of-fit testing in $\mathbb{R}^d$ and on lower-dimensional manifolds embedded in $\mathbb{R}^d$ based on sums of powers of weighted volumes of $k$-th nearest neighbor spheres. We prove asymptotic…

Methodology · Statistics 2016-12-21 Bruno Ebner , Norbert Henze , Joseph E. Yukich

By a result of Helton and McCullough, open bounded convex free semialgebraic sets are exactly open (matricial) solution sets D_L of a linear matrix inequality (LMI) L(X)>0. This paper gives a precise algebraic certificate for a polynomial…

Functional Analysis · Mathematics 2018-04-27 J. William Helton , Igor Klep , Christopher S. Nelson

This paper presents various worst-case results on the positive semidefinite (psd) rank of a nonnegative matrix, primarily in the context of polytopes. We prove that the psd rank of a generic n-dimensional polytope with v vertices is at…

Optimization and Control · Mathematics 2014-06-03 João Gouveia , Richard Z. Robinson , Rekha R. Thomas

In this paper we explore inequalities between symmetric homogeneous polynomials of degree four of three real variables and three nonnegative real variables. The main theorems describe the cases in which the smallest possible coefficient is…

Classical Analysis and ODEs · Mathematics 2016-04-05 Mariyan Milev , Nedecho Milev

Let $f:\mathbb{K}^n\rightarrow\mathbb{K}^m$ be a generically finite polynomial map of degree $d$ between affine spaces. In arXiv:1411.5011 we proved that if $\mathbb{K}$ is the field of complex or real numbers, then the set $S_f$ of points…

Algebraic Geometry · Mathematics 2021-04-06 Zbigniew Jelonek , Michał Lasoń

The problem of testing low-degree polynomials has received significant attention over the years due to its importance in theoretical computer science, and in particular in complexity theory. The problem is specified by three parameters:…

Computational Complexity · Computer Science 2022-02-18 Tali Kaufman , Dor Minzer

For a 4th order 3-dimensional symmetric tensor with its some entries $1$ or $-1$, we show the analytic sufficient and necessary conditions of its positive definiteness. By applying these conclusions, several strict inequalities is bulit for…

Classical Analysis and ODEs · Mathematics 2024-08-27 Yisheng Song

We develop a representation theoretic technique for detecting closed orbits that is applicable in all characteristics. Our technique is based on Kempf's theory of optimal subgroups and we make some improvements and simplify the theory from…

Representation Theory · Mathematics 2021-07-15 Harm Derksen , Visu Makam

We propose and discuss how basic notions (quadratic modules, positive elements, semialgebraic sets, Archimedean orderings) and results (Positivstellensaetze) from real algebraic geometry can be generalized to noncommutative $*$-algebras. A…

Operator Algebras · Mathematics 2007-09-25 Konrad Schmuedgen

A set of $k$ orthonormal bases of $\mathbb C^d$ is called mutually unbiased if $|\langle e,f\rangle |^2 = 1/d$ whenever $e$ and $f$ are basis vectors in distinct bases. A natural question is for which pairs $(d,k)$ there exist~$k$ mutually…

Optimization and Control · Mathematics 2024-05-01 Sander Gribling , Sven Polak

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