Maria Belk
I am interested in discrete geometryWikipedia, computational geometryWikipedia, and graph theoryWikipedia.
For my thesis, I worked on the following question: Given a configuration of the vertices of a graph in N-dimensional Euclidean space, when can you find a configuration of the graph in 3-dimensions with the same edge lengths? I classified all such graphs with the help of my advisor Robert Connelly.
My current research is focused on questions related to the Kneser-Poulsen conjecture: Consider a collection of possibly overlapping balls in Euclidean space. Suppose that the balls are rearranged so that the distances between the centers of the balls has not decreased. Kneser and Poulsen independently conjectured in the 1950's that the volume of the union of the balls has not decreased. This conjecture has been proven in dimension 2 by Bezdek and Connelly, but it is still open in higher dimensions.
Published papers:
This is a paper with my Ph.D. advisor Robert Connelly. Given a configuration of the vertices of a graph in N-dimensional Euclidean space, when can you find a configuration of the graph in 3-dimensions with the same edge lengths? We answer this question, assuming the 3-realizability of two specific graphs. The link goes to the official journal version.
This is a proof that the two specific graphs are 3-realizable.
Submitted papers:
In this paper, we give an example of a contraction in dimension n such that there is no continuous contraction in dimension 2n-1. It is known that there is always a continuous contraction in dimension 2n.
This paper proves that 4 balls in hyperbolic space satisify the Kneser-Poulsen conjecture.
My Ph.D. thesis, Applications of stress theory: realizing graphs and Kneser-Poulsen, includes material from my two published papers and the second of the submitted papers.
Here are powerpoint slides for four talks that I have given:
Abstract: A graph is d-realizable if, for every realization of the graph in some Euclidean space, there exists a realization in d-dimensional Euclidean space with the same edge lengths. For example, any tree is 1-realizable, but a triangle is not. In this talk, we will classify all 3-realizable graphs.
Abstract: We play a game on a graph where zombies wander around the graph trying to catch and eat a person. The zombie number of the graph is the number of zombies needed to catch the person, assuming the person can move much faster than the zombies. I will show how zombie number is related to treewidth and discuss some of the forbidden minors.
Abstract: Consider a collection of overlapping balls in Euclidean space. If we change the positions of the balls, then the volume of the union may change. In the 1950's, Kneser and Poulsen conjectured that if the distances between the centers do not decrease, then the volume of the union must increase or remain the same. In 2002, Bezdek and Connelly proved this conjecture for discs on the Euclidean plane. The conjecture remains open for higher dimensional Euclidean spaces, as well as for spherical and hyperbolic spaces. In this talk, we will examine the difficulties involved in extending the proof to these other settings.