Related papers: Discrete Moving Frames, Semi-Algebraic Invariants …

Canonicalization provides an architecture-agnostic method for enforcing equivariance, with generalizations such as frame-averaging recently gaining prominence as a lightweight and flexible alternative to equivariant architectures. Recent…

Many machine learning models leverage group invariance which is enjoyed with a wide-range of applications. For exploiting an invariance structure, one common approach is known as \emph{frame averaging}. One popular example of frame…

A function $f$ of a graph is called a complete graph invariant if the isomorphism of graphs $G$ and $H$ is equivalent to the equality $f(G)=f(H)$. If, in addition, $f(G)$ is a graph isomorphic to $G$, then $f$ is called a canonical form for…

This thesis is devoted to algorithmic aspects of the implementation of Cartan's moving frame method to the problem of the equivalence of submanifolds under a Lie group action. We adopt a general definition of a moving frame as an…

In many applications, we desire neural networks to exhibit invariance or equivariance to certain groups due to symmetries inherent in the data. Recently, frame-averaging methods emerged to be a unified framework for attaining symmetries…

The aim of these notes is to describe how to construct canonical bundles of moving frames and differential invariants for parametrized curves in Lagrangian Grassmannians, at least in the monotonic case. Such curves appear as Jacobi curves…

We propose a simple and efficient local algorithm for graph isomorphism which succeeds for a large class of sparse graphs. This algorithm produces a low-depth canonical labeling, which is a labeling of the vertices of the graph that…

Graph canonization is the problem of computing a unique representative, a canon, from the isomorphism class of a given graph. This implies that two graphs are isomorphic exactly if their canons are equal. We show that graphs of bounded tree…

Given a differential equation with infinite-dimensional symmetry pseudo-group it is shown, using an example, that it is generally not possible to construct enough joint invariants to form an invariant numerical scheme of the equation. To…

We consider the ring I_n of polynomial invariants over weighted graphs on n vertices. Our primary interest is the use of this ring to define and explore algebraic versions of isomorphism problems of graphs, such as Ulam's reconstruction…

We compute a canonical circular-arc representation for a given circular-arc (CA) graph which implies solving the isomorphism and recognition problem for this class. To accomplish this we split the class of CA graphs into uniform and…

We prove that Graph Isomorphism and Canonization in graphs excluding a fixed graph $H$ as a minor can be solved by an algorithm working in time $f(H)\cdot n^{O(1)}$, where $f$ is some function. In other words, we show that these problems…

Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…

Group based moving frames have a wide range of applications, from the classical equivalence problems in differential geometry to more modern applications such as computer vision. Here we describe what we call a discrete group based moving…

Canonicalization is a widely used strategy in equivariant machine learning, enforcing symmetry in neural networks by mapping each input to a standard form. Yet, it often introduces discontinuities that can affect stability during training,…

The canonical tree-decomposition theorem, given by Robertson and Seymour in their seminal graph minors series, turns out to be one of the most important tool in structural and algorithmic graph theory. In this paper, we provide the…

Ambiguities arising in different approaches (canonical, quasiclassical, path integration) to quantization are discussed by an example of the mechanics of a point-like particle in the Riemannian space (the geodesic dynamics). A way to select…

We investigate the canonical quantization of gravity coupled to pointlike matter in 2+1 dimensions. Starting from the usual point particle action in the first order formalism, we introduce auxiliary variables which make the action locally…

For integers $k\ge 2$ and $N\ge 2k+1$ there are $k!2^k$ canonical orderings of the edges of the complete $k$-uniform hypergraph with vertex set $[N] = \{1,2,\dots, N\}$. These are exactly the orderings with the property that any two subsets…

We prove that there exists an algorithm for determining whether two piecewise-linear spatial graphs are isomorphic. In its most general form, our theorem applies to spatial graphs furnished with vertex colorings, edge colorings and/or edge…