English
Related papers

Related papers: Inertia of Loewner Matrices

200 papers

The authors and Fischer recently proved that any hereditary property of two-dimensional matrices (where the row and column order is not ignored) over a finite alphabet is testable with a constant number of queries, by establishing the…

Combinatorics · Mathematics 2017-06-14 Noga Alon , Omri Ben-Eliezer

Entrywise functions preserving the cone of positive semidefinite matrices have been studied by many authors, most notably by Schoenberg [Duke Math. J. 9, 1942] and Rudin [Duke Math. J. 26, 1959]. Following their work, it is well-known that…

Functional Analysis · Mathematics 2024-03-29 Dominique Guillot , Apoorva Khare , Bala Rajaratnam

A multiset $\Lambda=\{\lambda_1,\ldots,\lambda_n\}$ of complex numbers is said to be realizable whenever there exists a nonnegative matrix of order $n$ with spectrum $\Lambda$. One of the broadest criterion that guarantees realizability is…

Spectral Theory · Mathematics 2024-01-17 Alberto Borobia , Roberto Canogar

Let $A, B$ be $n\times n$ positive semidefinite matrices. Bhatia and Kittaneh asked whether it is true $$ \sqrt{\sigma_j(AB)}\le \frac{1}{2} \lambda_j(A+B), \qquad j=1, \ldots, n$$ where $\sigma_j(\cdot)$, $\lambda_j(\cdot)$, are the $j$-th…

Functional Analysis · Mathematics 2016-01-22 Minghua Lin

A real symmetric matrix $A$ is said to be completely positive if it can be written as $BB^t$ for some (not necessarily square) nonnegative matrix $B$. A simple graph $G$ is called a completely positive graph if every doubly nonnegative…

Combinatorics · Mathematics 2020-02-07 Joyentanuj Das , Sachindranath Jayaraman , Sumit Mohanty

In this paper we report on new results relating to a conjecture regarding properties of $n\times n$, $n\leq 6$, positive definite matrices. The conjecture has been proven for $n\leq 4$ using computer-assisted sum of squares (SoS) methods…

Symbolic Computation · Computer Science 2023-09-06 Jeffrey Uhlmann

Using the Perron-Frobenius eigenfunction and eigenvalue, each finite irreducible nonnegative matrix $A$ can be transformed into a probability kernel $P$. This was generalized by David Vere-Jones who gave necessary and sufficient conditions…

Probability · Mathematics 2019-12-02 Jan M. Swart

Theorem 1. Given a number c >= 1, there exists a J-unitary operator \hat{V}, such that: (a) r(\hat{V})= r(\hat{V}^{-1})= c ; (b) S(c^{-1}\hat{V})=S(c^{-1}\hat{V}^{-1}) =S(c^{-1}\hat{V}^{*-1}) = S(c^{-1}\hat{V}^*)={0} (c) there exist maximal…

Dynamical Systems · Mathematics 2013-05-29 Sergej A. Choroszavin

Let $L$ be a linear operator on univariate polynomials of bounded degree taking values in real symmetric matrices, whose moment matrix is positive semidefinite. Assume that $L$ admits a positive matrix-valued representing measure $\mu$. Any…

Functional Analysis · Mathematics 2025-11-25 Aljaž Zalar , Igor Zobovič

We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…

Logic in Computer Science · Computer Science 2026-03-12 Ruiwen Dong , Doron Shafrir

It is well-known that a symmetric matrix with its entries $\pm1$ is not positive definite. But this is not ture for symmetric tensors (hyper-matrix). In this paper, we mainly dicuss the positive (semi-)definiteness criterion of a class of…

Optimization and Control · Mathematics 2025-03-06 Li Ye , Yisheng Song

Deciding the positivity of a sequence defined by a linear recurrence with polynomial coefficients and initial condition is difficult in general. Even in the case of recurrences with constant coefficients, it is known to be decidable only…

Symbolic Computation · Computer Science 2024-12-12 Alaa Ibrahim , Bruno Salvy

In 1907, Oskar Perron showed that a positive square matrix has a unique largest positive eigenvalue with a positive eigenvector. This result was extended to irreducible nonnegative matrices by Geog Frobenius in 1912, and to irreducible…

Numerical Analysis · Mathematics 2015-12-08 Shenglong Hu , Liqun Qi

In this paper we give a matrix version of Handelman's Positivstellensatz [1], representing polynomial matrices which are positive definite on convex, compact polyhedra. Moreover, we propose also a procedure to find such a representation. As…

Algebraic Geometry · Mathematics 2017-08-10 Công-Trình Lê , Thi-Hoa-Binh Du

Consider the equation div$(\varphi^2 \nabla \sigma)=0$ in $\mathbb{R}^N,$ where $\varphi>0$. Berestycki, Caffarelli and Nirenberg proved that if there exists $C>0$ such that $\int_{B_R}(\varphi \sigma)^2 \leq CR^2$ for every $R\geq 1$ then…

Analysis of PDEs · Mathematics 2020-03-23 Salvador Villegas

Let $n$ and $r$ be positive integers. Define the numbers $S_n^{(r)}$ by $S_n^{(r)}=\sum_{k=0}^n\binom{n}{k}^2\binom{2k}{k}(2k+1)^r.$ In this paper we prove some conjectures of Guo and Liu which extend some conjectures of Z.-W. Sun…

Number Theory · Mathematics 2019-01-28 Guo-Shuai Mao

We say that Wiener's property holds for the exponent $p>0$ if we have that whenever a positive definite function $f$ belongs to $L^p(-\epsilon,\epsilon)$ for some $\epsilon>0$, then $f$ necessarily belongs to $L^p(\TT)$, too. This holds…

Classical Analysis and ODEs · Mathematics 2007-11-06 Aline Bonami , Szilárd Gy. Révész

Let $K$ be a proper cone in $\IR^n$, let $A$ be an $n\times n$ real matrix that satisfies $AK\subseteq K$, let $b$ be a given vector of $K$, and let $\lambda$ be a given positive real number. The following two linear equations are…

Rings and Algebras · Mathematics 2007-05-23 Bit-Shun Tam , Hans Schneider

In this paper, we exhibit explicitly a sequence of $2\times2$ matrix valued orthogonal polynomials with respect to a weight $W_{p,n}$, for any pair of real numbers $p$ and $n$ such that $0<p<n$. The entries of these polynomiales are…

Representation Theory · Mathematics 2016-04-22 Inés Pacharoni , Ignacio Zurrián

We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed…

Symbolic Computation · Computer Science 2010-05-05 Manuel Kauers , Veronika Pillwein
‹ Prev 1 8 9 10 Next ›