Mathematical aspects of Feynman integrals

In the present dissertation we consider Feynman integrals in the framework of dimensional regularization. As all such integrals can be expressed in terms of scalar integrals, we focus on this latter kind of integrals in their Feynman parametric representation and study their mathematical properties, partially applying graph theory, algebraic geometry and number theory. The three main topics are the graph theoretic properties of the Symanzik polynomials, the termination of the sector decomposition algorithm of Binoth and Heinrich and the arithmetic nature of the Laurent coefficients of Feynman integrals.rnrnThe integrand of an arbitrary dimensionally regularised, scalar Feynman integral can be expressed in terms of the two well-known Symanzik polynomials. We give a detailed review on the graph theoretic properties of these polynomials. Due to the matrix-tree-theorem the first of these polynomials can be constructed from the determinant of a minor of the generic Laplacian matrix of a graph. By use of a generalization of this theorem, the all-minors-matrix-tree theorem, we derive a new relation which furthermore relates the second Symanzik polynomial to the Laplacian matrix of a graph.rnrnStarting from the Feynman parametric parameterization, the sector decomposition algorithm of Binoth and Heinrich serves for the numerical evaluation of the Laurent coefficients of an arbitrary Feynman integral in the Euclidean momentum region. This widely used algorithm contains an iterated step, consisting of an appropriate decomposition of the domain of integration and the deformation of the resulting pieces. This procedure leads to a disentanglement of the overlapping singularities of the integral. By giving a counter-example we exhibit the problem, that this iterative step of the algorithm does not terminate for every possible case. We solve this problem by presenting an appropriate extension of the algorithm, which is guaranteed to terminate. This is achieved by mapping the iterative step to an abstract combinatorial problem, known as Hironaka's polyhedra game. We present a publicly available implementation of the improved algorithm. Furthermore we explain the relationship of the sector decomposition method with the resolution of singularities of a variety, given by a sequence of blow-ups, in algebraic geometry.rnrnMotivated by the connection between Feynman integrals and topics of algebraic geometry we consider the set of periods as defined by Kontsevich and Zagier. This special set of numbers contains the set of multiple zeta values and certain values of polylogarithms, which in turn are known to be present in results for Laurent coefficients of certain dimensionally regularized Feynman integrals. By use of the extended sector decomposition algorithm we prove a theorem which implies, that the Laurent coefficients of an arbitrary Feynman integral are periods if the masses and kinematical invariants take values in the Euclidean momentum region. The statement is formulated for an even more general class of integrals, allowing for an arbitrary number of polynomials in the integrand.

On the car sequencing problem: analysis and solution methods

This work deals with the car sequencing (CS) problem, a combinatorial optimization problem for sequencing mixed-model assembly lines. The aim is to find a production sequence for different variants of a common base product, such that work overload of the respective line operators is avoided or minimized. The variants are distinguished by certain options (e.g., sun roof yes/no) and, therefore, require different processing times at the stations of the line. CS introduces a so-called sequencing rule H:N for each option, which restricts the occurrence of this option to at most H in any N consecutive variants. It seeks for a sequence that leads to no or a minimum number of sequencing rule violations. In this work, CS’ suitability for workload-oriented sequencing is analyzed. Therefore, its solution quality is compared in experiments to the related mixed-model sequencing problem. A new sequencing rule generation approach as well as a new lower bound for the problem are presented. Different exact and heuristic solution methods for CS are developed and their efficiency is shown in experiments. Furthermore, CS is adjusted and applied to a resequencing problem with pull-off tables.

Problem-specific design of metaheuristics for constrained spanning tree problems

When designing metaheuristic optimization methods, there is a trade-off between application range and effectiveness. For large real-world instances of combinatorial optimization problems out-of-the-box metaheuristics often fail, and optimization methods need to be adapted to the problem at hand. Knowledge about the structure of high-quality solutions can be exploited by introducing a so called bias into one of the components of the metaheuristic used. These problem-specific adaptations allow to increase search performance. This thesis analyzes the characteristics of high-quality solutions for three constrained spanning tree problems: the optimal communication spanning tree problem, the quadratic minimum spanning tree problem and the bounded diameter minimum spanning tree problem. Several relevant tree properties, that should be explored when analyzing a constrained spanning tree problem, are identified. Based on the gained insights on the structure of high-quality solutions, efficient and robust solution approaches are designed for each of the three problems. Experimental studies analyze the performance of the developed approaches compared to the current state-of-the-art.

EPR spectroscopy as a tool for the elucidation of non-covalent structuring principles in complex soft matter

This thesis aims at connecting structural and functional changes of complex soft matter systems due to external stimuli with non-covalent molecular interaction profiles. It addresses the problem of elucidating non-covalent forces as structuring principle of mainly polymer-based systems in solution. The structuring principles of a wide variety of complex soft matter types are analyzed. In many cases this is done by exploring conformational changes upon the exertion of external stimuli. The central question throughout this thesis is how a certain non-covalent interaction profile leads to solution condition-dependent structuring of a polymeric system.rnTo answer this question, electron paramagnetic resonance (EPR) spectroscopy is chosen as the main experimental method for the investigation of the structure principles of polymers. With EPR one detects only the local surroundings or environments of molecules that carry an unpaired electron. Non-covalent forces are normally effective on length scales of a few nanometers and below. Thus, EPR is excellently suited for their investigations. It allows for detection of interactions on length scales ranging from approx. 0.1 nm up to 10 nm. However, restriction to only one experimental technique likely leads to only incomplete pictures of complex systems. Therefore, the presented studies are frequently augmented with further experimental and computational methods in order to yield more comprehensive descriptions of the systems chosen for investigation.rnElectrostatic correlation effects in non-covalent interaction profiles as structuring principles in colloid-like ionic clusters and DNA condensation are investigated first. Building on this it is shown how electrostatic structuring principles can be combined with hydrophobic ones, at the example of host-guest interactions in so-called dendronized polymers (denpols).rnSubsequently, the focus is shifted from electrostatics in dendronized polymers to thermoresponsive alkylene oxide-based materials, whose structuring principles are based on hydrogen bonds and counteracting hydrophobic interactions. The collapse mechanism in dependence of hydrophilic-hydrophobic balance and topology of these polymers is elucidated. Complementarily the temperature-dependent phase behavior of elastin-like polypeptides (ELPs) is investigated. ELPs are the first (and so far only) class of compounds that is shown to feature a first-order inverse phase transition on nanoscopic length scales.rnFinally, this thesis addresses complex biological systems, namely intrinsically disordered proteins (IDPs). It is shown that the conformational space of the IDPs Osteopontin (OPN), a cytokine involved in metastasis of several kinds of cancer, and BASP1 (brain acid soluble protein one), a protein associated with neurite outgrowth, is governed by a subtle interplay between electrostatic forces, hydrophobic interaction, system entropy and hydrogen bonds. Such, IDPs can even sample cooperatively folded structures, which have so far only been associated with globular proteins.

Contributions to exact approaches in combinatorial optimization

The focus of this thesis is to contribute to the development of new, exact solution approaches to different combinatorial optimization problems. In particular, we derive dedicated algorithms for a special class of Traveling Tournament Problems (TTPs), the Dial-A-Ride Problem (DARP), and the Vehicle Routing Problem with Time Windows and Temporal Synchronized Pickup and Delivery (VRPTWTSPD). Furthermore, we extend the concept of using dual-optimal inequalities for stabilized Column Generation (CG) and detail its application to improved CG algorithms for the cutting stock problem, the bin packing problem, the vertex coloring problem, and the bin packing problem with conflicts. In all approaches, we make use of some knowledge about the structure of the problem at hand to individualize and enhance existing algorithms. Specifically, we utilize knowledge about the input data (TTP), problem-specific constraints (DARP and VRPTWTSPD), and the dual solution space (stabilized CG). Extensive computational results proving the usefulness of the proposed methods are reported.