Adam Zsolt Wagner
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Adam Zsolt Wagner has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Felix Christian Clemen
Department of Mathematics, Karlsruhe Institute of Technology, Karlsruhe, Germany
2 shared publications - Geordie Williamson
University of Sydney
2 shared publications - Alex Davies
DeepMind, London, United Kingdom
1 shared publication - François Charton
FAIR, Meta
1 shared publication - Grzegorz Swirszcz
DeepMind London UK
1 shared publication - Jordan S. Ellenberg
University of Wisconsin-Madison
1 shared publication
Latest Publications
- Open Access
Drums of high width
We provide a family of $5$-dimensional prismatoids whose width grows linearly in the number of vertices. This provides a new infinite family of counter-examples to the Hirsch conjecture whose excess width grows linearly in the number of vertices, and answers a question of Matschke, Santos and Weibel.
Open AccessDrums of high width
We provide a family of $5$-dimensional prismatoids whose width grows linearly in the number of vertices. This provides a new infinite family of counter-examples to the Hirsch conjecture whose excess width grows linearly in the number of vertices, and answers a question of Matschke, Santos and Weibel.
- Open Access
PatternBoost: Constructions in Mathematics with a Little Help from AI
We introduce PatternBoost, a flexible method for finding interesting constructions in mathematics. Our algorithm alternates between two phases. In the first ``local'' phase, a classical search algorithm is used to produce many desirable constructions. In the second ``global'' phase, a transformer neural network is trained on the best such constructions. Samples from the trained transformer are then used as seeds for the first phase, and the process is repeated. We give a detailed introduction to this technique, and discuss the results of its application to several problems in extremal combinatorics. The performance of PatternBoost varies across different problems, but there are many situations where its performance is quite impressive. Using our technique, we find the best known solutions to several long-standing problems, including the construction of a counterexample to a conjecture that had remained open for 30 years.
Open AccessPatternBoost: Constructions in Mathematics with a Little Help from AI
We introduce PatternBoost, a flexible method for finding interesting constructions in mathematics. Our algorithm alternates between two phases. In the first ``local'' phase, a classical search algorithm is used to produce many desirable constructions. In the second ``global'' phase, a transformer neural network is trained on the best such constructions. Samples from the trained transformer are then used as seeds for the first phase, and the process is repeated. We give a detailed introduction to this technique, and discuss the results of its application to several problems in extremal combinatorics. The performance of PatternBoost varies across different problems, but there are many situations where its performance is quite impressive. Using our technique, we find the best known solutions to several long-standing problems, including the construction of a counterexample to a conjecture that had remained open for 30 years.
- Open Access
- 14 July 2023
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 30 (3) , P3.17
Balanced Edge-Colorings Avoiding Rainbow Cliques of Size Four
A balanced edge-coloring of the complete graph is an edge-coloring such that every vertex is incident to each color the same number of times. In this short note, we present a construction of a balanced edge-coloring with six colors of the complete graph on $n=13^k$ vertices, for every positive integer $k$, with no rainbow $K_4$. This solves a problem by Erdős and Tuza.- 14 July 2023
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 30 (3) , P3.17
Open AccessBalanced Edge-Colorings Avoiding Rainbow Cliques of Size Four
A balanced edge-coloring of the complete graph is an edge-coloring such that every vertex is incident to each color the same number of times. In this short note, we present a construction of a balanced edge-coloring with six colors of the complete graph on $n=13^k$ vertices, for every positive integer $k$, with no rainbow $K_4$. This solves a problem by Erdős and Tuza. - Open Access
A note on balanced edge-colorings avoiding rainbow cliques of size four
A balanced edge-coloring of the complete graph is an edge-coloring such that every vertex is incident to each color the same number of times. In this short note, we present a construction of a balanced edge-coloring with six colors of the complete graph on $n=13^k$ vertices, for every positive integer $k$, with no rainbow $K_4$. This solves a problem by Erdős and Tuza.Open AccessA note on balanced edge-colorings avoiding rainbow cliques of size four
A balanced edge-coloring of the complete graph is an edge-coloring such that every vertex is incident to each color the same number of times. In this short note, we present a construction of a balanced edge-coloring with six colors of the complete graph on $n=13^k$ vertices, for every positive integer $k$, with no rainbow $K_4$. This solves a problem by Erdős and Tuza.