Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Topological complexity of configuration spaces of fully articulated
  graphs and banana graphs   In this paper we determine the topological complexity of configuration spaces
of graphs which are not necessarily trees, which is a crucial assumption in
previous results. We do this for two very different classes of graphs: fully
articulated graphs and banana graphs. We also complete the computation in the
case of trees to include configuration spaces with any number of points,
extending a proof of Farber. At the end we show that an unordered configuration
space on a graph does not always have the same topological complexity as the
corresponding ordered configuration space (not even when they are both
connected). Surprisingly, in our counterexamples the topological complexity of
the unordered configuration space is in fact smaller than for the ordered one.

5
The categories of this paper are: gr-qc
29
The categories of this paper are: funct-an
19
The categories of this paper are: eess
31
The categories of this paper are: ao-sci
27
The categories of this paper are: comp-gas
24
The categories of this paper are: dg-ga
21
The categories of this paper are: adap-org
1
The categories of this paper are: cs
13
The categories of this paper are: quant-ph
7
The categories of this paper are: hep-th
23
The categories of this paper are: solv-int
12
The categories of this paper are: nucl-th
15
The categories of this paper are: nucl-ex
32
The categories of this paper are: atom-ph
9
The categories of this paper are: nlin
36
The categories of this paper are: cmp-lg