Related papers: The isomorphism problem for Coxeter groups

In this paper, we count factorizations of Coxeter elements in well-generated complex reflection groups into products of reflections. We obtain a simple product formula for the exponential generating function of such factorizations, which is…

In this paper we prove a series of matching theorems for two sets of Coxeter generators of a finitely generated Coxeter group that identify common features of the two sets of generators. As an application, we describe an algorithm for…

This paper considers the planar figure of a combinatorial polytope or tessellation identified by the Coxeter symbol $k_{i,j}$ , inscribed in a conic, satisfying the geometric constraint that each octahedral cell has a centre. This…

Part I of this paper showed that the hidden subgroup problem over the symmetric group--including the special case relevant to Graph Isomorphism--cannot be efficiently solved by strong Fourier sampling, even if one may perform an arbitrary…

In this article, we study two combinatorial problems concerning the set of reflections of a Coxeter system. The first problem asks whether the language of palindromic reduced words for reflections is regular, and the second is about finding…

We study the equivalence relation on the set of acyclic orientations of an undirected graph G generated by source-to-sink conversions. These conversions arise in the contexts of admissible sequences in Coxeter theory, quiver…

In our previous paper math.QA/0409261, we defined a deformation of the group algebra of the group of even elements of a Coxeter group W, and showed that it is flat for all values of parameters if and only if all the rank 3 parabolic…

In this paper, we focus on a question of M. Newman on isomorphic subgroups of solvable groups. We get a reduction theorem of this question: for each prime q, assume that this question holds for every characteristic q-groups, then this…

We establish quasi-isometric rigidity for a class of right-angled Coxeter groups. Let $\Gamma_1,\Gamma_2$ be joins of finite generalized thick $m$-gons with $m\geq 3$. We show that the corresponding right-angled Coxeter groups are…

We study the cohomology ring of the Bott--Samelson variety. We compute an explicit presentation of this ring via Soergel's result, which implies that it is a purely combinatorial invariant. We use the presentation to introduce the…

We classify a class of complex representations of an arbitrary Coxeter group via characters of the integral homology of certain graphs. Such representations can be viewed as a generalization of the geometric representation and correspond to…

We study the automorphisms of a Cayley graph that preserve its natural edge-colouring. More precisely, we are interested in groups G, such that every such automorphism of every connected Cayley graph on G has a very simple form: the…

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…

The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…

We solve Dehn's isomorphism problem for virtually torsion-free relatively hyperbolic groups with nilpotent parabolic subgroups. We do so by reducing the isomorphism problem to three algorithmic problems in the parabolic subgroups, namely…

Similarly to how the classical group ring isomorphism problem asks, for a commutative ring $R$, which information about a finite group $G$ is encoded in the group ring $RG$, the twisted group ring isomorphism problem asks which information…

This paper considers a smaller version of the 26-node presentation of the Bimonster group.

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an…

In this paper, we will present a generalization for a minimization problem from I. Daubechies, M. Defrise, and C. Demol [3]. This generalization is useful for solving many practical problems in which more than one constraint are involved.…

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.