Results 31 to 40 of about 80 (79)
Characteristic numbers and chromatic polynomial of a tensor
We introduce the characteristic numbers and the chromatic polynomial of a linear subspace of matrices, or equivalently of a tensor. Our approach generalizes and unifies the chromatic polynomial of a graph and of a matroid, characteristic numbers of ...
Austin Conner, Mateusz Michalek
doaj +1 more source
A generalization of the Graham-Pollak tree theorem to even-order Steiner distance
Graham and Pollak showed in 1971 that the determinant of a tree’s distance matrix depends only on its number of vertices, and, in particular, it is always nonzero.
Cooper Joshua, Tauscheck Gabrielle
doaj +1 more source
Absolute And Relative Perturbation Bounds For Invariant Subspaces Of Matrices
. Absolute and relative perturbation bounds are derived for angles between invariant subspaces of complex square matrices, in the two-norm and in the Frobenius norm.
Ilse C. F. Ipsen
core
Parsimony and the rank of a flattening matrix. [PDF]
Snyman J, Fox C, Bryant D.
europepmc +1 more source
Tensor Decompositions and Applications
. This survey provides an overview of higher-order tensor decompositions, their applications, and available software. A tensor is a multidimensional or N-way array.
Tamara G. Kolda, Brett W. Bader
core
Low-rank tensor methods for Markov chains with applications to tumor progression models. [PDF]
Georg P +5 more
europepmc +1 more source
Universality of High-Strength Tensors. [PDF]
Bik A +3 more
europepmc +1 more source
A new S-type upper bound for the largest singular value of nonnegative rectangular tensors. [PDF]
Zhao J, Sang C.
europepmc +1 more source
An S-type singular value inclusion set for rectangular tensors. [PDF]
Sang C.
europepmc +1 more source
New iterative criteria for strong [Formula: see text]-tensors and an application. [PDF]
Cui J, Peng G, Lu Q, Huang Z.
europepmc +1 more source

