Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Covering Arrays for Equivalence Classes of Words   Covering arrays for words of length $t$ over a $d$ letter alphabet are $k
\times n$ arrays with entries from the alphabet so that for each choice of $t$
columns, each of the $d^t$ $t$-letter words appears at least once among the
rows of the selected columns. We study two schemes in which all words are not
considered to be different. In the first case words are equivalent if they
induce the same partition of a $t$ element set. In the second case, words of
the same weight are equivalent. In both cases we produce logarithmic upper
bounds on the minimum size $k=k(n)$ of a covering array. Definitive results for
$t=2,3,4$, as well as general results, are provided.

37
The categories of this paper are: supr-con
35
The categories of this paper are: mtrl-th
36
The categories of this paper are: cmp-lg
7
The categories of this paper are: hep-th
16
The categories of this paper are: stat
15
The categories of this paper are: nucl-ex
18
The categories of this paper are: econ
13
The categories of this paper are: quant-ph
14
The categories of this paper are: math-ph
29
The categories of this paper are: funct-an
21
The categories of this paper are: adap-org
9
The categories of this paper are: nlin
6
The categories of this paper are: astro-ph
27
The categories of this paper are: comp-gas
17
The categories of this paper are: q-fin
34
The categories of this paper are: chem-ph