Related papers: Discrete Moving Frames, Semi-Algebraic Invariants …
Orienting the edges of an undirected graph such that the resulting digraph satisfies some given constraints is a classical problem in graph theory, with multiple algorithmic applications. In particular, an $st$-orientation orients each edge…
We present an approach to the canonical quantization of systems with equations of motion that are historically called non-Lagrangian equations. Our viewpoint of this problem is the following: despite the fact that a set of differential…
The classical theory for a massive free particle moving on the group manifold $AdS_3 \cong SL(2, \mathbb{R})$ is analysed in detail. In particular a symplectic structure and two different sets of canonical coordinates are explicitly found,…
We devise a unified framework for the design of canonization algorithms. Using hereditarily finite sets, we define a general notion of combinatorial objects that includes graphs, hypergraphs, relational structures, codes, permutation…
We give canonical matrices of a pair (A,B) consisting of a nondegenerate form B and a linear operator A satisfying B(Ax,Ay)=B(x,y) on a vector space over F in the following cases: (i) F is an algebraically closed field of characteristic…
This work is a continuation of our previous works concerning linear canonical transformations and phase space representation of quantum theory. It is mainly focused on the description of an approach which allows to establish spinorial…
We introduce a novel type of stabilization map on the configuration spaces of a graph, which increases the number of particles occupying an edge. There is an induced action on homology by the polynomial ring generated by the set of edges,…
We introduce the notion of continuous orbit equivalence for partial dynamical systems, and give an equivalent characterization in terms of Cartan-isomorphisms for partial C*-crossed products. Both graph C*-algebras and semigroup C*-algebras…
We give a procedure that can be used to automatically satisfy invariants of a certain shape. These invariants may be written with the operations intersection, composition and converse over binary relations, and equality over these…
In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the…
Graph alignment in two correlated random graphs refers to the task of identifying the correspondence between vertex sets of the graphs. Recent results have characterized the exact information-theoretic threshold for graph alignment in…
The field of Graph Signal Processing (GSP) has proposed tools to generalize harmonic analysis to complex domains represented through graphs. Among these tools are translations, which are required to define many others. Most works propose to…
The representation of the resolvent as an integral operator, the $m$ function, and the associated spectral representation are fundamental topics in the spectral theory of self-adjoint ordinary differential operators. Versions of these are…
The sandpile group of a connected graph is a group whose cardinality is the number of spanning trees. The group is known to have a canonical simply transitive action on spanning trees if the graph is embedded into the plane. However, no…
Graph inverse semigroups generalize the polycyclic inverse monoids and play an important role in the theory of C*-algebras. This paper has two main goals: first, to provide an abstract characterization of graph inverse semigroups; and…
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…
We extend the notion of canonical ordering (initially developed for planar triangulations and 3-connected planar maps) to cylindric (essentially simple) triangulations and more generally to cylindric (essentially internally) $3$-connected…
In this paper, the generic part of the gauge theory of gravity is derived, based merely on the action principle and on the general principle of relativity. We apply the canonical transformation framework to formulate geometrodynamics as a…
We describe a canonical procedure for associating to any (germ of) holomorphic self-map f of C^n fixing the origin such that df_O is invertible and non-diagonalizable an n-dimensional complex manifold M, a holomorphic map p from M to C^n, a…
In numerous applications of geometric deep learning, the studied systems exhibit spatial symmetries and it is desirable to enforce these. For the symmetry of global rotations and reflections, this means that the model should be equivariant…