A. Yu. Olshanskii, M. V. Sapir
We prove that every countable group with solvable power problem embeds into a finitely presented 2-generated group with solvable power and conjugacy problems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We prove that a finitely generated solvable group which is not virtually nilpotent has exponential conjugacy growth.
For every finitely generated recursively presented group G we construct a finitely presented group H containing G such that G is (Frattini) embedded into H and the group H has solvable conjugacy problem if and only if G has solvable conjugacy problem. Moreover G and H have the same r.e. Turing degrees of the conjugacy problem. This solves a problem by D. Collins.
We prove that the complexity of the Conjugacy Problems for wreath products and for free solvable groups is decidable in polynomial time. For the wreath product AwrB, we must assume the decidability in polynomial time of the Conjugacy Problems for A and B and of the power problem in B. We obtain the result by making the algorithm for the Conjugacy Problem described in a paper of Matthews run in polynomial time. Using this result and properties of the Magnus embedding, we show that the Conjugacy and Conjugacy Search Problems in free solvable groups are computable in polynomial time.
We show the existence of finitely presented torsion-free groups with decidable word problem that cannot be embedded in any finitely generated group with decidable conjugacy problem. This answers a well-known question of Collins from the early 1970's.
(Free-abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphisms and having unsolvable conjugacy problem are constructed. Along the way, orbit undecidable, free subgroups of GL_d(Z), for d > 5, and Aut(F_d), for d > 4, are constructed as well.
We describe an effective version of the conjugacy problem and study it for wreath products and free solvable groups. The problem involves estimating the length of short conjugators between two elements of the group, a notion which leads to the definition of the conjugacy length function. We show that for free solvable groups the conjugacy length function is at most cubic. For wreath products the behaviour depends on the conjugacy length function of the two groups involved, as well as subgroup distortion within the quotient group.
The purpose of this paper is to consider when two maximal subalgebras of a finite-dimensional solvable Lie algebra $L$ are conjugate, and to investigate their intersection.
It is proved that for any prime $p$ a finitely generated nilpotent group is conjugacy separable in the class of finite $p$-groups if and only if the torsion subgroup of it is a finite $p$-group and the quotient group by the torsion subgroup is abelian.
Conjugacy classes of completely reducible cube-free solvable p'-subgroups of GL(2, q)
本文针对无立方因子正整数m与不整除m的素数p，确定了一般线性群GL(2, q)（q为p的幂）中阶为m的完全可约可解无立方因子子群的共轭类数量。
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$, $\sim_o$, and $\sim_c$) in certain classes of finitely presented monoids. We will show that in the class of polycyclic monoids, $p$-conjugacy is "almost" transitive, $\sim_c$ is strictly included in $\sim_p$, and the $p$- and $c$-conjugacy problems are decidable with linear compexity. For other classes of monoids, the situation is more complicated. We show t…
Groups with 5 nontrivial conjugacy classes of non self-normalizing subgroups are solvable
本研究针对Bianchi等人提出的关于$\mathcal{D}_5$（恰有5个非平凡非自正规子群共轭类的有限群族）由导出长度不超过3的可解群组成的猜想，完成验证并证实该猜想成立。
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 of P. Brinkmann that one can determine whether two cyclic words in a free group are mapped to each other by some power of a given automorphism. The algorithm effectively computes a conjugating element, if it exists. We also solve the power conjugacy problem and give an algorithm to recognize if two given elements of a finitely generated free group are Reideme…
In this paper we introduce the graph $Γ_{sc}(G)$ associated with a group $G$, called the solvable conjugacy class graph (abbreviated as SCC-graph), whose vertices are the nontrivial conjugacy classes of $G$ and two distinct conjugacy classes $C, D$ are adjacent if there exist $x \in C$ and $y \in D$ such that $\langle x, y\rangle$ is solvable. We discuss the connectivity, girth, clique number, and several other properties of the SCC-graph. One of our results asserts that there are only finitely many finite groups whose SCC-graph has given clique number~$d$, and we find explicitly the list of s…
We combine classical methods of combinatorial group theory with the theory of small cancellations over relatively hyperbolic groups to construct finitely generated torsion-free groups that have only finitely many classes of conjugate elements. Moreover, we present several results concerning embeddings into such groups. As another application of these techniques, we prove that every countable group $C$ can be realized as a group of outer automorphisms of a group $N$, where $N$ is a finitely generated group having Kazhdan's property (T) and containing exactly two conjugacy classes.
For a fixed $n\ge2$, the Houghton group $H_n$ consists of bijections of $X_n=\{1,\ldots,n\} \times \mathbb{N}$ that are `eventually translations' of each copy of $\mathbb{N}$. The Houghton groups have been shown to have solvable conjugacy problem. In general solvable conjugacy problem does not imply that all finite extensions and finite index subgroups have solvable conjugacy problem. Our main theorem is that a stronger result holds: for any $n\ge2$ and any group $G$ commensurable to $H_n$, $G$ has solvable conjugacy problem.
We say that a group has property $R_{\infty}$ if any group automorphism has an infinite number of twisted conjugacy classes. Fel'shtyn and Goncalves prove that the solvable Baumslag-Solitar groups BS(1,m) have property $R_{\infty}$. We define a solvable generalization $Γ(S)$ of these groups which we show to have property $R_{\infty}$. We then show that property $R_{\infty}$ is geometric for these groups, that is, any group quasi-isometric to $Γ(S)$ has property $R_{\infty}$ as well.
Given a short exact sequence of groups with certain conditions, $1\to F\to G\to H\to 1$, we prove that $G$ has solvable conjugacy problem if and only if the corresponding action subgroup $A\leqslant Aut(F)$ is orbit decidable. From this, we deduce that the conjugacy problem is solvable, among others, for all groups of the form $\mathbb{Z}^2\rtimes F_m$, $F_2\rtimes F_m$, $F_n \rtimes \mathbb{Z}$, and $\mathbb{Z}^n \rtimes_A F_m$ with virtually solvable action group $A\leqslant GL_n(\mathbb{Z})$. Also, we give an easy way of constructing groups of the form $\mathbb{Z}^4\rtimes F_n$ and $F_3\rti…
Let N be a finitely generated normal subgroup of a Gromov hyperbolic group G. We establish criteria for N to have solvable conjugacy problem and be conjugacy separable in terms of the corresponding properties of G/N. We show that the hyperbolic group from F. Haglund's and D. Wise's version of Rips's construction is hereditarily conjugacy separable. We then use this construction to produce first examples of finitely generated and finitely presented conjugacy separable groups that contain non-(conjugacy separable) subgroups of finite index.
Endo-Twisted Conjugacy and Outer Fixed Points in Solvable Baumslag--Solitar Groups
本文研究了可解鲍姆斯拉-索拉尔群中内扭共轭问题与外固定点的关系，提出算法并探讨其相互作用。
Let $\mathbf{G}$ be a unipotent group scheme defined in terms of a nilpotent Lie lattice over the ring $\mathcal{O}$ of integers of a number field. We consider bivariate zeta functions of groups of the form $\mathbf{G}(\mathcal{O})$ encoding, respectively, the numbers of isomorphism classes of irreducible complex representations of finite dimensions and the numbers of conjugacy classes of congruence quotients of the associated groups. We show that the domains of convergence and meromorphic continuation of these zeta functions of groups $\mathbf{G}(\mathcal{O})$ are independent of the number fi…
We show that every non-decreasing function $f\colon \mathbb N\to \mathbb N$ bounded from above by $a^n$ for some $a\ge 1$ can be realized (up to a natural equivalence) as the conjugacy growth function of a finitely generated group. We also construct a finitely generated group $G$ and a subgroup $H\le G$ of index 2 such that $H$ has only 2 conjugacy classes while the conjugacy growth of $G$ is exponential. In particular, conjugacy growth is not a quasi-isometry invariant.
We prove that fundamental groups of non-orientable 3-manifolds have a solvable conjugacy problem, and construct an algorithm. Together with our earlier work on the conjugacy problem in groups on orientable geometrizable 3-manifolds, all $π_1$ of (geometrizable) 3-manifolds have a solvable conjugacy problem. In corollaries, both the twisted conjugacy problem in closed surface groups and the conjugacy problem in closed surface-by-cyclic groups, are solvable.
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, computably presented groups such that for every element $u_0$ of $G$, the problem of deciding if an arbitrary element is conjugate to $u_0$ is decidable in quadratic time but the worst-case complexity of the global conjugacy problem is arbitrary: it can be any c.e. Turing degree , can exactly mirror the Time Hierarchy Theorem, or can be $\mathcal{NP}$-complet…
We show that the conjugacy problem in a wreath product $A \wr B$ is uniform-$\mathsf{TC}^0$-Turing-reducible to the conjugacy problem in the factors $A$ and $B$ and the power problem in $B$. If $B$ is torsion free, the power problem for $B$ can be replaced by the slightly weaker cyclic submonoid membership problem for $B$. Moreover, if $A$ is abelian, the cyclic subgroup membership problem suffices, which itself is uniform-$\mathsf{AC}^0$-many-one-reducible to the conjugacy problem in $A \wr B$. Furthermore, under certain natural conditions, we give a uniform $\mathsf{TC}^0$ Turing reduction f…
Let $N_1$ (resp., $N_2$) be the normal closure of a finite symmetrized set $R_1$ (resp., $R_2$) of a finitely generated free group $F = F(A)$. It is well-known that if $R_i$ satisfies the condition C(6), then the conjugacy problem is solvable in $F/N_i$. In the present paper we prove that if $R_1\cup R_2$ satisfies the condition C(6) and the presentation $<A\, \mid R_1,R_2>$ is atorical, then the conjugacy problem is solvable in $F/{N_1\cap N_2}$. In particular, if $R_1\cup R_2$ satisfies the condition C(7) then the conjugacy problem is solvable in $F/{N_1\cap N_2}$.
Topological Full Groups of Irreducible Edge Shifts have Solvable Conjugacy Problem
本研究利用链图和交换环半群等方法，解决了不可约边移位的拓扑全群的共轭问题，相关技术可推广至包含Houghton群、类Thompson群$QV$的更大边移位分段典范同胚群类。
Bounding conjugacy depth functions for wreath products of finitely generated abelian groups
本文研究了阿贝尔群圈积的共轭可分性渐近行为，完全刻画了lamplighter群的渐近类并给出了广义lamplighter群及无限基群情形的指数或超指数上下界，进而为非阿贝尔作用群的各种群圈积的共轭深度函数提供了下界。
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 that fundamental groups of geometrizable 3-manifolds all have a solvable conjugacy problem.
A branch group with unsolvable conjugacy problem
本文通过将任意有限生成剩余有限群保持共轭关系地嵌入有限生成分支群，构造出字问题可解但共轭问题不可解的分支群，回答了相关公开问题。
Subgroup Conjugacy Separability in Residually Free Groups
本文研究剩余自由群的子群共轭性质，证明有限展示情形具有子群共轭可分性，$FP_\infty$ 型还具可辨识性，并推出其外自同构群剩余有限。
In this paper we study conjugacy separability of subdirect products of two free (or hyperbolic) groups. We establish necessary and sufficient criteria and apply them to fibre products to produce a finitely presented group $G_1$ in which all finite index subgroups are conjugacy separable, but which has an index $2$ overgroup that is not conjugacy separable. Conversely, we construct a finitely presented group $G_2$ which has a non-conjugacy separable subgroup of index $2$ such that every finite index normal overgroup of $G_2$ is conjugacy separable. The normality of the overgroup is essential in…
The Conjugacy Problem in Wreath Products
研究花环积中共轭问题的可解性条件。通过指出简·马修斯结论的不足，给出新的附加条件。还给出了置换受限花环积中共轭问题可解的充要条件，涉及群\(A\)、\(B\)的共轭问题、幂问题、阶问题等多种条件。
A finitely generated solvable group with unbounded iterated identity is constructed.
A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We prove that the multiple conjugacy problem is solvable between two n-tuples A and B of elements of G whenever the elements of A does not generate an elliptic subgroup. When the edge and vertex groups are infinite cyclic, i.e. G is a Generalized Baumslag-Solitar group, we prove that the multiple conjugacy problem is fully solvable.
In this paper we consider the {\em conjugacy stability} property of subgroups and provide effective procedures to solve the problem in several classes of groups. In particular, we start with free groups, that is, we give an effective procedure to find out if a finitely generated subgroup of a free group is conjugacy stable. Then we further generalize this result to quasi-convex subgroups of torsion-free hyperbolic groups and finitely generated subgroups of limit groups.
We investigate the conjugacy growth of finitely generated linear groups. We show that finitely generated non-virtually-solvable subgroups of GL_d have uniform exponential conjugacy growth and in fact that the number of distinct polynomials arising as characteristic polynomials of the elements of the ball of radius n for the word metric has exponential growth rate bounded away from 0 in terms of the dimension d only.
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 generalized twisted conjugacy problem, $GTCP(G)$. We explore this connection for generalizations of different kinds: relative to finitely generated subgroups, to theirs cosets, or to recognizable, rational, context-free or algebraic subsets of the group. Using this result, we are able to prove that $GBrCP(G)$ is decidable (with respect to cosets) when $G$ is a vi…
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, and our main result shows that there is a polynomial upper bound for twisted conjugacy separability. That allows us to study regular conjugacy separability in the case of virtually nilpotent groups, where we compute a polynomial upper bound as well. As another application, we improve the work of the second author by giving a precise calculation of conjugacy…
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 generalized Stallings' methods, developed by the author, to solve various algorithmic problems concerning finitely generated subgroups of amalgams of finite groups.
Let $G$ be a non-compact semisimple Lie group with finite centre and finitely many components. We show that any finitely generated group $Γ$ which is quasi-isometric to an irreducible lattice in $G$ has the $R_\infty$-property, namely, that there are infinitely $ϕ$-twisted conjugacy classes for every automorphism $ϕ$ of $Γ$. Also, we show that any lattice in $G$ has the $R_\infty$-property, extending our earlier result for irreducible lattices.
A survey of problems, conjectures, and theorems about quasi-isometric classification and rigidity for finitely generated solvable groups.
Independence of the conjugacy problem and conjugacy separability
本文构造出共轭可分性函数任意大但共轭问题能多项式时间求解的有限生成群类，证明麦肯锡共轭问题算法复杂度可与最优解差任意远，揭示共轭问题与共轭可分性的独立性。
It is proved that every finitely generated profinite group with fewer than $2^{\aleph_0}$ conjugacy classes of elements of infinite order is finite
We investigate the palindromic width of finitely generated solvable groups. We prove that every finitely generated $3$-step solvable group has finite palindromic width. More generally, we show the finiteness of palindromic width for finitely generated abelian-by-nilpotent-by-nilpotent groups. For arbitrary solvable groups of step $\geq 3$, we prove that if $G$ is a finitely generated solvable group that is an extension of an abelian group by a group satisfying the maximal condition for normal subgroups, then the palindromic width of $G$ is finite. We also prove that the palindromic width of $\…
We prove that fundamental groups of orientable (geometrizable) 3-manifolds have a solvable conjugacy problem.
We study the notion of weak amalgamation in the context of diagonal conjugacy classes. Generalizing results of Kechris and Rosendal, we prove that for every countable structure $M$, Polish group $G$ of permutations of $M$, and $n \geq 1$, $G$ has a comeager $n$-diagonal conjugacy class iff the family of all $n$-tuples of $G$-extendable bijections between finitely generated substructures of $M$, has the joint embedding property and the weak amalgamation property. We characterize limits of weak Fraïssé classes that are not homogenizable. Finally, we investigate $1$- and $2$-diagonal conjugacy cl…
We use the theory of group actions on profinite trees to prove that the fundamental group of a finite, 1-acylindrical graph of free groups with finitely generated edge groups is conjugacy separable. This has several applications: we prove that positive, $C'(1/6)$ one-relator groups are conjugacy separable; we provide a conjugacy separable version of the Rips construction; we use this latter to provide an example of two finitely presented, residually finite groups that have isomorphic profinite completions, such that one is conjugacy separable and the other does not even have solvable conjugacy…
We study the conjugacy problem in cyclic extensions of free groups. It is shown that the conjugacy problem is solvable in split extensions of finitely generated free groups by virtually inner automorphisms. An algorithm for construction of the unique representative (the conjugacy normal form) for each conjugacy class is given.
Conjugacy Problem for Dehn Twists of Free Products of Free Abelian Groups
研究有限生成自由阿贝尔群自由积的Dehn扭转自同构的共轭问题的可解性。
We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability problem is solvable but the isomorphism problem is unsolvable. These are first examples of such a contrastive complexity behaviour with respect to the isomorphism problem.
We show that conjugacy of reversible cellular automata is undecidable, whether the conjugacy is to be performed by another reversible cellular automaton or by a general homeomorphism. This gives rise to a new family of finitely-generated groups with undecidable conjugacy problems, whose descriptions arguably do not involve any type of computation. For many automorphism groups of subshifts, as well as the group of asynchronous transducers and the homeomorphism group of the Cantor set, our result implies the existence of two elements such that every finitely-generated subgroup containing both ha…
When $G$ is solvable group, we prove that the number of conjugacy classes of elements of prime power order is less than or equal to the number of irreducible characters with values in fields where $\mathbb {Q}$ is extended by prime power roots of unity. We then combine this result with a theorem of Héthelyi and Külshammer that bounds the order of a finite group in terms of the number of conjugacy classes of elements of prime power order to bound the order of a solvable group by the number of irreducible characters with values in fields extended by prime power roots of unity. This yields for so…
Let ${\cal C}$ be a nonempty class of finite groups closed under taking subgroups, homomorphic images and extensions. A subgroup $H$ of an abstract residually ${\cal C}$ group $R$ is said to be conjugacy ${\cal C}$-distinguished if whenever $y\in R$, then $y$ has a conjugate in $H$ if and only if the same holds for the images of $y$ and $H$ in every quotient group $R/N\in {\cal C}$ of $R$. We prove that in a group having a normal free subgroup $Φ$ such that $R/Φ$ is in ${\cal C}$, every finitely generated subgroup is conjugacy ${\cal C}$-distinguished. We also prove that finitely generated sub…
Free-by-cyclic groups are conjugacy separable
本文证明了所有有限生成的自由-循环群都是共轭可分离的，并展示了外自同构群的残余有限性。
We construct a finitely presented group with quadratic Dehn function and undecidable conjugacy problem. This solves E. Rips' problem formulated in 1992. v2: misprints corrected. v3: lemmas 4.7, 4.10 corrected, more misprints fixed.
In 2000, L. Héthelyi and B. Külshammer proved that if $p$ is a prime number dividing the order of a finite solvable group $G$, then $G$ has at least $2\sqrt{p-1}$ conjugacy classes. In this paper we show that if $p$ is large, the result remains true for arbitrary finite groups.
Twisted conjugacy in dihedral Artin groups I: Torus Knot groups
本文针对奇数二面体Artin群的扭曲共轭问题，提出一种基于环面纽结群替代表示和测地线正规形式的线性时间算法，并证明该结果可应用于扩张群中的共轭问题。
We exhibit a family of infinite, finitely-presented, nilpotent-by-abelian groups. Each member of this family is a solvable S-arithmetic group that is related to Baumslag-Solitar groups, and everyone of these groups has a quasi-isometry group that is virtually a product of a solvable real Lie group and a solvable p-adic Lie group. In addition, we propose a candidate for a polycyclic group whose quasi-isometry group is a solvable real Lie group, and we introduce a candidate for a quasi-isometrically rigid solvable group that is not finitely presented. We also record some conjectures on the large…
A group $G$ is called subgroup conjugacy separable (abbreviated as SCS), if any two finitely generated and non-conjugate subgroups of $G$ remain non-conjugate in some finite quotient of $G$. We prove that free groups and the fundamental groups of orientable closed compact surfaces are SCS.
A group $G$ is called subgroup conjugacy separable if for every pair of non-conjugate finitely generated subgroups of $G$, there exists a finite quotient of $G$ where the images of these subgroups are not conjugate. It is proved that the fundamental group of a hyperbolic 3-manifold (closed or with cusps) is subgroup conjugacy separable.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。