Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Unavoidable Sets of Partial Words of Uniform Length   A set X of partial words over a finite alphabet A is called unavoidable if
every two-sided infinite word over A has a factor compatible with an element of
X. Unlike the case of a set of words without holes, the problem of deciding
whether or not a given finite set of n partial words over a k-letter alphabet
is avoidable is NP-hard, even when we restrict to a set of partial words of
uniform length. So classifying such sets, with parameters k and n, as avoidable
or unavoidable becomes an interesting problem. In this paper, we work towards
this classification problem by investigating the maximum number of holes we can
fill in unavoidable sets of partial words of uniform length over an alphabet of
any fixed size, while maintaining the unavoidability property.

16
The categories of this paper are: stat
13
The categories of this paper are: quant-ph
32
The categories of this paper are: atom-ph
5
The categories of this paper are: gr-qc
14
The categories of this paper are: math-ph
2
The categories of this paper are: math
28
The categories of this paper are: alg-geom
30
The categories of this paper are: q-alg
27
The categories of this paper are: comp-gas
0
The categories of this paper are: hep-ph
37
The categories of this paper are: supr-con
4
The categories of this paper are: cond-mat
11
The categories of this paper are: hep-lat
18
The categories of this paper are: econ
20
The categories of this paper are: acc-phys
9
The categories of this paper are: nlin