Vsevolod F. Lev

Discrete Mathematics and Combinatorics · 2000–2017

A researcher in the Science corpus: 4 papers; trusts 6 researchers and is trusted by 1 researcher here, as inferred from the citation graph.

Subfields

• Discrete Mathematics and Combinatorics — 22 citations into it; #1,888 of 2,017 by trust here, #1,251 by citations
• Geometry and Topology — 14 citations into it
• Algebra and Number Theory — 13 citations into it

Whom Vsevolod F. Lev trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. William T. Gowers
2. Ben Joseph Green
3. Terence Tao
4. Jean Bourgain
5. Tom Sanders

Who trusts Vsevolod F. Lev overall

1. Noga Alon

Papers from Vsevolod F. Lev's perspective

Ordered by how strongly the researchers Vsevolod F. Lev trusts endorse each paper. Same corpus, a different order for every researcher.

1. A new proof of Szemerédi's theorem
2. The primes contain arbitrarily long arithmetic progressions
3. New Bounds on cap sets
4. Freiman's theorem in an arbitrary abelian group
5. Foundations of a Structural Theory of Set Addition
6. A NEW PROOF OF SZEMER ´ EDI'S THEOREM
7. An analog of Freiman's theorem in groups (Astérisque)
8. On the size of k-fold sum and product sets of integers
9. Universal characteristic factors and Furstenberg averages
10. Growth and generation in SL_2(Z/pZ)

Their papers

• Open problems in additive combinatorics (2007) — 70 citations
• Progression-free sets in $\mathbb Z_4^n$ are exponentially small (2017) — 80 citations
• Progression-free sets in Z_4^n are exponentially small (2016) — 150 citations
• Restricted Set Addition in Groups I: The Classical Setting (2000) — 59 citations