A. Yu. Olshanskii, M. V. Sapir
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
An introduction to the universal algebra approach to Higman-Thompson groups (including Thompson's group $V$) is given, following a series of lectures by Graham Higman in 1973. In these talks, Higman outlined an algorithm for the conjugacy problem; which although essentially correct fails in certain cases, as we show here. A revised and complete version of the algorithm is written out explicitly. From this, we construct an algorithm for the power conjugacy problem in these groups. Python implementations of these algorithms can be found at [26].
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 points of certain finite state transducers, we show the conjugacy problem in $H$ is decidable (for all inputs). Diekert, Laun and Ushakov have recently shown the word problem in $H$ is solvable in polynomial time, using the power circuit technology of Myasnikov, Ushakov and Won. Building on this work, we show in a strongly generic setting that the conjugacy p…
A classical conjecture by Graham Higman states that the number of conjugacy classes of $U_n(q)$, the group of upper triangular $n\times n$ matrices over $\mathbb{F}_q$, is polynomial in $q$, for all $n$. In this paper we present both positive and negative evidence, verifying the conjecture for $n\le 16$, and suggesting that it probably fails for $n\ge 59$. The tools are both theoretical and computational. We introduce a new framework for testing Higman's conjecture, which involves recurrence relations for the number of conjugacy classed of \emph{pattern groups}. These relations are proved by t…
We give a direct proof that all Higman-Thompson groups of the form $G_{k,1}$ (for $k \ge 2$) are embedded in one another, which is a recent result of N. Matte Bon. This extends the embeddings given by Higman in 1974.
The Higman operations and embeddings of recursive groups
本文提出利用 Higman 运算显式构造递归可枚举整数序列集合的算法，使构造性 Higman 嵌入对广泛群类可行，并引入辅助运算简化过程，同时提及可数群嵌入二生成元群的自动化机制。
We survey recent results about asymptotic functions of groups, obtained by the authors in collaboration with J.-C.Birget, V. Guba and E. Rips. We also discuss methods used in the proofs of these results.
Embedding Higman-Thompson groups of unfolding trees into the Leavitt path algebras
本文将有向图展开树的Higman-Thompson群嵌入Leavitt路代数，并证明有根Leavitt路代数的同构可诱导这些群之间的同构。
A modified proof for Higman's embedding theorem
本文给出Higman嵌入定理的简化证明，通过缩短递归关系与良性子群刻画的论证，并用组合观察替代同态技术引理，使证明更简短。
Higman operations on integer sequences, and embeddings of recursive groups
本文是纪念Victor Mazurov80岁诞辰国际群论会议报告的扩展版，介绍了最新论文中针对不同类型递归群，研究其显式嵌入有限表现群可能性的相关工作。
We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite group with solvable word problem for which there is no effective method that allows, given some non-identity element, to find a morphism onto a finite group in which this element has a non-trivial image. We also prove that the depth function of this group grows faster than any recursive function.
Boone--Higman Embeddings for Contracting Self-Similar Groups
该研究给出简短证明，表明所有收缩自相似群可嵌入有限表现单群，具体通过Röver--Nekrashevych群及一类扭曲Brin--Thompson群实现，简化了此前针对收缩有理相似群的更一般论证。
An explicit algorithm for the Higman Embedding Theorem
本文提出一种算法，对任意递归群G，显式构造其到有限表示群的嵌入，并证明该群可选为2生成元群。
Let G(q) be a finite Chevalley group, where q is a power of a good prime p, and let U(q) be a Sylow p-subgroup of G(q). Then a generalized version of a conjecture of Higman asserts that the number k(U(q)) of conjugacy classes in U(q) is given by a polynomial in q with integer coefficients. In an earlier paper, the first and the third authors developed an algorithm to calculate the values of k(U(q)). By implementing it into a computer program using GAP, they were able to calculate k(U(q)) for G of rank at most 5, thereby proving that for these cases k(U(q)) is given by a polynomial in q. In thi…
Quasi-isometric Higman embeddings and the Dehn function
本文证明满足特定计算枚举条件的有限生成群可拟等距嵌入到 Dehn 函数受计算复杂度控制的有限呈现群中，推广了自由 Burnside 群嵌入结果，并改进了字问题 NP 性与多项式 Dehn 函数嵌入的经典刻画。
Boone-Higman embeddings of $\mathrm{Aut}(F_n)$ and mapping class groups of punctured surfaces
本文证明自同构群 $\mathrm{Aut}(F_n)$ 满足置换型 Boone-Higman 猜想，可嵌入扭曲 Brin-Thompson 群，并推广到映射类群等，且该性质对自由积和正则圈积封闭。
William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for lattice-ordered groups: Theorem: A finitely generated lattice-ordered group has soluble word problem if and only if it can be embedded in an simple lattice-ordered group that can be embedded in a finitely presented lattice-ordered group. The proof uses permutation groups and the ideas used to prove the lattice-ordered group analogue of Higman's Embedding Theorem.
Conjugacy in Rearrangement Groups of Fractals
本文推广链图方法，利用两类重写系统解决多种分形重排群及相关 Thompson 型群的共轭问题，并为 Houghton 群和 Higman–Thompson 群给出新解法。
Explicit construction of benign subgroup for Higman's reversing operation
本文针对Higman翻转运算显式构造良性子群的有限表示母群与子群，为将递归群嵌入有限表示群的通用算法开发推进了一步。
Embedding finitely presented self-similar groups into finitely presented simple groups
该研究证明有限表现自相似群可嵌入有限表现单群，确立这类群满足Boone-Higman猜想，还通过环上矩阵群例子证明$\n\b{GL}_n(\n\b{Q})$的有限生成子群也满足该猜想。
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 develop a theory of average sizes of kernels of generic matrices with support constraints defined in terms of graphs and hypergraphs. We apply this theory to study unipotent groups associated with graphs. In particular, we establish strong uniformity results pertaining to zeta functions enumerating conjugacy classes of these groups. We deduce that the numbers of conjugacy classes of $\mathbf{F}_q$-points of the groups under consideration depend polynomially on $q$. Our approach combines group theory, graph theory, toric geometry, and $p$-adic integration. Our uniformity results are in line …
In this paper we establish some subnormal embeddings of groups into groups with additional properties; in particular embeddings of countable groups into 2-generated groups with some extra properties. The results obtained are generalizations of theorems of P. Hall, R. Dark, B. Neumann, Hanna Neumann, G. Higman on embeddings of that type. Considering subnormal embeddings of finite groups into finite groups with additional properties we bring some illustration to a result of H. Heineken and J. Lennox.
We prove that every countable left-ordered group embeds into a finitely generated left-ordered simple group. Moreover, if the first group has a computable left-order, then the simple group also has a computable left-order. We also obtain a Boone-Higman-Thompson type theorem for left-orderable groups with recursively enumerable positive cones. These embeddings are Frattini embeddings, and isometric whenever the initial group is finitely generated. Finally, we reprove Thompson's theorem on word problem preserving embeddings into finitely generated simple groups and observe that the embedding is …
An embedding of the m-times punctured disc into the n-times punctured disc, for n>m, yields an embedding of the braid group on m strands B_m into the braid group on n strands B_n, called a geometric embedding. The main example consists of adding n-m trivial strands to the right of each braid on m strands. We show that geometric embeddings do not merge conjugacy classes, meaning that if the images of two elements in B_m by a geometric embedding are conjugate in B_n, the original elements are conjugate in B_m. We also show that the result does not hold, in general, for geometric embeddings of ma…
Measure equivalence rigidity among the Higman groups
本文证明具有至少5个生成元的广义 Higman 群对于测度等价是超刚性的，基于非圆柱作用的不变量，推导出格嵌入、Cayley图自同构及轨道等价与$W^*$-超刚性定理。
Embedding hyperbolic groups into finitely presented infinite simple groups
本文回顾了Boone--Higman猜想的历史，并概述了证明双曲群可嵌入有限呈现单群的相关工作。
The main result of this article is that any braided (resp. annular, planar) diagram group $D$ splits as a short exact sequence $1 \to R \to D \to S \to 1$ where $R$ is a subgroup of some right-angled Artin group and $S$ a subgroup of Thompson's group $V$ (resp. $T$, $F$). As an application, we show that several braided diagram groups embeds into Thompson's group $V$, including Higman's groups $V_{n,r}$, groups of quasi-automorphisms $QV_{n,r,p}$, and generalised Houghton's groups $H_{n,p}$.
We observe that the group of all lifts of elements of Thompson's group $T$ to the real line is finitely presented and contains the additive group $\mathbb{Q}$ of the rational numbers. This gives an explicit realization of the Higman embedding theorem for $\mathbb{Q}$, answering a Kourovka notebook question of Martin Bridson and Pierre de la Harpe.
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.
On conjugacy and perturbation of subalgebras
本文研究迹冯·诺依曼代数中子代数的共轭轨道，构造了使具有Haagerup性质或性质(T)的子代数分别具有唯一嵌入的II$_1$因子，并讨论了可分性与密度特征。
Let $k$ be any field and let $G$ be a connected reductive algebraic $k$-group. Associated to $G$ is an invariant first studied by Satake and Tits that is called the index of $G$ (a Dynkin diagram along with some additional combinatorial information). Tits showed that the $k$-isogeny class of $G$ is uniquely determined by its index and the $k$-isogeny class of its anisotropic kernel $G_a$. For the cases where $G$ is absolutely simple, Satake and Tits classified all possibilities for the index of $G$. Let $H$ be a connected reductive $k$-subgroup of maximal rank in $G$. We introduce an invariant…
We show that a construction by Aanderaa and Cohen used in their proof of the Higman Embedding Theorem preserves torsion length. We give a new construction showing that every finitely presented group is the quotient of some $C'(1/6)$ finitely presented group by the subgroup generated by its torsion elements. We use these results to show there is a finitely presented group with infinite torsion length which is $C'(1/6)$, and thus word-hyperbolic and virtually torsion-free.
On explicit embeddings of $\mathbb{Q}$ into finitely presented groups
本文构造了有理数群到有限呈现群及二生成元有限呈现群的显式嵌入，回应了 1990 年代末的相关问题，方法基于 Higman 的整数值序列集合与自由构造技术。
Existential Inclusions of Bi-exact Groups are Conjugacy Representation Rigid
本文证明非顺从双精确群的存在性嵌入中，非平凡共轭交是顺从的，进而结合Bekka和Kalantar的工作，得出拟正则表示的弱等价类在自共轭子群中决定共轭类。
In a seminal paper, Brin demonstrates that the outerautomorphism group of Thompson group $T$ is isomorphic to the cyclic group of order two. In this article, building on characterisation of automorphisms of the Higman-Thompson groups $G_{n,r}$ and $T_{n,r}$ as groups of transducers, we give a new proof, automata theoretic in nature, of Brin's result. We also demonstrate that the group of outerautomorphisms of Thompson's group $V = G_{2,1}$ contains an isomorphic copy of Thompson's group $F$. This extends a result of the author demonstrating that whenever $n \ge 3$ and $1 \le r < n$ the outerau…
Auxiliary free constructions for explicit embeddings of recursive groups
本文提出一种基于HNN-扩张和融合自由积的辅助自由构造，推广了Higman的结构，简化了递归群嵌入方法，并用于在小秩自由群中构造无限生成的良性子群。
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.
Malnormal Subgroups of Finitely Presented Groups
该研究改进了Higman嵌入定理，证明了有限生成群的递归呈示性与非正常嵌入的等距性质之间的关系，并改进了Clapham和Ol'shanskii的定理。
HNN extensions and embedding theorems for groups
本文探讨HNN扩张的起源、发展及其在群作用于树的Bass-Serre理论中的核心地位。
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…
I study embeddings of alternating group of rank five into the Cremona group of rank three. I find all embeddings induced by A_5-del Pezzo fibrations and I study their conjugacy. As an application, I show that there is a series of continuous families of pairwise non-conjugate embeddings of alternating group of rank five into Cr$_3(\mathbb{C})$.
The set $\mathcal S(G)$ of compact subgroups of a Hausdorff topological group $G$ can be equipped with the Vietoris topology. A compact subgroup $K\in\mathcal S(G)$ is isolated up to conjugacy if there is a neighborhood $\mathcal U\subseteq\mathcal S(G)$ of $K$ such that every $L\in\mathcal U$ is conjugate to $K$. In this paper, we characterize compact subgroups of a Lie group that are isolated up to conjugacy. Our characterization depends only on the intrinsic structure of $K$, the ambient Lie group $G$ and the embedding of $K$ into $G$ are irrelevant. In addition, we prove that any continuou…
We generalize the small cancellation theory over hyperbolic groups developed by Olshanskii to the case of relatively hyperbolic groups. This allows us to construct infinite finitely generated groups with exactly $n$ conjugacy classes for every $n\ge 2$. In particular, we give the affirmative answer to the well--known question of the existence of a finitely generated group $G$ other than $\mathbb Z/2\mathbb Z$ such that all nontrivial elements of $G$ are conjugate.
For all sufficiently large odd integers $n$, the following version of Higman's embedding theorem is proved in the variety ${\cal B}_n$ of all groups satisfying the identity $x^n=1$. A finitely generated group $G$ from ${\cal B}_n$ has a presentation $G=\langle A\mid R\rangle$ with a finite set of generators $A$ and a recursively enumerable set $R$ of defining relations if and only if it is a subgroup of a group $H$ finitely presented in the variety ${\cal B}_n$. It follows that there is a 'universal' $2$-generated finitely presented in ${\cal B}_n$ group containing isomorphic copies of all fin…
On the Self-Similarity of Permutational Wreath Products and Their Embedding into Finitely Presented Simple Groups
该研究探讨置换圈积的自相似性，证明特定条件下Scott–Röver–Nekrashevych群的有限表现性与几乎单性，及\boldsymbol{\boldsymbol{Z}^d \rtimes_X G}嵌入有限表现单群，为Boone–Higman猜想提供新群族。
Algorithmically finite, universal, and $*$-universal groups
本文在ceer度框架下研究群字问题，引入更精细度量，证明存在非泛但自由积后泛的$*$-泛群，并研究相关群的指标集。
Representing in Low Rank I: conjugacy, topological and homological aspects
本文研究了有限群的低秩表示性质，探讨了同调良好性质、共轭类以及同余核等关键问题。
We prove that an arbitrary right-angled Artin group $G$ admits a quasi-isometric group embedding into a right-angled Artin group defined by the opposite graph of a tree. Consequently, $G$ admits quasi-isometric group embeddings into a pure braid group and into the area-preserving diffeomorphism groups of the 2--disk and the 2--sphere, answering questions due to Crisp--Wiest and M. Kapovich. Another corollary is that a pure braid group contains a closed hyperbolic manifold group as a quasi-isometrically embedded subgroup up to dimension eight. Finally, we show that the isomorphism problem, conj…
Let $\boldsymbol{G}$ be an algebraic group of exceptional Lie type in characteristic $p$, $G=\boldsymbol{G}^σ$ its fixed-point subgroup under the action of a Steinberg endomorphism $σ$, and $\overline{G}$ an almost simple group with socle $G$. A maximal subgroup $M<\overline{G}$ is called non-generic if it is almost simple and its socle is not isomorphic to a group of Lie type in characteristic $p$. A finite subgroup $H$ of $\boldsymbol{G}$ is Lie primitive if it does not lie in any proper closed positive-dimensional subgroup of $\boldsymbol{G}$; it is Lie imprimitive if it lies in a positive-…
We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all $n\in\mathbb{N}$, a residually free group is of type ${\rm{FP}}_n$ if and only if it is of type ${\rm{F}}_n$. New families of subdirect products of free groups are constructed, including the first examples of finitely presented subgroups that are neither ${\rm{FP}}_\infty$ nor of Stallings-Bieri type. The template for these examples leads to a more constructive characterization of finitely presented residua…
On the finite presentation of subdirect products and the nature of residually free groups
本文建立了VSP判据用于判断群次直积的有限可表示性，并借此刻画了有限可表示的剩余自由群，解决了其子群的共轭与成员问题，还构造了非FP无穷且非Stallings-Bieri型的有限可表示子群新实例。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。