an:06827223
Zbl 1379.05047
Gusev, Vladimir V.; Jungers, RaphaĆ«l M.; Pribavkina, Elena V.
Generalized primitivity of labeled digraphs
EN
Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 -- September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 549-555 (2017).
2017
a
05C20 05C78
primitive sets of matrices; labeled digraphs; Stallings foldings
Summary: We study reachability properties of digraphs whose edges are labeled by elements of a semigroup. We introduce a notion of primitivity for such digraphs, which allows us to unify a variety of recent results on the combinatorial structure of semigroups of nonnegative square matrices. We make use of Stallings foldings, a key procedure in combinatorial group theory, to design an almost-linear time algorithm for checking primitivity in an important case of allowable digraphs improving the previously known algorithm. We also present computational complexity results related to computation of the exponent.
For the entire collection see [Zbl 1375.05004].