Three-page encoding and complexity theory for spatial graphs
We construct a series of finitely presented semigroups. The centers of these semigroups encode uniquely up to rigid ambient isotopy in 3-space all non-oriented spatial graphs. This encoding is obtained by using three-page embeddings of graphs into the product of the line with the cone on three points. By exploiting three-page embeddings we introduce the notion of the three-page complexity for spatial graphs. This complexity satisfies the properties of finiteness and additivity under natural operations.
PERIPHERALLY SPECIFIED HOMOMORPHS OF LINK GROUPS
Johnson and Livingston have characterized peripheral structures in homomorphs of knot groups. We extend their approach to the case of links. The main result is an algebraic characterization of all possible peripheral structures in certain homomorphic images of link groups.
Compressed Drinfeld associators
Drinfeld associator is a key tool in computing the Kontsevich integral of knots. A Drinfeld associator is a series in two non-commuting variables, satisfying highly complicated algebraic equations - hexagon and pentagon. The logarithm of a Drinfeld associator lives in the Lie algbera L generated by the symbols a,b,c modulo [a,b]=[b,c]=[c,a]. The main result is a description of compressed associators that satisfy the compressed pentagon and hexagon in the quotient L/[[L,L],[L,L]]. The key ingredient is an explicit form of Campbell-Baker-Hausdorff formula in the case when all commutators commute.