Search for dissertations about: "conjecture"

Showing result 11 - 15 of 120 swedish dissertations containing the word conjecture.

2. 11. Properties of the Pushforward Map on Test Functions, Measures and Distributions

   Author : Niels Christian Overgaard; Partiella differentialekvationer; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Matematik; Mathematics; wavefront sets.; oscillatory integrals; Bernstein-Sato polynomials; Palamodov s conjecture; image directe; Pushforward map; pullback map; Mathematical logic; set theory; combinatories; Matematisk logik; mängdlära; kombinatorik;

   Abstract : The subject of this thesis is the pushforward map on compactly supported distributions induced by a smooth mapping. Being the adjoint of the natural pullback operation on the class of smooth functions, the pushforward map is always well-defined, and as such it must be regarded as one of the fundamental operations of distribution theory. READ MORE

4. 12. Polynomial Sequences Generated by Linear Recurrences : Location and Reality of Zeros

   Author : Innocent Ndikubwayo; Boris Shapiro; Rikard Bögvad; Tamás Forgacs; Stockholms universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; real-rooted polynomials; generating functions; discriminants; Tran s conjecture; Toeplitz matrices; Mathematics; matematik;

   Abstract : In this thesis, we study the problem of location of the zeros of individual polynomials in sequences of polynomials generated by linear recurrence relations.In paper I, we establish the necessary and sufficient conditions that guarantee hyperbolicity of all the polynomials generated by a three-term recurrence of length 2, whose coefficients are arbitrary real polynomials. READ MORE

5. 13. Theory Exploration for Programs and Proofs

   Author : Sólrún Einarsdóttir; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Theorem Proving; Automated Reasoning; Theory Exploration; Property-Based Testing; Functional Programming; Conjecture Generation; Artificial Intelligence; Coinduction;

   Abstract : We have built two theory exploration systems, Cohipster and RoughSpec . Theory exploration is a method of automatically conjecturing properties about the functions and structures that appear in a computer program or a formalization of a mathematical theory. READ MORE

6. 14. A Proof and Formalization of the Initiality Conjecture of Dependent Type Theory

   Author : Menno de Boer; Peter LeFanu Lumsdaine; Alexander Berglund; Bas Spitters; Stockholms universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Dependent type theory; Category theory; Contextual categories; Initiality; Formalization; Mathematics; matematik; matematisk logik; Mathematical Logic;

   Abstract : In this licentiate thesis we present a proof of the initiality conjecture for Martin-Löf’s type theory with 0, 1, N, A+B, ∏AB, ∑AB, IdA(u,v), countable hierarchy of universes (Ui)iєN closed under these type constructors and with type of elements (ELi(a))iєN. We employ the categorical semantics of contextual categories. READ MORE

7. 15. Hardness of Approximating Constraint Satisfaction Problems and Their Variants in Presence of Additional Structural Assumptions

   Author : Aleksa Stankovic; Johan Håstad; Per Austrin; Luca Trevisan; KTH; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Hardness of Approximation; Approximation Algorithms; Label Cover; Vertex Cover; Unique Games Conjecture; Max-3-Lin; Universal Factor Graphs; Regular Constraint Satisfaction Problems; Inapproximerbarhet; Approximationsalgoritm; Label Cover; Vertex Cover; Unique Games Conjecture; Max-3-Lin; Universell Faktorgraf; Regelbundna Begränsningsproblem; Datalogi; Computer Science;

   Abstract : This thesis studies how the approximability of some fundamental computational problems is affected by some additional requirements on the structure of the inputs. The problems studied in this thesis belong or are closely related to constraint satisfaction problems (CSPs), which are considered to be one of the most fundamental problems in theoretical computer science. READ MORE