CORRIGENDUM TO: ENUMERATION OF TWO-LINE ARRAYS

L. CARLITZ and MARGARET MODEL

Duke University, Durham, North Carolina 27706

The proof of (2.5) and (2.7) in the paper: "Enumeration of Two-Line Arrays" [1] is incorrect as it stands. A
corrected proof follows.
Let g(n,k) denote the number of two-line arrays of positive integers

a1 a2 - an
b1 b2 - bn

satisfying the inequalities

max(a}-,bg) < min (aj+i,hj+i) (1 < / < n) ,
max(aj,bj) < / (1 < i < n)
and
max(an,bn) = k.
We wish to show that

(2.7) gln + k,k) = ^ g(j,j)g(n +k-j, k-j + 1) (n > 1).

M
Let / be the greatest integer <k such that
max (apbj) = j .
It follows that ai+i = bj+f = /.
Consider the array
a7 .» /
/ ... . •j ... . j
Put
a- = aj+;-(j-U
(1 < i < n + k-j)
bj = bJH-(/-V

It follows from the conditions satisfied by a-t, bj that

max(a;,b;) < min{a'j+i,b'j+1) (1 < / < n+k-j),

max(aj,bj) < / (1 < / < n +k-j),
max(a'n+H,b'n+k„j) = k-j+1.
This evidently yields (2.7).

REFERENCE
1. L. Carlitz, "Enumeration of Two-Line Arrays/' The Fibonacci Quarterly, Vol. 11, Wo. 2 (April 1973), pp. 1 1 3 -
130.

266