Sökning: "composition algebra"

Visar resultat 11 - 14 av 14 avhandlingar innehållade orden composition algebra.

  1. 11. Tensor Products on Category O and Kostant's Problem

    Författare :Johan Kåhrström; Volodymyr Mazorchuk; Henning Haahr Andersen; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Semi-simple Lie algebras; Tensor products; Kostant s problem; Primitive quotients; MATHEMATICS; MATEMATIK;

    Sammanfattning : This thesis consists of a summary and three papers, concerning some aspects of representation theory for complex finite dimensional semi-simple Lie algebras with focus on the BGG-category O.Paper I is motivated by the many useful properties of functors on category O given by tensoring with finite dimensional modules, such as projective functors and translation functors. LÄS MER

  2. 12. On time-frequency analysis and pseudo-differential operators for vector-valued functions

    Författare :Patrik Wahlberg; Joachim Toft; Luigi Rodino; Växjö universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; MATHEMATICS; MATEMATIK;

    Sammanfattning : This thesis treats different aspects of time-frequency analysis and pseudodifferential operators, with particular emphasis on techniques involving vector-valued functions and operator-valued symbols. The vector (Banach) space is either motivated by an application as in Paper I, where it is a space of stochastic variables, or is part of a general problem as in Paper II, or arises naturally from problems for scalar-valued operators and function spaces, as in Paper V. LÄS MER

  3. 13. Environment support for building structured mathematical models

    Författare :Johan Herber; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis is about two topics. It describes a high-level programming environment for scientific computing, called ObjectMath, and several contributions to this environment. It also analyses the concept of software development environment architecture, in particular with respect to the ObjectMath environment. LÄS MER

  4. 14. Strong Partial Clones and the Complexity of Constraint Satisfaction Problems : Limitations and Applications

    Författare :Victor Lagerkvist; Peter Jonsson; Christer Bäckström; Nadia Creignou; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : In this thesis we study the worst-case time complexity of the constraint satisfaction problem parameterized by a constraint language (CSP(S)), which is the problem of determining whether a conjunctive formula over S has a model. To study the complexity of CSP(S) we borrow methods from universal algebra. LÄS MER