Related papers: The conjugacy problem in $GL(n,Z)$

We prove that if $G$ is finite 2-generated $p$-group of nilpotence class at most 2 then the group algebra of $G$ with coefficients in the field with $p$ elements determines $G$ up to isomorphisms.

Many quantum algorithms for attacking symmetric cryptography involve the rank problem of quantum linear equations. In this paper, we first propose two quantum algorithms for solving quantum linear systems of equations with coherent…

For a prime $p$, we describe a protocol for handling a specific type of fusion system on a $p$-group by computer. These fusion systems contain all saturated fusion systems. This framework allows us to computationally determine whether or…

The efficient solution of large-scale multiterm linear matrix equations is a challenging task in numerical linear algebra, and it is a largely open problem. We propose a new iterative scheme for symmetric and positive definite operators,…

We show how to construct highly symmetric algorithms for matrix multiplication. In particular, we consider algorithms which decompose the matrix multiplication tensor into a sum of rank-1 tensors, where the decomposition itself consists of…

We establish a connection between the generalized conjugacy problem for a $G$-by-$\mathbb{Z}$ group, $GCP(G \rtimes \mathbb{Z})$, and two algorithmic problems for $G$: the generalized Brinkmann's conjugacy problem, $GBrCP(G)$, and the…

In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…

We investigate linearity of amalgams of subgroups of algebraic groups along intersections with algebraic subgroups. In the process, we establish linearity of certain "doubles" of linear groups, and obtain new examples of finitely generated…

We discuss the time complexity of the word and conjugacy search problems for free products $G = A \star_C B$ of groups $A$ and $B$ with amalgamation over a subgroup $C$. We stratify the set of elements of $G$ with respect to the complexity…

Weanalyzethecomputationalcomplexityofanalgorithmtosolve the conjugacy search problem in a certain family of metabelian groups. We prove that in general the time complexity of the conjugacy search problem for these groups is at most…

A systematic algorithm for building integrating factors of the form mu(x,y), mu(x,y') or mu(y,y') for second order ODEs is presented. The algorithm can determine the existence and explicit form of the integrating factors themselves without…

Let $M_n(\mathbb{Z})$ the ring of $n$-by-$n$ matrices with integral entries, and $n \geq 2$. This paper studies the set $G_n(\mathbb{Z})$ of pairs $(A,B) \in M_n(\mathbb{Z})^2$ generating $M_n(\mathbb{Z})$ as a ring. We use several…

The maximal clique problem, to find the maximally sized clique in a given graph, is classically an NP-complete computational problem, which has potential applications ranging from electrical engineering, computational chemistry,…

An element $\phi$ of the outer automorphism group $\Out(\f)$ of the rank $n$ free group $F_n$ is {\it polynomially growing} if the word lengths of conjugacy classes in $\f$ grow at most polynomially under iteration by $\phi$. It is {\it…

This thesis contains a collection of algorithms for working with the twisted groups of Lie type known as Suzuki groups, and small and large Ree groups. The two main problems under consideration are constructive recognition and constructive…

The existing doubling algorithms have been proven efficient for several important nonlinear matrix equations arising from real-world engineering applications. In a nutshell, the algorithms iteratively compute a basis matrix, in one of the…

In his earlier work, the author introduced a group theory question that arises in the study of iterated Galois groups of post-critically finite quadratic polynomials. In this paper, we prove the first non-trivial results on this question.

We develop methods for computing with matrix groups defined over a range of infinite domains, and apply those methods to the design of algorithms for nilpotent groups. In particular, we provide a practical algorithm to test nilpotency of…

In this paper we study the complexity of solving quadratic equations in the lamplighter group. We give a complete classification of cases (depending on genus and other characteristics of a given equation) when the problem is…

Using the computational algebra system GAP (http://www.gap-system.org) and the GAP package LAGUNA (http://www.cs.st-andrews.ac.uk/~alexk/laguna.htm), we checked that all 2-groups of order not greater than 32 are determined by normalized…