https://www.math.toronto.edu/~drorbn/papers/OnVassiliev/OnVassiliev.pdf

On the Vassiliev knot invariants

Termination of term rewriting using dependency pairs

In the past two decades, there have been far-reaching developments in the problem of determining all finite non-abelian simple groups—so much so, that many people now believe that the solution to the problem is imminent. And now, as I correct these proofs in October 1980, the solution has just been announced. Of course, the solution will have a considerable effect on many related areas, both within group theory and outside. The purpose of this article is to consider the theory of finite permutation groups with the assumption that the finite simple groups are known, and to examine questions such as: which problems are solved or solvable under this assumption, and what important problems remain?

Finite permutation groups and finite simple groups

Fay has described in [2,3] a complete T-unification for equational theories T which possess a complete set of reductions as defined by Knuth & Bendix [12] This algorithm relies essentially on using the narrowing process defined by Lankford [13] In this paper, we first study the relations between narrowing and unification and we give a new version of Fay's algorithm We then show how to eliminate many redundancies in this algorithm and give a sufficient condition for the termination of the algorithm In a last part, we show how to extend the previous results to various kinds of canonical term rewriting systems

Canonical Forms and Unification

The paper reports on the development of a 2D geometric constraint solver. The solver is a major component of a new generation of cad systems based on a high-level geometry representation. The solver uses a graph-reduction directed algebraic approach, and achieves interactive speed. The paper describes the architecture of the solver and its basic capabilities. Then, it discusses in detail how to extend the scope of the solver, with particular emphasis on the theoretical and human factors involved in finding a solution, in an exponentially large search space, so that the solution is appropriate to the application, and so that the way of finding it is intuitive for an untrained user.

/pdf/geometric-constraint-solver-1rperl7hbt.pdf

Geometric constraint solver

/pdf/computational-problems-in-abstract-algebra-3jzn29cfpn.pdf

Computational Problems in Abstract Algebra

Five Tables Relating to Rational Cuboids.

/pdf/groups-of-primes-having-maximum-density-3pklektdix.pdf

John Leech

Papers

Computational Problems in Abstract Algebra

Five Tables Relating to Rational Cuboids.

Groups of primes having maximum density