Vector Space Ramsey Numbers

Bachelor thesis (2024)

Authors

B.J. Stolk Electrical Engineering, Mathematics and Computer Science

Contributors

A. Bishnoi Discrete Mathematics and Optimization - EEMCS (mentor)
A. Ravi Discrete Mathematics and Optimization - EEMCS (mentor)
J. Komjáthy Applied Probability - EEMCS (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science
More Info
expand_more

Published Date

20-08-2024

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

In this text, we begin by giving a definition of Vector Space Ramsey Numbers. It concerns colourings of $t$-dimensional subspaces of some vector space $\mathbb{F}_q^n$. We want to ensure that each colouring contains a monochromatic $k$-dimensional subspace. After proving that these numbers always exist, we continue with studying asymptotic bounds for these numbers. We study a selection of methods, such as through coding theory or using the probabilistic method, to obtain lower and upper bounds for vector space Ramsey numbers. Lastly, we introduce two methods to directly compute vector space Ramsey numbers. That being through an ILP formulation and through a SAT formulation.