Mei-Chu Chang

Discrete Mathematics and Combinatorics · 2002–2008

A researcher in the Science corpus: 5 papers; trusts 9 researchers and is trusted by 21 researchers here, as inferred from the citation graph.

Subfields

• Discrete Mathematics and Combinatorics — 12 citations into it; #89 of 2,017 by trust here, #267 by citations
• Algebra and Number Theory — 5 citations into it; #2,407 of 2,864 by trust here, #2,392 by citations

Whom Mei-Chu Chang trusts overall

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

1. Nets Hawk Katz
2. József Solymosi
3. William T. Gowers
4. Terence Tao
5. Jean Bourgain
6. Moubariz Z. Garaev
7. I. Łaba

Who trusts Mei-Chu Chang overall

1. Jean Bourgain
2. Terence Tao
3. Tomasz Schoen
4. Ben Green
5. Tom Sanders
6. Ben Joseph Green
7. Van H. Vu
8. Emmanuel Breuillard
9. Benny Sudakov
10. Endre Szemerédi

Papers from Mei-Chu Chang's perspective

Ordered by how strongly the researchers Mei-Chu Chang trusts endorse each paper. Same corpus, a different order for every researcher.

1. An improved bound on the Minkowski dimension of Besicovitch sets in $\mathbb{R}^3$
2. A polynomial bound in Freiman's theorem
3. Convexity and Sumsets
4. On the Number of Sums and Products
5. A new proof of Szemerédi's theorem
6. A NEW PROOF OF SZEMER ´ EDI'S THEOREM
7. A sum-product estimate in finite fields, and applications
8. Local smoothing type estimates on Lp for large p
9. Well-posedness for the Navier–Stokes Equations
10. Method of Modern Mathematical Physics

Their papers

• The Erdős-Szemerédi problem on sum set and product set (2003) — 58 citations
• On a question of Davenport and Lewis and new character sum bounds in finite fields (2008) — 73 citations
• On the size of k-fold sum and product sets of integers (2003) — 67 citations
• Factorization in generalized arithmetic progressions and application to the Erdős-Szemerédi sum-product problems (2003) — 63 citations
• A polynomial bound in Freiman's theorem (2002) — 236 citations