Related papers: The isomorphism problem for cyclic algebras and it…
In this paper we develop three characterizations for isomorphism of graphs. The first characterization is obtained by associating certain bitableaux with the graphs. We order these bitableaux by suitably defined lexicographic order and…
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 present norm criteria for the existence of anti-automorphisms, as well as explicit constructions of anti-automorphisms, both on cyclic and generalized cyclic algebras. Our approach describes anti-automorphisms as polynomial maps and…
This paper addresses the isomorphism problem for the universal (nonself-adjoint) operator algebras generated by a row contraction subject to homogeneous polynomial relations. We find that two such algebras are isometrically isomorphic if…
Let $\mathbb{Q}(\alpha)$ and $\mathbb{Q}(\beta)$ be algebraic number fields. We describe a new method to find (if they exist) all isomorphisms, $\mathbb{Q}(\beta) \rightarrow \mathbb{Q}(\alpha)$. The algorithm is particularly efficient if…
In the thesis we present a new method for parametrizing algebraic varieties over the field of characteristic zero. The problem of parametrizing is reduced to a problem of finding an isomorphism of algebras. We introduce the Lie algebra of a…
We prove that the isomorphism problem for separable nuclear C*-algebras is complete in the class of orbit equivalence relations. In fact, already the isomorphism of simple, separable AI C*-algebras is a complete orbit equivalence relation.…
We provide isomorphism results for Hopf algebras that are obtained as graded twistings of function algebras on finite groups by cocentral actions of cyclic groups. More generally , we also consider the isomorphism problem for…
We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…
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…
We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.
Symmetries and isomorphisms play similar conceptual roles when we consider how models represent physical situations, but they are formally distinct, as two models related by symmetries are not typically isomorphic. I offer a rigorous…
In this paper, we study the behaviour of TF-isomorphisms, a natural generalisation of isomorphisms. TF-isomorphisms allow us to simplify the approach to seemingly unrelated problems. In particular, we mention the Neighbourhood…
Evolution algebras are non-associative algebras inspired from biological phenomena, with applications to or connections with different mathematical fields. There are two natural ways to define an evolution algebra associated to a given…
Bell and Zhang have shown that if $A$ and $B$ are two connected graded algebras finitely generated in degree one that are isomorphic as ungraded algebras, then they are isomorphic as graded algebras. We exploit this result to solve the…
It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algorithm. The d-dimensional WL-algorithm can distinguish many…
We investigate the factorization problem as well as the classifying complements problem in the setting of Jordan algebras. Matched pairs of Jordan algebras and the corresponding bicrossed products are introduced. It is shown that any Jordan…
Constraint satisfaction problems are computational problems that naturally appear in many areas of theoretical computer science. One of the central themes is their computational complexity, and in particular the border between…
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small tree-width, and applying dynamic…
We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…