Jump to content

Talk:Zassenhaus algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 2a01:cb0c:cd:d800:2dda:86e0:ba91:26c5 (talk) at 15:59, 16 March 2021 (→Bounds on dimensions?: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Zassenhaus_algorithm&oldid=1012477436"