University of Twente Student Theses
The most powerful theorem
Graaf, R. van der (2025) The most powerful theorem.
|
PDF
3MB |
| Abstract: | We are given a large dataset including all theorems, axioma’s, definitions and more that exist within mathematics. This dataset is represented as a directed graph. In this graph, the theorems, axioma’s and definitions are the vertices. There is a directed edge from vertex a to vertex b if vertex a is used to proof the existence of vertex b. This graph will be called the LPG. We are interested in finding the strongest vertex in this graph. We first construct a measure to score each vertex which consists of the Pagerank, Betweenness centrality and Degree score. Additionally, we define the Pareto Front to identify undominated vertices. Every vertex in the LPG has a certain category. We reduce the LPG to a graph that only contains these categories. This way, we first find out that the category ‘Function’ performs best in the designed statistic. We now look specifically in the sub graph that only contains vertices of the category ‘Function’. We find that there are 4 vertices are performing equally good in the sub graph, of which the vertex ‘Function.Injective.addMonoid’ performs slightly better in the designed statistic than the other 3 vertices. |
| Item Type: | Essay (Bachelor) |
| Faculty: | EEMCS: Electrical Engineering, Mathematics and Computer Science |
| Subject: | 31 mathematics |
| Programme: | Applied Mathematics BSc (56965) |
| Link to this item: | https://purl.utwente.nl/essays/105078 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page