Log In Sign Up

Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time

by   Moritz Lichter, et al.

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.


page 1

page 2

page 3

page 4


On the first-order transduction quasiorder of hereditary classes of graphs

Logical transductions provide a very useful tool to encode classes of st...

An Optimal Construction for the Barthelmann-Schwentick Normal Form on Classes of Structures of Bounded Degree

Building on the locality conditions for first-order logic by Hanf and Ga...

Separating polynomial χ-boundedness from χ-boundedness

Extending the idea from the recent paper by Carbonero, Hompe, Moore, and...

What can be certified compactly?

Local certification consists in assigning labels (called certificates) t...

Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm

As it is well known, the isomorphism problem for vertex-colored graphs w...

Choiceless Polynomial Time with Witnessed Symmetric Choice

We extend Choiceless Polynomial Time (CPT), the currently only remaining...