On Nonnegative Integer Matrices and Short Killing Words

TL;DR

This paper proves that for certain nonnegative integer matrices with joint spectral radius at most one, a zero matrix product can be achieved with a bounded-length product, impacting automata theory and code theory.

Contribution

It establishes a bound on the length of matrix products producing zero, leading to a polynomial-length word existence in incomplete codes, supporting a weak form of Restivo's conjecture.

Findings

Bound on product length for zero matrix in matrix set

Existence of polynomial-length words avoiding factors in incomplete codes

Supports a weak version of Restivo's conjecture

Abstract

Let $n$ be a natural number and $\mathcal{M}$ a set of $n \times n$-matrices over the nonnegative integers such that the joint spectral radius of $\mathcal{M}$ is at most one. We show that if the zero matrix $0$ is a product of matrices in $\mathcal{M}$, then there are $M_1, \ldots, M_{n^5} \in \mathcal{M}$ with $M_1 \cdots M_{n^5} = 0$. This result has applications in automata theory and the theory of codes. Specifically, if $X \subset \Sigma^*$ is a finite incomplete code, then there exists a word $w \in \Sigma^*$ of length polynomial in $\sum_{x \in X} |x|$ such that $w$ is not a factor of any word in $X^*$. This proves a weak version of Restivo's conjecture.