Inasa Nakamura (Saga University): Transformations of partial matchings and their presenting dotted graphs

A partial matching is a finite graph consisting of edges and vertices of degree one or zero. Partial matchings are useful for describing RNA secondary structures in a mathematical viewpoint. We consider transformations between two states of partial matchings. We introduce a method of presenting transformations between partial matchings, in terms of lattice presentations and lattice polytopes. Further we explain dotted graphs and their transformations that are related to transformations of lattice polytopes.