相关论文: The isomorphism problem for cyclic algebras and it…

We classify all division algebras that are principal Albert isotopes of a cyclic Galois field extension of degree $n>2$ up to isomorphisms. We achieve a ``tight'' classification when the cyclic Galois field extension is cubic. The…

We find and describe unexpected isomorphisms between two very different objects associated to hypersurface singularities. One object is the Milnor algebra of a function, while the other object associated to a singularity is the local ring…

In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…

A complete classifications, up to isomorphism, of two-dimensional associative and diassociative algebras over any basic field are given.

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…

In the Graph Isomorphism problem two N-vertex graphs G and G' are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and transforms G into G'. If yes, then G and G' are said…

We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…

We study the Modular Isomorphism Problem applying a combination of existing and new techniques. We make use of the small group algebra to give a positive answer for two classes of groups of nilpotency class 3. We also introduce a new…

We investigate the computational complexity of the problem of deciding if an algebra homomorphism can be factored through an intermediate algebra. Specifically, we fix an algebraic language, L, and take as input an algebra homomorphism f…

The graph isomorphism problem looks deceptively simple, but although polynomial-time algorithms exist for certain types of graphs such as planar graphs and graphs with bounded degree or eigenvalue multiplicity, its complexity class is still…

We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…

The aim of this paper is to consider the relation between Lie-isoclinism and isomorphism of two pairs of Leibniz algebras. We show that, unlike the absolute case for finite dimensional Lie algebras, these concepts are not identical, even if…

The goal of this article is to prove the comparison theorem between algebraic and topological nearby cycles of a morphism without slopes. We prove in particular that for a family of holomorphic functions without slopes, if we iterate…

The computational complexity of the graph isomorphism problem is considered to be a major open problem in theoretical computer science. It is known that testing isomorphism of chordal graphs is polynomial-time equivalent to the general…

One of the central questions of universal algebraic geometry is: when two algebras have the same algebraic geometry? There are various interpretations of the sentence "Two algebras have the same algebraic geometry". One of these is…

Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…

If a morphism of germs of schemes induces isomorphisms of all local jet schemes, does it follow that the morphism is an isomorphism? This problem is called the local isomorphism problem. In this paper, we use jet schemes to introduce…

The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle…

We reduce the isomorphism problem for undirected graphs without loops to the isomorphism problems for a class of finite dimensional $2$-step nilpotent Lie algebras over a field and for a class of finite $p$-groups. We show that the…

Symmetric homology is a natural generalization of cyclic homology, in which symmetric groups play the role of cyclic groups. In the case of associative algebras, the symmetric homology theory was introduced by Z. Fiedorowicz \cite{F} and…