Related papers: Identifying normal and congruence subgroups

Let $G$ be a semisimple simply-connected algebraic group over an algebraically closed field of characteristic zero. We prove that the affine Hecke category associated to the loop group of $G$ is equivalent to the colimit, evaluated in the…

The Profinite Isomorphism Problem for a class of groups \mathcal{C} asks for an algorithm that decides for any two groups in \mathcal{C} whether they have isomorphic profinite completions. We present the positive solution to this problem…

A graph is called normal if its vertex set can be covered by cliques and also by stable sets, such that every such clique and stable set have non-empty intersection. This notion is due to Korner, who introduced the class of normal graphs as…

In this paper we give full description of normal subgroups of index eight and ten for the group.

We examine $p$-groups with the property that every non-normal subgroup has a normalizer which is a maximal subgroup. In particular we show that for such a $p$-group $G$, when $p=2$, the center of $G$ has index at most 16 and when $p$ is odd…

We present a new algorithm for computing the first discrete homology group of a graph. By testing the algorithm on different data sets of random graphs, we find that it significantly outperforms other known algorithms.

We present a simple and flexible method to prove consistency of semidefinite optimization problems on random graphs. The method is based on Grothendieck's inequality. Unlike the previous uses of this inequality that lead to constant…

We compute the M\"obius function for the subgroup lattice of the simple Suzuki group $Sz(q)$; this is used to enumerate normal subgroups of certain Hecke groups with quotients isomorphic to $Sz(q)$.

Computing the embedding distribution of a given graph is a fundamental question in topological graph theory. In this article, we extend our viewpoint to a sequence of graphs and consider their asymptotic embedding distributions, which are…

Let $G$ be a finite group and let $H$ be a proper subgroup of $G$ of minimal index. By applying an old result of Y. Berkovich, we provide a polynomial algorithm for computing $|G : H|$ for a permutation group $G$. Moreover, we find $H$…

Can we do a topological study of various classes of normal subgroups endowed with a hull-kernel-type topology? In this paper, we have provided an answer to this question. We have introduced as well a new class of normal subgroups called…

We prove that the topological complexity of a finite index subgroup of a hyperbolic group is linear in its index. This follows from a more general result relating the size of the quotient of a free cocompact action of hyperbolic group on a…

Two classic results, due to K. Doerk and P. Hall respectively, establish the solvability of those finite groups all of whose maximal subgroups are supersolvable, and the solvability of finite groups in which all maximal subgroups have prime…

In this article we prove that for any saturated fusion system, that the (unique) smallest weakly normal subsystem of it on a given strongly closed subgroup is actually normal. This has a variety of corollaries, such as the statement that…

We consider the following problem stated by Vdovin (2010) in the "Kourovka notebook" (Problem 17.41): Let $H$ be a solvable subgroup of a finite group $G$ that has no nontrivial solvable normal subgroups. Do there always exist five…

An integral of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. In this paper, we prove that the integrability of a finite group is a decidable problem.

Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…

In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups,…

Finite $p$-groups with a unique $\mathcal{A}_2$-subgroup are classified up to isomorphism. A problem proposed by Berkovich and Janko is solved.

We describe an algorithm for determining whether two convex polytopes P and Q, embedded in a lattice, are isomorphic with respect to a lattice automorphism. We extend this to a method for determining if P and Q are equivalent, i.e. whether…