Andrey
Kupavskii
Research interests:
Extremal Combinatorics, Discrete and Computational Geometry, Probabilistic Methods, Analysis of Boolean Functions, selected topics in Computer Science
kupavskii@ya.ru
Short Biography
I was born on November 17 in 1989 in Noginsk, Russia. I graduated with honours from Noginsk Gymnasium in 2005. I received a Master's degree with honours in mathematics from Moscow State University in 2010. In 2013 I got my PhD in mathematics from the Number Theory Department of Moscow State University under the supervision of prof. A.M. Raigorodskii and prof. N.G. Moschevitin.
Dec 2019 - present: MIPT, Russia: vice-head in Laboratory of Combinatorial and Geometric Structures.
Dec 2018 - Aug 2019: University of Oxford, UK: Advanced Postdoc.Mobility fellow of Swiss National Science Foundation (host: Prof. Peter Keevash).
Nov 2017 - Nov 2018, University of Birmingham, UK: postdoc in the Combinatorics and Probability group (head: Prof. Daniela Kühn and Prof. Deryk Osthus)
Oct 2016 - Oct 2017, EPFL, Switzerland: research fellow (postdoc) in the DCG (Discrete and Computational Geometry) group (head: Prof. János Pach).
May 2016 - present, MIPT, Russia: senior research fellow at the Laboratory of Advanced Combinatorics and Networks Applications (head: Prof. Andrei Raigorodskii).
Feb 2016 - Sept 2016, G-SCOP, CNRS, France: postdoc in the Combinatorial Optimization group (head: Dr András Sebö).
Sept 2013 - Jan 2016, EPFL, Switzerland: postdoc in the DCG (Discrete and Computational Geometry) group (head: Prof. János Pach).
Sept 2011 - May 2016, MIPT, Russia: junior research fellow in the Discrete Mathematics Department (head: Prof. Andrei Raigorodskii).
Jun 2011 - Aug 2013, Yandex, Russia: research fellow in the Yandex theory group (head: Dr Pavel Serdyukov).
Webpages and profiles on other sites
Publications
Submitted
- The right acute angles problem? submitted
- Nearly $k$-distance sets, submitted
- Beyond the Erdős Matching Conjecture, submitted
- Simple juntas for shifted families, submitted
- Diversity, submitted
- Simplices in diameter and unit distance graphs, in preparation
Journal publications
- Embedding graphs in Euclidean space, accepted at J. Comb. Theory Ser. A.
- Rainbow structures in locally bounded colourings of graphs, to appear in Random Structures and Algorithms.
- Incompatible intersection properties, to appear in Combinatorica.
- Optimal bounds on the VC-dimension, Journal of Machine Learning Research 20 (2019), 81.1-81.8.
- Degree versions of theorems on intersecting families via stability, J. Comb. Theory Ser. A 168 (2019), 272-287.
- When are epsilon-nets small?, to appear in Journal of Computer and System Sciences.
- Regular intersecting families, Disc. Appl. Math. 270 (2019), 142-152.
- Random Kneser graphs and hypergraphs, Electronic Journal of Combinatorics (2018) P4.52
- Families of sets with no matching of sizes 3 and 4, European Journal of Combinatorics 75 (2019), 123-135.
- Partition-free families of sets, Proceedings of the London Mathematical Society (2019), DOI: 10.1112/plms.12236
- Two problems on matchings in set families - in the footsteps of Erdős and Kleitman, J. Comb. Th. Ser. B (2019) https://doi.org/10.1016/j.jctb.2019.02.004
- Short monadic second-order sentences about sparse random graphs, SIAM J. Discrete Math. 32 (2018), N4, 2916–2940
- Bounding the size of an almost-equidistant set in Euclidean space, to appear in Comb. Probab. Comput.
- Diversity of uniform intersecting families, European Journal of Combinatorics 74 (2018), 39-47.
- Tilings with noncongruent triangles, European Journal of Combinatorics 73 (2018), 72-80.
- Controlling Lipschitz functions, Mathematika 64 (2018), N3, 898--910.
- Tilings of the plane with unit area triangles of bounded diameter, Acta Math. Hungarica 155 (2018), N1, 175-183
- New inequalities for families without $kk$ pairwise disjoint members, J. Comb. Th. Ser. A 157 (2018), 427-434.
- Erdős-Ko-Rado theorem for $\{0,\pm 1\}\{0,\pm 1\}$-vectors, J. Comb. Theory Ser. A 155 (2018), 157-179.
- Regular bipartite graphs and intersecting families, J. Comb. Theory Ser. A 155 (2018), 180-189.
- n the size of $kk$-cross-free families, Combinatorica (2018), DOI: 10.1007/s00493-017-3792-8
- Families of vectors without antipodal pairs, Studia Sci. Math. Hungarica 55 (2018), N2, 231-237.
- Counting intersecting and pairs of cross-intersecting families, Comb. Probab. Comput. 27 (2018), N1, 60-68.
- Families with no s pairwise disjoint sets, Journal of the London Mathematical Society 95 (2017), N3, 875-894.
- Intersection theorems for $\{0,\pm 1\}\{0,\pm 1\}$-vectors and ss-cross-intersecting families, Moscow Journal of Combinatorics and Number Theory 7 (2017), N2, 91-109.
- A size-sensitive inequality for cross-intersecting families, European Journal of Combinatorics 62 (2017), 263-271
- Uniform 𝑠-cross-intersecting families, Combinatorics, Probability and Computing 26 (2017), N4, 517-524.
- From Tarski's plank problem to simultaneous approximation, The American Math. Monthly 124 (2017), N6, 494-505.
- Proof of Schur's conjecture in $R^d$, Combinatorica 37 (, N6, 1181-1205.
- Spectra of short monadic sentences about sparse random graphs, Doklady Math. 95 (2017), N1, 60-61.
- On simplices in diameter graphs in $R^4$, Mathematical Notes 101 (2017), N2, 232-246.
- Colorings of uniform hypergraphs with large girth and applications, Combinatorics, Probability & Computing 27 (2018), N2, 245-273.
- Number of double-normal pairs in space, Discrete and Computational Geometry 56 (2016), N3, 711-726.
- On random subgraphs of Kneser and Schrijver graphs, J. Comb Theory Ser. A 141 (2016), 8–15.
- On Schur's conjecture in $R^4$, Math. Notes 97, N1 (2015), 21–29.
- Colorings of Partial Steiner Systems and Their Applications, J. Math. Sci. 206 (2015), N6, 511–538.
- Diameter graphs in $R^4$, Discrete and Computational Geometry 51, N4 (2014), 842–858.
- Note on Schur's conjecture in $R^4$, Doklady Math. 89, N1 (2014), 88–91.
- Two notions of unit distance graphs, Journal of Combinatorial Theory, Series A 125 (2014), 1–17.
- Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers, Izvestiya: Mathematics 78, N1 (2014), 59–89.
- Distance Ramsey numbers, Doklady Math. 87, N2 (2013), 171-174.
- New bounds for distance Ramsey numbers, Discrete Mathematics 313 (2013), 2566–2574.
- The distribution of second degrees in the Buckley-Osthus random graph model, Internet Mathematics 9, N4 (2013) 297–335
- Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii, Sbornik: Mathematics 204, N10 (2013) 1435–1479.
- Colorings of partial Steiner systems and their applications, Fundam. Prikl. Mat. 18, N3 (2013), 77–115.
- Discrete analysis for mathematicians and computer scientists, Matematicheskoe Prosveshenie 3, N 17 (2013), 162–181 (In Russian).
- On densest sets without distance one in small-dimensional spaces, Proceedings of Moscow Institute of Physics and Technology 4, N1–13 (2012), 111–121 (in Russian).
- On some analogues of Borsuk problem in $Q^d$, Proceedings of Moscow Institute of Physics and Technology 4, N1–13 (2012), 81–90 (in Russian).
- On distance graphs with large chromatic numbers and small clique numbers, Doklady Math. 85 (2012), N3, 394–398.
- Colorings of uniform hypergraphs with large girth, Doklady Math. 85 (2012), N2, 247-250.
- Distance graphs with large chromatic number and arbitrary girth, Moscow J. Comb. Number Theory 2 (2012), N2, 52–62.
- Counterexamples to Borsuk's conjecture on spheres of small radii, Moscow J. Comb. Number Theory 2 (2012), N4 27–48.
- On the chromatic number of $R^n$ with an arbitrary norm, Discrete Mathematics 311 (2011), 437–440.
- On the coloring of spheres embedded in $R^n$, Sbornik: Mathematics 202 (2011), N6, 859-886.
- The chromatic number of the space $R^n$ with the set of forbidden distances, Doklady Math. 82 (2010), N3, 963-966.
- Partition of 3-dimensional sets into 5 parts of smaller diameter, Math. Notes 87 (2010), N2, 218-229.
- Lifting lower bounds of the chromatic number of $R^n$ in higher dimension, Doklady Math. 80, N3 (2009), 833–836.
- About the chromatic number of $R^9$, J. Math. Sci. 163, N6 (2008), 720–731.
Refereed Conferences Publications
- Some results around the Erdős Matching Conjecture, Acta Mathematica Universitatis Comenianae, 88 (2019), N3, 695-699.
- Sharp bounds for the chromatic number of random Kneser graphs, Acta Mathematica Universitatis Comenianae, 88 (2019), N3, 861'865.
- Nearly $k$-distance sets, Acta Mathematica Universitatis Comenianae, 88 (2019), N3, 689-693.
- The crossing Tverberg Theorem, Proceedings of SoCG'19
- Lower bounds for searching robots, some faulty, Proceedings of PODC'18
- Embedding graphs in Euclidean space, Electronic Notes in Discrete Mathematics61 (2017), 475-481. Proceedings of EuroComb'17
- Families with no matchings of size $ss$, Electronic Notes in Discrete Mathematics61 (2017), 483-489. Proceedings of EuroComb'17
- Near-Optimal Lower Bounds for $\epsilon$-nets for Halfspaces and Low Complexity Set Systems A Journey Through Discrete Mathematics. Springer, Cham (2017), 527-541.
- A short proof for an extension of the Erdős-Ko-Rado Theorem, in Proceedings of Connections in Discrete Mathematics conference.
- Lower bounds for the size of $\epsilon$-nets, Proceedings of SoCG'2016.
- Simultaneous approximation of polynomials, Proceedings of JCDCG^2 (2015).
- Two notions of unit distance graphs, Proceedings of EuroComb'13.
- Prediction of retweet cascade size over time, Proceedings of the 21st ACM international conference on Information and knowledge management (2012), ACM.
- Predicting the Audience Size of a Tweet, ICWSM'13.
- On the chromatic number of small-dimensional Euclidean spaces, Electronic Notes in Discrete Mathematics, EuroComb'09.
Books
- Elements of discrete mathematics in problems, MCCME, 2016 (in Russian).
PhD thesis
- Packing and colouring spheres in high-dimensional spaces, Moscow State University, 26.04.2013.
Habilitation
- Families of sets with forbidden configurations and applications to discrete geometry, Moscow Institute of Physics and Technology, 19.05.2019