Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Canonization for Bounded and Dihedral Color Classes in Choiceless
  Polynomial Time   In the quest for a logic capturing PTime the next natural classes of
structures to consider are those with bounded color class size. We present a
canonization procedure for graphs with dihedral color classes of bounded size
in the logic of Choiceless Polynomial Time (CPT), which then captures PTime on
this class of structures. This is the first result of this form for non-abelian
color classes. The first step proposes a normal form which comprises a "rigid
assemblage". This roughly means that the local automorphism groups form
2-injective 3-factor subdirect products. Structures with color classes of
bounded size can be reduced canonization preservingly to normal form in CPT. In
the second step, we show that for graphs in normal form with dihedral color
classes of bounded size, the canonization problem can be solved in CPT. We also
show the same statement for general ternary structures in normal form if the
dihedral groups are defined over odd domains.

34
The categories of this paper are: chem-ph
22
The categories of this paper are: chao-dyn
6
The categories of this paper are: astro-ph
25
The categories of this paper are: patt-sol
8
The categories of this paper are: hep-ex
11
The categories of this paper are: hep-lat
3
The categories of this paper are: physics
37
The categories of this paper are: supr-con
20
The categories of this paper are: acc-phys
18
The categories of this paper are: econ
7
The categories of this paper are: hep-th
0
The categories of this paper are: hep-ph
27
The categories of this paper are: comp-gas
35
The categories of this paper are: mtrl-th
23
The categories of this paper are: solv-int
13
The categories of this paper are: quant-ph