Results 31 to 40 of about 80 (79)

Characteristic numbers and chromatic polynomial of a tensor

open access: yesForum of Mathematics, Sigma
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

open access: yesSpecial Matrices
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

open access: yes, 1998
. 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]

open access: yesJ Math Biol, 2023
Snyman J, Fox C, Bryant D.
europepmc   +1 more source

Tensor Decompositions and Applications

open access: yes, 2009
. 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]

open access: yesJ Math Biol, 2022
Georg P   +5 more
europepmc   +1 more source

Universality of High-Strength Tensors. [PDF]

open access: yesVietnam J Math, 2022
Bik A   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy