Alexey Gordeev

About Me

I am a postdoc at Umeå University, working with Lars-Daniel Öhman. In January 2026, I will begin my Momentum MSCA postdoctoral fellowship at the Alfréd Rényi Institute of Mathematics.

I completed my PhD in September 2022 at St.Petersburg Department of V.A. Steklov Institute (PDMI RAS), advised by Fedor Petrov. You can find my thesis (in Russian) here.

You can find my CV here.

Research Interests

triple arrays, polynomial method in combinatorics, extremal hypergraph problems, list coloring, geometric combinatorial optimization

Papers

Near triple arrays
A. Gordeev, L.D. Öhman, K. Markström
Journal of Combinatorial Theory, Series A, 219, 106121, 2026.
[Link] [arXiv version]
Resolvable triple arrays
A. Gordeev, L.D. Öhman
arXiv:2512.08681, 2025.
[PDF]
Cayley incidence graphs
A.S. Árnadóttir, A. Gordeev, S. Lato, T. Randrianarisoa, J. Vermant
Ars Mathematica Contemporanea, 2025. In press.
[Link] [arXiv version]
On regularity of maximal distance minimizers in Rⁿ
A. Gordeev, Y. Teplitskaya
Annali Scuola Normale Superiore - Classe di Scienze, 26(3), 1639–1663, 2025.
[Link] [arXiv version]
Combinatorial Nullstellensatz and Turán numbers of complete r-partite r-uniform hypergraphs
A. Gordeev
Discrete Mathematics, 347(7), 114037, 2024.
[Link] [arXiv version] [Corrigendum]
Erdős–Hajnal problem for H-free hypergraphs
D. Cherkashin, A. Gordeev, G. Strukov
Graphs and Combinatorics, 40(1), 1–15, 2024.
[Link] [Full text view-only] [arXiv version]
The Alon–Tarsi Number of A Toroidal Grid
A. Gordeev, Z. Li, F. Petrov, Z. Shao
European Journal of Combinatorics, 111, 103697, 2023.
[Link][arXiv version]
On list chromatic numbers of 2-colorable hypergraphs
D. Cherkashin, A. Gordeev
Proceedings of MIPT, 14(1), 49-57, 2022.
[PDF] [arXiv version]
Alon–Tarsi numbers of direct products
A. Gordeev, F. Petrov
Moscow Journal of Combinatorics and Number Theory 10(4), 271–279, 2021.
[Link] [arXiv version]
Maximal distance minimizers for a rectangle
D. Cherkashin, A. Gordeev, G. Strukov, Y. Teplitskaya
arXiv:2106.00809, 2021.
[PDF]
On minimizers of the maximal distance functional for a planar convex closed smooth curve
D. Cherkashin, A. Gordeev, G. Strukov, Y. Teplitskaya
arXiv:2011.10463, 2020.
[PDF]
Constant terms of near-Dyson polynomials
A. Gordeev
The Electronic Journal of Combinatorics 25(4), 2018.
[PDF] [Link]

Talks

Bollobás–Meir conjecture for the TSP in the unit cube holds asymptotically
PGMO Days 2025, Paris, France, November 18, 2025.
[Book of abstracts] [Slides]
A Christofides-based approach to the travelling salesman problem in the unit cube
Eurocomb’25, Budapest, Hungary, August 28, 2025.
[Book of extended abstracts] [Slides]
Near triple arrays
Eurocomb’25, Budapest, Hungary, August 25, 2025.
[Book of extended abstracts] [Slides]
On a travelling salesman problem in the unit cube
Theory Coffee seminar, EPFL, March 17, 2025.
Non-extremal triple arrays and near-triple arrays
Open University Discrete Mathematics Seminar, November 27, 2024.
[Slides]
Combinatorial Nullstellensatz and the Erdős box problem
Algebraic Graph Theory Seminar, University of Waterloo, September 30, 2024.
[Slides]
Synergies of combinatorics and theoretical computer science workshop, EPFL, August 19, 2024.
[Recording] [Slides]
New non-extremal triple arrays
30th British Combinatorial Conference, London, July 3, 2024.
[Book of abstracts] [Slides]

Teaching

Lecturer at Saint Petersburg State University (Spring 2019 – Fall 2021)
Algorithms and Data Structures
a 3 semester undergraduate course in “Modern Programming” bachelor programme
Lecture notes (in Russian): [1 semester] [2 semester] [3 semester]
Teacher at the Summer Informatics Camp, Perm, Russia (2013 – 2021)
Algorithms and Data Structures
a 3 week course with lectures and practice sessions aimed at high school students