Minimum-Rank and Mortality Bounds for Finite Real Matrix Monoids
Statement
Let , and let a family of real matrices generate a finite entire product monoid . If , then some word attains rank with length at most
In particular, if contains zero, a zero word has length at most
Over the rationals, these bounds improve Kiefer–Ryzhikov's (2026) bounds for mortality and minimum-rank diameter. The mortality bound also improves Almeida–Steinberg's (2009) universal rational bound for . No finiteness assumption on the generating alphabet is needed. The empty word is allowed and suffices when .
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.