Related papers: Testing isomorphism between tuples of subspaces
In this paper, we propose algorithms for the graph isomorphism (GI) problem that are based on the eigendecompositions of the adjacency matrices. The eigenvalues of isomorphic graphs are identical. However, two graphs $ G_A $ and $ G_B $ can…
Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…
It's important to design polynomial time algorithms to test if two graphs are isomorphic at least for some special classes of graphs. An approach to this was presented by Eugene M. Luks(1981) in the work \textit{Isomorphism of Graphs of…
We construct a new category of vector spaces which contains both the standard category of vector spaces and Grassmannians. Its space of objects classifies vector bundles, its space of morphisms classifies bundle isomorphisms, and it can be…
An $n$-tuple of operators $(V_1,...,V_n)$ acting on a Hilbert space $H$ is said to be isometric if the operator $[V_1\...\ V_n]:H^n\to H$ is an isometry. We prove a decomposition for an isometric tuple of operators that generalizes the…
The set of matrix tuples with invariant subspaces whose dimensions sum up to the dimension of the space, but which do not span the whole space form an algebraic hypersurface. We found the equation of this hypersurface. This generalizes…
In this paper, we address the following two general problems: given two algebraic varieties in ${\bf C}^n$, find out whether or not they are (1) isomorphic; (2) equivalent under an automorphism of ${\bf C}^n$. Although a complete solution…
This article deals with new polynomial time algorithm for graph isomorphism testing.
We prove that there is a graph isomorphism test running in time $n^{\operatorname{polylog}(h)}$ on $n$-vertex graphs excluding some $h$-vertex graph as a minor. Previously known bounds were $n^{\operatorname{poly}(h)}$ (Ponomarenko, 1988)…
Graph isomorphism is an important computer science problem. The problem for the general case is unknown to be in polynomial time. The base algorithm for the general case works in quasi-polynomial time. The solutions in polynomial time for…
Correspondence homomorphisms are both a generalization of standard homomorphisms and a generalization of correspondence colourings. For a fixed target graph $H$, the problem is to decide whether an input graph $G$, with each edge labeled by…
A classical difficult isomorphism testing problem is to test isomorphism of p-groups of class 2 and exponent p in time polynomial in the group order. It is known that this problem can be reduced to solving the alternating matrix space…
This paper investigates type isomorphism in a lambda-calculus with intersection and union types. It is known that in lambda-calculus, the isomorphism between two types is realised by a pair of terms inverse one each other. Notably,…
The Weisfeiler-Leman procedure is a widely-used technique for graph isomorphism testing that works by iteratively computing an isomorphism-invariant coloring of vertex tuples. Meanwhile, a fundamental tool in structural graph theory, which…
We prove two isomorphism-invariance theorems for groupoids associated with ultragraphs. These theorems characterize ultragraphs for which the topological full group of an associated groupoid is an isomorphism invariant. These results extend…
This paper presents a new graph isomorphism invariant, called $\mathfrak{w}$-labeling, that can be used to design a polynomial-time algorithm for solving the graph isomorphism problem for various graph classes. For example, all…
Graph isomorphism is an important problem as its worst-case time complexity is not yet fully understood. In this study, we try to draw parallels between a related optimization problem called point set registration. A graph can be…
Given locally compact quantum groups $\G_1$ and $\G_2$, we show that if the convolution algebras $L^1(\G_1)$ and $L^1(\G_2)$ are isometrically isomorphic as algebras, then $\G_1$ is isomorphic either to $\G_2$ or the commutant $\G_2'$.…
In this article, we study the isomorphism problem for the algebras of $\Phi-$Pseudofunctions and $\Phi-$Pseudomeasures, denoted by $PF_\Phi(G)$ and $PM_\Phi(G),$ respectively. More precisely, for a certain class of Young functions $\Phi,$…
We give an isomorphism test for graphs of Euler genus $g$ running in time $2^{O(g^4 \log g)}n^{O(1)}$. Our algorithm provides the first explicit upper bound on the dependence on $g$ for an fpt isomorphism test parameterized by the Euler…