Bounds for generalized triple-array width
Bound the quantity ω(r × c, v), defined as the least common upper bound on the three intersection-range widths of an (r × c, v)-generalized triple array, in terms of r, c, and v.
References
For those parameter sets where near triple arrays do not exist, we investigated generalized triple arrays. In relation to this, we ask the following question. Let $\omega(r \times c, v)$ be the smallest integer $\omega$ such that there exists an $(r \times c, v; \omega_{rc}, \omega_{rr}, \omega_{cc})$-generalized triple array with $\omega_{rc}, \omega_{rr}, \omega_{cc} \leq \omega$. How can $\omega(r \times c, v)$ be bounded in terms of $r, c, v$?
In relation to this, we ask the following question. \begin{question} Let $\omega(r \times c, v)$ be the smallest integer $\omega$ such that there exists an $(r \times c, v; \omega_{rc}, \omega_{rr}, \omega_{cc})$-generalized triple array with $\omega_{rc}, \omega_{rr}, \omega_{cc} \leq \omega$. How can $\omega(r \times c, v)$ be bounded in terms of $r, c, v$? \end{question}
How can $\omega(r \times c, v)$ be bounded in terms of $r, c, v$?