Search for dissertations about: "matematik"

Showing result 11 - 15 of 2787 swedish dissertations containing the word matematik.

  1. 11. The function concept and university mathematics teaching

    Author : Olov Viirman; Iiris Attorps; Barbara Jaworski; Högskolan i Gävle; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; mathematics; university education; commognitive framework; function concept; discourse; teaching; Matematik; Mathematics;

    Abstract : This thesis concerns the teaching of mathematics at university level, with a particular focus on the teaching of the function concept. The main aim of the thesis is describing and analysing the teaching practices of university mathematics teachers regarding the function concept, and how this concept is constituted through these practices. READ MORE

  2. 12. Around power ideals : From Fröberg's conjecture to zonotopal algebra

    Author : Gleb Nenashev; Boris Shapiro; Volkmar Welker; Stockholms universitet; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; matematik; Mathematics;

    Abstract : In this thesis we study power algebras, which are quotient of polynomial rings by power ideals. We will study Hilbert series of such ideals and their other properties. We consider two important special cases, namely, zonotopal ideals and generic ideals. Such ideals have a lot combinatorial properties. READ MORE

  3. 13. Snarks : Generation, coverings and colourings

    Author : Jonas Hägglund; Roland Häggkvist; Klas Markström; Luis Goddyn; Umeå universitet; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Snarks; cubic graphs; enumeration; cycle covers; perfect matching covers; Fulkerson s conjecture; strong cycle double cover conjecture; cycle decompositions; stable cycles; oddness; circumference; uncolourability measures; Mathematics; matematik;

    Abstract : For a number of unsolved problems in graph theory such as the cycle double cover conjecture, Fulkerson's conjecture and Tutte's 5-flow conjecture it is sufficient to prove them for a family of graphs called snarks. Named after the mysterious creature in Lewis Carroll's poem, a \emph{snark} is a cyclically 4-edge connected 3-regular graph of girth at least 5 which cannot be properly edge coloured using three colours. READ MORE

  4. 14. On random cover and matching problems

    Author : Joel Larsson; Klas Markström; Tatyana Turova; Umeå universitet; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Mathematics; matematik;

    Abstract : This thesis consists of the following papers.I  J. Larsson, The Minimum Matching in Pseudo-dimension 0 < q < 1, submittedII  V. Falgas-Ravry, J. READ MORE

  5. 15. On random satisfiability and optimization problems

    Author : Joel Larsson; Klas Markström; Roland Häggkvist; Victor Falgas Ravry; Stefanie Gerke; Umeå universitet; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Random graphs; k-SAT; satisfiability; coupon collector; random cover time; threshold phenomenon; concentration of measure; combinatorial probability; perfect matching; assignment problem; local graph limit; mean-field; Mathematics; matematik;

    Abstract : In Paper I, we study the following optimization problem: in the complete bipartite graph where edges are given i.i.d. weights of pseudo-dimension q>0, find a perfect matching with minimal total weight. READ MORE