User:Rickinasia/sandbox10
Rickinasia/sandbox10 | |
|---|---|
刘鸿 | |
| Born | March 28, 1986 |
| Education | PhD in Mathematics |
| Alma mater | University of Illinois Urbana-Champaign, University of Szeged, Illinois Institute of Technology, University of Shanghai for Science and Technology |
| Scientific career | |
| Fields | Extremal combinatorics, discrete geometry, Ramsey theory, random graphs, combinatorial number theory, probabilistic combinatorics, graph theory |
| Institutions | Institute for Basic Science, University of Warwick |
| Theses | |
| Doctoral advisor | József Balogh |
| Other academic advisors | Michael Pelsmajer, Hemanshu Kaul |
| Website | Extremal Combinatorics and Probability Group |
| Liu Hong | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
| Traditional Chinese | 劉鴻 | ||||||||||
| Simplified Chinese | 刘鸿 | ||||||||||
| |||||||||||
Liu Hong (Chinese: 刘鸿) is a mathematician and distinguished research fellow heading the Extremal Combinatorics and Probability Group (ECOPRO) at the Institute for Basic Science. He is a tenured professor and a UKRI Future Leaders Fellow at the Mathematics Institute at the University of Warwick as well as a Leverhulme Early Career Fellow.[1]
Education
[edit]Liu received a B.S. in in applied mathematics from the University of Shanghai for Science and Technology and an M.S. in applied math at the Illinois Institute of Technology with a thesis under Michael Pelsmajer.[2][3] PhD from the University of Illinois Urbana-Champaign in 2015 under his advisor József Balogh.[4] His thesis investigated supersaturation and enumeration problems in extremal combinatorics. During the PhD program he was a visiting student to the University of Szeged.
Career
[edit]In 2016, Liu was awarded an Leverhulme Early Career Fellowship for research on counting in finite fields, integers and graphs.[5] The Fellowship was conducted at the University of Warwick. Upon completion, he began working as an assistant professor at Warwick which is also when Liu received the UKRI Future Leaders Fellowship from the United Kingdom and began conducting research with Oleg Pikhurko.[6]
Research
[edit]Liu and Richard Montgomery solved the odd cycle problem of Paul Erdős and András Hajnal from 1966.[7]
Awards and fellowships
[edit]- 2025: Frontiers of Science Award, 2025 International Congress of Basic Science[8]
- 2019–2026: UKRI Future Leaders Fellowship, UK[9][10]
- 2016–2019: Leverhulme Early Career Fellowship, UK[5][11]
Editorial commitments
[edit]- Associate editor, SIAM Journal on Discrete Mathematics[12]
Selected publications
[edit]- Hong, Liu; Montgomery, Richard (31 March 2023). "A solution to Erdős and Hajnal's odd cycle problem". Journal of the American Mathematical Society: 1191–1234. doi:10.1090/jams/1018.
- Fernández, Irene Gil; Kim, Jaehoon; Liu, Hong; Pikhurko, Oleg (2024). "New lower bounds on kissing numbers and spherical codes in high dimensions". American Journal of Mathematics.
- Liu, Hong; Pikhurko, Oleg; Staden, Katherine (August 2017). "The minimum number of triangles in graphs of given order and size". Electronic Notes in Discrete Mathematics. 61: 805–811. doi:10.1016/j.endm.2017.07.039.
- Balogh, József; Liu, Hong; Sharifzadeh, Maryam; Treglown, Andrew (2015). "The number of maximal sum-free subsets of integers". Proceedings of the American Mathematical Society: 4713–4721. doi:10.1090/S0002-9939-2015-12615-9.
- Kim, Jaehoon; Liu, Hong; Sharifzadeh, Maryam; Staden, Katherine (17 July 2017). "Proof of Komlós's conjecture on Hamiltonian subsets". Proceedings of the London Mathematical Society. 115 (5): 974–1013. doi:10.1112/plms.12059.
See also
[edit]References
[edit]- ^ "HONG LIU 刘鸿". University of Warwick. Archived from the original on 23 April 2024.
- ^ Liu, Hong; Pelsmajer, Michael J. (9 Jun 2010). Dominating Sets in Triangulations on Surfaces (PhD thesis). Illinois Institute of Technology. doi:10.48550/arXiv.1006.1879.
- ^ "Applied Mathematics' Hemanshu Kaul and Alumnus Hong Liu Give Invited Talks at 2018 International Workshop on Graph Theory". Department of Applied Mathamatics. Illinois Institute of Technology. 20 February 2018. Retrieved 15 October 2024.
- ^ "School Colloquium - Sublinear expanders and its applications". Apply Square (in Korean). Retrieved 15 October 2024.
- ^ a b "Early Career Fellowships 2016". Leverhulme Early Career Fellowship. Retrieved 14 October 2024.
- ^ "Basics on the Hypergraph Container Method IV". School of Mathematical Sciences. Fudan University. Retrieved 10 October 2024.
- ^ "Philip Leverhulme Prizes 2020". Leverhulme Trust. Retrieved 15 April 2025.
- ^ "Hong Liu, CI of the Extremal Combinatorics and Probability Group, Receives Frontiers of Science Award at the 3rd ICBS". Institute for Basic Science. 17 April 2025. Retrieved 12 May 2025.
- ^ "Embeddings in Sparse Graphs". UKRI Gateway. UK Research and Innovation. Retrieved 14 October 2024.
- ^ "Extremal and enumerative problems for discrete structures". UKRI Gateway. UK Research and Innovation. Retrieved 14 October 2024.
- ^ "Alumni". Department of Applied Mathamatics. Illinois Institute of Technology. Retrieved 15 October 2024.
- ^ "SIDMA – Editorial Board". SIAM Journal on Discrete Mathematics. Society for Industrial and Applied Mathematics. Retrieved 14 October 2024.
External links
[edit]