3 problems

Let $H(n,j)$ be the distance-$j$ binary Hamming graph with vertex set $\mathbb{Z}_2^n$, in which two vectors are adjacent exactly when their Hamming distance is $j$. For the binary…

Let $\rho_{a,N}$ be the Krawtchouk weight. For two finite sets $F_1,F_2$ of positive integers, allowing either set to be empty, consider the measure … If $N$ is a positive integer,…

Generalized Krawtchouk uniqueness conjecture. There is only one initial value $y_0$ for which