Please use this identifier to cite or link to this item:
http://hdl.handle.net/2445/199425
Title: | Learning-powered computer-assisted counterexample search |
Author: | Ventosa Andreu, Laura |
Director/Tutor: | Knauer, Kolja |
Keywords: | Teoria de grafs Treballs de fi de grau Sistemes adaptatius Programació (Matemàtica) Aprenentatge automàtic Demostració automàtica de teoremes Graph theory Bachelor's theses Adaptive control systems Mathematical programming Machine learning Automatic theorem proving |
Issue Date: | 23-Jan-2023 |
Abstract: | [en] This thesis explores the great potential of computer-assisted proofs in the advancement of mathematical knowledge, with a special focus on using computers to refute conjectures by finding counterexamples, sometimes a humanly impossible task. In recent years, mathematicians have become more aware that machine learning techniques can be extremely helpful for finding counterexamples to conjectures in a more efficient way than by using exhaustive search methods. In this thesis we do not only present the theoretical background behind some of these methods but also implement them to try to refute some graph theory conjectures. |
Note: | Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2023, Director: Kolja Knauer |
URI: | http://hdl.handle.net/2445/199425 |
Appears in Collections: | Treballs Finals de Grau (TFG) - Matemàtiques Programari - Treballs de l'alumnat |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
tfg_ventosa_andreu_laura.pdf | Memòria | 1.58 MB | Adobe PDF | View/Open |
codi.zip | Codi font | 35.4 kB | zip | View/Open |
This item is licensed under a
Creative Commons License