Strongly connected multivariate digraphs (Q521369)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Strongly connected multivariate digraphs |
scientific article |
Statements
Strongly connected multivariate digraphs (English)
0 references
10 April 2017
0 references
Summary: Generalizing the idea of viewing a digraph as a model of a linear map, we suggest a multi-variable analogue of a digraph, called a hydra, as a model of a multi-linear map. Walks in digraphs correspond to usual matrix multiplication while walks in hydras correspond to the tensor multiplication introduced by \textit{R. Grone} [J. Algebra 109, 14--24 (1987; Zbl 0653.15011)]. By viewing matrix multiplication as a special case of this tensor multiplication, many concepts on strongly connected digraphs are generalized to corresponding ones for hydras, including strongly connectedness, periods and primitiveness, etc. We explore the structure of all possible periods of strongly connected hydras, which turns out to be related to the existence of certain kind of combinatorial designs. We also provide estimates of largest primitive exponents and largest diameters of relevant hydras. Much existing research on tensors are based on some other definitions of multiplications of tensors and so our work here supplies new perspectives for understanding irreducible and primitive nonnegative tensors.
0 references
de Bruijn form
0 references
cyclic decomposition
0 references
diameter
0 references
Markov operator
0 references
period
0 references
phase space
0 references
primitive exponent
0 references
hydra
0 references
tensor multiplication
0 references
0 references
0 references
0 references