Sökning: "Set theory"

Visar resultat 21 - 25 av 1203 avhandlingar innehållade orden Set theory.

1. 21. Canonical Bases for Algebraic Computations

   Författare :Patrik Nordbeck; Algebra; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; gruppteori; algebra; algebraisk geometri; fältteori; Talteori; group theory; algebraic geometry; field theory; Matematik; Number Theory; regular languages; Mathematics; composition of polynomials; factor algebras; Gröbner bases; SAGBI bases;

   Sammanfattning : This thesis deals with computational methods in algebra, mainly focusing on the concept of Gröbner and SAGBI bases in non-commutative algebras. The material has a natural division into two parts. The first part is a rather extensive treatment of the basic theory of Gröbner bases and SAGBI bases in the non-commutative polynomial ring. LÄS MER

3. 22. Contributions to the theory of optimal stopping

   Författare :Sören Christensen; Göteborgs universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

   Sammanfattning : This thesis deals with the explicit solution of optimal stopping problems with infinite time horizon. To solve Markovian problems in continuous time we introduce an approach that gives rise to explicit results in various situations. LÄS MER

4. 23. The Theory of Polynomial Functors

   Författare :Qimh Xantcha; Torsten Ekedahl; Vincent Franjou; Stockholms universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; numerical ring; polynomial map; strict polynomial map; numerical map; polynomial functor; strict polynomial functor; numerical functor; maze; multi-set; multation; Algebra and geometry; Algebra och geometri; Mathematics; matematik;

   Sammanfattning : Polynomial functors were introduced by Professors Eilenberg and Mac Lane in 1954, who used them to study certain homology rings. Strict polynomial functors were invented by Professors Friedlander and Suslin in 1997, in order to develop the theory of group schemes. LÄS MER

5. 24. Formal Languages and Automata in Computational Algebra

   Författare :Jonas Månsson; Algebra; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; control; Datalogi; Talteori; algebraisk geometri; algebra; gruppteori; Computer science; numerical analysis; systems; group theory; field theory; algebraic geometry; finite automata; Number Theory; Gröbner bases; SAGBI bases; numerisk analys; system; kontroll; fältteori;

   Sammanfattning : This thesis is a collection of six papers in computational algebra. In particular, we study noncommutative Gröb- ner bases, SAGBI bases and similar algebraic objects which can be represented as a graph or an automaton. LÄS MER

7. 25. Exploring 'couplehood' in dementia : A constructivist grounded theory study

   Författare :Ingrid Hellström; Ulla Lundh; Mike Nolan; Ingegerd Fagerberg; Linköpings universitet; []
   Nyckelord :MEDICIN OCH HÄLSOVETENSKAP; MEDICAL AND HEALTH SCIENCES; dementia; spousal relationship; couplehood; grounded theory; Caring sciences; Vårdvetenskap;

   Sammanfattning :   The overall aim of this thesis is to gain a better understanding how people with dementia and their spouses experience dementia over time, especially the impact it has on their inter-personal relationships and patterns of everyday life. Data were collected using separate semi-structured interviews with 20 persons with dementia and their spouses of 6 monthly intervals over an 18-months period (132 interviews in total), and analysed using constructivist grounded theory. LÄS MER