中文
相关论文

相关论文: The twisted conjugacy problem for pairs of endomor…

200 篇论文

We consider groups $G$ such that the set $[G,\varphi]=\{g^{-1}g^{\varphi}|g\in G\}$ is a subgroup for every automorphism $\varphi$ of $G$, and we prove that there exists such a group $G$ that is finite and nilpotent of class $n$ for every…

群论 · 数学 2024-05-15 Chiara Nicotera

In this article, we solve the twisted conjugacy problem with respect to endomorphisms for solvable Baumslag--Solitar groups $BS(1,n)$, i.e., we propose an algorithm which, given two elements $u,v \in BS(1,n)$ and an endomorphism $\psi \in…

群论 · 数学 2026-02-12 Mallika Roy

We study groups $G$ where the $\varphi$-conjugacy class $[e]_{\varphi}=\{g^{-1}\varphi(g)~|~g\in G\}$ of the unit element is a subgroup of $G$ for every automorphism $\varphi$ of $G$. If $G$ has $n$ generators, then we prove that the $k$-th…

群论 · 数学 2017-05-22 Daciberg Gonçalves , Timur Nasybullov

In this note we solve the twisted conjugacy problem for braid groups, i.e. we propose an algorithm which, given two braids $u,v\in B_n$ and an automorphism $\phi \in Aut (B_n)$, decides whether $v=(\phi (x))^{-1}ux$ for some $x\in B_n$. As…

群论 · 数学 2011-05-02 Juan González-Meneses , Enric Ventura

We construct two practical algorithms for twisted conjugacy classes of polycyclic-by-finite groups. The first algorithm determines whether two elements of a group are twisted conjugate for two given endomorphisms, under the condition that…

群论 · 数学 2021-10-22 Karel Dekimpe , Sam Tertooy

In this article, we solve the twisted conjugacy problem for solvable Baumslag--Solitar groups $BS(n,1)$, i.e., we propose an algorithm which, given two elements $u,v \in BS(n,1)$ and an automorphism $\varphi \in \Aut(BS(n,1))$, decides…

群论 · 数学 2025-08-07 Oorna Mitra , Mallika Roy , Enric Ventura

A group $G$ is twisted conjugacy separable if for every automorphism $\varphi$, distinct $\varphi$-twisted conjugacy classes can be separated in a finite quotient. Likewise, $G$ is completely twisted conjugacy separable if for any group $H$…

群论 · 数学 2026-03-04 Sam Tertooy

The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…

群论 · 数学 2016-05-03 Alexei Miasnikov , Paul E. Schupp

Suppose, $G$ is a residually finite group of finite upper rank admitting an automorphism $\varphi$ with finite Reidemeister number $R(\varphi)$ (the number of $\varphi$-twisted conjugacy classes). We prove that such $G$ is soluble-by-finite…

群论 · 数学 2022-10-04 Evgenij Troitsky

Let $N$ be a finitely generated nilpotent group. Algorithm is constructed such, that for every automorphism $\phi \in Aut(N)$ defines the Reidemeister number $R(\phi).$ It is proved that any free nilpotent group of rank $r = 2$ or $r = 3$…

群论 · 数学 2020-10-19 V. Roman'kov

This paper initiates the study of effective twisted conjugacy separability for finitely generated groups, which measures the complexity of separating distinct twisted conjugacy classes via finite quotients. The focus is on nilpotent groups,…

群论 · 数学 2018-08-27 Jonas Deré , Mark Pengitore

We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…

群论 · 数学 2007-05-23 O. Bogopolski , A. Martino , O. Maslakova , E. Ventura

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…

群论 · 数学 2008-10-03 Martin R. Bridson

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

群论 · 数学 2007-05-23 Inna Bumagin , Olga Kharlampovich , Alexei Miasnikov

We establish a connection between the generalized conjugacy problem for a $G$-by-$\mathbb{Z}$ group, $GCP(G \rtimes \mathbb{Z})$, and two algorithmic problems for $G$: the generalized Brinkmann's conjugacy problem, $GBrCP(G)$, and the…

群论 · 数学 2022-11-21 André Carvalho

Let $F$ be a free group of finite rank. We say that the monomorphism problem in $F$ is decidable if for any two elements $u$ and $v$ in $F$, there is an algorithm that determines whether there exists a monomorphism of $F$ that sends $u$ to…

群论 · 数学 2009-10-13 Laura Ciobanu , Abderezak Ould Houcine

We describe an algorithm for deciding whether or not a given finitely generated torsion-free nilpotent group is decomposable as the direct product of nontrivial subgroups.

群论 · 数学 2015-12-18 Gilbert Baumslag , Charles F. Miller , Gretchen Ostheimer

We consider twisted conjugacy classes of continuous automorphisms $\varphi$ of a Lie group $G$. We obtain a necessary and sufficient condition on $\varphi$ for its Reidemeister number, the number of twisted conjugacy classes, to be infinite…

群论 · 数学 2026-04-10 Ravi Prakash , Riddhi Shah

Given a group $G$ and an endomorphism $\varphi$ of $G$, two elements $x, y \in G$ are said to be $\varphi$-conjugate if $x = gy \varphi(g)^{-1}$ for some $g \in G$. The number of equivalence classes for this relation is the Reidemeister…

群论 · 数学 2023-10-12 Pieter Senden

Let $k$ be an algebraically closed field, $G$ a linear algebraic group over $k$ and $\varphi\in Aut(G)$, the group of all algebraic group automorphisms of $G$. Two elements $x, y$ of $G$ are said to be $\varphi$-twisted conjugate if…

群论 · 数学 2020-09-23 Sushil Bhunia , Anirban Bose
‹ 上一页 1 2 3 10 下一页 ›