Публикации

Публикации

Избранные публикации 2020 года:

  1. G Ivanov, M Naszódi, A Polyanskii: Approximation of the average of some random matrices. Journal of Functional Analysis. 2020, октябрь, Том: 279, Выпуск: 7, Номер статьи: 108684.
  2. Andrey Kupavskii, Dmitriy Zakharov: The right acute angles problem? European Journal of Combinatorics. 2020, октябрь, Том: 89, Номер статьи: 103144.
  3. Andrey Kupavskii, Zhivotovskiy N.: When are epsilon-nets small? Journal of Computer and System Sciences. 2020, июнь, Том: 110, Стр. 22-36.
  4. János Pach, Reed B., Yuditsky Y.: Almost All String Graphs are Intersection Graphs of Plane Convex Sets. Discrete & Computational Geometry volume. 2020, июнь, Том: 63, Выпуск: 4, Специальный выпуск: SI Стр. 888-917.
  5. S Bustamante, J Corsten, Nora Frankl, A Pokrovskiy: Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles. SIAM Journal on Discrete Mathematics. 2020, Том: ‏ 34,Выпуск: ‏ 2, Стр. ‏ 1460-147
  6. K. I. Olmezov: Sharpening an Estimate of the Size of the Sumset of a Convex Set. Mathematical Notes. 2020, май, Том: ‏ 107, Выпуск: 5-6, Стр. ‏ 984-987
  7. T. Schoen & I. D. Shkredov: L-functions and sum-free sets. Acta Mathematica Hungarica. 2020, август, Том: ‏ 161, Выпуск: ‏ 2, Специальный выпуск: ‏ SI, Стр. ‏ 427-442
  8. János Pach, István Tomon: Colorings with only rainbow arithmetic progressions. Acta Mathematica Hungarica. 2020, август, Том: ‏ 161, Выпуск: ‏ 2 Специальный выпуск: ‏ SI, Стр. ‏ 507-515
  9. Andreas F. Holmsen, Hossein Nassajian Mojarrad, János Pach, Gábor Tardos: Two extensions of the Erdos-Szekeres problem. Journal of the European Mathematical Society. 2020, Том: 22, Выпуск: ‏ 12, Стр. ‏ 3981-3995
  10. Andrey Kupavskii, A A Sagdeev: Ramsey theory in a space with Chebyshev metric. Russian Mathematical Surveys. 2020, Том: 75, Выпуск: 5, стр. 965
  11. R Zhang, M E Zhukovskii, M I Isaev, I V Rodionov: Extreme value theory for triangular arrays of dependent random variables. Russian Mathematical Surveys. 2020, Том: 75, выпуск 5 (455), стр. 193–194
  12. Sergei Kiselev, Andrey Kupavskii: Rainbow matchings in k-partite hypergraphs. Bulletin of the London Mathematical society. 2020, октябрь
  13. Andrey Kupavskii: The VC-dimension of k-vertex d-polytopes. Combinatorica. 2020, ноябрь
  14. János Pach, Gábor Tardos, Géza Tóth: Disjointness graphs of segments in the space. Combinatorics, Probability and Computing. 2020, ноябрь
  15. K. I. Olmezov: Additive Properties of Slowly Increasing Convex Sets. Mathematical Notes. 2020, ноябрь, Том: ‏ 108, Выпуск: ‏ 5-6, Стр. ‏ 827-841
  16. Daniel Korandi, János Pach, István Tomon: Large homogeneous submatrices . SIAM Journal on Discrete Mathematics. 2020, Том: ‏ 34, Выпуск: ‏ 4, Стр. ‏ 2532-2552
  17. Michael Th. Rassias, Bicheng Yang and Andrei Raigorodskii: On a More Accurate Reverse Hilbert-Type Inequality in the Whole Plane. Journal of Mathematical Inequalities. 2020, ноябрь, Том: 14, Стр. 1359–1374
  18. Balázs Patkós: On the general position problem on Kneser graphs. Ars Mathematica Contemporeana. 2020, Том: ‏ 18, Выпуск: ‏ 2, Стр. ‏ 273-280
  19. Peter Frankl: On the size of shadow-added intersecting families. European Journal of Combinatorics. 2021, February, Volume 92, Номер статьи 103243
  20. Peter Frankl, Andrey Kupavskii: Simple Juntas for Shifted Families. DISCRETE ANALYSIS. 2020, сентябрь, Номер статьи: 14
  21. Alexander Guterman, Pavel Shteyner: Linear converters of weak, directional and strong majorizations. Linear Algebra and Its Applications. 2021, март, Том 613, стр. 320-346

Янош Пах:

  1. Andrey Kupavskii, János Pach, István Tomon: On the Size of K-Cross-Free Families. Combinatorica 39(1): 153-164 (2019).
  2. Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach: A lower bound on opaque sets. Comput. Geom. 80: 13-22 (2019).
  3. Jacob Fox, János Pach, Andrew Suk: Approximating the rectilinear crossing number. Comput. Geom. 81: 45-53 (2019).
  4. Radoslav Fulek, János Pach: Thrackles: An improved upper bound. Discret. Appl. Math. 259: 226-231 (2019).
  5. Jacob Fox, János Pach, Andrew Suk: Erdős-Hajnal Conjecture for Graphs with Bounded VC-Dimension. Discret. Comput. Geom. 61(4): 809-829 (2019).
  6. János Pach, István Tomon: Ordered graphs and large bi-cliques in intersection graphs of curves. Eur. J. Comb. 82 (2019).
  7. János Pach, Géza Tóth: Many touchings force many crossings. J. Comb. Theory, Ser. B 137: 104-111 (2019).
  8. Jacob Fox, János Pach, Andrew Suk: Semi-Algebraic Colorings of Complete Graphs. Symposium on Computational Geometry 2019: 36:1-36:12.
  9. János Pach, István Tomon: On the Chromatic Number of Disjointness Graphs of Curves. Symposium on Computational Geometry 2019: 54:1-54:17.
  10. János Pach, István Tomon: Coloring Hasse Diagrams and Disjointness Graphs of Curves. GD 2019: 244-250.
  11. János Pach, Natan Rubin, Gábor Tardos: Planar point sets determine many pairwise crossing segments. STOC 2019: 1158-1166.
  12. János Pach, Reed B., Yuditsky Y.: Almost All String Graphs are Intersection Graphs of Plane Convex Sets. Discrete & Computational Geometry volume. June 2020, 63 (4), SI, pp. 888-917.
  13. János Pach, István Tomon: Colorings with only rainbow arithmetic progressions. Acta Mathematica Hungarica. August 2020, 161 (2) SI, pp. 507-515
  14. Andreas F. Holmsen, Hossein Nassajian Mojarrad, János Pach, Gábor Tardos: Two extensions of the Erdos-Szekeres problem. Journal of the European Mathematical Society. 2020, 22 (12), pp. 3981-3995
  15. János Pach, Gábor Tardos, Géza Tóth: Disjointness graphs of segments in the space. Combinatorics, Probability and Computing. November 2020
  16. Daniel Korandi, János Pach, István Tomon: Large homogeneous submatrices . SIAM Journal on Discrete Mathematics. 2020, 34 (4), pp. 2532-2552
  17. Jacob Fox, János Pach & Andrew Suk: The Schur-Erdős problem for sesmi-algebraic colorings. Israel Journal of Mathematics, 2020

Андрей Купавский:

  1. M. Csikós, A. Kupavskii, N. Mustafa, Optimal bounds on the VC-dimension, Journal of Machine Learning Research 20 (2019), pp. 81.1-81.8
  2. A. Kupavskii, Degree versions of theorems on intersecting families via stability, J. Comb. Theory Ser. A 168 (2019), pp. 272-287.
  3. F. Ihringer, A. Kupavskii, Regular intersecting families, Disc. Appl. Math. 270 (2019), pp. 142-152.
  4. P. Frankl, A. Kupavskii, Families of sets with no matching of sizes 3 and 4, European Journal of Combinatorics 75 (2019), pp. 123-135.
  5. P. Frankl, A. Kupavskii, Partition-free families of sets, Proceedings of the London Mathematical Society 119 (2019), N2, pp. 440-468.
  6. P. Frankl, A. Kupavskii, Two problems on matchings in set families - in the footsteps of Erdős and Kleitman, J. Comb. Th. Ser. B 138 (2019), pp. 286-313.
  7. A. Kupavskii, N. Mustafa, K. Swanepoel, Bounding the size of an almost-equidistant set in Euclidean space, Comb. Probab. Comput. 28 (2019), N2, pp. 280-286.
  8. P. Frankl, A. Kupavskii, Some results around the Erdős Matching Conjecture, Acta Mathematica Universitatis Comenianae, 88 (2019), N3, pp. 695-699.
  9. S. Kiselev, A. Kupavskii, Sharp bounds for the chromatic number of random Kneser graphs, Acta Mathematica Universitatis Comenianae, 88 (2019), N3, pp. 861-865.
  10. N. Frankl, A. Kupavskii, Nearly k-distance sets, Acta Mathematica Universitatis Comenianae, 88 (2019), N3, pp. 689-693.
  11. R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, The crossing Tverberg Theorem, Proceedings of SoCG'19, 38:1-38:13.
  12. Kupavskii, J. Pach, I. Tomon, On the size of k-cross-free families, Combinatorica 39 (2019), N1, pp. 153-164.
  13. Andrey Kupavskii, Dmitriy Zakharov: The right acute angles problem? European Journal of Combinatorics. 2020 October, 89, article number: 103144.
  14. Andrey Kupavskii, Zhivotovskiy N.: When are epsilon-nets small? Journal of Computer and System Sciences. June 2020, 110, pp. 22-36.
  15. Andrey Kupavskii, A A Sagdeev: Ramsey theory in a space with Chebyshev metric. Russian Mathematical Surveys. 2020, 75 (5), pp. 965
  16. Sergei Kiselev, Andrey Kupavskii: Rainbow matchings in k-partite hypergraphs. Bulletin of the London Mathematical society. October 2020
  17. Andrey Kupavskii: The VC-dimension of k-vertex d-polytopes. Combinatorica. November 2020
  18. Peter Frankl, Andrey Kupavskii: Simple Juntas for Shifted Families. DISCRETE ANALYSIS. 2020, September, article number: 14

Александр Полянский:

  1. A. Polyanskii, On almost-equidistant sets II, Electronic Journal of Combinatorics 26(2), #P2.14.
  2. A. Polyanskii, On simultaneous approximations of in $3$ and ${\pi}/{\sqrt{3}}$ by rational numbers, Sbornik Mathematics 210(4), pp. 589-605.
  3. A. Polyanskii, On almost-equidistant sets, Linear Algebra and Its Applications 563, pp. 220-230.
  4. R. Pinchasi, A. Polyanskii, A One-Page Solution of a Problem of Erdős and Purdy, Discrete & Computational Geometry, pp. 1–4.
  5. G Ivanov, M Naszódi, A Polyanskii: Approximation of the average of some random matrices. Journal of Functional Analysis. 2020 October, 279 (7), article number: 108684.

Арсений Сагдеев:

  1. A. Sagdeev, On the Partition of an Odd Number into Three Primes in a Prescribed Proportion, Mathematical Notes, 2019, Vol. 106, No. 1, pp. 98–107.
  2. A. Sagdeev, A. Raigorodskii, On a Frankl–Wilson theorem and its geometric corollaries, Acta Mathematica Universitatis Comenianae, 2019, Vol. 88, No. 3, pp. 1029–1033.
  3. Andrey Kupavskii, A A Sagdeev: Ramsey theory in a space with Chebyshev metric. Russian Mathematical Surveys. 2020, 75 (5), pp. 965

Сергей Киселев:

  1. J. Balogh, D. Cherkashin, S. Kiselev, Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs, European Journal of Combinatorics, 2019, pp. 228-236.
  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. Sergei Kiselev, Andrey Kupavskii: Rainbow matchings in k-partite hypergraphs. Bulletin of the London Mathematical society. October 2020

Лев Шабанов:

  1. L. E. Shabanov, Turán-Type Results for Distance Graphs in an Infinitesimal Plane Layer, Journal of Mathematical Sciences,February 2019, Volume 236, Issue 5, pp 554–578.