Up | ||
Degree Sequence Packing with Applications to Discrete TomographyJames ShookApplied and Computational Mathematics Division, NIST Tuesday, April 28, 2015 15:00-16:00, In discrete tomography, a branch of discrete imaging science, the goal is to reconstruct discrete objects using data acquired from low-dimensional projections. Specifically, in the $k$-color discrete tomography problem the goal is to color the entries of an $m \times n$ matrix using $k$ colors so that each row and column receive a prescribed number of entries of each color. This problem is equivalent to packing the degree sequences of $k$ bipartite graphs with parts of sizes $m$ and $n$. In this talk we will define degree sequence packing, present some new results and discuss how our results are related to the 2-color discrete tomography problem. This is joint work with Jennifer Diemunsch, Michael Ferrara, Sogol Jahanbekam of the University of Colorado-Denver. Speaker Bio: Dr James Shook obtained a B.S. in Mathematics from the University of Maryland. With the support of a GAANN fellowship he earned a M.S. and Ph.D. in Mathematics from the University of Mississippi. James started in August 2011, as a National Research Council Postdoctoral Research Associate in the Applied and Computational Mathematics Division in the ITL at NIST. Dr. Shook is interested in structural graph theory and the evolution of affiliations in social networks. Contact: B. Cloteaux Note: Visitors from outside NIST must contact Cathy Graham; (301) 975-3800; at least 24 hours in advance. |