加载中…
We introduce regularized bivariate affine -Krawtchouk polynomials and show that they give the first eigenmatrix of a translation association scheme on . The relations are defined by Smith type, and the corresponding eigenvalues are written as character sums over Smith type classes. The proof is based on recurrence relations obtained from the transition numbers describing how Smith types change when one row and one column are added to a matrix. These recurrences identify the character sums with the regularized bivariate affine -Krawtchouk polynomials.

生成讲解博客的中文版本

生成AI智能校验的中文版本