Lombardi Drawings of Graphs

We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line segments or polylines, and the vertices have perfect angular resolution: the edges are equally spaced around each vertex. We describe algorithms for finding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs.Comment: Expanded version of paper appearing in the 18th International Symposium on Graph Drawing (GD 2010). 13 pages, 7 figure

Precise Partitions Of Large Graphs

First by using an easy application of the Regularity Lemma, we extend some known results about cycles of many lengths to include a specified edge on the cycles. The results in this chapter will help us in rest of this thesis. In 2000, Enomoto and Ota posed a conjecture on the existence of path decomposition of graphs with fixed start vertices and fixed lengths. We prove this conjecture when |G| is large. Our proof uses the Regularity Lemma along with several extremal lemmas, concluding with an absorbing argument to retrieve misbehaving vertices. Furthermore, sharp minimum degree and degree sum conditions are proven for the existance of a Hamiltonian cycle passing through specified vertices with prescribed distances between them in large graphs. Finally, we prove a sharp connectivity and degree sum condition for the existence of a subdivision of a multigraph in which some of the vertices are specified and the distance between each pair of vertices in the subdivision is prescribed (within one)

Hierarchical freezing in a lattice model

A certain two-dimensional lattice model with nearest and next-nearest neighbor interactions is known to have a limit-periodic ground state. We show that during a slow quench from the high temperature, disordered phase, the ground state emerges through an infinite sequence of phase transitions. We define appropriate order parameters and show that the transitions are related by renormalizations of the temperature scale. As the temperature is decreased, sublattices with increasingly large lattice constants become ordered. A rapid quench results in glass-like state due to kinetic barriers created by simultaneous freezing on sublattices with different lattice constants.Comment: 6 pages; 5 figures (minor changes, reformatted

Efficient Algorithms for Graph-Theoretic and Geometric Problems

This thesis studies several different algorithmic problems in graph theory and in geometry. The applications of the problems studied range from circuit design optimization to fast matrix multiplication. First, we study a graph-theoretical model of the so called ''firefighter problem''. The objective is to save as much as possible of an area by appropriately placing firefighters. We provide both new exact algorithms for the case of general graphs as well as approximation algorithms for the case of planar graphs. Next, we study drawing graphs within a given polygon in the plane. We present asymptotically tight upper and lower bounds for this problem Further, we study the problem of Subgraph Isormorphism, which amounts to decide if an input graph (pattern) is isomorphic to a subgraph of another input graph (host graph). We show several new bounds on the time complexity of detecting small pattern graphs. Among other things, we provide a new framework for detection by testing polynomials for non-identity with zero. Finally, we study the problem of partitioning a 3D histogram into a minimum number of 3D boxes and it's applications to efficient computation of matrix products for positive integer matrices. We provide an efficient approximation algorithm for the partitioning problem and several algorithms for integer matrix multiplication. The multiplication algorithms are explicitly or implicitly based on an interpretation of positive integer matrices as 3D histograms and their partitions

Fermion condensation and super pivotal categories

We study fermionic topological phases using the technique of fermion condensation. We give a prescription for performing fermion condensation in bosonic topological phases which contain a fermion. Our approach to fermion condensation can roughly be understood as coupling the parent bosonic topological phase to a phase of physical fermions, and condensing pairs of physical and emergent fermions. There are two distinct types of objects in fermionic theories, which we call "m-type" and "q-type" particles. The endomorphism algebras of q-type particles are complex Clifford algebras, and they have no analogues in bosonic theories. We construct a fermionic generalization of the tube category, which allows us to compute the quasiparticle excitations in fermionic topological phases. We then prove a series of results relating data in condensed theories to data in their parent theories; for example, if $\mathcal{C}$ is a modular tensor category containing a fermion, then the tube category of the condensed theory satisfies $\textbf{Tube}(\mathcal{C}/\psi) \cong \mathcal{C} \times (\mathcal{C}/\psi)$. We also study how modular transformations, fusion rules, and coherence relations are modified in the fermionic setting, prove a fermionic version of the Verlinde dimension formula, construct a commuting projector lattice Hamiltonian for fermionic theories, and write down a fermionic version of the Turaev-Viro-Barrett-Westbury state sum. A large portion of this work is devoted to three detailed examples of performing fermion condensation to produce fermionic topological phases: we condense fermions in the Ising theory, the $SO(3)_6$ theory, and the $\frac{1}{2}\text{E}_6$ theory, and compute the quasiparticle excitation spectrum in each of these examples.Comment: 161 pages; v2: corrected typos (including 18 instances of "the the") and added some reference