中文
相关论文

相关论文: Conjugacy problem for subgroups with applications …

200 篇论文

Our main theorem is that the word problem in the Artin group G = <a,b,c | aba=bab, ac=ca, {}_{n}(b,c) = {}_{n}(c,b) > for n >= 5 can be solved using a system R of length preserving rewrite rules that, together with free reduction, can be…

群论 · 数学 2023-10-27 Derek F. Holt , Sarah Rees

Given a group $G$ and a subgroup $H$, we let $\mathcal{O}_G(H)$ denote the lattice of subgroups of $G$ containing $H$. This paper provides a classification of the subgroups $H$ of $G$ such that $\mathcal{O}_{G}(H)$ is Boolean of rank at…

We discuss time complexity of The Conjugacy Problem in HNN-extensions of groups, in particular, in Miller's groups. We show that for "almost all", in some explicit sense, elements, the Conjugacy Problem is decidable in cubic time. It is…

In this paper we generalize techniques of Belk-Matucci to solve the conjugacy problem for every Thompson-like group $V_n(H)$, where $n \geq 2$ and $H$ is a subgroup of the symmetric group on $n$ elements. We use this to prove that, if $n…

群论 · 数学 2018-08-07 Julio Aroca

Let $G$ be a Garside group with Garside element $\Delta$, and let $\Delta^m$ be the minimal positive central power of $\Delta$. An element $g\in G$ is said to be 'periodic' if some power of it is a power of $\Delta$. In this paper, we study…

几何拓扑 · 数学 2015-03-17 Eon-Kyung Lee , Sang-Jin Lee

We prove an analogue of the Centralizer Theorem in the context of Artin-Tits groups.

群论 · 数学 2016-05-24 Oussama Ajbal , Eddy Godelle

In this paper we give an algorithm for computing the conjugacy growth series for a right-angled Artin group, based on a natural language of minimal length conjugacy representatives. In addition, we provide a further language of unique…

群论 · 数学 2023-12-01 Laura Ciobanu , Susan Hermiller , Valentin Mercier

Let $S$ be a semigroup. The elements $a,b\in S$ are called primarily conjugate if $a=xy$ and $b=yx$ for certain $x,y\in S$. The relation of conjugacy is defined as the transitive closure of the relation of primary conjugacy. In the case…

群论 · 数学 2007-05-23 Ganna Kudryavtseva

Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's approach to Artin's braid groups, it has been extended to more and more…

群论 · 数学 2014-02-25 Patrick Dehornoy , Volker Gebhardt

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…

Weanalyzethecomputationalcomplexityofanalgorithmtosolve the conjugacy search problem in a certain family of metabelian groups. We prove that in general the time complexity of the conjugacy search problem for these groups is at most…

群论 · 数学 2019-03-27 Jonathan Gryak , Delaram Kahrobaei , Conchita Martinez-Perez

We study topological aspects of supersolvable abelian arrangements, toric arrangements in particular. The complement of such an arrangement sits atop a tower of fiber bundles, and we investigate the relationship between these bundles and…

代数拓扑 · 数学 2026-05-12 Christin Bibby , Daniel C. Cohen , Emanuele Delucchi

An element in Artin's braid group $B_n$ is called periodic if it has a power which lies in the center of $B_n$. The conjugacy problem for periodic braids can be reduced to the following: given a divisor $1\le d<n-1$ of $n-1$ and an element…

几何拓扑 · 数学 2017-05-05 Eon-Kyung Lee , Sang-Jin Lee

In 1951, Higman constructed a remarkable group $$H=\left\langle a,b,c,d \, \left| \, b^a = b^2, c^b = c^2, d^c = d^2, a^d = a^2 \right. \right\rangle$$ and used it to produce the first examples of infinite simple groups. By studying fixed…

群论 · 数学 2019-02-19 Owen Baker

We give an algorithm to solve the Conjugacy Problem for ascending HNN-extensions of free groups. To do this, we give algorithms to solve certain problems on dynamics of free group endomorphisms.

群论 · 数学 2025-10-08 Alan D. Logan

In this note, we provide a (super-exponential time) algorithm to solve the generalized conjugacy problem in relatively hyperbolic groups, given solvability of the generalized conjugacy problem in each of the parabolic subgroups.

群论 · 数学 2022-02-24 Chris Karpinski

Let G be a simple algebraic group of adjoint type over an algebraically closed field of bad characteristic. We show that its sheets of conjugacy classes are parametrized by G-conjugacy classes of pairs (M,O) where M is the identity…

表示论 · 数学 2022-08-18 Filippo Ambrosio , Giovanna Carnovale , Francesco Esposito

We characterize twisted right-angled Artin groups whose finitely generated subgroups are also twisted right-angled Artin groups. Additionally, we give a classification of coherence within this class of groups in terms of the defining graph.…

群论 · 数学 2025-05-01 Simone Blumer , Islam Foniqi , Claudio Quadrelli

In this paper, we show that for every abelian subgroup $H$ of a Garside group, some conjugate $g^{-1}Hg$ consists of ultra summit elements and the centralizer of $H$ is a finite index subgroup of the normalizer of $H$. Combining with the…

几何拓扑 · 数学 2008-07-23 Eon-Kyung Lee , Sang Jin Lee

This paper proposes for every $n$, linear time reductions of the word and conjugacy problems on the braid groups $B_n$ to the corresponding problems on the braid monoids $B_n^+$ and moreover only using positive words representations.

群论 · 数学 2007-09-26 Serge Burckel