Sets of nonnegative matrices without positive products (Q426069): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
Given a set of irreducible nonnegative matrices of order \(d \times d\), the authors study the problem of existence of a strictly positive product of these matrices, with repititions allowed. The main result of the article is that if the answer is in the negative then (under some rather general assumptions), there is a repetition of the set of standard basis vectors of \(\mathbb{R}^d\) on which all given the given matrices act as permutations. | |||
Property / review text: Given a set of irreducible nonnegative matrices of order \(d \times d\), the authors study the problem of existence of a strictly positive product of these matrices, with repititions allowed. The main result of the article is that if the answer is in the negative then (under some rather general assumptions), there is a repetition of the set of standard basis vectors of \(\mathbb{R}^d\) on which all given the given matrices act as permutations. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: K. C. Sivakumar / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 15B48 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6044822 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
primitivity | |||
Property / zbMATH Keywords: primitivity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
multiplicative semigroup | |||
Property / zbMATH Keywords: multiplicative semigroup / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
partition | |||
Property / zbMATH Keywords: partition / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
permutation | |||
Property / zbMATH Keywords: permutation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scrambling matrix | |||
Property / zbMATH Keywords: scrambling matrix / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
polynomial algorithm | |||
Property / zbMATH Keywords: polynomial algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
irreducible nonnegative matrice | |||
Property / zbMATH Keywords: irreducible nonnegative matrice / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
sstrictly positive product | |||
Property / zbMATH Keywords: sstrictly positive product / rank | |||
Normal rank |
Revision as of 22:47, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sets of nonnegative matrices without positive products |
scientific article |
Statements
Sets of nonnegative matrices without positive products (English)
0 references
11 June 2012
0 references
Given a set of irreducible nonnegative matrices of order \(d \times d\), the authors study the problem of existence of a strictly positive product of these matrices, with repititions allowed. The main result of the article is that if the answer is in the negative then (under some rather general assumptions), there is a repetition of the set of standard basis vectors of \(\mathbb{R}^d\) on which all given the given matrices act as permutations.
0 references
primitivity
0 references
multiplicative semigroup
0 references
partition
0 references
permutation
0 references
scrambling matrix
0 references
polynomial algorithm
0 references
irreducible nonnegative matrice
0 references
sstrictly positive product
0 references