Ji Zeng 曾骥

I’m a PhD student in Department of Mathematics, UC San Diego. My advisor is Andrew Suk. I’m intersted in extremal combinatorics and discrete geometry.

Email: jzeng[at]domain where “domain” equals “ucsd.edu”.

Teaching: MATH 10C Spring 2024 (canvas). MATH 10B Winter 2023 (evaluation). Also TA Award.

Talks

Jan 2024, Mathematisches Forschungsinstitut Oberwolfach – Variation of no-three-in-line problem, video(40min).
Sep 2023, Rényi Institute – Erdős Center Seminar, Disjoint faces in simple topological graphs, slides(50min), video(50min).
Sep 2022, UC San Diego – Andrew’s workshop, Unavoidable patterns in complete simple topological graphs, slides(50min).
Slides of other talks may be available upon request ;-)

Papers

G. Damásdi, Z. Dong, M. Scheucher, J. Zeng. Saturation results around the Erdős–Szekeres problem. Symposium on Computational Geometry 2024.
A. Suk, J. Zeng. On cliques in three-dimensional dense point-line arrangements. Submitted.
Y. Chen, X. Liu, J. Nie, J. Zeng. Random Turán and counting results for general position sets over finite fields. Submitted.
- We used the container method to give an almost sharp answer to the no-three-in-line problem in random subsets of planes over finite fields.
J. Zeng. Note on disjoint faces in simple topological graphs. Submitted.
- We studied a topological variant of the Heilbronn triangle problem in the context of graph drawing.
A. Suk, J. Zeng. On higher dimensional point sets in general position. Symposium on Computational Geometry 2023.
J. Nie, E. Surya, J. Zeng. On asymptotic packing of convex geometric and ordered graphs. Journal of Graph Theory 104 (2023), 836-850.
S. Spiro, E. Surya, J. Zeng. Semi-restricted Rock, Paper, Scissors. Electronic Journal of Combinatorics 30 (2023), P4.32.
A. Suk, J. Zeng. Unavoidable patterns in complete simple topological graphs. Discrete & Computational Geometry, minor revision.
- Symposium on Graph Drawing 2022 Best Paper Award.
A. Suk, J. Zeng. A positive fraction Erdos-Szekeres theorem and its applications. Discrete & Computational Geometry 71 (2024), 308-325.
- We proved a multipartite analogue of the Erdos–Szekeres lemma, and studied efficient partitions of sequences into multipartite monotone subsequences.
J. Zeng. On average hitting time and Kemeny’s constant for weighted trees. Submitted.
F. Chung, J. Zeng. Forest formulas of discrete Green’s functions. Journal of Graph Theory 102 (2023), 556-577.