Valency Hub
alphaFeedback
AK

Andrey Kupavskii

0000-0002-8313-9598
math.COcs.DMmath.MGcs.CGcs.DScs.LGcs.DCmath.PRcs.CRcs.IT

On Valency

published · living versions
W_tbzz6fws·v1 · currentpublished
A polynomial method over formal power series
with Artur Akhiiarov, Mikhail Koshelev, Andrei Raigorodskii
1 version
W_w6hgcse9·v1published
Between the Semi-Random Process and G(n,p)
W_sbds9n3u·v1published
Families that intersect in an arithmetic progression
W_92pnjk9a·v1published
Nearly Tight Bounds for Proportional Group Fair Divisions and One-Sided Discrepancy
W_9bbw57p4·v1published
On supersaturation in the Erdős–Sós problem
W_agn8f4hd·v1published
A complete solution of the Erdős-Kleitman matching problem for n≤3sn\le 3s

Preprints & journals

118 papers in the corpus · 2013–2026
Almost entropic matroids and (k,L)(k,L)-systems2610.27892v1 · Andrey Kupavskii, Nikolai Terekhov2026 · 0 citationsarXiv
Families that intersect in an arithmetic progression2610.26243v1 · Andrey Kupavskii, Fedor Noskov, Georgy Sokolov et al.2026 · 0 citationsarXivon Valency
Improved Approximations for Coflow Scheduling via Iterated Rounding and Stable Matchings2610.16068v1 · Mikhail Cherniavskii, Arseni Fedorovich, Mikhail Koshelev et al.2026 · 0 citationsarXiv
Approximation algorithms via discrepancy with hard constraints2610.16079v1 · Mikhail Cherniavskii, Andrey Kupavskii, Stanislav Moiseev et al.2026 · 0 citationsarXiv
SP-Allreduce: Symmetric Tree Schedules for Tori and Beyond2610.16387v1 · Mikhail Cherniavskii, Andrey Kupavskii, Georgy Mironov et al.2026 · 0 citationsarXiv
Ordinary and measurable colorings of Euclidean three-space2610.18907v1 · Mikhail Koshelev, Andrey Kupavskii, Vsevolod Voronov2026 · 0 citationsarXiv
Nearly Tight Bounds for Proportional Group Fair Divisions and One-Sided Discrepancy2609.03682v1 · Alexander Shekhovtsov, Georgy Sokolov, Mikhail Cherniavskii et al.2026 · 0 citationsarXivon Valency
A Complete Intersection Theorem for Large Permutation Groups2607.00318v1 · Nathan Keller, Andrey Kupavskii, Noam Lifshitz et al.2026 · 0 citationsarXiv
Structure and properties of large cross-intersecting families2606.20085v1 · Yang Huang, Andrey Kupavskii2026 · 0 citationsarXiv
More on the Erdős--Kleitman problem on matchings in set families2605.04379v1 · Andrey Kupavskii, Georgy Sokolov2026 · 0 citationsarXiv
Matchings in permutations2605.04987v1 · Eduard Inozemtsev, Dmitrii Kolupaev, Andrey Kupavskii2026 · 0 citationsarXiv
Structure of tt-Intersecting Families of Vector Spaces2605.02698v1 · Ferdinand Ihringer, Andrey Kupavskii2026 · 0 citationsarXiv
Families without ss-matchings: the other end2605.00996v1 · Andrey Kupavskii, Georgy Sokolov2026 · 0 citationsarXiv
Frankl's diversity theorem for permutations2602.11796v1 · Eduard Inozemtsev, Andrey Kupavskii2026 · 0 citationsarXiv
On supersaturation in the Erdős--Sós problem2602.10292v1 · Andrey Kupavskii, Yakov Shubin2026 · 0 citationsarXivon Valency
A complete solution of the Erdős-Kleitman matching problem for n≤3sn\le 3s2511.21628v1 · Andrey Kupavskii, Georgy Sokolov2025 · 0 citationsarXivon Valency
Non-dissective coverings by planks2511.20047v1 · Andrey Kupavskii, Janos Pach2025 · 0 citationsarXiv
Exact results and the structure of extremal families for the Duke--Erdős forbidden sunflower problem2511.17142v1 · Andrey Kupavskii, Fedor Noskov2025 · 0 citationsarXiv
Delta-system method: a survey2508.20132v1 · Andrey Kupavskii2025 · 0 citationsarXiv
Tree covers of size 22 for the Euclidean plane2508.16875v1 · Artur Bikeev, Andrey Kupavskii, Maxim Turevskii2025 · 1 citationarXiv
A complete tt-intersection theorem for families of spanning trees2507.17913v1 · Elizaveta Iarovikova, Andrey Kupavskii2025 · 0 citationsarXiv
Near-optimal edge partitioning via intersecting families2505.18026v6 · Alexander Yakunin, Andrey Kupavskii, Alexander Sushin et al.2025 · 0 citationsarXiv
The Erdős-Rado Sunflower Problem for Vector Spaces2505.03671v2 · Ferdinand Ihringer, Andrey Kupavskii2025 · 0 citationsarXiv
Intersecting Families of Spanning Trees2502.08128v2 · Peter Frankl, Glenn Hurlbert, Ferdinand Ihringer et al.2025 · 0 citationsarXiv
The Hajnal--Rothschild problem2502.06699v1 · Peter Frankl, Andrey Kupavskii2025 · 0 citationsarXiv
Structure of non-trivial intersecting families2412.07974v1 · Andrey Kupavskii2024 · 3 citationsarXiv
Linear dependencies, polynomial factors in the Duke--Erdős forbidden sunflower problem2410.06156v3 · Andrey Kupavskii, Fedor Noskov2024 · 0 citationsarXiv
Intersection problems and a correlation inequality for integer sequences2408.08221v1 · Peter Frankl, Andrey Kupavskii2024 · 0 citationsarXiv
Two questions on Kneser colorings2405.08797v2 · Eduard Inozemtsev, Andrey Kupavskii2024 · 0 citationsarXiv
An almost complete tt-intersection theorem for permutations2405.07843v1 · Andrey Kupavskii2024 · 0 citationsarXiv
Intersecting families with covering number 332405.02621v3 · Andrey Kupavskii2024 · 1 citationarXiv
Stability for binary scalar products2404.17933v1 · Andrey Kupavskii, Dmitry Tsarev2024 · 0 citationsarXiv
Non-trivial rr-wise agreeing families2404.14178v3 · Peter Frankl, Andrey Kupavskii2024 · 0 citationsarXiv
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers2404.05045v1 · Sujoy Bhore, Bal'azs Keszegh, Andrey Kupavskii et al.2024 · 0 citationsarXiv
Intersection theorems for uniform subfamilies of hereditary families2311.02246v1 · Andrey Kupavskii2023 · 0 citationsarXiv
Choosing optimal parameters for a distributed multi-constrained QoS routing2310.07350v1 · Sergey Komech, Andrey Kupavskii, Alexei Vezolainen2023 · 1 citationarXiv
Octopuses in the Boolean cube: families with pairwise small intersections, part II2309.10921v1 · Andrey Kupavskii, Fedor Noskov2023 · 0 citationsarXiv
Erdős--Ko--Rado type results for partitions via spread approximations2309.00097v3 · Andrey Kupavskii2023 · 0 citationsarXiv
Tilings of Z\mathbb Z with multisets of distances2304.05082v3 · Andrey Kupavskii, Elizaveta Popova2023 · 0 citationsarXiv
Nearly k-Distance Sets.37808958 · Frankl, Nóra, Kupavskii, Andrey2023 · 1 citationDiscrete & computational geometry. 2023;70(3):455-494
Cutting corners2211.17150v2 · Andrey Kupavskii, Arsenii Sagdeev, Dmitrii Zakharov2022 · 2 citationsJournal of Combinatorial Theory, Series B, 2026, Vol. 177, pp. 273--292
Octopuses in the Boolean cube: families with pairwise small intersections, part I2209.04756v1 · Andrey Kupavskii, Fedor Noskov2022 · 1 citationarXiv
Erdős Matching Conjecture for almost perfect matchings2206.01526v2 · Dmitriy Kolupaev, Andrey Kupavskii2022 · 10 citationsarXiv
Spread approximations for forbidden intersections problems2203.13379v3 · Andrey Kupavskii, Dmitriy Zakharov2022 · 15 citationsarXiv
Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings2203.03873v2 · N'ora Frankl, Andrey Kupavskii, Arsenii Sagdeev2022 · 5 citationsProceedings of the American Mathematical Society, 2023, Vol. 151, No. 6, pp. 2353--2362
Sketching Distances in Monotone Graph Classes2202.09253v3 · Louis Esperet, Nathaniel Harms, Andrey Kupavskii2022 · 3 citationsarXiv
Odd-distance and right-equidistant sets in the maximum and Manhattan metrics2202.03743v2 · Alexander Golovanov, Andrey Kupavskii, Arsenii Sagdeev2022 · 7 citationsEuropean Journal of Combinatorics, 2023, Vol. 107, 103603, 8 pp
Perfect matchings in down-sets2201.03865v1 · Peter Frankl, Andrey Kupavskii2022 · 1 citationarXiv
On the Erdős-Purdy problem and the Zarankiewitz problem for semialgebraic graphs2112.10245v1 · Nora Frankl, Andrey Kupavskii2021 · 0 citationsarXiv
On anti-stochastic properties of unlabeled graphs2112.04395v4 · Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky et al.2021 · 2 citationsarXiv
Career total: at least 219 works. 118 are in this corpus.Showing the 50 most recent.

Profile built from the corpus for this byline.

Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.