arXiv math/03043062003-04-21math.GRcs.NEcs.SC

Genetic algorithms and the Andrews-Curtis conjecture

Alexei D. Miasnikov

备注：: 19 pages
发表信息：: International Journal of Algebra and Computation, Vol. 9 No. 6, (1999) 671-686

英文摘要：

The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be transformed into the trivial presentation by a finite sequence of "elementary transformations" which are Nielsen transformations together with an arbitrary conjugation of a relator. It is believed that the Andrews-Curtis conjecture is false; however, not so many possible counterexamples are known. It is not a trivial matter to verify whether the conjecture holds for a given balanced presentation or not. The purpose of this paper is to describe some non-deterministic methods, called Genetic Algorithms, designed to test the validity of the Andrews-Curtis conjecture. Using such algorithm we have been able to prove that all known (to us) balanced presentations of the trivial group where the total length of the relators is at most 12 satisfy the conjecture. In particular, the Andrews-Curtis conjecture holds for the presentation <x,y|x y x = y x y, x^2 = y^3> which was one of the well known potential counterexamples.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Balanced presentations of the trivial group on two generators and the Andrews-Curtis conjecture

The Andrews-Curtis conjecture states that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of the elementary Nielsen transformations and conjugations. In this paper we describe all balanced presentations of the trivial group on two generators and with the total length of relators <= 12. We show that all these presentations satisfy the Andrews-Curtis conjecture.

2003-04-21cs.SCmath.GR

On the Andrews-Curtis conjecture and algorithms from topology

We relate the Andrews-Curtis conjecture to the triviality problem for balanced presentations of groups using algorithms from 3-manifold topology. Implementing this algorithm could lead to counterexamples to the Andrews-Curtis conjecture.

2001-08-08math.GRmath.GT

The Andrews-Curtis Conjecture and Black Box Groups

The paper discusses the Andrews-Curtis graph of a normal subgroup N in a group G. The vertices of the graph are k-tuples of elements in N which generate N as a normal subgroup; two vertices are connected if one them can be obtained from another by certain elementary transformations. This object appears naturally in the theory of black box finite groups and in the Andrews-Curtis conjecture in algebraic topology. We suggest an approach to the Andrews-Curtis conjecture based on the study of Andrews-Curtis graphs of finite groups, discuss properties of Andrews-Curtis graphs of some classes of fini…

2001-11-06math.GR

On conjectures of Andrews and Curtis

It is shown that the original Andrews--Curtis conjecture on balanced presentations of the trivial group is equivalent to its "cyclic" version in which, in place of arbitrary conjugations, one can use only cyclic permutations. This, in particular, proves a satellite conjecture of Andrews and Curtis made in 1966. We also consider a more restrictive "cancellative" version of the cyclic Andrews--Curtis conjecture with and without stabilizations and show that the restriction does not change the Andrews--Curtis conjecture when stabilizations are allowed. On the other hand, the restriction makes the …

2016-06-27math.GRmath.GT

On Andrews-Curtis conjectures for soluble groups

The Andrews-Curtis conjecture claims that every normally generating $n$-tuple of a free group $F_n$ of rank $n \ge 2$ can be reduced to a basis by means of Nielsen transformations and arbitrary conjugations. Replacing $F_n$ by an arbitrary finitely generated group yields natural generalizations whose study may help disprove the original and unsettled conjecture. We prove that every finitely generated soluble group satisfies the generalized Andrews-Curtis conjecture in the sense of Borovik, Lubotzky and Myasnikov. In contrast, we show that some soluble Baumslag-Solitar groups do not satisfy the…

2017-11-29math.GR

The Finitary Andrews-Curtis Conjecture

The well known Andrews-Curtis Conjecture [2] is still open. In this paper, we establish its finite version by describing precisely the connected components of the Andrews-Curtis graphs of finite groups. This finite version has independent importance for computational group theory. It also resolves a question asked in [5] and shows that a computation in finite groups cannot lead to a counterexample to the classical conjecture, as suggested in [5].

2011-03-07math.GR

更多相关论文收起更多论文

稳定Andrews-Curtis猜想与平凡群的可加厚表示

The stable Andrews-Curtis conjecture and thickenable presentations of the trivial group

University of Oxford（牛津大学）

本文通过建立稳定Andrews-Curtis移动次数的显式上界，证明了平凡群的可加厚平衡表示满足（非稳定）Andrews-Curtis猜想。

2026-06-04math.GRmath.GT

通过假表面和Zeeman猜想稳定安德鲁斯-库特里斯猜想

Stable Andrews-Curtis Conjecture via Fake Surfaces and Zeeman Conjecture

University of California, Santa Barbara（加州大学圣塔芭芭拉分校）；Chern Institute of Mathematics and LPMC, Nankai University（南开大学陈省身数学研究所与理论物理研究中心）

本文通过归纳法证明复杂度小于6的可收缩假表面可3变形到一个点，从而支持稳定的安德鲁斯-库特里斯猜想。

2026-01-08math.GRmath.GT

Andrews-Curtis and Nielsen equivalence relations on some infinite groups

The Andrews-Curtis conjecture asserts that, for a free group $F_n$ of rank $n$ and a free basis $(x_1,...,x_n)$, any normally generating tuple $(y_1,...,y_n)$ is Andrews-Curtis equivalent to $(x_1,...,x_n)$. This equivalence corresponds to the actions of $\operatorname{Aut}F_n$ and of $F_n$ on normally generating $n$-tuples. The equivalence corresponding to the action of $\operatorname{Aut}F_n$ on generating $n$-tuples is called Nielsen equivalence. The conjecture for arbitrary finitely generated group has its own importance to analyse potential counter-examples to the original conjecture. We …

2014-09-17math.GR

The complexity of balanced presentations and the Andrews-Curtis conjecture

Motivated by problems in topology, we explore the complexity of balanced group presentations. We obtain large lower bounds on the complexity of Andrews-Curtis trivialisations, beginning in rank 4. Our results are based on a new understanding of how Dehn functions of groups behave under certain kinds of push-outs. We consider groups $S$ with presentations of deficiency 1 satisfying certain technical conditions and construct balanced group presentations $¶_w$ indexed by words $w$ in the generators of $S$. If $w=1$ in $S$ then $¶_w$ is Andrews-Curtis trivialisable and the number of Andrews-Curtis…

2015-04-16math.GRmath.GT

Conjugacy search problem and the Andrews-Curtis conjecture

We develop new computational methods for studying potential counterexamples to the Andrews-Curtis conjecture, in particular, Akbulut-Kurby examples AK(n). We devise a number of algorithms in an attempt to disprove the most interesting counterexample AK(3). To improve metric properties of the search space (which is a set of balanced presentations of the trivial group) we introduce a new transformation (called an ACM-move here) that generalizes the original Andrews-Curtis transformations and discuss details of a practical implementation. To reduce growth of the search space we introduce a strong…

2016-09-01math.GR

On the Andrews-Curtis equivalence

The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of ``elementary transformations" which are Nielsen transformations augmented by arbitrary conjugations. It is a prevalent opinion that this conjecture is false; however, not many potential counterexamples are known. In this paper, we show that some of the previously proposed examples are actually not counterexamples. We hope that the tricks we used in constructing relevant chains of elementary transformations will be useful to those who attempt to establis…

2003-02-07math.GRmath.GT

A counterexample to a strong version of the Andrews-Curtis conjecture

We prove that the presentations $\langle x,y | [x,y],1 \rangle$ and $\langle x,y | [x,[x,y^{-1}]]^2y[y^{-1},x]y^{-1},[x,[[y^{-1},x],x]] \rangle$ are not $Q^*$-equivalent even though their standard complexes have the same simple homotopy type.

2018-06-29math.ATmath.GRmath.GT

Representation theory, topological field theory, and the Andrews-Curtis conjecture

We pose a representation-theoretic question motivated by an attempt to resolve the Andrews-Curtis conjecture. Roughly, is there a triangular Hopf algebra with a collection of self-dual irreducible representations $V_i$ so that the product of any two decomposes as a sum of copies of the $V_i$, and $\sum (\rank V_i)^2=0$? This data can be used to construct a `topological quantum field theory' on 2-complexes which stands a good chance of detecting counterexamples to the conjecture.

1992-02-14hep-thmath.GRmath.QA

关于 Andrews-Curtis 群：非有限展示性

On the Andrews-Curtis groups: non-finite presentability

本文定义了一类广义 Andrews-Curtis 群 $\{A_{r,s}\}$，并证明 $A_{2,s}$（$s \geq 1$）是非有限展示的，从而得出 AC($F_2$) 是非有限展示的，部分回答了关于其有限展示性的著名问题。

2023-05-19math.GR

Andrews-Curtis 群

Andrews-Curtis groups

本文研究 Andrews-Curtis 群，证明对非初等无挠双曲群，完全 Andrews-Curtis 群到 Andrews-Curtis 群的自然满态射是同构，从而简化了相关猜想的研究。

2025-07-02math.GR

重新审视AK(3)的稳定Andrews-Curtis平凡化：基于自动演绎的案例研究

Stable Andrews-Curtis trivialization of AK(3) revisited. A case study using automated deduction

本文使用自动定理证明器Prover9为平凡群的AK(3)平衡表示与平凡表示的稳定AC等价性提供了替代证明，排除了其作为稳定Andrews-Curtis猜想反例的可能，并提出开发相关计算搜索方法的挑战。

2025-01-17cs.LOmath.GR

通过4-流形三分解实现的一族Andrews-Curtis平凡化

A family of Andrews-Curtis trivializations via 4-manifold trisections

本文利用4-流形三分解技术，证明了由R-链环族 $L(3,2;4/d)$ 对应的所有群展示对所有 $d$ 均是Andrews-Curtis平凡的。

2023-04-06math.GRmath.GT

在长度为14的安德鲁斯 - 柯蒂斯边界处的机器可验证等价证书

Machine-checkable equivalence certificates at the length-14 Andrews-Curtis frontier

研究安德鲁斯 - 柯蒂斯猜想在长度为14时的等价性，通过证明六个困难表示中的四个AC等价性得到机器可验证证书，还进行相关分析和程序推导，实现了部分等价性并补充了相关分析，使MS(3) 分支无条件坍缩。

2026-07-28math.GR