Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Fundamenta Informaticae

1 2018

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Preserving λ-scrambling Matrices

Guterman A. E., Maksaev A. M.

Fundamenta Informaticae

2018

Vol. 162, nr 2/3

119--141

The notion of scrambling index was firstly introduced by Akelbek and Kirkland in 2009. For a primitive digraph D, it is defined as the smallest positive integer k such that for every pair of vertices u and v of D there exist two directed paths of lengths k to a common vertex w. This notion turned out to be useful for several applications, e. g., to estimate eigenvalues of non-negative primitive stochastic matrices. In 2010 Huang and Liu with the background of a memoryless communication system generalized this notion to λ-tuples of vertices and named it λ-th upper scrambling index. These notions can be reformulated in terms of matrix theory. A standard way to generate matrices with the given λ-th upper scrambling index is to apply certain matrix transformations that preserve this index to the existing examples of matrices with known λ-th upper scrambling index. In this paper we completely characterize bijective linear maps preserving λ-th upper scrambling index 1 or 0.