English
Related papers

Related papers: Even Order Pascal Tensors are Positive Definite

200 papers

Entrywise powers of symmetric matrices preserving positivity, monotonicity or convexity with respect to the Loewner ordering arise in various applications, and have received much attention recently in the literature. Following FitzGerald…

Functional Analysis · Mathematics 2015-02-19 Dominique Guillot , Apoorva Khare , Bala Rajaratnam

We compute to all loop orders correlation function of four heavy BPS operators in $\mathcal{N}$= 4 SYM with special polarisations considered recently by Frank Coronado. Our main result is an expression for the octagon form factor as…

High Energy Physics - Theory · Physics 2019-06-19 Ivan Kostov , Valentina B. Petkova , Didina Serban

A $n$-by-$n$ matrix is called totally positive ($TP$) if all its minors are positive and $TP_k$ if all of its $k$-by-$k$ submatrices are $TP$. For an arbitrary totally positive matrix or $TP_k$ matrix, we investigate if the $r$th compound…

Combinatorics · Mathematics 2024-05-13 Shaun Fallat , Himanshu Gupta , Charles R. Johnson

In 2020, Cossu and Zanardo raised a conjecture on the idempotent factorization on singular matrices in the form $\begin{pmatrix} p&z\\ \bar{z}&\sfrac{\lVert z\rVert}{p} \end{pmatrix},$ where $p$ is a prime integer which is irreducible but…

Rings and Algebras · Mathematics 2023-06-02 Peeraphat Gatephan , Kijti Rodtes

In this paper we provide an identity between determinant and generalized matrix function. Also, a criterion of positive semi-definite matrices affirming the permanent dominant conjecture is given. As a consequence, infinitely many infinite…

Rings and Algebras · Mathematics 2023-11-01 Kijti Rodtes

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

One of the central problems in the theory of linear complementarity problems (LCPs) is to study the class of $Q$-matrices since it characterizes the solvability of LCP. Recently, the concept of $Q$-matrix has been extended to the case of…

Optimization and Control · Mathematics 2015-09-11 Zheng-Hai Huang , Yun-Yang Suo , Jie Wang

Matrices of rank at most k are defined by the vanishing of polynomials of degree k + 1 in their entries (namely, their (k + 1)-times-(k + 1)-subdeterminants), regardless of the size of the matrix. We prove a qualitative analogue of this…

Algebraic Geometry · Mathematics 2015-01-14 Jan Draisma , Jochen Kuttler

Biquadratic tensors play a central role in many areas of science. Examples include elasticity tensor and Eshelby tensor in solid mechanics, and Riemann curvature tensor in relativity theory. The singular values and spectral norm of a…

Numerical Analysis · Mathematics 2019-10-08 Liqun Qi , Shenglong Hu , Xinzhen Zhang

We present a framework to decompose real multivariate polynomials while preserving invariance and positivity. This framework has been recently introduced for tensor decompositions, in particular for quantum many-body systems. Here we…

Mathematical Physics · Physics 2024-08-08 Gemma De las Cuevas , Andreas Klingler , Tim Netzer

Conjugate partial-symmetric (CPS) tensors are the high-order generalization of Hermitian matrices. As the role played by Hermitian matrices in matrix theory and quadratic optimization, CPS tensors have shown growing interest recently in…

Optimization and Control · Mathematics 2018-02-27 Taoran Fu , Bo Jiang , Zhening Li

Higher-order processes with parameterization are capable of abstraction and application (migrated from the lambda-calculus), and thus are computationally more expressive. For the minimal higher-order concurrency, it is well-known that the…

Logic in Computer Science · Computer Science 2021-08-25 Xian Xu , Wenbo Zhang

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

In this paper we study the set of tensors that admit a special type of decomposition called an orthogonal tensor train decomposition. Finding equations defining varieties of low-rank tensors is generally a hard problem, however, the set of…

Algebraic Geometry · Mathematics 2021-11-01 Pardis Semnani , Elina Robeva

Banded bounded matrices, which represent non normal operators, of oscillatory type that admit a positive bidiagonal factorization are considered. To motivate the relevance of the oscillatory character the Favard theorem for Jacobi matrices…

Classical Analysis and ODEs · Mathematics 2023-07-18 Amílcar Branquinho , Ana Foulquié-Moreno , Manuel Mañas

We give a spectral algorithm for decomposing overcomplete order-4 tensors, so long as their components satisfy an algebraic non-degeneracy condition that holds for nearly all (all but an algebraic set of measure $0$) tensors over…

Machine Learning · Computer Science 2022-03-08 Samuel B. Hopkins , Tselil Schramm , Jonathan Shi

The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…

Discrete Mathematics · Computer Science 2016-06-24 Dmitry N. Kozlov

This paper considers an idempotent and symmetrical algebraic structure as well as some closely related concept. A special notion of determinant is introduced and a Cramer formula is derived for a class of limit systems derived from the…

Combinatorics · Mathematics 2020-10-09 Walter Briec

We prove the nonsingularity of a class of integer matrices V(n,d), namely power-product matrix, for positive integers n and d. Some technical proofs are mainly based on linear algebra and enumerative combinatorics, particularly the…

Combinatorics · Mathematics 2021-04-13 Yi-Shuai Niu , Hu Zhang

A tensor $T$, in a given tensor space, is said to be $h$-identifiable if it admits a unique decomposition as a sum of $h$ rank one tensors. A criterion for $h$-identifiability is called effective if it is satisfied in a dense, open subset…

Algebraic Geometry · Mathematics 2017-03-09 Alex Massarenti , Massimiliano Mella , Giovanni Staglianò