ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n>0n>0, and let a family of real n×nn\times n matrices generate a finite entire product monoid SS. If s=min⁡X∈Srank⁡Xs=\min_{X\in S}\operatorname{rank}X, then some word attains rank ss with length at most

B(n,s)=n2n−s−n(n+1)2+s(s−1)2.B(n,s)=n2^{n-s}-\frac{n(n+1)}2+\frac{s(s-1)}2.

In particular, if SS contains zero, a zero word has length at most

B(n,0)=n2n−n(n+1)2=Θ(n2n).B(n,0)=n2^n-\frac{n(n+1)}2=\Theta(n2^n).

Over the rationals, these bounds improve Kiefer–Ryzhikov's (2026) 3n23^{n^2} bounds for mortality and minimum-rank diameter. The mortality bound also improves Almeida–Steinberg's (2009) universal rational bound (2n−1)n2−1(2n-1)^{n^2}-1 for n>1n>1. No finiteness assumption on the generating alphabet is needed. The empty word is allowed and suffices when s=ns=n.

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.