Approximate random k-colouring of a graph G=(V,E) is a very well studied problem in computer science, discrete mathematics and statistical physics. It amounts to constructing a k-colouring of G which is distributed close to Gibbs distribution in polynomial time. In this talk, we deal with the problem when the underlying graph is an instance of E...
Creator:
Efthymiou, Charilaos (Georgia Institute of Technology)
Created:
2015-05-18
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
The language of Riemannian geometry arises naturally in the elastic description of amorphous solids, yet in the long history of elasticity it was put to very little practical use as a computational tool. In recent years the usage of Riemannian terminology has been revived, mostly in the context of incompatible irreversible deformations. In this ...
Creator:
Efrati, Efi (University of Chicago)
Created:
2011-05-16
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
Thin elastic sheets are very common in both natural andman-made structures. The configurations these structures assume in space are often very complex and may contain many length scales, even in the case ofunconstrained thin sheets. We will show that in some cases, a simple intrinsicgeometry leads to complex three-dimensional configurations, and...
Creator:
Efrati, Efi (Hebrew University)
Created:
2008-07-21
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
Cartographic Details: Scale 1:5,448,960 ; 86 English miles to 1 in. (E 65°--E 100°/N 38°--N 1°). Relief shown by hachures and spot heights. Possibly from Stanford's London Atlas of Universal Geography."London Atlas Series." Date from previous call number. Shows international and administrative boundaries, railways, roads, submarine cables.
Creator:
Edward Stanford Ltd.
Created:
1890
Contributed By:
University of Minnesota Libraries, John R. Borchert Map Library.