Related papers: Identifying normal and congruence subgroups
We give an overview of the Hidden Subgroup Problem (HSP) as of July 2010, including new results discovered since the survey of arXiv:quant-ph/0411037v1. We recall how the problem provides a framework for efficient quantum algorithms and…
We prove that, given $\epsilon>0$ and $k\geq 1$, there is an integer $n$ such that the following holds. Suppose $G$ is a finite group and $A\subseteq G$ is $k$-stable. Then there is a normal subgroup $H\leq G$ of index at most $n$, and a…
We introduce the subgroup identification problem, and show that there is a finitely presented group G for which it is unsolvable, and that it is uniformly solvable in the class of finitely presented locally Hopfian groups. This is done as…
An algorithm is given to compute a normal form for hyperelliptic curves. The elliptic case has been treated in a previous paper. In this paper the hyperelliptic case is treated.
We consider the lattice of subsemigroups of the general linear group over an Artinian ring containing the group of diagonal matrices and show that every such semigroup is actually a group.
Complex real-world networks commonly reveal characteristic groups of nodes like communities and modules. These are of value in various applications, especially in the case of large social and information networks. However, while numerous…
This is a report on our long term project to find an algorithm to decide if a finitely presented group has a non-trivial action on a tree.
In this paper we consider the {\em conjugacy stability} property of subgroups and provide effective procedures to solve the problem in several classes of groups. In particular, we start with free groups, that is, we give an effective…
We show a rigidity result for subfactors that are normalized by a representation of a lattice $\Gamma$ in a higher rank simple Lie group with trivial center into a finite factor. This implies that every subfactor of $L\Gamma$ which is…
We study a relation between the Hecke groups and the index of subfactors in a von Neumann algebra. Such a problem was raised by V. F. R. Jones. We solve the problem using the notion of a cluster C*-algebra.
We give three programs on computer for finding the subgroupoids, wide subgroupoids and normal subgroupoids of a finite groupoid.
A group G is a cn-group if for each subgroup H of G there exists a normal subgroup N of G such that the index of both H and N in HN is finite. The class of cn-groups contains properly the classes of core- finite groups and that of groups in…
Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its…
We consider group-subgroup pairs in which the group is a semidirect product and the subgroup is contained in the normal part. We give conditions for the pair to be a Hecke pair and we show that the enveloping Hecke algebra and Hecke…
The problem of computing the index of a coincidence isometry of the hyper cubic lattice $\mathbb{Z}^{n}$ is considered. The normal form of a rational orthogonal matrix is analyzed in detail, and explicit formulas for the index of certain…
We compute the trace decategorification of the Hecke category for an arbitrary Coxeter group. More generally, we introduce the notion of a strictly object-adapted cellular category and calculate the trace for such categories.
We classify the pairs $(C,G)$ where $C$ is a seminormal curve over an arbitrary field $k$ and $G$ is a smooth connected algebraic group acting faithfully on $C$ with a dense orbit, and we determine the equivariant Picard group of $C$. We…
We present an algorithm which decides whether a given quasiconvex residually finite subgroup $H$ of a hyperbolic group $G$ is associated with a splitting. The methods developed also provide algorithms for computing the number of filtered…
We prove that Hall subgroups of finite simple groups are pronormal. Thus we obtain an affirmative answer to Problem 17.45(a) of "Kourovka notebook".
Let $G$ be a finite group and $N$ a normal subgroup of $G$. We determine the structure of $N$ when the diameter of the graph associated to the $G$-conjugacy classes contained in $N$ is as large as possible, that is, is equal to three.