Sökning: "it matematik"

Visar resultat 1 - 5 av 1384 avhandlingar innehållade orden it matematik.

  1. 1. Skolans matematik : En kritisk analys av den svenska skolmatematikens förhistoria, uppkomst och utveckling

    Författare :Sverker Lundin; Donald Broady; Sten Kaijser; Göteborgs universitet; Göteborgs universitet; Gothenburg University; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; matematik; skolmatematik; historia; Matematik; matematikdidaktik; utbildningssociologi; vetenskapsteori;

    Sammanfattning : I argue that common beliefs regarding mathematics originate in the practices of elementary mathematics instruction rather than in science. While learning how to solve mathematical problems in school, we come to believe that mathematics has a set of properties in itself, for instance that it is useful in everyday life, even though this is not necessarily so. LÄS MER

  2. 2. Admissible transformations and the group classification of Schrödinger equations

    Författare :Celestin Kurujyibwami; Peter Basarab-Horwath; Roman Popovych; Pontelis Damianou; Linköpings universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : We study admissible transformations and solve group classification problems for various classes of linear and nonlinear Schrödinger equations with an arbitrary number n of space variables.The aim of the thesis is twofold. LÄS MER

  3. 3. Limit shapes of standard Young tableaux and sorting networks via the Edelman-Greene correspondence

    Författare :Samu Potka; Svante Linusson; Niklas Eriksen; KTH; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Matematik; Mathematics;

    Sammanfattning : This thesis consists of the following two articles.New properties of the Edelman–Greene bijection. Edelman and Greene constructed a correspondence between reduced words of the reverse permutation and standard Young tableaux. LÄS MER

  4. 4. Snarks : Generation, coverings and colourings

    Författare :Jonas Hägglund; Roland Häggkvist; Klas Markström; Luis Goddyn; Umeå universitet; []
    Nyckelord :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;

    Sammanfattning : 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. LÄS MER

  5. 5. On random satisfiability and optimization problems

    Författare :Joel Larsson; Klas Markström; Roland Häggkvist; Victor Falgas Ravry; Stefanie Gerke; Umeå universitet; []
    Nyckelord :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;

    Sammanfattning : 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. LÄS MER