相关论文: Conjugacy in Artin groups of extra-large type

We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…

The Tits Conjecture, proved by Crisp and Paris, states that squares of the standard generators of any Artin group generate an obvious right-angled Artin subgroup. We consider a larger set of elements consisting of all the centers of the…

The Baumslag group had been a candidate for a group with an extremely difficult word problem until Myasnikov, Ushakov, and Won succeeded to show that its word problem can be solved in polynomial time. Their result used the newly developed…

We consider several algorithmic problems concerning geodesics in finitely generated groups. We show that the three geodesic problems considered by Miasnikov et al [arXiv:0807.1032] are polynomial-time reducible to each other. We study two…

We conjecture that the word problem of Artin-Tits groups can be solved without introducing trivial factors ss^{-1} or s^{-1}s. Here we make this statement precise and explain how it can be seen as a weak form of hyperbolicity. We prove the…

We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…

There are several graphs defined on groups. Among them we consider graphs whose vertex set consists conjugacy classes of a group $G$ and adjacency is defined by properties of the elements of conjugacy classes. In particular, we consider…

We prove that any Artin group of large type is shortlex automatic with respect to its standard generating set, and that the set of all geodesic words over the same generating set satisfies the Falsification by Fellow-Traveller Property…

We study, from a constructive computational point of view, the techniques used to solve the conjugacy problem in the "generic" lattice-ordered group Aut(R) of order automorphisms of the real line. We use these techniques in order to show…

We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…

In this paper, we study the structure of finite groups with a large number of conjugacy classes of $p$-elements for some prime $p$. As consequences, we obtain some new criteria for the existence of normal $p$-complements in finite groups.

In this paper a relation between iterated cyclings and iterated powers of elements in a Garside group is shown. This yields a characterization of elements in a Garside group having a rigid power, where 'rigid' means that the left normal…

We prove several results on the model theory of Artin groups, focusing on Artin groups which are ``far from right-angled Artin groups''. The first result is that if $\mathcal{C}$ is a class of Artin groups whose irreducible components are…

We show that the class of $\mathcal{C}$-hereditarily conjugacy separable groups is closed under taking arbitrary graph products whenever the class $\mathcal{C}$ is an extension closed variety of finite groups. As a consequence we show that…

We show that two-dimensional Artin groups satisfy a strengthening of the Tits alternative: their subgroups either contain a non-abelian free group or are virtually free abelian of rank at most $2$. When in addition the associated Coxeter…

For every integer l bigger than one, we find elements x and y in the mapping class group of an appropriate orientable surface S, satisfying the Artin relation of length l. That is, xyx... = yxy..., where each side of the equality contains l…

Consider an element~$x$ of a Garside group which is rigid in the sense of Garside-theory. Let $SC(x)$ be the set of rigid conjugates of~$x$ -- this is a well-known characteristic subset of the conjugacy class of~$x$. We present…

We show that Artin groups of extra-large type, and more generally Artin groups of large and hyperbolic type, are hierarchically hyperbolic. This implies in particular that these groups have finite asymptotic dimension and uniform…

Several key agreement protocols are based on the following "Generalized Conjugacy Search Problem": Find, given elements b_1,...,b_n and xb_1x^{-1},...,xb_nx^{-1} in a nonabelian group G, the conjugator x. In the case of subgroups of the…

We have proved in [Topology, 45 1 (2006)] that fundamental groups of oriented geometrizable 3-manifolds have a solvable conjugacy problem. We now consider the case of groups of non-oriented geometrizable 3-manifolds in order to conclude…