Search for dissertations about: "matrices mathematics"

Showing result 21 - 25 of 128 swedish dissertations containing the words matrices mathematics.

  2. 21. Geometry of numbers, class group statistics and free path lengths

    Author : Samuel Holmin; Pär Kurlberg; Yiannis Petridis; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; geometry of numbers; lattices; class numbers; class groups; free path lengths; Mathematics; Matematik;

    Abstract : This thesis contains four papers, where the first two are in the area of geometry of numbers, the third is about class group statistics and the fourth is about free path lengths. A general theme throughout the thesis is lattice points and convex bodies. READ MORE

  4. 22. Graph Techniques for Matrix Equations and Eigenvalue Dynamics

    Author : Joakim Arnlind; Jens Hoppe; Martin Bordemann; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; MATHEMATICS; MATEMATIK;

    Abstract : 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. READ MORE

  5. 23. Systems of Linear First Order Partial Differential Equations Admitting a Bilinear Multiplication of Solutions

    Author : Jens Jonasson; Stefan Rauch; Sergio Benenti; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Cauchy–Riemann equations; holomorphic functions; algebra; MATHEMATICS; MATEMATIK;

    Abstract : The Cauchy–Riemann equations admit a bilinear multiplication of solutions, since the product of two holomorphic functions is again holomorphic. This multiplication plays the role of a nonlinear superposition principle for solutions, allowing for construction of new solutions from already known ones, and it leads to the exceptional property of the Cauchy–Riemann equations that all solutions can locally be built from power series of a single solution z = x + iy ∈ C. READ MORE

  6. 24. Computational algorithms for algebras

    Author : Samuel Lundqvist; Clas Löfwall; Ralf Fröberg; H. Michael Möller; Stockholms universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Hilbert function; Gröbner basis; zero-dimensional ideal; affine variety; projective variety; run-time complexity; Algebra and geometry; Algebra och geometri; Mathematics; matematik;

    Abstract : This thesis consists of six papers. In Paper I, we give an algorithm for merging sorted lists of monomials and together with a projection technique, we obtain a new complexity bound for the Buchberger-Möller algorithm and the FGLM algorithm. READ MORE

  7. 25. Summation formulae and zeta functions

    Author : Johan Andersson; Mikael Passare; Aleksandar Ivic; Stockholms universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; zeta function; summation formula; automorphic form; modular group; Kloosterman sum; Selberg theory; power sum method; MATHEMATICS; MATEMATIK;

    Abstract : This thesis in analytic number theory consists of 3 parts and 13 individual papers.In the first part we prove some results in Turán power sum theory. We solve a problem of Paul Erdös and disprove conjectures of Paul Turán and K. Ramachandra that would have implied important results on the Riemann zeta function. READ MORE