Zero/positive capacities of two-dimensional runlength constrained arrays

A binary sequence satisfies a one-dimensional (d, k) runlength constraint if every run of zeroes has length at least d and at most k. A binary sequence satisfies a one-dimensional (d/sub 1/, k/sub 1/, d/sub 2/, k/sub 2/) runlength constraint if every run of zeroes has length at least d/sub 1/ and at most k/sub 2/ and every run of ones has length at least d/sub 2/ and at most k/sub 2/. A two-dimensional binary array is said to satisfy a (d/sub 1/, k/sub 1/, d/sub 2/, k/sub 2/; d/sub 3/, d/sub 4/, k/sub 4/) runlength constraint if it satisfies the one-dimensional (d/sub 1/, k/sub 1/, d/sub 2/, k/sub 2/) runlength constraint horizontally (i.e. on every row) and the one-dimensional (d/sub 3/, k/sub 3/, d/sub 4/, k/sub 4/) runlength constraint vertically (i.e. on every column). For convenience, we will say that a binary array satisfies the (d,k) runlength constraint if each row and each column satisfy the (d,k) runlength constraint and that a binary array satisfies the (d/sub 1/, k/sub 1/, d/sub 2/, k/sub 2/) runlength constraint if it is (d/sub 1/, k/sub 1/, d/sub 2/, k/sub 2/) runlength constrained both horizontally and vertically. We say that a binary array satisfies the (d/sub 1/, k/sub 1/; d/sub 3/, k/sub 3/) runlength constraint if each row satisfies the (d/sub 1/, k/sub 1/, d/sub 1/, k/sub 1/) runlength constraint and each column satisfies the (d/sub 3/, k/sub 3/, d/sub 3/, k/sub 3/) runlength constraint. Finally, we always allow violation of the smallest runlength constraint at the beginning and the end sequences and at the edges of arrays. In this work we examine the following basic question: for which values of d/sub 1/, k/sub 1/, d/sub 2/, k/sub 2/, d/sub 3/, k/sub 3/, d/sub 4/, k/sub 4/, is C(d/sub 1/, k/sub 1/, d/sub 2/, k/sub 2/; d/sub 3/, k/sub 3/, d/sub 4/, k/sub 4/) positive and for which values is it equal to zero?.