Back to results

Virginia Tech

Plane Permutations and their Applications to Graph Embeddings and Genome Rearrangements

Abstract

dc:description.abstract

Maps have been extensively studied and are important in many research fields. A map is a 2-cell embedding of a graph on an orientable surface. Motivated by a new way to read the information provided by the skeleton of a map, we introduce new objects called plane permutations. Plane permutations not only provide new insight into enumeration of maps and related graph embedding problems, but they also provide a powerful framework to study less related genome rearrangement problems. As results, we refine and extend several existing results on enumeration of maps by counting plane permutations filtered by different criteria. In the spirit of the topological, graph theoretical study of graph embeddings, we study the behavior of graph embeddings under local changes. We obtain a local version of the interpolation theorem, local genus distribution as well as an easy-to-check necessary condition for a given embedding to be of minimum genus. Applying the plane permutation paradigm to genome rearrangement problems, we present a unified simple framework to study transposition distances and block-interchange distances of permutations as well as reversal distances of signed permutations. The essential idea is associating a plane permutation to a given permutation or signed permutation to sort, and then applying the developed plane permutation theory.

Degree

thesis:*
Name thesis:degree_name
Ph. D.
Level thesis:degree_level
doctoral
Discipline thesis:degree_discipline
Mathematics
Department dc:contributor.department
Mathematics
Grantor dc:publisher
Virginia Tech
Year dc:date.issued
2017

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Chen, Xiaofeng
Chair dc:contributor.committeechair
  • Reidys, Christian Michael
Committee members dc:contributor.committeemember
  • Mortveit, Henning S.
  • Haskell, Peter E.
  • Floyd, William J.

Subjects

dc:subject × 4

Rights

dc:rights
Statement dc:rights
  • In Copyright

Identifiers

dc:identifier.*
Dc Identifier Other
vt_gsexam:10619
OAI identifier oai:identifier
oai:vtechworks.lib.vt.edu:10919/77535

Chain of custody

source
Harvested from
Virginia Tech
Base URL
vtechworks.lib.vt.edu/oai/request
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
citation

Chen, Xiaofeng. Plane Permutations and their Applications to Graph Embeddings and Genome Rearrangements. doctoral thesis, Virginia Tech, 2017. http://hdl.handle.net/10919/77535