Treewidth: theory and applications to computer science

This report is an introduction to the concept of treewidth, a property of graphs that has important implications in algorithms. Some basic concepts of graph theory are presented in the first chapter for those readers that are not familiar with the notation. In Chapter 2, the definition of treewidth and some different ways of characterizing it are explained. The last two chapters focus on the algorithmic implications of treewidth, which are very relevant in Computer Science. An algorithm to compute the treewidth of a graph is presented and its result can be later applied to many other problems in graph theory, like those introduced in the last chapter.

Distribution theory and fundamental solutions of differential operators

The objective of this dissertation is to study the theory of distributions and some of its applications. Certain concepts which we would include in the theory of distributions nowadays have been widely used in several fields of mathematics and physics. It was Dirac who first introduced the delta function as we know it, in an attempt to keep a convenient notation in his works in quantum mechanics. Their work contributed to open a new path in mathematics, as new objects, similar to functions but not of their same nature, were being used systematically. Distributions are believed to have been first formally introduced by the Soviet mathematician Sergei Sobolev and by Laurent Schwartz. The aim of this project is to show how distribution theory can be used to obtain what we call fundamental solutions of partial differential equations.