Andrey Kupavskii

Members - Andrey Kupavskii
Photo by Dan Komoda/Institute for Advanced Study

Andrey
Kupavskii

MIPT
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).

Lab videos

Publications

JournalConferencesBooksPhD
JournalConferencesBooksPhD

Journal publications

  1. Frankl P., Kupavskii A.
    Intersection theorems for (-1, 0, 1)-vectors, European Journal of Combinatorics, Volume 117, March 2024, 103830
  2. Kuruzov I., Rogozin A., Chezhegov S., Kupavskii A.
    Robust Algebraic Connectivity, Programming and Computer Software, Volume 49, pages 525–534, (2023)
  3. Frankl P., Kupavskii A.
    Uniform intersecting families with large covering number, European Journal of Combinatorics, Volume 113, October 2023, 103747
  4. Fulek, R. , Gärtner, B., Kupavskii, A., Valtr, P., Wagner, U.
    The Crossing Tverberg Theorem, Discrete & Computational Geometry,
  5. Frankl N., Kupavskii A.
    Nearly k-distance sets, Discrete & Computational Geometry, Volume 70, Pages 455-494, (2023)
  6. Kupavskii A., Noskov F.
    Octopuses in the Boolean cube. Families with pairwise small intersections, part I, Journal of Combinatorial Theory. Series B, Volume 163, November 2023, Pages 308-331
  7. Frankl P., Kupavskii A.
    Perfect matchings in down-sets, Discrete Mathematics, Volume 346, Issue 5, May 2023, 113323
  8. Kolupaev D., Kupavskii A.
    Erdos matching conjecture for almost perfect matchings, Discrete Mathematics, Volume 346, Issue 4, April 2023, 113304
  9. Kupavskii A.
    Rainbow version of the Erdos Matching Conjecture via concentration, Combinatorial Theory (escholarship), Volume 3, Issue 1
  10. Frankl N., Kupavskii A., Sagdeev A.
    Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings, Proceedings of the American Mathematical Society, Volume 151, 2023, Pages 2353-2362
  11. Kupavskii A., Volostnov A., Yarovikov Y.
    Minimum number of partial triangulations, European Journal of Combinatorics, Volume 108, February 2023, 103636
  12. Frankl P., Kiselev S., Kupavskii A.
    Best possible bounds on the number of distinct differences in intersecting families, European Journal of Combinatorics, Volume 107, January 2023, 103601
  13. Golovanov A., Kupavskii A., Sagdeev A.
    Odd-distance and right-equidistant sets in the maximum and Manhattan metrics, European Journal of Combinatorics, Volume 107, January 2023, 103603
  14. Golovanov A., Kupavskii A., Sagdeev A.
    Odd-Distance Sets and Right-Equidistant Sequences in the Maximum and Manhattan Metrics, Doklady Mathematics, Volume 106, Pages 340-342, 2022
  15. Bulankina V., Kupavskii A.
    Choice number of Kneser graphs, Discrete Mathematics, Volume 345, Issue 11, November 2022, 113097
  16. Groenland C., Johnston T., Kupavskii A., Meeks K., Scott A., Tan J.
    Reconstructing the degree sequence of a sparse graph from a partial deck, Journal of Combinatorial Theory. Series B, Volume 157, November 2022, Pages 283-293
  17. Kiselev S., Kupavskii A.
    Sharp bounds for the chromatic number of random Kneser graphs, Journal of Combinatorial Theory. Series B, Volume 157, November 2022, Pages 96-122
  18. Frankl P., Kupavskii A.
    The Erdos Matching Conjecture and concentration inequalities, Journal of Combinatorial Theory. Series B, Volume 157, November 2022, Pages 366-400
  19. Frankl P., Holmsen A., Kupavskii A.
    Intersection Theorems for Triangles, Discrete & Computational Geometry, Volume 68, pages 728–737, (2022)
  20. Frankl N., Kupavskii A.
    Almost Sharp Bounds on the Number of Discrete Chains in the Plane, Combinatorica, Volume 42, pages 1119–1143, (2022)
  21. Kupavskii A., Weltge S.
    Binary scalar products, Journal of Combinatorial Theory. Series B, Volume 156, September 2022, Pages 18-30
  22. Frankl N., Kiselev S., Kupavskii A., Patkós B.
    VC-saturated set systems, European Journal of Combinatorics, Volume 104, August 2022, 103528
  23. Kupavskii A., Polyanskii A., Tomon I., Zakharov D.
    The Extremal Number of Surfaces, International Mathematics Research Notices, Volume 2022, Issue 17, August 2022, Pages 13246–13271
  24. Frankl P., Kiselev S., Kupavskii A.
    On the maximum number of distinct intersections in an intersecting family, Discrete Mathematics, Volume 345, Issue 4, April 2022, 112757
  25. Kupavskii A., Sagdeev A., Frankl N.
    Infinite sets can be Ramsey in the Chebyshev metric, Russian Mathematical Surveys, Volume 77, Issue 3, 2022, Pages 549–551
  26. Kupavskii A., Sagdeev A.
    All finite sets are Ramsey in the maximum norm, Forum of Mathematics, Sigma, Volume 9 , 2021 , e55
  27. Kupavskii A., Welzl E.
    Lower bounds for searching robots, some faulty, Distributed Computing, Volume 34, Issue 4, Pages 229 - 237
  28. Frankl P., Kupavskii A.
    Diversity, Journal of Combinatorial Theory. Series A, Volume 182, August 2021, 105468
  29. Frankl P., Kupavskii A.
    Beyond the Erdos Matching Conjecture, European Journal of Combinatorics, Volume 95, June 2021, 103338
  30. Kiselev S., Kupavskii A.
    Rainbow matchings in k-partite hypergraphs, Bulletin of the London Mathematical Society, Volume 53, Issue2, April 2021, Pages 360-369
  31. Frankl P., Kupavskii A.
    Almost intersecting families, Electronic Journal of Combinatorics, Volume 28, Issue 2, 2021, P2.7
  32. Kupavskii A.
    The VC-dimension of k-vertex d-polytopes, Combinatorica, Volume 40, pages 869–874, (2020)
  33. Kupavskii A., Zakharov D.
    The right acute angles problem?, European Journal of Combinatorics, Volume 89, October 2020, 103144
  34. Frankl P., Kupavskii A.
    Simple Juntas for Shifted Families, Discrete Analysis, September 2020, 14
  35. Frankl P., Kupavskii A.
    Sharp results concerning disjoint cross-intersecting families, European Journal of Combinatorics, Volume 86, May 2020, 103089
  36. Kupavskii A., Sagdeev A.
    Ramsey theory in a space with Chebyshev metric, Russian Mathematical Surveys, Volume 75, Number 5, 2020, Pages 965-967
  37. N. Frankl, A. Kupavskii, K. Swanepoel,
    Embedding graphs in Euclidean space, accepted at J. Comb. Theory Ser. A.
  38. J. Kim, D. Kühn, A. Kupavskii, D. Osthus,
    Rainbow structures in locally bounded colourings of graphs, to appear in Random Structures and Algorithms.
  39. P. Frankl, A. Kupavskii,
    Incompatible intersection properties, to appear in Combinatorica.
  40. M. Csikós, A. Kupavskii, N. Mustafa,
    Optimal bounds on the VC-dimension, Journal of Machine Learning Research 20 (2019), 81.1-81.8.
  41. A. Kupavskii,
    Degree versions of theorems on intersecting families via stability, J. Comb. Theory Ser. A 168 (2019), 272-287.
  42. A. Kupavskii, N. Zhivotovskiy,
    When are epsilon-nets small?, to appear in Journal of Computer and System Sciences.
  43. F. Ihringer, A. Kupavskii,
    Regular intersecting families, Disc. Appl. Math. 270 (2019), 142-152.
  44. A. Kupavskii,
    Random Kneser graphs and hypergraphs, Electronic Journal of Combinatorics (2018) P4.52
  45. P. Frankl, A. Kupavskii,
    Families of sets with no matching of sizes 3 and 4, European Journal of Combinatorics 75 (2019), 123-135.
  46. P. Frankl, A. Kupavskii,
    Partition-free families of sets, Proceedings of the London Mathematical Society (2019), DOI: 10.1112/plms.12236
  47. P. Frankl, A. Kupavskii,
    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
  48. A. Kupavskii, M. Zhukovskii,
    Short monadic second-order sentences about sparse random graphs, SIAM J. Discrete Math. 32 (2018), N4, 2916-2940
  49. A. Kupavskii, N. Mustafa, K. Swanepoel,
    Bounding the size of an almost-equidistant set in Euclidean space, to appear in Comb. Probab. Comput.
  50. A. Kupavskii,
    Diversity of uniform intersecting families, European Journal of Combinatorics 74 (2018), 39-47.
  51. A. Kupavskii, J. Pach, G. Tardos,
    Tilings with noncongruent triangles, European Journal of Combinatorics 73 (2018), 72-80.
  52. A. Kupavskii, J. Pach, G. Tardos,
    Controlling Lipschitz functions, Mathematika 64 (2018), N3, 898--910.
  53. A. Kupavskii, J. Pach, G. Tardos,
    Tilings of the plane with unit area triangles of bounded diameter, Acta Math. Hungarica 155 (2018), N1, 175-183
  54. P. Frankl, A. Kupavskii,
    New inequalities for families without $kk$ pairwise disjoint members, J. Comb. Th. Ser. A  157 (2018), 427-434.
  55. P. Frankl, A. Kupavskii,
    Erdős-Ko-Rado theorem for ${0,pm 1}{0,pm 1}$-vectors, J. Comb. Theory Ser. A 155 (2018), 157-179.
  56. A. Kupavskii, D. Zakharov,
    Regular bipartite graphs and intersecting families, J. Comb. Theory Ser. A 155 (2018), 180-189.
  57. A. Kupavskii, J. Pach, I. Tomon,
    On the size of $kk$-cross-free families, Combinatorica (2018), DOI: 10.1007/s00493-017-3792-8
  58. P. Frankl, A. Kupavskii,
    Families of vectors without antipodal pairs, Studia Sci. Math. Hungarica 55 (2018), N2, 231-237.
  59. P. Frankl, A. Kupavskii,
    Counting intersecting and pairs of cross-intersecting families, Comb. Probab. Comput. 27 (2018), N1, 60-68.
  60. P. Frankl, A. Kupavskii,
    Families with no s pairwise disjoint sets, Journal of the London Mathematical Society 95 (2017), N3, 875-894.
  61. P. Frankl, A. Kupavskii,
    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.
  62. P. Frankl, A. Kupavskii,
    A size-sensitive inequality for cross-intersecting families, European Journal of Combinatorics 62 (2017), 263-271
  63. P. Frankl, A. Kupavskii,
    Uniform 𝑠-cross-intersecting families, Combinatorics, Probability and Computing 26 (2017), N4, 517-524.
  64. A. Kupavskii, J. Pach,
    From Tarski's plank problem to simultaneous approximation, The American Math. Monthly 124 (2017), N6, 494-505.
  65. A. Kupavskii, A. Polyanskii,
    Proof of Schur's conjecture in $R^d$, Combinatorica 37 (, N6, 1181-1205.
  66. A. B. Kupavskii, M. E. Zhukovskii,
    Spectra of short monadic sentences about sparse random graphs, Doklady Math. 95 (2017), N1, 60-61.
  67. A. Kupavskii, A. Polyanskii,
    On simplices in diameter graphs in $R^4$, , Mathematical Notes 101 (2017), N2, 232-246.
  68. A. Kupavskii, D.A. Shabanov,
    Colorings of uniform hypergraphs with large girth and applications, Combinatorics, Probability & Computing 27 (2018), N2, 245-273.
  69. A. Kupavskii,
    Number of double-normal pairs in space, Discrete and Computational Geometry 56 (2016), N3, 711-726.
  70. A. Kupavskii,
    On random subgraphs of Kneser and Schrijver graphs, J. Comb Theory Ser. A 141 (2016), 8-15.
  71. V.V. Bulankina, A.B. Kupavskii, A.A. Polyanskiy,
    On Schur's conjecture in $R^4$, Math. Notes 97, N1 (2015), 21-29.
  72. A. Kupavskii, D.A. Shabanov,
    Colorings of Partial Steiner Systems and Their Applications, , J. Math. Sci. 206 (2015), N6, 511-538.
  73. A. Kupavskii,
    Diameter graphs in $R^4$, Discrete and Computational Geometry 51, N4 (2014), 842-858.
  74. V.V. Bulankina, A.B. Kupavskii, A.A. Polyanskiy,
    Note on Schur's conjecture in $R^4$, Doklady Math. 89, N1 (2014), 88-91.
  75. N. Alon, A. Kupavskii,
    Two notions of unit distance graphs, Journal of Combinatorial Theory, Series A 125 (2014), 1-17.
  76. A. Kupavskii,
    Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers, Izvestiya: Mathematics 78, N1 (2014), 59-89.
  77. A. Kupavskii, M. Titova,
    Distance Ramsey numbers, Doklady Math. 87, N2 (2013), 171-174.
  78. A. Kupavskii, A. Raigorodskii, M. Titova,
    New bounds for distance Ramsey numbers, Discrete Mathematics 313 (2013), 2566-2574.
  79. A.B. Kupavskii, L. Ostroumova, P. Tetali, D. Shabanov,
    The distribution of second degrees in the Buckley-Osthus random graph model, Internet Mathematics 9, N4 (2013) 297-335
  80. A.B. Kupavskii, A.M.Raigorodskii,
    Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii, Sbornik: Mathematics 204, N10 (2013) 1435-1479.
  81. A.B. Kupavskii, D.A. Shabanov,
    Colorings of partial Steiner systems and their applications, Fundam. Prikl. Mat. 18, N3 (2013), 77-115.
  82. D. Il'inskiy, A. Kupavskii, A. Raigorodskii, A. Skopenkov,
    Discrete analysis for mathematicians and computer scientists, Matematicheskoe Prosveshenie 3, N 17 (2013), 162-181 (In Russian).
  83. A.B. Kupavskii, A.M. Raigorodskii, M. Titova,
    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).
  84. A.B. Kupavskii, E.I. Ponomarenko, A.M. Raigorodskii,
    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).
  85. A.B. Kupavskii, A.M. Raigorodskii,
    On distance graphs with large chromatic numbers and small clique numbers, Doklady Math. 85 (2012), N3, 394-398.
  86. A.B. Kupavskii, D.A. Shabanov,
    Colorings of uniform hypergraphs with large girth, Doklady Math. 85 (2012), N2, 247-250.
  87. A.B. Kupavskii,
    Distance graphs with large chromatic number and arbitrary girth, Moscow J. Comb. Number Theory 2 (2012), N2, 52-62.
  88. A.B. Kupavskii, A.M. Raigorodskii,
    Counterexamples to Borsuk's conjecture on spheres of small radii, Moscow J. Comb. Number Theory 2 (2012), N4 27-48.
  89. A. Kupavskiy,
    On the chromatic number of $R^n$ with an arbitrary norm, Discrete Mathematics 311 (2011), 437-440.
  90. A. Kupavskii,
    On the coloring of spheres embedded in $R^n$, Sbornik: Mathematics 202 (2011), N6, 859-886.
  91. A. Kupavskii,
    The chromatic number of the space $R^n$ with the set of forbidden distances, Doklady Math. 82 (2010), N3, 963-966.
  92. A. Kupavskii, A.M. Raigorodskii,
    Partition of 3-dimensional sets into 5 parts of smaller diameter, Math. Notes 87 (2010), N2, 218-229.
  93. A. Kupavskii,
    Lifting lower bounds of the chromatic number of $R^n$ in higher dimension, Doklady Math. 80, N3 (2009), 833-836.
  94. A. Kupavskiy, A.M. Raigorodskii,
    About the chromatic number of $R^9$, J. Math. Sci. 163, N6 (2008), 720-731.

Refereed Conferences Publications

  1. P. Frankl, A. Kupavskii, Some results around the Erdős Matching Conjecture, Acta Mathematica Universitatis Comenianae, 88 (2019), N3, 695-699.
  2. S. Kiselev, A. Kupavskii, Sharp bounds for the chromatic number of random Kneser graphs, Acta Mathematica Universitatis Comenianae, 88 (2019), N3, 861'865.
  3. N. Frankl, A. Kupavskii, Nearly $k$-distance sets, Acta Mathematica Universitatis Comenianae, 88 (2019), N3, 689-693.
  4. R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, The crossing Tverberg Theorem, Proceedings of SoCG'19
  5. A. Kupavskii, E. Welzl, Lower bounds for searching robots, some faulty, Proceedings of PODC'18
  6. N. Frankl, A. Kupavskii, K. Swanepoel, Embedding graphs in Euclidean space, Electronic Notes in Discrete Mathematics61 (2017), 475-481. Proceedings of EuroComb'17
  7. A. Kupavskii, P. Frankl, Families with no matchings of size $ss$, Electronic Notes in Discrete Mathematics61 (2017), 483-489. Proceedings of EuroComb'17
  8. A. Kupavskii, N. Mustafa, J. Pach, Near-Optimal Lower Bounds for $epsilon$-nets for Halfspaces and Low Complexity Set Systems A Journey Through Discrete Mathematics. Springer, Cham (2017), 527-541.
  9. P. Frankl, A. B. Kupavskii, A short proof for an extension of the Erdős-Ko-Rado Theorem, in Proceedings of Connections in Discrete Mathematics conference.
  10. A. Kupavskii, N. Mustafa, J. Pach, Lower bounds for the size of $epsilon$-nets, Proceedings of SoCG'2016.
  11. A. Kupavskii, J. Pach, Simultaneous approximation of polynomials, Proceedings of JCDCG^2 (2015).
  12. N. Alon, A. Kupavskii, Two notions of unit distance graphs, Proceedings of EuroComb'13.
  13. A. Kupavskii, L. Ostroumova, A. Umnov, S. Usachev, P. Serdyukov, G. Gusev, A. Kustarev, Prediction of retweet cascade size over time, Proceedings of the 21st ACM international conference on Information and knowledge management (2012), ACM.
  14. A. Kupavskii, A. Umnov, G. Gusev, P. Serdyukov, Predicting the Audience Size of a Tweet, ICWSM'13.
  15. A.B. Kupavskii, A.M. Raigorodskii, On the chromatic number of small-dimensional Euclidean spaces, Electronic Notes in Discrete Mathematics, EuroComb'09.

Books

  1. A.A. Glibichuk, A.A. Dainyak, D.G. Il'insliy, A.B. Kupavskii, A.M. Raigorodskii, A.B. Skopenkov, A.A. Chernov Elements of discrete mathematics in problems, MCCME, 2016 (in Russian).

PhD thesis

  1. A. Kupavskii, Packing and colouring spheres in high-dimensional spaces, Moscow State University, 26.04.2013.

Habilitation

  1. A. Kupavskii, Families of sets with forbidden configurations and applications to discrete geometry, Moscow Institute of Physics and Technology, 19.05.2019