Related papers: Discrete Moving Frames, Semi-Algebraic Invariants …
We present a new approach for learning unsupervised node representations in community graphs. We significantly extend the Interferometric Graph Transform (IGT) to community labeling: this non-linear operator iteratively extracts features…
We give a local treatment of finite alignment by identifying the finitely aligned part of any (not necessarily finitely aligned) higher-rank graph. We show the finitely aligned part is itself a constellation and forms a finitely aligned…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
In this work the equivariant signature of a manifold with proper action of a discrete group is defined as an invariant of equivariant bordisms. It is shown that the computation of this signature can be reduced to its computation on fixed…
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…
The main goal of this article is to bring together the theories of holomorphic iteration in the unit disc and semigroups of holomorphic functions. We develop a technique that allows us to partially embed the orbit of a holomorphic self-map…
An edge-weighted graph $G=(V,E)$ is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory problems, such as…
Canonical quantization of gravitational systems is obstructed by the problem of time. Due to diffeomorphism symmetry the Hamiltonian vanishes: dynamics with respect to a background time parameter appears "frozen." Two strategies towards the…
Functions which are covariant or invariant under the transformations of a compact linear group $G$ acting in a euclidean space $\real^n$, can be profitably studied as functions defined in the orbit space of the group. The orbit space is the…
Canonical transformations are ubiquitous in Hamiltonian mechanics, since they not only describe the fundamental invariance of the theory under phase-space reparameterisations, but also generate the dynamics of the system. In the first part…
We consider the problem of constrained motion along a conic path under a given external potential function. The model is described as a second-class system capturing the behavior of a certain class of specific quantum field theories. By…
The general uncertainty principle applied to gravity can be implemented as a set of modified Poisson brackets in the canonical formalism. As such, the theory is not canonical and the resulting equations of motion do not lead to a covariant…
In this paper we study the realizability question for commuting graphs of finite groups: Given an undirected graph $X$ is it the commuting graph of a group $G$? And if so, to determine such a group. We seek efficient algorithms for this…
In order to apply canonical labelling of graphs and isomorphism checking in interactive theorem provers, these checking algorithms must either be mechanically verified or their results must be verifiable by independent checkers. We analyze…
It is well known that in a generally covariant gravitational theory the choice of spacetime scalars as coordinates yields phase-space observables (or "invariants"). However their relation to the symmetry group of diffeomorphism…
We consider the problem of classification of an object given multiple observations that possibly include different transformations. The possible transformations of the object generally span a low-dimensional manifold in the original signal…
The parameterized analysis of graph modification problems represents the most extensively studied area within Parameterized Complexity. Given a graph $G$ and an integer $k\in\mathbb{N}$ as input, the goal is to determine whether we can…
It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…
We consider spin system defined on the coadjoint orbit with noncompact symmetry and investigate the quantization. Classical spin with noncompact SU(N,1) symmetry is first formulated as a dynamical system and the constraint analysis is…
In the work are defined the concepts semi-canonical and canonical binary matrix. What is described is an algorithm solving the combinatorial problem for finding the semi-canonical matrices in the set \Lambda_n^k consisting of all n\times n…