Related papers: Testing isomorphism between tuples of subspaces
We consider all compatible topologies of an arbitrary finite-dimensional vector space over a non-trivial valuation field whose metric completion is a locally compact space. We construct the canonical lattice isomorphism between the lattice…
This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…
The criteria for determining graph isomorphism are crucial for solving graph isomorphism problems. The necessary condition is that two isomorphic graphs possess invariants, but their function can only be used to filtrate and subdivide…
The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…
Suppose we are given two graphs on $n$ vertices. We define an observable in the Hilbert space $\Co[(S_n \wr S_2)^m]$ which returns the answer ``yes'' with certainty if the graphs are isomorphic and ``no'' with probability at least…
In this paper, we show the existence of a polynomial time graph isomorphism algorithm for all graphs excluding graphs that are locally trianglefree. This particular class of graphs allows to divide the graph into neighbourhood sub-graph…
A method for improving the efficiency of graph isomorphism testing is presented. The method uses the structure of the graph colored by vertex hash codes as a means of partitioning vertices into equivalence classes, which in turn reduces the…
Graphs are widely used to model complicated data semantics in many application domains. In this paper, two novel and efficient algorithms Fast-ON and Fast-P are proposed for solving the subgraph isomorphism problem. The two algorithms are…
We give a method of constructing maps between tubular groups inductively according to a set of strategies. This map will be a quasi-isometry exactly when the set of strategies is consistent. Conversely, if there exists a quasi-isometry…
We consider several ways to test for topology directly in harmonic space by comparing the measured a_lm with the expected correlation matrices. Two tests are of a frequentist nature while we compute the Bayesian evidence as the third test.…
Circular-arc graphs are intersection graphs of arcs on the circle. The aim of our work is to present a polynomial time algorithm testing whether two circular-arc graphs are isomorphic. To accomplish our task we construct decomposition…
The Kalman variety of a linear subspace in a vector space consists of all endomorphism that possess an eigenvector in that subspace. We study the defining polynomials and basic geometric invariants of the Kalman variety.
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…
Given a graph $G$, the graph $[G]$ obtained by adding, for each pair of vertices of $G$, a unique vertex adjacent to both vertices is called the binding graph of $G$. In this work, we show that the class of binding graphs is…
We give two equivalent sets of invariants which classify pairs of coisotropic subspaces of finite-dimensional Poisson vector spaces. For this it is convenient to dualize; we work with pairs of isotropic subspaces of presymplectic vector…
The quantum lens spaces form a natural and well-studied class of noncommutative spaces which can be subjected to classification using algebraic invariants by drawing on the fully developed classification theory of unital graph…
Let $f:G\rightarrow H$ be a homomorphism of groups, we construct a topological space $X_f$ such that its group of homeomorphisms is isomorphic to $G$, its group of homotopy classes of self-homotopy equivalences is isomorphic to $H$ and the…
We present the implementation of an algorithm for graph isomorphism testing, based on ideas about number of walks (of sufficiently large length) between vertices. The algorithm is expanded for strongly regular graphs (SRG-s) by testing the…
We use the concept of a Kirchhoff resistor network (alternatively random walk on a network) to probe connected graphs and produce symmetry revealing canonical labelings of the graph(s) nodes and edges.
Over 50 years ago, Lov\'{a}sz proved that two graphs are isomorphic if and only if they admit the same number of homomorphisms from any graph [Acta Math. Hungar. 18 (1967), pp. 321--328]. In this work we prove that two graphs are quantum…