In this section we shall obtain certain combinatorial properties of sequences of n integers, each integer one of 1, ... , a. The motivation for our interest in these properties will become apparent in Chapter 3. By at once proving the necessary facts we gain in efficiency at the expense of a temporary lack of motivation. To avoid the trivial we assume, throughout this monograph, that a ≧ 2 and n ≧ 2; the main interest in application will usually be for large n.
KeywordsEntropy Expense Dispatch
Unable to display preview. Download preview PDF.