Search for dissertations about: "matematik"
Showing result 16 - 20 of 2786 swedish dissertations containing the word matematik.
-
16. On avoiding and completing edge colorings
Abstract : These papers are all related to the problem of avoiding and completing an edge precoloring of a graph. In more detail, given a graph G and a partial proper edge precoloring φ of G and a list assignment L for every non-colored edge of G, can we extend the precoloring to a proper edge coloring avoiding any list assignment? In the first paper, G is a d-dimensional hypercube graph Qd, a partial proper edge precoloring φ and every list assignment L must satisfy certain sparsity conditions. READ MORE
-
17. Hardy and spectral inequalities for a class of partial differential operators
Abstract : This thesis is devoted to the study of Hardy and spectral inequalities for the Heisenberg and the Grushin operators. It consists of five chapters. In chapter 1 we present basic notions and summarize the main results of the thesis. READ MORE
-
18. Graphical representations of Ising and Potts models : Stochastic geometry of the quantum Ising model and the space-time Potts model
Abstract : HTML clipboard Statistical physics seeks to explain macroscopic properties of matter in terms of microscopic interactions. Of particular interest is the phenomenon of phase transition: the sudden changes in macroscopic properties as external conditions are varied. READ MORE
-
19. Mathematical models of social norms and petty corruption
Abstract : Corruption is a problem all around the world, but the extent of the problem varies between countries and situations. In this thesis, I focus on how corruption levels can change when they are culturally determined. For this reason, I study the dynamics of the cultural underpinnings: social norms and conventions. READ MORE
-
20. On linear graph invariants related to Ramsey and edge numbers : or how I learned to stop worrying and love the alien invasion
Abstract : In this thesis we study the Ramsey numbers, R(l,k), the edge numbers, e(l,k;n) and graphs that are related to these. The edge number e(l,k;n) may be defined as the least natural number m for which all graphs on n vertices and less than m edges either contains a complete subgraph of size l or an independent set of size k. READ MORE
