A set of nonnegative matrices is called primitive if there exists a product of these matrices that is entrywise positive. Motivated by recent results relating synchronizing automata and primitive sets, we study the length of the shortest product of a primitive set having a column or a row with k positive entries, called its k-rendezvous time (k-RT), in the case of sets of matrices having no zero rows and no zero columns. We prove that the k-RT is at most linear w.r.t. the matrix size n for small k, while the problem is still open for synchronizing automata. We provide two upper bounds on the k-RT: the second is an improvement of the first one, although the latter can be written in closed form. We then report numerical results comparing our upper bounds on the k-RT with heuristic approximation methods.
A set of nonnegative matrices is called primitive if there exists a product of these matrices that is entrywise positive. Motivated by recent results relating synchronizing automata and primitive sets, we study the length of the shortest product of a primitive set having a column or a row with k positive entries (the k-RT). We prove that this value is at most linear w.r.t. the matrix size n for small k, while the problem is still open for synchronizing automata. We then report numerical results comparing our upper bound on the k-RT with heuristic approximation methods.Keywords: Primitive set of matrices, synchronizing automaton, Černý conjecture.Deciding whether a set is primitive is an NP-hard problem if the set contains at least three matrices (while it is still of unknown complexity for sets of two matrices) [3], and so is computing its exponent. For sets of matrices having at least a positive entry in every row and every column (called NZ [13] or allowable matrices [16,18]), the primitivity problem becomes decidable in polynomial-time [28], although computing the exponent remains NP-hard [13]. Methods for approximating the exponent have been proposed [6] as well as upper bounds that depend just on the matrix size; in particular, if we denote with exp N Z (n) the maximal exponent among all the primitive sets of n × n NZ matrices, it is known that exp N Z (n) ≤ (15617n 3 + 7500n 2 + 56250n − 78125)/46875 [3,33]. Better upper bounds have been found for some classes of primitive sets [13,17]. The NZ condition is often met in applications and in particular in the connection with synchronizing automata.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.