Burnside Problems for Matrix Semigroup Quotients with Applications to Border Complexity
Roland Guttenberg, Nathan Lhote, Mahsa Shirmohammadi, James Worrell
Abstract
The Burnside theorem for matrix semigroups states that a finitely generated matrix semigroup is finite whenever each element has only finitely many distinct powers. We study analogous finiteness questions for quotients of matrix semigroups by congruences, which need not themselves admit faithful finite-dimensional matrix representations. We show three finiteness criteria based on uniform bounds on the quotient images of (rank-)stable subsemigroups and groups in the Zariski closure. Our proofs use exterior algebra and the Ramsey theorem to develop variations of Simon's factorisation forest to matrix semigroups modulo congruences. We also present applications of our results to border complexity. One such involves separating homogeneous algebraic branching programs of fixed width and degree from its Zariski closure.
Create a lesson
Related papers
Hereditary permutations for simple types revisited: A baby case for University Algebra
Thorsten Altenkirch
On the semantics of conditional branching
Fredrik Dahlqvist
Invariance and Expressiveness: Modal Variations
Martin Otto
The Necessity of Acceptance & Rejection in Inferential Reasoning
Khashayar Irani
The Density of Interpolants in Modal Logic: First Results
Roman Kontchakov, Louwe Kuijer, Frank Wolter
Variational Trajectory Flow Matching with a Non-Linear Interpolant
Gurjeet Sangra Singh, Frantzeska Lavda, Alexandros Kalousis