User blog comment:Ynought/Extended array hierarchy/@comment-35470197-20190117222337/@comment-35470197-20190119230724

I found another typo. now when \(k\) is bigger than one should be now when \(k\) is bigger than zero.

Then I have several questions:
 * 1) In the description any 0 gets deleted, do you intend the computation \((2,0,1)_{3,1} = (2,1)_{3,1}\) and \((2,1)^{(3,0,1)}_{(4,1)} = (2,1)^{(3,1)}_{4,1}\)? Or Is it applicable only to the suffix in the right bottom?
 * 2) In the computation of \((a,\ldots,d)_{e,\ldots,g} = ((a+d,\ldots),\ldots,(a+d,\ldots))_{e+d,\f+d,ldots,d-1}\), is the second rightmost entry of the suffix \(g+d\)? Or is it \(g'+d\), where \(g'\) is the second rightmost entry of \(e,\ldots,g\).
 * 3) Is \((2,1)_3\) computed in the rules in the previous log post? Or is it computed by a similar rule to the first rule? (i.e. \((2,1)_3 = (2+1,1+1)_{1-1} = (3,2)_0\))
 * 4) Is \((2,1)\) without suffix computed in the rules in the previous log post?
 * 5) Is \((2,1)^2\) without suffix computed as \((2,1)^1_{(2,1)^1}\) by regarding \(\bullet_2\) as the empty array?