Results 41 to 50 of about 835 (69)
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
Croot, Lev and Pach used a new polynomial technique to give a new exponential upper bound for the size of three-term progression-free subsets in the groups $(\mathbb Z _4)^n$.
Hegedüs, Gábor
core
Parsimony and the rank of a flattening matrix. [PDF]
Snyman J, Fox C, Bryant D.
europepmc +1 more source
Low-rank tensor methods for Markov chains with applications to tumor progression models. [PDF]
Georg P +5 more
europepmc +1 more source
Hankel Tensors: Associated Hankel Matrices and Vandermonde Decomposition
Hankel tensors arise from applications such as signal processing. In this paper, we make an initial study on Hankel tensors. For each Hankel tensor, we associate it with a Hankel matrix and a higher order two-dimensional symmetric tensor, which we call ...
Qi, Liqun
core
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
An upper bound for the Z-spectral radius of adjacency tensors. [PDF]
Wu ZY, He J, Liu YM, Tian JK.
europepmc +1 more source

