On the size of finite rational matrix semigroups
Let n be a positive integer and M a set of rational n × n-matrices such that M generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in M whose length is at most 2^{n (2 n + 3)} g(n)^{n+1} ∈ 2^{O(n² log n)}, where g(n) is the maximum order of...
Main Authors: | Bumpus, G, Haase, C, Kiefer, S, Stoienescu, P-I, Tanner, J |
---|---|
Format: | Conference item |
Language: | English |
Published: |
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2020
|
Similar Items
-
Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques
by: Kiefer, S, et al.
Published: (2019) -
Nonnegativity problems for matrix semigroups
by: D'Costa, J, et al.
Published: (2024) -
Finite semigroups imposing tractable constraints
by: Bulatov, A, et al.
Published: (2002) -
On the decidability of membership in matrix-exponential semigroups
by: Ouaknine, J, et al.
Published: (2019) -
On Rationality of Nonnegative Matrix Factorization
by: Chistikov, D, et al.
Published: (2017)