相关论文: The Conjugacy Problem and Higman Embeddings

Let G be a finite group and H a normal subgroup such that G/H is cyclic. Given a conjugacy class g^G of G we define its centralizing subgroup to be HC_G(g). Let K be such that H\le K\le G. We show that the G-conjugacy classes contained in K…

We determine, in an inductive framework, the vertices of the polytope $P(s,K)$ controlling the conjugacy classes of elements which product to one in the maximal compact subgroup $K$ of a simple complex algebraic group $G$. This extends…

Hard instances of natural computational problems are often elusive. In this note we present an example of a natural decision problem, the word problem for a certain finitely presented group, whose hard instances are easy to find. More…

For every Turing machine, we construct an automaton group that simulates it. Precisely, starting from an initial configuration of the Turing machine, we explicitly construct an element of the group such that the Turing machine stops if, and…

The question whether a set of formulae G implies a formula f is fundamental. The present paper studies the complexity of the above implication problem for propositional formulae that are built from a systematically restricted set of Boolean…

We investigate the computational complexity of the problem of deciding if an algebra homomorphism can be factored through an intermediate algebra. Specifically, we fix an algebraic language, L, and take as input an algebra homomorphism f…

For a given finite class of finite graphs H, a graph G is called a realization of H if the neighbourhood of its any vertex induces the subgraph isomorphic to a graph of H. We consider the following problem known as the Generalized…

There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by $\sim_p$,…

Let $G$ be a finite group and assume $p$ is a prime dividing the order of $G$. Suppose for any such $p$, that every two abelian $p$-subgroups of $G$ of equal order are conjugate. The structure of such a group $G$ has been settled in this…

Let G be a reductive linear algebraic group over an algebraically closed field of characteristic p > 0. A subgroup of G is said to be separable in G if its global and infinitesimal centralizers have the same dimension. We study the…

The conformal crossing equation puts very stringent constraints on the conformal data. We formulate it in way that makes the conformal symmetry more transparent. This allows for generalization of the crossing equation to arbitrary Lie group…

We study the conjugacy problem in the automorphism group $Aut(T)$ of a regular rooted tree $T$ and in its subgroup $FAut(T)$ of finite-state automorphisms. We show that under the contracting condition and the finiteness of what we call the…

We prove that finite index subgroups of right angled Artin groups are conjugacy separable. We then apply this result to establish various properties of other classes of groups. In particular, we show that any word hyperbolic Coxeter group…

Part 1 : We remark that the conjugacy problem for pairs of hyperbolic au- tomorphisms of a finitely presented group (typically a free group) is decidable. The solution that we propose uses the isomorphism problem for the suspensions, and…

We consider the {\em Deligne-Simpson problem}: {\em Give necessary and sufficient conditions for the choice of the conjugacy classes $c_j\subset gl(n,{\bf C})$ or $C_j\subset GL(n,{\bf C})$, $j=1,..., p+1$, so that there exist irreducible…

Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ the…

Stallings folding theory is modified, using double coset representatives, and to applied to the study of subgroups of amalgamated products of finite rank free groups. As a first application the subgroup membership problem for such groups is…

Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability.…

In this article we study a class of central extensions of $\mathbb{Z}\wr\mathbb{Z}$, as first described by Hall. On the one hand, we consider groups of this type with cyclic centre, our construction yields a rich class of groups. In…

We study irreducible specializations, in particular when group-preserving specializations may not exist. We obtain a criterion in terms of embedding problems. We include several applications to analogs of Schinzel's hypothesis H and to the…