Related papers: Testing isomorphism between tuples of subspaces

We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.

Planarity Testing is the problem of determining whether a given graph is planar while planar embedding is the corresponding construction problem. The bounded space complexity of these problems has been determined to be exactly Logspace by…

We make use of the complex implicit representation in order to provide a deterministic algorithm for checking whether or not two implicit algebraic curves are related by a similarity, a central question in Pattern Recognition and Computer…

We develop the methodology of positioning graph vertices relative to each other to solve the problem of determining isomorphism of two undirected graphs. Based on the position of the vertex in one of the graphs, it is determined the…

We formulate a notion of the quantum automorphism group of a $2$-graph. After some preliminary computations, we define quantum isomorphism between a pair of $2$-graphs. We produce a `non-trivial' example of a pair of $2$-graphs that are not…

Let $L$ be a Lie algebra with its enveloping algebra $U(L)$ over a field. In this paper we survey results concerning the isomorphism problem for enveloping algebras: given another Lie algebra $H$ for which $U(L)$ and $U(H)$ are isomorphic…

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…

Graph (or network) is a mathematical structure that has been widely used to model relational data. As real-world systems get more complex, multilayer (or multiple) networks are employed to represent diverse patterns of relationships among…

This article approaches the counting of subgraphs, in terms of signature-type functionals defined over combinatorial Hopf algebras of graphs. Well-known algebraic identities that arise in the context of counting subgraphs are then captured…

We use category-theoretic techniques to provide two proofs showing that for a higher-rank graph $\Lambda$, its cubical (co-)homology and categorical (co-)homology groups are isomorphic in all degrees, thus answering a question of Kumjian,…

Let V be a complex vector space with basis {x_1,x_2,...,x_n} and G be a finite subgroup of GL(V). The tensor algebra T(V) over the complex is isomorphic to the polynomials in the non-commutative variables x_1, x_2,..., x_n with complex…

We investigate the following problem: Given two embeddings G_1 and G_2 of the same abstract graph G on an orientable surface S, decide whether G_1 and G_2 are isotopic; in other words, whether there exists a continuous family of embeddings…

Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic,…

The group isomorphism problem asks whether two finite groups given by their Cayley tables are isomorphic or not. Although there are polynomial-time algorithms for some specific group classes, the best known algorithm for testing isomorphism…

Let A be a finite abelian group. We set up an algebraic framework for studying A-equivariant complex-orientable cohomology theories in terms of a suitable kind of equivariant formal groups. We compute the equivariant cohomology of many…

The Modular Isomorphism Problem asks, if an isomorphism between modular group algebras of finite $p$-groups over a field $F$ implies an isomorphism of the group bases. We explore the differences of knowledge on the problem when $F$ is…

Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a small portion of the input. The most typical situation where sublinear time algorithms are…

We consider the Grassmann graphs and dual polar graphs over the same finite field and show that, up to graph automorphism, for every dual polar graph there is the unique isometric embedding in the corresponding Grassmann graph.

In this paper we formulate and study the problem of representing groups on graphs. We show that with respect to polynomial time turing reducibility, both abelian and solvable group representability are all equivalent to graph isomorphism,…

The graph isomorphism problem asks whether two graphs are identical up to vertex relabeling. While the exact problem admits quasi-polynomial-time classical algorithms, many applications in molecular comparison, noisy network analysis, and…