Nevena Francetić (Carleton University and University of Ottawa)
Covering Arrays with Row Limit

Covering arrays with row limit, CARLs, are a new family of combinatorial objects which we introduce as a generalization of group divisible designs and covering arrays. In the same manner as their predecessors, CARLs have a natural application as combinatorial models for interaction test suites.

In this talk we consider the central questions regarding CARLs: the bounds on their size and constructions of (optimal) object. We discuss their relationship to their predecessors in terms of asymptotic growth. Also, we present some constructions of optimal CARLs with row limit four. Finally, we consider a packing version of the same problem, namely packing arrays with row limit, PARLs, and transformation from optimal CARLs to optimal PARLs.