Related papers: Black box groups isomorphic to ${\rm PGL}(2,2^e)$

Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…

An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…

For a fixed integer $e \geqslant 3$ and $n$ large enough, we show that the number of congruence classes modulo $2^e$ of characteristic polynomials of $n \times n$ symmetric $\{\pm 1\}$-matrices with constant diagonal is equal to…

A subalgebraic approximation algorithm is proposed to estimate from a set of time series the parameters of the observer representation of a discrete-time polynomial system without inputs which can generate an approximation of the observed…

We discuss a conjecture which says that the automorphism group of the Weyl algebra in characteristic zero is canonically isomorphic to the automorphism group of the corresponding Poisson algebra of classical polynomial symbols. Several…

We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in $1.5 (\Delta + 2) \ln n$ dimensions, where $\Delta$ is the maximum degree of G. We also show that $\boxi(G) \le (\Delta + 2) \ln n$…

We give a polynomial gluing construction of two groups $G_X\subseteq GL(\ell,\mathbb F)$ and $G_Y\subseteq GL(m,\mathbb F)$ which results in a group $G\subseteq GL(\ell+m,\mathbb F)$ whose ring of invariants is isomorphic to the tensor…

In recent years, several powerful techniques have been developed to design {\em randomized} polynomial-space parameterized algorithms. In this paper, we introduce an enhancement of color coding to design deterministic polynomial-space…

We present a deterministic linear-time algorithm for finding an odd cycle through two specified vertices in an undirected graph. This is shown in a generalized form as follows: Let $\Gamma$ be any group in which every element is of order at…

This paper describes a non-deterministic polynomial-time algorithm to find a path of length O(log p loglog p) between any two vertices of the Cayley graph of SL(2,Z/pZ).

The $2 \rightarrow q$ norm of a matrix $X \in \mathbb{R}^{n \times d}$ is defined as $\lVert X \rVert_{2 \rightarrow q} = \sup_{\lVert v \rVert_2 = 1} \lVert Xv \rVert_q$. We give polynomial-time multiplicative approximation algorithms for…

We propose a simple and efficient local algorithm for graph isomorphism which succeeds for a large class of sparse graphs. This algorithm produces a low-depth canonical labeling, which is a labeling of the vertices of the graph that…

The point of this paper is to use affine automorphisms from algebraic geometry to build cryptographic multivariate mappings. We will construct groups G,H, both isomorphic to the cyclic group with a prime number of elements and multilinear…

In this paper we consider the problems of testing isomorphism of tensors, $p$-groups, cubic forms, algebras, and more, which arise from a variety of areas, including machine learning, group theory, and cryptography. These problems can all…

Two groups are said to have the same character table if a permutation of the rows and a permutation of the columns of one table produces the other table. The problem of determining when two groups have the same character table is…

In this article we study a coarse version of the $K$-theoretic Farrell--Jones conjecture we call coarse or bounded isomorphism conjecture. Using controlled category theory we are able to translate this conjecture for asymptotically faithful…

In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…

The mod-p cohomology ring of a non-trivial finite p-group is an infinite dimensional, finitely presented graded unital algebra over the field with p elements, with generators in positive degrees. We describe an effective algorithm to test…

The main result of this paper is a complete classification of the outer automorphism groups of two-generator, one-relator groups with torsion. To this classification we apply recent algorithmic results of Dahmani--Guirardel, which yields an…

We use group theoretic methods to obtain the extended Lie point symmetries of the quantum dynamics of a scalar particle probing the near horizon structure of a black hole. Symmetries of the classical equations of motion for a charged…