English
Related papers

Related papers: Total negativity: Characterizations and single-vec…

200 papers

A matrix is incomplete when some of its entries are missing. A Robinson incomplete symmetric matrix is an incomplete symmetric matrix whose non-missing entries do not decrease along rows and columns when moving toward the diagonal. A…

Discrete Mathematics · Computer Science 2021-01-11 Julio Aracena , Christopher Thraves Caro

The dynamics of linear positive systems map the positive orthant to itself. In other words, it maps a set of vectors with zero sign variations to itself. This raises the following question: what linear systems map the set of vectors with…

Systems and Control · Computer Science 2021-04-28 Eyal Weiss , Michael Margaliot

Uhlmann showed that there exists a positive, unital and trace-preserving map transforming a Hermitian matrix $A$ into another $B$ if and only if the vector of eigenvalues of $A$ majorizes that of $B$. In this work I characterize the…

Functional Analysis · Mathematics 2021-05-20 Julio I. de Vicente

Total positivity of matrices is deeply studied and plays an important role in various branches of mathematics. The main purpose of this paper is to study total positivity of a matrix $M=[M_{n,k}]_{n,k}$ generated by the weighted lattice…

Combinatorics · Mathematics 2023-08-11 Yu-Jie Cui , Bao-Xuan Zhu

Matrix completion algorithms recover a low rank matrix from a small fraction of the entries, each entry contaminated with additive errors. In practice, the singular vectors and singular values of the low rank matrix play a pivotal role for…

Methodology · Statistics 2016-05-03 Juhee Cho , Donggyu Kim , Karl Rohe

A nonnegative matrix $A$ is called primitive if $A^k$ is positive for some integer $k>0$. A generalization of this concept to finite sets of matrices is as follows: a set of matrices $\mathcal M = \{A_1, A_2, \ldots, A_m \}$ is primitive if…

Combinatorics · Mathematics 2015-04-16 Vincent D. Blondel , Raphael M. Jungers , Alex Olshevsky

A symmetric matrix $C$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $C=BB^T$. The CP-completion problem is to study whether we can assign values to the missing entries of a partial matrix (i.e.,…

Optimization and Control · Mathematics 2013-11-21 Anwa Zhou , Jinyan Fan

While the Lorenzian and Riemanian metrics for which all polynomial scalar curvature invariants vanish (the VSI property) are well-studied, less is known about the four-dimensional neutral signature metrics with the VSI property. Recently it…

Differential Geometry · Mathematics 2015-12-09 D. Brooks , N. Musoke , D. McNutt , A. Coley

A version of the singular Yamabe problem in bounded domains yields complete conformal metrics with negative constant scalar curvatures. In this paper, we study whether these metrics have negative Ricci curvatures. Affirmatively, we prove…

Differential Geometry · Mathematics 2020-12-14 Qing Han , Weiming Shen

Many results have been proved for various nuclear norm penalized estimators of the uniform sampling matrix completion problem. However, most of these estimators are not robust: in most of the cases the quadratic loss function and its…

Statistics Theory · Mathematics 2017-07-25 Andreas Elsener , Sara van de Geer

We explain how a slight variant in the use of our recursive algorithm leads to improve the known lower bounds for the absolute trace of a totally positive algebraic integer. We also link the absolute trace of a totally positive algebraic…

Number Theory · Mathematics 2019-07-23 V. Flammang

The dual of a matrix ordered space has a natural matrix ordering that makes the dual space matrix ordered as well. The purpose of these notes is to give a condition that describes when the linear map taking a basis of the n by n matrices to…

Quantum Physics · Physics 2015-06-12 Vern I. Paulsen , Fred Shultz

In this paper we give a first study of perfect copositive $n \times n$ matrices. They can be used to find rational certificates for completely positive matrices. We describe similarities and differences to classical perfect, positive…

Metric Geometry · Mathematics 2024-02-14 Valentin Dannenberg , Achill Schürmann

This work investigates preserving and reversing unimodality and convexity properties for sequences under transformations defined by sign-regular kernels. It is shown that these transformations only preserve these properties if the kernels…

Classical Analysis and ODEs · Mathematics 2025-02-20 Zakaria Derbazi

This is the first of a series of papers where we develop a theory of total positivity for loop groups. In this paper, we completely describe the totally nonnegative part of the polynomial loop group GL_n(\R[t,t^{-1}]), and for the formal…

Combinatorics · Mathematics 2009-12-06 Thomas Lam , Pavlo Pylyavskyy

We consider conformal deformations within a class of incomplete Riemannian metrics which generalize conic orbifold singularities by allowing both warping and any compact manifold (not just quotients of the sphere) to be the "link" of the…

Differential Geometry · Mathematics 2021-07-06 Thalia Jeffres , Julie Rowlett

Let $\mathcal{M} (X)$ denote the space of complete Riemannian metrics with non-positive sectional curvature and with negatively curved ends, on a manifold $X$. We show that $\mathcal{M} (\mathbb{R} \times S ^{1}) $ and $\mathcal{M}…

Differential Geometry · Mathematics 2025-06-26 Yasha Savelyev

In this paper new tests for the independence of two high-dimensional vectors are investigated. We consider the case where the dimension of the vectors increases with the sample size and propose multivariate analysis of variance-type…

Statistics Theory · Mathematics 2023-04-19 Taras Bodnar , Holger Dette , Nestor Parolya

A symmetric tensor is completely positive (CP) if it is a sum of tensor powers of nonnegative vectors. This paper characterizes completely positive binary tensors. We show that a binary tensor is completely positive if and only if it…

Optimization and Control · Mathematics 2018-08-08 Jinyan Fan , Jiawang Nie , Anwa Zhou

We prove that checking if a partial matrix is partial totally positive is co-NP-complete. This contrasts with checking a conventional matrix for total positivity, for which we provide a cubic time algorithm. Checking partial sign regularity…

Computational Complexity · Computer Science 2021-09-21 Daniel Carter , Charles Johnson
‹ Prev 1 3 4 5 6 7 10 Next ›