Breadth-first search and the Andrews-Curtis conjecture

Andrews and Curtis conjectured in 1965 that every balanced presentation of the trivial group can be transformed into a standard presentation by a finite sequence of elementary transformations. Recent computational work by Miasnikov and Myasnikov on this problem has been based on genetic algorithms. We show that a computational attack based on a breadth-first search of the tree of equivalent presentations is also viable, and seems to outperform that based on genetic algorithms. It allows us to extract shorter proofs (in some cases, provably shortest) and to consider the length thirteen case for two generators. We prove that, up to equivalence, there is a unique minimum potential counterexample.

The Fa,b,c conjecture, I

In 1977 a five-part conjecture was made about a family of groups related to trivalent graphs and one part of the conjecture was proved. The conjecture completely determines all finite members of the family. Here we prove another part of the conjecture and foreshadow a paper which completes the proof of the other three parts.

The Fa,b,c conjecture is true, II

In 1977 a five-part conjecture was made about a family of groups related to trivalent graphs and subsequently two parts of the conjecture were proved. The conjecture completely determines all finite members of the family. Here we complete the proof of the conjecture by giving proofs for the remaining three parts. (c) 2006 Elsevier Inc. All rights reserved.

On some Results Related to Köthe's Conjecture

The Köthe conjecture states that if a ring R has no nonzero nil ideals then R has no nonzero nil one-sided ideals. Although for more than 70 years significant progress has been made, it is still open in general. In this paper we survey some results related to the Köthe conjecture as well as some equivalent problems.

Generalization of a Conjecture in the Geometry of Polynomials

In this paper we survey work on and around the following conjecture, which was first stated about 45 years ago: If all the zeros of an algebraic polynomial p (of degree n ≥ 2) lie in a disk with radius r, then, for each zero z1 of p, the disk with center z1 and radius r contains at least one zero of the derivative p′ . Until now, this conjecture has been proved for n ≤ 8 only. We also put the conjecture in a more general framework involving higher order derivatives and sets defined by the zeros of the polynomials.

Toward Clemens' Conjecture in Degrees between 10 and 24

1 Supported in part by the Norwegian Research Council for Science and the Humanities. It is a pleasure for this author to thank the Department of Mathematics of the University of Sofia for organizing the remarkable conference in Zlatograd during the period August 28-September 2, 1995. It is also a pleasure to thank the M.I.T. Department of Mathematics for its hospitality from January 1 to July 31, 1993, when this work was started. 2Supported in part by NSF grant 9400918-DMS.

Hilbert-Smith Conjecture for K - Quasiconformal Groups

MSC 2010: 30C60

Remarks on the Nagata Conjecture

2000 Mathematics Subject Classification: 14C20, 14E25, 14J26.

Smale's Conjecture on Mean Values of Polynomials and Electrostatics

2000 Mathematics Subject Classification: Primary 30C10, 30C15, 31B35.

A Note About the Nowicki Conjecture on Weitzenböck Derivations

2000 Mathematics Subject Classification: 13N15, 13A50, 16W25.

Finite dimensional ordered vector spaces with Riesz interpolation and Effros-Shen's unimodularity conjecture

Peer reviewed

The proof of Kontsevich's periodicity conjecture on noncommutative birational transformations

For an arbitrary associative unital ring RR, let J1J1 and J2J2 be the following noncommutative, birational, partly defined involutions on the set M3(R)M3(R) of 3×33×3 matrices over RR: J1(M)=M−1J1(M)=M−1 (the usual matrix inverse) and J2(M)jk=(Mkj)−1J2(M)jk=(Mkj)−1 (the transpose of the Hadamard inverse).

We prove the surprising conjecture by Kontsevich that (J2∘J1)3(J2∘J1)3 is the identity map modulo the DiagL×DiagRDiagL×DiagR action (D1,D2)(M)=D−11MD2(D1,D2)(M)=D1−1MD2 of pairs of invertible diagonal matrices. That is, we show that, for each MM in the domain where (J2∘J1)3(J2∘J1)3 is defined, there are invertible diagonal 3×33×3 matrices D1=D1(M)D1=D1(M) and D2=D2(M)D2=D2(M) such that (J2∘J1)3(M)=D−11MD2(J2∘J1)3(M)=D1−1MD2.

Foil rolling : a new interpretation of experimental results

This paper explores a new interpretation of experiments on foil rolling. The assumption that the roll remains convex is relaxed so that the strip profile may become concave, or thicken in the roll gap. However, we conjecture that the concave profile is associated with phenomena which occur after the rolls have stopped. We argue that the yield criterion must be satisfied in a nonconventional manner if such a phenomenon is caused plastically. Finite element analysis on an extrusion problem appears to confirm this conjecture.

Numerical investigations of linear least squares methods for derivative estimation

The results of a numerical investigation into the errors for least squares estimates of function gradients are presented. The underlying algorithm is obtained by constructing a least squares problem using a truncated Taylor expansion. An error bound associated with this method contains in its numerator terms related to the Taylor series remainder, while its denominator contains the smallest singular value of the least squares matrix. Perhaps for this reason the error bounds are often found to be pessimistic by several orders of magnitude. The circumstance under which these poor estimates arise is elucidated and an empirical correction of the theoretical error bounds is conjectured and investigated numerically. This is followed by an indication of how the conjecture is supported by a rigorous argument.