Related papers: Testing isomorphism between tuples of subspaces

We give new polynomial-time algorithms for testing isomorphism of a class of groups given by multiplication tables (GpI). Two results (Cannon & Holt, J. Symb. Comput. 2003; Babai, Codenotti & Qiao, ICALP 2012) imply that GpI reduces to the…

The equivariant cohomology of a space with a group action is not only a ring but also an algebra over the cohomology ring of the classifying space of the acting group. We prove that toric manifolds (i.e. compact smooth toric varieties) are…

We give an explicit description of the set of all factorization structures, or twisting maps, existing between the algebras k^2 and k^2, and classify the resulting algebras up to isomorphism. In the process we relate several different…

We prove that if open subgroups of the groups of invertible elements in two Fourier-Stieltjes algebras are isometric as metric spaces, then the underlying locally compact groups are topologically isomorphic. We describe the structure of…

We show how to test the bipartiteness of an intersection graph of n line segments or simple polygons in the plane, or of balls in R^d, in time O(n log n). More generally we find subquadratic algorithms for connectivity and bipartiteness…

As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…

We use representation theory to construct spaces of matrices of constant rank. These spaces are parametrized by the natural representation of the general linear group or the symplectic group. We present variants of this idea, with more…

This paper introduces gluing diagrams a combinatorial tool to construct homomorphisms between the shift pseudogroups of directed graphs and thus also their full groups of shifts. We will establish which of these diagrams produce…

In this paper we consider the mixed tensor space of a $\mathbb Z_2$-graded vector space. We obtain a spanning set of invariants of the associated symmetric algebra under the action of the general linear supergroup as well as the queer…

In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically been applied to Graph Isomorphism. In particular, we show…

Let $R$ be a semilocal principal ideal domain. Two algebraic objects over $R$ in which scalar extension makes sense (e.g. quadratic spaces) are said to be of the same genus if they become isomorphic after extending scalars to all…

The isomorphism problem is a fundamental problem in network analysis, which involves capturing both low-order and high-order structural information. In terms of extracting low-order structural information, graph isomorphism algorithms…

The state-of-the-art solvers for the graph isomorphism problem can readily solve generic instances with tens of thousands of vertices. Indeed, experiments show that on inputs without particular combinatorial structure the algorithms scale…

We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak near unanimity polymorphism $\phi$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is…

We prove a categorical duality between a class of abstract algebras of partial functions and a class of (small) topological categories. The algebras are the isomorphs of collections of partial functions closed under the operations of…

Subgraph isomorphism is a well-known NP-hard problem which is widely used in many applications, such as social network analysis and knowledge graph query. Its performance is often limited by the inherent hardness. Several insightful works…

In recent years many algorithms have been developed for finding patterns in graphs and networks. A disadvantage of these algorithms is that they use subgraph isomorphism to determine the support of a graph pattern; subgraph isomorphism is a…

We study the isoperimetric problem in H-type groups and Grushin spaces, emphasizing a relation between them. We prove existence, symmetry and regularity properties of isoperimetric sets, under a symmetry assumption that depends on the…

We show that among compact subsets of the plane which are drawings of linear graphs, two sets $\sigma$ and $\tau$ are homeomorphic if and only if the corresponding spaces of absolutely continuous functions (in the sense of Ashton and Doust)…

This is a survey of recent progress in several areas of combinatorial algebra. We consider combinatorial problems about free groups, polynomial algebras, free associative and Lie algebras. Our main idea is to study automorphisms and, more…