PROBLEM OF ARRANGEMENTS ON CHESSBOARDS AND GENERALIZATIONS

AbstractFor a unified approach to the study of the distributions of like objects on chessboards, the numbers defined by C(k, s; m, n)=1m!n! [ΔmuΔnυ(suυ)k] u=0.υ=0' where Δu denotes the partial (with respect to u) difference operator, are examined. This approach facilities the treatment of further generalizations of such problems