A combinatorial property for semigroups of matrices.
A semigroup \(S\) has the weak permutation property if there exists some integer \(k\geq 2\) such that for any sequence \(s_1,s_2,\dots,s_k\) of elements of \(S\), there are distinct permutations \(\sigma\) and \(\tau\) of the set \(\{1,2,\dots,k\}\) such that \(s_{\sigma(1)}s_{\sigma(2)}\cdots s_{\sigma(k)}=s_{\tau(1)}s_{\tau(2)}\cdots s_{\tau(k)}\). In this article, the authors study the semigroups of matrices over a commutative semiring, proving that a semigroup of matrices \(S\) over a tropical semiring has the weak permutation property and that if \(S\) is finitely generated then the growth function of \(S\) is polynomially upper bounded. They also find an application of this result to the Burnside problem for semigroups.
- Identities in upper triangular tropical matrix semigroups and the bicyclic monoid
- The tropical matrix groups with symmetric idempotents
- Green's \(\mathcal J\)-order and the rank of tropical matrices.
- Tropical matrices and group representations
- Representations and identities of plactic-like monoids
- Permutability of matrices over bipotent semirings
- scientific article; zbMATH DE number 929642 (Why is no real title available?)
- scientific article; zbMATH DE number 6123189 (Why is no real title available?)
- scientific article; zbMATH DE number 5053676 (Why is no real title available?)
- Multiplicative structure of \(2\times 2\) tropical matrices
- Regular D-classes of the semigroup of n x n tropical matrices
- Tropical linear representations of the Chinese monoid
- Tropical matrix groups and Boolean matrix groups
- Generating sets, presentations, and growth of tropical matrix monoids
This page was built for publication: A combinatorial property for semigroups of matrices.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1402903)
