Discrete Moving Frames, Semi-Algebraic Invariants and the Graph Canonization Problem
Leonid Bedratyuk

TL;DR
This paper introduces a geometric framework using discrete moving frames to canonize graphs, providing a theoretical foundation for graph isomorphism invariants as semi-algebraic functions, bypassing computational complexity issues.
Contribution
It formalizes graph canonization as a discrete moving frame problem, linking invariants to semi-algebraic functions and offering a new theoretical perspective.
Findings
Defines graph canonization via discrete moving frames.
Shows invariants are semi-algebraic, not purely algebraic.
Provides a rigorous theoretical foundation for graph isomorphism invariants.
Abstract
This paper develops an invariant--geometric interpretation of the canonization problem for simple undirected weighted graphs based on the {discrete moving frame method} for finite groups. We consider the action of the {pair group} on the space of edge weights of a graph. It is emphasized that the classical algebraic approach aimed at describing the ring of polynomial invariants of this action quickly becomes computationally impractical due to the explosive growth in the number and degrees of generators. The main result is a formalization of a canonical labeling of a graph as a {discrete moving frame} in the sense of Olver: a discrete orbit cross-section is fixed, in particular by a lexicographic rule, and for each configuration of edge weights one defines a permutation in that maps it to its canonical representative. The coordinates of the canonical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Optics and Image Analysis · Geometric and Algebraic Topology
