Related papers: Polycyclic groups and profinite isomorphism

We study simplicial profinite groups with a view towards applications in profinite combinatorial group theory. This approach provides a natural framework to the concept of pro-$\mathfrak{C}$-presentation of a pro-$\mathfrak{C}$-group $G$ as…

We classify affine varieties with an action of a connected, reductive algebraic group such that the group is isomorphic to an open orbit in the variety. This is accomplished by associating a set of one-parameter subgroups of the group to…

We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our…

It is proved that the profinite completion of the mapping class group Mod (g,n) of a surface of genus g with n boundary components is isomorphic to such of the arithmetic group GL(6g-6+2n, Z). We establish a relation between the normal…

We investigate actions of cyclic groups on polynomial rings with two variables, and the minimal free resolution of the corresponding invariant ring. In particular, we fully classify several cases, including the case the defining ideal has…

This is one of a series papers which aim towards to solve the problem of determining automorphism groups of Frobenius groups. This one solves the problem in the case where the Frobenius kernels are elementary abelian and Frobenius…

Consider the abelian category ${\mathcal C}$ of commutative group schemes of finite type over a field $k$, its full subcategory ${\mathcal F}$ of finite group schemes, and the associated pro category ${\rm Pro}({\mathcal C})$ (resp. ${\rm…

Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…

Let $p$ be a prime number, $G$ be a finite $p$-group and $K$ be a field of characteristic $p$. The Modular Isomorphism Problem (MIP) asks whether the group algebra $KG$ determines the group $G$. Dealing with MIP, we investigated a question…

Let $G$ be a group. The BCI problem asks whether two Haar graphs of $G$ are isomorphic if and only if they are isomorphic by an element of an explicit list of isomorphisms. We first generalize this problem in a natural way and give a…

We prove that there exist profinite Heyting algebras that are not isomorphic to the profinite completion of any Heyting algebra. This resolves an open problem from 2009. More generally, we characterize those varieties of Heyting algebras in…

In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…

We undertake the study of profinite quandles. We provide several constructions of profinite quandles from profinite groups, and from other profinite quandle. We characterize which subquandles of profinite quandles are again profinite.…

We define and study the class of positively finitely related (PFR) profinite groups. Positive finite relatedness is a probabilistic property of profinite groups which provides a first step to defining higher finiteness properties of…

We prove that if $G$ is a finite simple group which is the unit group of a ring, then $G$ is isomorphic to either (a) a cyclic group of order 2; (b) a cyclic group of prime order $2^k -1$ for some $k$; or (c) a projective special linear…

We initiate a systematic study of the perfection of affine group schemes of finite type over fields of positive characteristic. The main result intrinsically characterises and classifies the perfections of reductive groups, and obtains a…

In this article, we study the properties of profinite geometric iterated monodromy groups associated to polynomials. Such groups can be seen as generic representations of absolute Galois groups of number fields into the automorphism group…

In this article, we explore the problem of determining isomorphisms between the twisted complex group algebras of finite $p$-groups. This problem bears similarity to the classical group algebra isomorphism problem and has been recently…

We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.

We present a new algorithm to decide isomorphism between finite graded algebras. For a broad class of nilpotent Lie algebras, we demonstrate that it runs in time polynomial in the order of the input algebras. We introduce heuristics that…