| Tartalmi leírás: |
Recent new methods in geometry and combinatorics rely on finding and proving the existence of witness graphs, which are geometrical structures with desirable parameters. This approach, combined with large-scale computer search methods, can provide useful bounds on a large number of geometric or combinatorial problems that would otherwise be out of reach to prove by hand.
In this project, we apply this framework to a number of questions in pure mathematics, such as the double-cap conjecture or high-dimensional sphere packing.
|
