|
Papers on Computer Science methods in Algebra 1.
Balanced presentations of the trivial group on
two generators and the Andrews-Curtis conjecture (with A.D. Miasnikov). Groups
and computation, III (Columbus, OH, 1999), 257-263. Ohio State Univ. Math.
Res. Inst. Publ. 8, Using computers we described all trivial (perfect) groups given by balanced presentations of length at most 12. Then we proved (again using computers and genetic algorithms) that every balanced presentation on two generators of the trivial group satisfies the AC conjecture. 2. Whitehead method and Genetic Algorithms (with A.D.
Miasnikov). Computational and experimental group
theory, 89-114, Contemp. Math., 349, Amer. Math. Soc., We describe a genetic Whitehead's algorithm for finding minimal elements (elements of minimal length in automorphic orbits) in arbitrary free groups. The classical Whitehead's algorithm is extremely innefective for free groups of big ranks, but this genetic version of it works all right. Also we formulate several mathematical conjectures that came out of our experiments. 3. Pattern Recognition and Minimal Words in Free Groups of Rank 2 (with R.M. Haralick and A.D. Miasnikov). Submitted. We describe a linear time probabilistic algorithm to recognize Whitehead minimal elements (elements of minimal length in their automorphic orbits) in free groups of rank 2. Moreover, for a non-minimal element the algorithm gives an automorphism that will most likely reduce the length of the element. This method is based on linear regression and pattern recognition techniques. I did not believe this myself first, untill I've seen it working with my own eyes. 4.
Pattern
Recognition Approaches to Solving Combinatorial Problems in Free Groups (with
R.M. Haralick and A.D. Miasnikov), Contemp. Math., 349,
Amer. Math. Soc., Providence, RI, 2004,
197-213. In this survey paper we present some pattern recognition techniques that can be used in studying free groups. As an illustration we apply these methods to Whitehead minimization problem. |