Sökning: "Naturvetenskap Matematik Algebra och logik"
Visar resultat 11 - 15 av 111 avhandlingar innehållade orden Naturvetenskap Matematik Algebra och logik.
11. Waring-type problems for polynomials : Algebra meets Geometry
Sammanfattning : In the present thesis we analyze different types of additive decompositions of homogeneous polynomials. These problems are usually called Waring-type problems and their story go back to the mid-19th century and, recently, they received the attention of a large community of mathematicians and engineers due to several applications. LÄS MER
12. Bounds on Hilbert Functions
Sammanfattning : This thesis is constituted of two articles, both related to Hilbert functions and h-vectors. In the first paper, we deal with h-vectorsof reduced zero-dimensional schemes in the projective plane, and, in particular, with the problem of finding the possible h-vectors for the union of two sets of points of given h-vectors. LÄS MER
13. Effective Domains and Admissible Domain Representations
Sammanfattning : This thesis consists of four papers in domain theory and a summary. The first two papers deal with the problem of defining effectivity for continuous cpos. LÄS MER
14. Proportionalitetsbegreppet i den svenska gymnasiematematiken – en studie om läromedel och nationella prov : [The Concept of Proportionality in the Swedish Upper Secondary School Mathematics – a Study of Textbooks and National Examinations]
Sammanfattning : Proportionalitet är ett centralt begrepp i skolmatematiken. Begreppet introduceras i de lägre stadierna och återkommer i så gott som samtliga kurser från årskurs 9 tillsista kursen på gymnasiet. Det övergripande syftet med denna studie är att undersöka hur det matematiska begreppet proportionalitet hanteras i den svenska gymnasieskolan. LÄS MER
15. Constructive Newton–Puiseux Theorem, Sheaf Model of the Separable Closure and Dynamic Evaluation
Sammanfattning : Computing the Puiseux expansions of a plane algebraic curve defined by an affine equation over an algebraically closed field is a an important algorithm in algebraic geometry. This is the so-called Newton–Puiseux Theorem. The termination of this algorithm, however, is usually justified by non-constructive means. LÄS MER