Talk:Zassenhaus algorithm

Bounds on dimensions?
If I am not mistaken, we have q+l=n+k here; q taking any value from max(n,k) to m; l being no greater than min(n,k) and no smaller than max(0,n+k-m). Could these bounds, if correct, be included? 2A01:CB0C:CD:D800:2DDA:86E0:BA91:26C5 (talk) 15:59, 16 March 2021 (UTC)