Андрей
Купавский
Руководитель лаборотории
Область научных интересов:
Экстремальная Комбинаторика, Дискретная и Вычислительная Геометрия, Анализ Булевых Функций, Вероятностные Методы, отдельные разделы Теоретической Информатики
kupavskii@ya.ru
Краткая биография
Родился 17.11.1989 в городе Ногинск Московской области, Россия. В 2005 году закончил с серебряной медалью Ногинскую Гимназию. В 2010 году закончил с красным дипломом Московский Государственный Университет им. М.В. Ломоносова. В 2013 году защитил кандидатскую диссертацию на кафедре Теории Чисел МГУ под руководством проф. А.М. Райгородского и Н.Г. Мощевитина.
Дек 2019 - настоящее время: МФТИ Россия, зам. заведующего Лаборатории Комбинаторных и Геометрических структур (зав. лабораторией - проф. Янош Пах).
Дек 2018 - Авг 2019: Университет Оксфорда Англия: исследователь (постдок) в группе Комбинаторики, под руководством проф. Питера Киваша.
Сент 2018 - настоящее время: грант Advanced Postdoc.Mobility Швейцарского Фонда Научных Исследований.
Июн 2018 - настоящее время, Кавказский Математический Центр, Россия: сотрудник, под руководством проф. А.М. Райгородского.
Ноя 2017 - настоящее время, Университет Бирмингема, Англия: исследователь (постдок) в группе Комбинаторики и Вероятности, под руководством проф. Даниелы Кюн и Дерика Остуса.
Окт 2016 - Окт 2017, EPFL,Швейцария: постдок в группе Дискретной и Вычислительной Геометрии, под руководством проф. Яноша Паха.
Май 2016 - настоящее время, МФТИ, Россия: старший научный сотрудник Лаборатории Продвинутой Комбинаторики и Сетевых Приложений, под руководством проф. А.М. Райгородского.
Фев 2016 - Сент 2016, G-SCOP, CNRS, Франция: постдок в группе Комбинаторной Оптимизации, под руководством проф. Андраша Шебё.
Сент 2013 - Янв 2016, EPFL, Швейцария: постдок в группе Дискретной и Вычислительной Геометрии, под руководством проф. Яноша Паха.
Сент 2011 - Май 2016, МФТИ, Россия: младший научный сотрудник на кафедре Дискретной Математики, под руководством проф. А.М. Райгородского.
Июнь 2011 - Авг 2013, Яндекс, Россия: исследователь в группе теории Яндекса, под руководством к.ф.м.н. Павла Сердюкова.
Профили и страницы на других сайтах
- Профиль на портале МФТИ
- ResearchGate
- Статьи на ArXiv
- Профиль на портале Google Scholar
- DPBL
Публикации
Статьи в журналах
- Intersection theorems for (-1, 0, 1)-vectors, European Journal of Combinatorics, Volume 117, March 2024, 103830
- Robust Algebraic Connectivity, Programming and Computer Software, Volume 49, pages 525–534, (2023)
- Uniform intersecting families with large covering number, European Journal of Combinatorics, Volume 113, October 2023, 103747
- The Crossing Tverberg Theorem, Discrete & Computational Geometry,
- Nearly k-distance sets, Discrete & Computational Geometry, Volume 70, Pages 455-494, (2023)
- 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
- Perfect matchings in down-sets, Discrete Mathematics, Volume 346, Issue 5, May 2023, 113323
- Erdos matching conjecture for almost perfect matchings, Discrete Mathematics, Volume 346, Issue 4, April 2023, 113304
- Rainbow version of the Erdos Matching Conjecture via concentration, Combinatorial Theory (escholarship), Volume 3, Issue 1
- 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
- Minimum number of partial triangulations, European Journal of Combinatorics, Volume 108, February 2023, 103636
- Best possible bounds on the number of distinct differences in intersecting families, European Journal of Combinatorics, Volume 107, January 2023, 103601
- Odd-distance and right-equidistant sets in the maximum and Manhattan metrics, European Journal of Combinatorics, Volume 107, January 2023, 103603
- Odd-Distance Sets and Right-Equidistant Sequences in the Maximum and Manhattan Metrics, Doklady Mathematics, Volume 106, Pages 340-342, 2022
- Choice number of Kneser graphs, Discrete Mathematics, Volume 345, Issue 11, November 2022, 113097
- 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
- Sharp bounds for the chromatic number of random Kneser graphs, Journal of Combinatorial Theory. Series B, Volume 157, November 2022, Pages 96-122
- The Erdos Matching Conjecture and concentration inequalities, Journal of Combinatorial Theory. Series B, Volume 157, November 2022, Pages 366-400
- Intersection Theorems for Triangles, Discrete & Computational Geometry, Volume 68, pages 728–737, (2022)
- Almost Sharp Bounds on the Number of Discrete Chains in the Plane, Combinatorica, Volume 42, pages 1119–1143, (2022)
- Binary scalar products, Journal of Combinatorial Theory. Series B, Volume 156, September 2022, Pages 18-30
- VC-saturated set systems, European Journal of Combinatorics, Volume 104, August 2022, 103528
- The Extremal Number of Surfaces, International Mathematics Research Notices, Volume 2022, Issue 17, August 2022, Pages 13246–13271
- On the maximum number of distinct intersections in an intersecting family, Discrete Mathematics, Volume 345, Issue 4, April 2022, 112757
- Infinite sets can be Ramsey in the Chebyshev metric, Russian Mathematical Surveys, Volume 77, Issue 3, 2022, Pages 549–551
- All finite sets are Ramsey in the maximum norm, Forum of Mathematics, Sigma, Volume 9 , 2021 , e55
- Lower bounds for searching robots, some faulty, Distributed Computing, Volume 34, Issue 4, Pages 229 - 237
- Diversity, Journal of Combinatorial Theory. Series A, Volume 182, August 2021, 105468
- Beyond the Erdos Matching Conjecture, European Journal of Combinatorics, Volume 95, June 2021, 103338
- Rainbow matchings in k-partite hypergraphs, Bulletin of the London Mathematical Society, Volume 53, Issue2, April 2021, Pages 360-369
- Almost intersecting families, Electronic Journal of Combinatorics, Volume 28, Issue 2, 2021, P2.7
- The VC-dimension of k-vertex d-polytopes, Combinatorica, Volume 40, pages 869–874, (2020)
- The right acute angles problem?, European Journal of Combinatorics, Volume 89, October 2020, 103144
- Simple Juntas for Shifted Families, Discrete Analysis, September 2020, 14
- Sharp results concerning disjoint cross-intersecting families, European Journal of Combinatorics, Volume 86, May 2020, 103089
- Ramsey theory in a space with Chebyshev metric, Russian Mathematical Surveys, Volume 75, Number 5, 2020, Pages 965-967
- 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.
- On 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.
Статьи в рецензируемых материалах конференций
- P. Frankl, A. Kupavskii, Some results around the Erdős Matching Conjecture, Acta Mathematica Universitatis Comenianae, 88 (2019), N3, 695-699.
- S. Kiselev, A. Kupavskii, Sharp bounds for the chromatic number of random Kneser graphs, Acta Mathematica Universitatis Comenianae, 88 (2019), N3, 861'865.
- N. Frankl, A. Kupavskii, Nearly $k$-distance sets, Acta Mathematica Universitatis Comenianae, 88 (2019), N3, 689-693.
- R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, The crossing Tverberg Theorem, Proceedings of SoCG'19
- A. Kupavskii, E. Welzl, Lower bounds for searching robots, some faulty, Proceedings of PODC'18
- N. Frankl, A. Kupavskii, K. Swanepoel, Embedding graphs in Euclidean space, Electronic Notes in Discrete Mathematics61 (2017), 475-481. Proceedings of EuroComb'17
- A. Kupavskii, P. Frankl, Families with no matchings of size $ss$, Electronic Notes in Discrete Mathematics61 (2017), 483-489. Proceedings of EuroComb'17
- 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.
- 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.
- A. Kupavskii, N. Mustafa, J. Pach, Lower bounds for the size of $epsilon$-nets, Proceedings of SoCG'2016.
- A. Kupavskii, J. Pach, Simultaneous approximation of polynomials, Proceedings of JCDCG^2 (2015).
- N. Alon, A. Kupavskii, Two notions of unit distance graphs, Proceedings of EuroComb'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.
- A. Kupavskii, A. Umnov, G. Gusev, P. Serdyukov, Predicting the Audience Size of a Tweet, ICWSM'13.
- A.B. Kupavskii, A.M. Raigorodskii, On the chromatic number of small-dimensional Euclidean spaces, Electronic Notes in Discrete Mathematics, EuroComb'09.
Книги
- А. Глибичук, А.А. Дайняк, Д.Г. Ильинский, А.Б. Купавский, А.М. Райгородский, А.Б. Скопенков, А.А. Чернов, Элементы дискретной математики в задачах, МЦНМО, 2016.
Кандидатская диссертация
- А.Б. Купавский, Упаковки и раскраски сфер в пространствах большой размерности, Московский Государственный Университет, 26.04.2013.
Докторская диссертация
- А.Б. Купавский, Семейства множеств с запрещёнными конфигурациями и приложения к дискретной геометрии, Московский Физико-Технический Университет, 19.05.2019.