Search for dissertations about: "convex geometry"
Showing result 1 - 5 of 32 swedish dissertations containing the words convex geometry.
-
1. Positive vector bundles in complex and convex geometry
Abstract : This thesis concerns various aspects of the geometry of holomorphic vector bundles and their analytical theory which all, vaguely speaking, are related to the notion of positive curvature in general, and L^2-methods for the dbar-equation in particular. The thesis contains four papers. READ MORE
-
2. Multipoint Okounkov bodies
Abstract : During the nineties, the field medallist Okounkov found a way to associate to an ample line bundle L over an n−complex dimensional projective manifold X a convex body in Rn, now called Okounkov body ∆(L). The construction depends on the choice of a valuation centered at one point p∈X and it works even if L is a big line bundle. READ MORE
-
3. Simple homotopy type of the Hamiltonian Floer complex
Abstract : For an aspherical symplectic manifold M, closed or with convex contact boundary, and with vanishing first Chern class, a Floer chain complex is defined for Hamiltonians linear at infinity with coefficients in the group ring of the fundamental group of M. For two non-degenerate Hamiltonians of the same slope continuation maps are shown to be simple homotopy equivalences. READ MORE
-
4. Robust Water Balance Modeling with Uncertain Discharge and Precipitation Data : Computational Geometry as a New Tool
Abstract : Models are important tools for understanding the hydrological processes that govern water transport in the landscape and for prediction at times and places where no observations are available. The degree of trust placed on models, however, should not exceed the quality of the data they are fed with. READ MORE
-
5. Fixed-Parameter Algorithms for Optimal Convex Partitions and Other Results
Abstract : In this thesis I study two-dimensional geometric optimization problems for which it is difficult to find efficient, exact, deterministic algorithms. All known solutions to these problems require time that is exponential in the total size of the input. READ MORE
