Related papers: Discrete Moving Frames, Semi-Algebraic Invariants …
We sketch our recent application of a non-commutative version of the Cartan `moving-frame' formalism to the quantum Euclidean space $R^N_q$, the space which is covariant under the action of the quantum group $SO_q(N)$. For each of the two…
We propose an approach to quantize discrete networks (graphs with discrete edges). We introduce a new exact solution of discrete Schrodinger equation that is used to write the solution for quantum graphs. Formulation of the problem and…
It is well known that a commuting family of diagonalizable linear operators on a finite dimensional vector space is simultaneously diagonalizable. In this paper, we consider a family A of anti-commuting (complex) linear operators on a…
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. We bridge this gap for a natural and important special case, planar graph isomorphism,…
We show that a canonical labeling of a random $n$-vertex graph can be obtained by assigning to each vertex $x$ the triple $(w_1(x),w_2(x),w_3(x))$, where $w_k(x)$ is the number of walks of length $k$ starting from $x$. This takes time…
In hep-th/0411028 a new manifestly covariant canonical quantization method was developed. The idea is to quantize in the phase space of arbitrary histories first, and impose dynamics as first-class constraints afterwards. The Hamiltonian is…
We consider diffusion on discrete measure spaces as encoded by Markovian semigroups arising from weighted graphs. We study whether the graph is uniquely determined if the diffusion is given up to order isomorphism. If the graph is recurrent…
Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and…
Spectral embedding is a powerful graph embedding technique that has received a lot of attention recently due to its effectiveness on Graph Transformers. However, from a theoretical perspective, the universal expressive power of spectral…
One of the hardest problems to tackle in the dynamics of canonical approaches to quantum gravity is that of the Hamiltonian constraint. We investigate said problem in the context of formal geometric quantization. We study the implications…
We define an infinite graded graph of ordered pairs and a~canonical action of the group $\mathbb{Z}$ (the adic action) and of the infinite sum of groups of order two~$\mathcal{D}=\sum_1^{\infty} \mathbb{Z}/2\mathbb{Z}$ on the path space of…
We show that if $p=O(1/n)$, then the Erd\H{o}s-R\'{e}nyi random graph $G(n,p)$ with high probability admits a canonical labeling computable in time $O(n\log n)$. Combined with the previous results on the canonization of random graphs, this…
We construct a manifestly diffeomorphism invariant Wilsonian (Exact) Renormalization Group for classical gravity, and begin the construction for quantum gravity. We demonstrate that the effective action can be computed without gauge fixing…
A new purely algebraic algorithm is presented for computation of invariants (generalized Casimir operators) of Lie algebras. It uses the Cartan's method of moving frames and the knowledge of the group of inner automorphisms of each Lie…
Recent developments concerning canonical quantisation and gauge invariant quantum mechanical systems and quantum field theories are briefly discussed. On the one hand, it is shown how diffeomorphic covariant representations of the…
Learning transformation invariant representations of visual data is an important problem in computer vision. Deep convolutional networks have demonstrated remarkable results for image and video classification tasks. However, they have…
We initiate the study of computational complexity of graph coverings, aka locally bijective graph homomorphisms, for {\em graphs with semi-edges}. The notion of graph covering is a discretization of coverings between surfaces or topological…
The expressivity of Graph Neural Networks (GNNs) has been studied broadly in recent years to reveal the design principles for more powerful GNNs. Graph canonization is known as a typical approach to distinguish non-isomorphic graphs, yet…
Studying 2 degree-of-freedom (DOF) Hamiltonian dynamical systems often involves the computation of stable & unstable manifolds of periodic orbits, due to the homoclinic & heteroclinic connections they can generate. Such study is generally…
A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$. It is known that for a given numerical semigroup $S$, the…