Related papers: Polynomial-time isomorphism test of groups that ar…

We say that a polynomial automorphism $\phi $ in $n$ variables is stably co-tame if the tame subgroup in $n$ variables is contained in the subgroup generated by $\phi $ and affine automorphisms in $n+1$ variables. In this paper, we give…

In this paper, we introduce two generalizations of the tame subgroup of the automorphism group of a polynomial ring over a domain of positive characteristic. We study detailed structures of these new `tame subgroups' in the case of two…

In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects. In this work we show…

Extraspecial groups form a remarkable subclass of p-groups. They are also present in quantum information theory, in particular in quantum error correction. We give here a polynomial time quantum algorithm for finding hidden subgroups in…

We have developed polynomial-time algorithms to generate terms of the cogrowth series for groups $\mathbb{Z}\wr \mathbb{Z},$ the lamplighter group, $(\mathbb{Z}\wr \mathbb{Z})\wr \mathbb{Z}$ and the Navas-Brin group $B.$ We have also given…

We claimed that there is a polynomial algorithm to test if two graphs are isomorphic. But the algorithm is wrong. It only tests if the adjacency matrices of two graphs have the same eigenvalues. There is a counterexample of two…

Let $k$ be a field of characteristic $p>0$. Call a finite group $G$ a poco group over $k$ if any finitely generated cohomological Mackey functor for $G$ over $k$ has polynomial growth. The main result of this paper is that $G$ is a poco…

In an earlier paper of Cadek, Vokrinek, Wagner, and the present authors, we investigated an algorithmic problem in computational algebraic topology, namely, the computation of all possible homotopy classes of maps between two topological…

This thesis provides an explanation of L\'aszl\'o Babai's quasi-polynomial algorithm for the Graph Isomorphism Problem published in 2015 with a particular focus on the case of local certificates, i.e. the case that cannot be dealt with by…

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…

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…

We continue our investigation of a variation of the group ring isomorphism problem for twisted group algebras. Contrary to previous work, we include cohomology classes which do not contain any cocycle of finite order. This allows us to…

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

Fix a positive integer $g$ and a squarefree integer $m$. We prove the existence of a genus $g$ curve $C/\mathbb{Q}$ such that the mod $m$ representation of its Jacobian is tame. The method is to analyse the period matrices of hyperelliptic…

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…

In this paper we propose the PCP-like theorem for sub-linear time inapproximability. Abboud et al. have devised the distributed PCP framework for sub-quadratic time inapproximability. We show that the distributed PCP theorem can be…

New results on metric ultraproducts of finite simple groups are established. We show that the isomorphism type of a simple metric ultraproduct of groups $X_{n_i}(q)$ ($i\in I$) for $X\in\{{\rm PGL},{\rm PSp},{\rm PGO}^{(\varepsilon)},{\rm…

We show that there is a dense set $\ourset\subseteq \mathbb{N}$ of group orders and a constant $c$ such that for every $n\in \ourset$ we can decide in time $O(n^2(\log n)^c)$ whether two $n\times n$ multiplication tables describe isomorphic…

The mapping class group of a closed surface of genus $g$ is an extension of the Torelli group by the symplectic group. This leads to two natural problems: (a) compute (stably) the symplectic decomposition of the lower central series of the…

We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these…