Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Tackling the Minimal Superpermutation Problem   A superpermutation on $n$ symbols is a string that contains each of the $n!$
permutations of the $n$ symbols as a contiguous substring. The shortest
superpermutation on $n$ symbols was conjectured to have length $\sum_{i=1}^n
i!$. The conjecture had been verified for $n \leq 5$. We disprove it by
exhibiting an explicit counterexample for $n=6$. This counterexample was found
by encoding the problem as an instance of the (asymmetric) Traveling Salesman
Problem, and searching for a solution using a powerful heuristic solver.

32
The categories of this paper are: atom-ph
11
The categories of this paper are: hep-lat
25
The categories of this paper are: patt-sol
16
The categories of this paper are: stat
31
The categories of this paper are: ao-sci
23
The categories of this paper are: solv-int
7
The categories of this paper are: hep-th
27
The categories of this paper are: comp-gas
37
The categories of this paper are: supr-con
0
The categories of this paper are: hep-ph
34
The categories of this paper are: chem-ph
13
The categories of this paper are: quant-ph
24
The categories of this paper are: dg-ga
33
The categories of this paper are: plasm-ph
26
The categories of this paper are: bayes-an
8
The categories of this paper are: hep-ex