Interview with Yufei Zhao
From MaRDI portal
Publication:5056214
DOI10.54550/ECA2021V1S2I5zbMath1499.01035OpenAlexW4250639290MaRDI QIDQ5056214
Publication date: 7 December 2022
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.54550/eca2021v1s2i5
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the Erdős distinct distances problem in the plane
- The Green-Tao theorem: an exposition
- Hypergraph containers
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- A reverse Sidorenko inequality
- On the number of graphs without 4-cycles
- Independent sets in regular graphs and sum-free subsets of finite groups
- Restriction estimates using polynomial partitioning. II
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- Algebraic methods in discrete analogs of the Kakeya problem
- The number of independent sets in an irregular graph
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
- The primes contain arbitrarily long arithmetic progressions
- An Entropy Approach to the Hard-Core Model on Bipartite Graphs
- A restriction estimate using polynomial partitioning
- On the size of Kakeya sets in finite fields
- On replica symmetry of large deviations in random graphs
- The Number of Independent Sets in a Regular Graph
- Metrics for sparse graphs
- On weighted graph homomorphisms
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
- Independent sets in hypergraphs
- A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
- An inverse theorem for the Gowers \(U^{s+1}[N\)-norm]
- A new proof of Szemerédi's theorem
This page was built for publication: Interview with Yufei Zhao
