1 de 1 copias disponibles
Graph colorings and realization of manifolds as leaves
This thesis has two main parts. The first one is devoted to show that, for any infinite connected (repetitive) graph X with finite maximum vertex degree D, there exists a (repetitive) limit-aperiodic coloring by at most D colors. Several direct consequences of this theorem are also derived, like the existence of (repetitive) limit-aperiodic colorings of any (repetitive) tiling of a Riemannian manifold. The second part is devoted to prove that any (repetitive) Riemannian manifold of bounded geometry can be isometrically realized as leaf of a Riemannian (minimal) matchbox manifold, whose leaves have no holonomy. This also uses the previous result about colorings, but it also requires much more technical work concerning the space of pointed Riemannian manifolds with the topology defined by the smooth convergence.
- Formato: PDF
- Tamaño: 1 Kb.
This thesis has two main parts. The first one is devoted to show that, for any infinite connected (repetitive) graph X with finite maximum vertex degree D, there exists a (repetitive) limit-aperiodic coloring by at most D colors. Several direct consequences of this theorem are also derived, like the existence of (repetitive) limit-aperiodic colorings of any (repetitive) tiling of a Riemannian manifold. The second part is devoted to prove that any (repetitive) Riemannian manifold of bounded geometry can be isometrically realized as leaf of a Riemannian (minimal) matchbox manifold, whose leaves have no holonomy. This also uses the previous result about colorings, but it also requires much more technical work concerning the space of pointed Riemannian manifolds with the topology defined by the smooth convergence.
- Formato: PDF
- Tamaño: 1 Kb.
- Lectura offline protegida
- Lectura online
