相关论文: Genetic algorithms and the Andrews-Curtis conjectu…
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…
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…
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.
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…
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…
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…
We show that the Andrews-Curtis conjecture holds for all balanced presentations of the trivial group corresponding to Heegaard diagrams of $S^3$.
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…
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…
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…
The Andrews-Curtis conjecture remains one of the outstanding open problems in combinatorial group theory. It claims that every normally generating $r$-tuple of a free group $F_r$ of rank $r\geq 2$ can be reduced to a basis by means of…
Recent work by Shehper et al. (2024) demonstrated that the well-known Akbulut-Kirby AK(3) balanced presentation of the trivial group is stably AC-equivalent to the trivial presentation. This result eliminates AK(3) as a potential…
Motivated by the search for a counterexample to the Poincar\'e conjecture in three and four dimensions, the Andrews-Curtis conjecture was proposed in 1965. It is now generally suspected that the Andrews-Curtis conjecture is false, but small…
Genetic algorithms are heuristic optimization techniques inspired by Darwinian evolution, which are characterized by successfully finding robust solutions for optimization problems. Here, we propose a subroutine-based quantum genetic…
For any group $G$ and integer $k\ge 2$ the Andrews-Curtis transformations act as a permutation group, termed the Andrews-Curtis group $AC_k(G)$, on the subset $N_k(G) \subset G^k$ of all $k$-tuples that generate $G$ as a normal subgroup…
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…
A conjecture of Dehornoy claims that, given a presentation of an Artin-Tits group, every word that represents the identity can be transformed into the trivial word using the braid relations, together with certain rules (between pairs of…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
We construct a sequence of balanced finite presentations of the trivial group with two generators and two relators with the following property: The minimal number of relations required to demonstrate that a generator represents the trivial…
There is no proof yet of convergence of Genetic Algorithms. We do not supply it too. Instead, we present some thoughts and arguments to convince the Reader, that Genetic Algorithms are essentially bound for success. For this purpose, we…