Sökning: "Natural Sciences Mathematics Discrete Mathematics"
Visar resultat 1 - 5 av 273 avhandlingar innehållade orden Natural Sciences Mathematics Discrete Mathematics.
1. Mathematical Multi-Objective Optimization of the Tactical Allocation of Machining Resources in Functional Workshops
Sammanfattning : In the aerospace industry, efficient management of machining capacity is crucial to meet the required service levels to customers and to maintain control of the tied-up working capital. We introduce new multi-item , multi-level capacitated resource allocation models with a medium--to--long--term planning horizon. LÄS MER
2. Vector-valued Eisenstein series of congruence types and their products
Sammanfattning : Historically, Kohnen and Zagier connected modular forms with period polynomials, and as a consequence of this association concluded that the products of at most two Eisenstein series span all spaces of classical modular forms of level 1. Later Borisov and Gunnells among other authors extended the result to higher levels. LÄS MER
3. Admissible transformations and the group classification of Schrödinger equations
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
4. Studies in Efficient Discrete Algorithms
Sammanfattning : This thesis consists of five papers within the design and analysis of efficient algorithms.In the first paper, we consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. We develop a combinatorial randomized algorithm that runs in subcubic time for a special class of graphs. LÄS MER
5. On linear graph invariants related to Ramsey and edge numbers : or how I learned to stop worrying and love the alien invasion
Sammanfattning : In this thesis we study the Ramsey numbers, R(l,k), the edge numbers, e(l,k;n) and graphs that are related to these. The edge number e(l,k;n) may be defined as the least natural number m for which all graphs on n vertices and less than m edges either contains a complete subgraph of size l or an independent set of size k. LÄS MER