Related papers: Even Order Pascal Tensors are Positive Definite
This paper addresses two fundamental problems posed by Qi regarding the sufficiency of eigenvalues for the classification of symmetric tensors in the two-dimensional setting. For $2\times2\times2$ and $2\times2\times2\times2$ complex…
Set of generalized Pascal matrices whose elements are generalized binomial coefficients is considered as an integral object. The special system of generalized Pascal matrices, based on which we are building fractal generalized Pascal…
Hadamard's determinant inequality was refined and generalized by Zhang and Yang in [Acta Math. Appl. Sinica 20 (1997) 269-274]. Some special cases of the result were rediscovered recently by Rozanski, Witula and Hetmaniok in [Linear Algebra…
In this paper, we study the positive stability of $P$-matrices. We prove that a $P$-matrix A is positively stable if A is a $Q^2$-matrix and there is at least one nested sequence of principal submatrices of A each of which is also a…
Programs that combine I/O and countable probabilistic choice, modulo either bisimilarity or trace equivalence, can be seen as describing a probabilistic strategy. For well-founded programs, we might expect to axiomatize bisimilarity via a…
We have extended the Paley constructions for Hadamard matrices and obtained some series of Hadamard matrices. Especially Paley construction-II is applicable for odd prime power q is congruent to 1(mod 4) however our method is applicable for…
We prove that an elasticity tensor with orthotropic symmetry is extremal if the determinant of its acoustic tensor is an extremal polynomial that is not a perfect square.
It is well known that the dominant eigenvalue of a real essentially nonnegative matrix is a convex function of its diagonal entries. This convexity is of practical importance in population biology, graph theory, demography, analytic…
Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The cone of copositive matrices of a given order and the cone…
The "positive square" of any tensor is presented in a universal and unified manner, valid in Lorentzian manifolds of arbitrary dimension, and independently of any (anti)-symmetry properties of the tensor. For rank-m tensors, the positive…
The T-product for third-order tensors has been used extensively in the literature. In this paper, we first introduce the first-order and second-order T-derivatives for the multi-vector real-valued function with the tensor T-product; and…
A symmetric tensor is a higher order generalization of a symmetric matrix. In this paper, we study various properties of symmetric tensors in relation to a decomposition into a sum of symmetric outer product of vectors. A rank-1 order-k…
We outline an algorithm for construction of functional bases of absolute invariants under the rotation group for sets of rank 2 tensors and vectors in the Euclidean space of arbitrary dimension. We will use our earlier results for symmetric…
A multidimensional nonnegative matrix is called polystochastic if the sum of its entries over each line is equal to $1$. The permanent of a multidimensional matrix is the sum of products of entries over all diagonals. We prove that if $d$…
I show that factorization for hard processes in QCD is also valid when the detected particles are polarized, and that the proof of the theorem determines the operator form for the parton densities. Particular attention is given to the case…
We introduce $\hat{H}$-eigenvalue for $2m$-th order $n$-dimensional complex tensors. Then we determine several checkable inclusion sets for $\hat{H}$-eigenvalues and derive some criterions for the Hermitian positive definiteness…
A third order real tensor is mapped to a special f-diagonal tensor by going through Discrete Fourier Transform (DFT), standard matrix SVD and inverse DFT. We call such an f-diagonal tensor an s-diagonal tensor. An f-diagonal tensor is an…
We introduce a variant of PCPs, that we refer to as rectangular PCPs, wherein proofs are thought of as square matrices, and the random coins used by the verifier can be partitioned into two disjoint sets, one determining the row of each…
We introduce a notion of planar algebra, the simplest example of which is a vector space of tensors, closed under planar contractions. A planar algebra with suitable positivity properties produces a finite index subfactor of a II_1 factor,…
Motivated by a flurry of recent work on efficient tensor decomposition algorithms, we show that the celebrated moment matrix extension algorithm of Brachat, Comon, Mourrain, and Tsigaridas for symmetric tensor canonical polyadic (CP)…