Mahonian numbers modulo 2

mats.granvik(AT)abo.fi

These images don’t show clearly. By clicking on them you can see them in full size and with better quality.

Recurrence 1:
T(1,1)=1, n>1: T(n,1)=0, k>1: T(n,k) = (0 + (sum from i = 1 to k-1 of T(n-i,k-1))) mod 2.

Recurrence 2:
T(1,1)=1, n>1: T(n,1)=0, k>1: T(n,k) = (1 + (sum from i = 1 to k-1 of T(n-i,k-0))) mod 2.

Like Loading...
This entry was posted in Uncategorized. Bookmark the permalink.