Lines in Euclidean Ramsey theory

Let $\ell_m$ be a sequence of $m$ points on a line with consecutive points of distance one. For every natural number $n$, we prove the existence of a red/blue-coloring of $\mathbb{E}^n$ containing no red copy of $\ell_2$ and no blue copy of $\ell_m$ for any $m \geq 2^{cn}$. This is best possible up to the constant $c$ in the exponent. It also answers a question of Erd\H{o}s, Graham, Montgomery, Rothschild, Spencer and Straus from 1973. They asked if, for every natural number $n$, there is a set $K \subset \mathbb{E}^1$ and a red/blue-coloring of $\mathbb{E}^n$ containing no red copy of $\ell_2$ and no blue copy of $K$.Comment: 7 page

Ambient and intrinsic triangulations and topological methods in cosmology

The thesis consist of two parts, one part concerns triangulations the other the structure of the universe. 1 Images in films such as Shrek or Frozen and in computer games are often made using small triangles. Subdividing a figure (such as Shrek) into small triangles is called triangulating. This may be done in two different ways. The first method makes use of straight triangles and is used most often. Because computer power is limited, we want to use as few triangles as possible, while maintaining the quality of the image. This means that one has to choose the triangles in a clever manner. Much is known about the choice of triangles if the surface is convex (egg-shaped). This thesis contributes to our understanding of non-convex surfaces. The second and new method uses curved triangles that follow the surface. The triangles we use are determined by the intrinsic geometry of the surface and are called intrinsic triangles. 2 Shortly after the Big Bang the universe was very hot and dense. Quantum mechanical effects introduced structure into the matter distribution in the early universe. The universe expanded according the laws of General Relativity and the matter cooled down. After the matter in the universe had cooled down, clusters of galaxies formed out of the densest regions. These clusters of galaxies are connected by stringy structures consisting of galaxies. This thesis contributes to the understanding of this intricate structure

A Brouwer fixed point theorem for graph endomorphisms

We prove a Lefschetz formula for general simple graphs which equates the Lefschetz number L(T) of an endomorphism T with the sum of the degrees i(x) of simplices in G which are fixed by T. The degree i(x) of x with respect to T is defined as a graded sign of the permutation T induces on the simplex x multiplied by -1 if the dimension of x is odd. The Lefschetz number is defined as in the continuum as the super trace of T induced on cohomology. In the special case where T is the identity, the formula becomes the Euler-Poincare formula equating combinatorial and cohomological Euler characteristic. The theorem assures in general that if L(T) is nonzero, then T has a fixed clique. A special case is a discrete Brouwer fixed point theorem for graphs: if T is a graph endomorphism of a connected graph G, which is star-shaped in the sense that only the zeroth cohomology group is nontrivial, like for connected trees or triangularizations of star shaped Euclidean domains, then there is clique x which is fixed by T. Unlike in the continuum, the fixed point theorem proven here looks for fixed cliques, complete subgraphs which play now the role of "points" in the graph. Fixed points can so be vertices, edges, fixed triangles etc. If A denotes the automorphism group of a graph, we also look at the average Lefschetz number L(G) which is the average of L(T) over A. We prove that this is the Euler characteristic of the graph G/A and especially an integer. We also show that as a consequence of the Lefschetz formula, the zeta function zeta(T,z) is a product of two dynamical zeta functions and therefore has an analytic continuation as a rational function which is explicitly given by a product formula involving only the dimension and the signature of prime orbits of simplices in G.Comment: 24 pages, 6 figure