English
Related papers

Related papers: An effective criterion for multiple positive zeros…

200 papers

We present a necessary and sufficient condition for the separability of multipartite quantum states, this criterion also tells us how to write a multipartite separable state as a convex sum of separable pure states. To work out this…

Quantum Physics · Physics 2009-11-06 Shengjun Wu , Xuemei Chen , Yongde Zhang

We provide fundamental results on positive solutions to parametrized systems of generalized polynomial $\textit{inequalities}$ (with real exponents and positive parameters), including generalized polynomial $\textit{equations}$. In doing…

Algebraic Geometry · Mathematics 2024-10-07 Stefan Müller , Georg Regensburger

A novel approach for solving a multiple judge, multiple criteria decision making (MCDM) problem is proposed. The ranking of alternatives that are evaluated based on multiple criteria is difficult, since the presence of multiple criteria…

Applications · Statistics 2018-07-17 Daniel Kostner

This paper considers the problem of testing whether there exists a non-negative solution to a possibly under-determined system of linear equations with known coefficients. This hypothesis testing problem arises naturally in a number of…

Econometrics · Economics 2021-09-16 Zheng Fang , Andres Santos , Azeem M. Shaikh , Alexander Torgovitsky

Power law systems have been studied extensively due to their wide-ranging applications, particularly in chemistry. In this work, we focus on power law systems that can be decomposed into stoichiometrically independent subsystems. We show…

Dynamical Systems · Mathematics 2024-04-23 Al Jay Lan J. Alamin , Bryan S. Hernandez

The present paper is a continuation of the author's previous works, in which necessary and sufficient local extrema at a stationary point of a polynomial or a power series (and thus of an analytic function) are given. It is known that for…

Optimization and Control · Mathematics 2024-02-29 V. N. Nefedov

We consider the problem of aggregation of incomplete preferences represented by arbitrary binary relations or incomplete paired comparison matrices. For a number of indirect scoring procedures we examine whether or not they satisfy the…

Optimization and Control · Mathematics 2011-10-11 Pavel Chebotarev , Elena Shamis

Covariance selection seeks to estimate a covariance matrix by maximum likelihood while restricting the number of nonzero inverse covariance matrix coefficients. A single penalty parameter usually controls the tradeoff between log likelihood…

Optimization and Control · Mathematics 2010-10-12 Vijay Krishnamurthy , Alexandre d'Aspremont

Single parameter estimation is known to benefit from extreme sensitivity to parameter changes in quantum critical systems. However, the simultaneous estimation of multiple parameters is generally limited due to the incompatibility arising…

Quantum Physics · Physics 2022-03-25 Giovanni Di Fresco , Bernardo Spagnolo , Davide Valenti , Angelo Carollo

Let $M$ be a non-zero binary matrix with distinct rows where the rows are closed under certain logical operators. In this article, we investigate the existence of columns containing an equal or greater number of ones than zeros.…

Combinatorics · Mathematics 2023-09-12 Mohammad Javad Moghaddas Mehr

It is known that the weight (that is, the number of nonzero coefficients) of a univariate polynomial over a field of characteristic zero is larger than the multiplicity of any of its nonzero roots. We extend this result to an appropriate…

Number Theory · Mathematics 2011-11-10 Sandro Mattarei

We consider a method of pairwise variations for smooth optimization problems, which involve polyhedral constraints. It consists in making steps with respect to the difference of two selected extreme points of the feasible set together with…

Optimization and Control · Mathematics 2017-01-12 I. V. Konnov

Techniques of matrix completion aim to impute a large portion of missing entries in a data matrix through a small portion of observed ones. In practice including collaborative filtering, prior information and special structures are usually…

Statistics Theory · Mathematics 2022-03-09 Ji Chen , Xiaodong Li , Zongming Ma

In this article we study the limiting empirical measure of zeros of higher derivatives for sequences of random polynomials. We show that these measures agree with the limiting empirical measure of zeros of corresponding random polynomials.…

Probability · Mathematics 2018-01-30 Sung-Soo Byun , Jaehun Lee , Tulasi Ram Reddy

In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solutions. The bound is polynomial of the number of constraints,…

Optimization and Control · Mathematics 2015-03-17 Tomonari Kitahara , Shinji Mizuno

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…

Signal Processing · Electrical Eng. & Systems 2018-08-07 Luke Pfister , Yoram Bresler

This paper considers the problem of testing whether there exists a solution satisfying certain non-negativity constraints to a linear system of equations. Importantly and in contrast to some prior work, we allow all parameters in the system…

This paper deals with strong structural controllability of linear structured systems in which the system matrices are given by zero/nonzero/arbitrary pattern matrices. Instead of assuming that the nonzero and arbitrary entries of the system…

Optimization and Control · Mathematics 2020-03-05 Jiajia Jia , Harry L. Trentelman , Nikolaos Charalampidis , M. Kanat Camlibel

In variable selection, most existing screening methods focus on marginal effects and ignore dependence between covariates. To improve the performance of selection, we incorporate pairwise effects in covariates for screening and…

Methodology · Statistics 2019-02-12 Siliang Gong , Kai Zhang , Yufeng Liu

We consider two matrix completion problems, in which we are given a matrix with missing entries and the task is to complete the matrix in a way that (1) minimizes the rank, or (2) minimizes the number of distinct rows. We study the…

Data Structures and Algorithms · Computer Science 2018-09-14 Robert Ganian , Iyad Kanj , Sebastian Ordyniak , Stefan Szeider