← 研踪 PaperTrailarXiv:2601.01236 · v3
The asymptotic size of finite irreducible semigroups of rational matrices
首次提交 2026-01-04 00:51
版本更新 2026-10-29 03:03
雷达观测 2026-10-30 10:22
摘要
In this paper we investigate the maximum size of finite semigroups of rational $n \times n$ matrices, with the goal of shedding more light on their structure. Such semigroups provide a rich generalisation of transition monoids of unambiguous (and, in particular, deterministic) finite automata. While in general such semigroups can be arbitrarily large in terms of $n$, a classical result of Schützenberger from 1962 implies an upper bound of $2^{O(n^2 \log n)}$ for irreducible semigroups. A semigroup of rational matrices is called irreducible if the only subspaces of $\mathbb{Q}^n$ that are invariant for all matrices in the semigroup are $\mathbb{Q}^n$ and the subspace consisting only of the zero vector. Irreducible matrix semigroups can be viewed as the building blocks of general matrix semigroups, and as such play an important role in mathematics and computer science. From the point of view of automata theory, they can be seen as a generalisation of strongly connected weighted automata. Using a very different technique from that of Schützenberger, we improve the upper bound on the cardinality to $3^{n^2}$. This is the main result of the paper. The bound is in some sense tight, as we show that there exists, for every $n$, a finite irreducible semigroup with $3^{\lfloor n^2/4 \rfloor}$ rational matrices. Our main result also leads to an improvement of a bound, due to Almeida and Steinberg, on the mortality threshold of finite semigroups of rational matrices. The mortality threshold is a number $\ell$ such that if the zero matrix is in the semigroup, then the zero matrix can be written as a product of at most $\ell$ matrices from any subset that generates the semigroup.
作者备注：full version of a STACS'26 paper, invited for a special issue of LMCS, revision based on referee reports
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v3 · 2026-10-29 03:03 · 最新观测版本
The asymptotic size of finite irreducible semigroups of rational matrices
In this paper we investigate the maximum size of finite semigroups of rational $n \times n$ matrices, with the goal of shedding more light on their structure. Such semigroups provide a rich generalisation of transition monoids of unambiguous (and, in particular, deterministic) finite automata. While in general such semigroups can be arbitrarily large in terms of $n$, a classical result of Schützenberger from 1962 implies an upper bound of $2^{O(n^2 \log n)}$ for irreducible semigroups. A semigroup of rational matrices is called irreducible if the only subspaces of $\mathbb{Q}^n$ that are invariant for all matrices in the semigroup are $\mathbb{Q}^n$ and the subspace consisting only of the zero vector. Irreducible matrix semigroups can be viewed as the building blocks of general matrix semigroups, and as such play an important role in mathematics and computer science. From the point of view of automata theory, they can be seen as a generalisation of strongly connected weighted automata. Using a very different technique from that of Schützenberger, we improve the upper bound on the cardinality to $3^{n^2}$. This is the main result of the paper. The bound is in some sense tight, as we show that there exists, for every $n$, a finite irreducible semigroup with $3^{\lfloor n^2/4 \rfloor}$ rational matrices. Our main result also leads to an improvement of a bound, due to Almeida and Steinberg, on the mortality threshold of finite semigroups of rational matrices. The mortality threshold is a number $\ell$ such that if the zero matrix is in the semigroup, then the zero matrix can be written as a product of at most $\ell$ matrices from any subset that generates the semigroup.
查看此版本解读 →查看此版本原文 ↗