Sökning: "jakob jonsson"

Visar resultat 1 - 5 av 7 avhandlingar innehållade orden jakob jonsson.

1. 1. Combinatorial Considerations on Two Models from Statistical Mechanics

   Författare :Johan Thapper; Svante Linusson; Peter Jonsson; Jakob Jonsson; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; fully packed loop model; rhombus tilings; hard particle model; independence complex; discrete morse theory; Discrete mathematics; Diskret matematik;

   Sammanfattning : Interactions between combinatorics and statistical mechanics have provided many fruitful insights in both fields. A compelling example is Kuperberg’s solution to the alternating sign matrix conjecture, and its following generalisations. LÄS MER

3. 2. Preventing problem gambling: Focus on overconsumption

   Författare :Jakob Jonsson; Per Carlbring; Ingrid Munck; Ståle Pallesen; Stockholms universitet; []
   Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; gambling; problem gambling; prevention; overconsumption; responsible gambling; online self-test; ESEM; psychometric properties; predictive; longitudinal; CFA; gambling fallacies; reinforcers; personalized behavioural feedback; motivational interviewing; gambling expenditure; RCT; 12-month follow-up; spel om pengar; problematiskt spelande; prevention; överkonsumtion; spelansvar; online självtest; ESEM; psykometriska egenskaper; prediktiv; longitudinell; CFA; tankefällor om spel; psykologiska förstärkare; personifierad återkoppling på beteende; motiverande samtal; spelutgifter; RCT; 12-månaders uppföljning; Psychology; psykologi;

   Sammanfattning : A proportion of gamblers experience problems. The role of overconsumption in developing gambling problems is sparsely described in the literature and there is little scientific knowledge about the prevention of gambling problems. LÄS MER

4. 3. Simplicial Complexes of Graphs

   Författare :Jakob Jonsson; Anders Björner; John Shareshian; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Algebra and geometry; simplicial complex; monotone graph property; discrete Morse theory; simplicial homology; homotopy type; connectivity degree; Cohen-Macaulay complex; Euler characteristic; decision tree; Algebra och geometri; Algebra and geometry; Algebra och geometri;

   Sammanfattning : Let G be a finite graph with vertex set V and edge set E. A graph complex on G is an abstract simplicial complex consisting of subsets of E. In particular, we may interpret such a complex as a family of subgraphs of G. LÄS MER

5. 4. 470 nya kyrkor : Bidrag till Sveriges arkitekturhistoria 1850-1890

   Författare :Jakob Lindblad; Anders Åman; Hedvig Brander Jonsson; Ingrid Sjöström; Henrik Ranby; Uppsala universitet; []
   Nyckelord :HUMANIORA; HUMANITIES; HUMANIORA; HUMANITIES; Swedish 19th century church architecture; parish churches; 19th century church history and settlement history; 19th liturgy and church architecture; Överintendentsämbetet Board of Public Works and Buildings ; ‘Sockenkyrkorna. Kulturarv och bebyggelsehistoria’ Sockenkyrkoprojektet ; ‘sacred space’; architects; master builders; designs; constructional drawings; cultural heritage; Art; Konstvetenskap; History Of Art; konstvetenskap;

   Sammanfattning : The present study critically examines the zealous building of 470 new parish churches in Sweden in 1850–1890; mainly replacing older churches in Västergötland, Småland and Scania; mainly new sites in Norrland. The primary source material is the church itself, meticulously examined in the fi eld and from archives, comparative analysis, the systemati-sation of formal elements and interpretation of architectural expression, characterisation of locations, plans, interiors and exteriors. LÄS MER

7. 5. On hypergraph algebras

   Författare :Eric Emtander; Jörgen Backelin; Ralf Fröberg; Jakob Jonsson; Stockholms universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; matematik;

   Sammanfattning : .... LÄS MER