I am a postdoc at Umeå University, working with Lars-Daniel Öhman.
I completed my PhD in 2022 at St.Petersburg Department of Steklov Institute of Mathematics of Russian Academy of Sciences (PDMI RAS), advised by Fedor Petrov. You can find my thesis (in Russian) here.
You can find my CV here.
list colorings of graphs and hypergraphs, polynomial method in combinatorics, extremal hypergraph problems, maximal distance minimizers, row-column designs
On regularity of maximal distance minimizers in R^n
A. Gordeev, Y. Teplitskaya
The Annali della Scuola Normale di Pisa - Classe di Scienze, 2023.
[Link] [arXiv version]
Combinatorial Nullstellensatz and Turán numbers of complete r-partite r-uniform hypergraphs
A. Gordeev
arXiv:2307.04447, 2023.
[PDF]
The Alon–Tarsi Number of A Toroidal Grid
Z. Li, Z. Shao, F. Petrov, A. Gordeev
European Journal of Combinatorics, 111, 103697, 2023.
[Link][arXiv version]
Erdős–Hajnal problem for H-free hypergraphs
D. Cherkashin, A. Gordeev, G. Strukov
arXiv:2207.05840, to appear in Graphs and Combinatorics.
[PDF]
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
F. Petrov, A. Gordeev
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]
Powered by Jekyll and Minimal Light theme.