Sökning: "kth matematik"
Visar resultat 21 - 25 av 359 avhandlingar innehållade orden kth matematik.
21. Graph Techniques for Matrix Equations and Eigenvalue Dynamics
Sammanfattning : One way to construct noncommutative analogues of a Riemannian manifold Σ is to make use of the Toeplitz quantization procedure. In Paper III and IV, we construct C-algebras for a continuously deformable class of spheres and tori, and by introducing the directed graph of a representation, we can completely characterize the representation theory of these algebras in terms of the corresponding graphs. LÄS MER
22. Limit theorems for generalizations of GUE random matrices
Sammanfattning : This thesis consists of two papers devoted to the asymptotics of random matrix ensembles and measure valued stochastic processes which can be considered as generalizations of the Gaussian unitary ensemble (GUE) of Hermitian matrices H=A+A†, where the entries of A are independent identically distributed (iid) centered complex Gaussian random variables. In the first paper, a system of interacting diffusing particles on the real line is studied; special cases include the eigenvalue dynamics of matrix-valued Ornstein-Uhlenbeck processes (Dyson's Brownian motion). LÄS MER
23. Point counts and the cohomology of moduli spaces of curves
Sammanfattning : n this thesis we count the number of points defined over finite fields of certain moduli spaces of pointed curves. The aim is primarily to gain cohomological information. Paper I is joint work with Orsola Tommasi. Here we present details of the method of finding cohomological information on moduli spaces of curves by counting points. LÄS MER
24. Limit Theorems for Ergodic Group Actions and Random Walks
Sammanfattning : This thesis consists of an introduction, a summary and 7 papers. The papers are devoted to problems in ergodic theory, equidistribution on compact manifolds and random walks on groups. In Papers A and B, we generalize two classical ergodic theorems for actions of abelian groups. LÄS MER
25. Numerical Algorithms for Free Boundary Problems of Obstacle Types
Sammanfattning : .... LÄS MER