Department
of Mathematics

Krieger School of Arts and Sciences

Johns Hopkins University

3400 N. Charles Street, Baltimore, MD
21218

Office: 220 Krieger Hall

Email: jhan at math.jhu.edu

I am a J.J. Sylvester Assistant Professor in
the Department of Mathematics, Johns
Hopkins University. I got my Ph.D. in July 2018 from Beijing International Center for Mathematical
Research, Peking University (Beijing, China), under the supervision of
Prof. Gang Tian and Prof. Chenyang Xu. My undergraduate advisor is
Prof. Bican Xia at
Peking University.

Fall 2018 teaching: Math 401, Introduction to Abstract Algebra

Spring 2019 teaching: 110.202, Calculus 3

Fall 2020 teaching: AS.110.643, Algebraic
Geometry (Surfaces)

Math 201 Linear Algebra

Spring 2019 teaching: AS.110.644, Algebraic Geometry 2 (BCHM)

**Research Interests**:

Algebraic Geometry : Birational Geometry
(Minimal Model Program, boundedness of varieties)

Symbolic Computation (Computer Algebra):
Cylindrical Algebraic Decomposition, Polynomial Inequalities, etc.

I am a co-organizer (with Vyacheslav
Shokurov) of Hopkins Algebraic Geometry Seminar.

Spring 2020, Fall 2019, Spring 2019, Fall 2018.

JAMI Program 2019--2020: Higher dimensional
algebraic geometry (an event in honor of Prof. Shokurov’s 70th birthday),

https://sites.google.com/view/jami-program-2019-2020

**Publications and Preprints**

1.
Jingjun Han, Wenfei Liu, On
a generalized canonical bundle formula for generically finite morphisms, arXiv:
1905.12542, submitted.

2.
Jingjun Han, Jihao Liu, V.V. Shokurov, ACC for minimal log discrepancies of
exceptional singularities, arXiv:1903.04338.

3.
Jingjun Han, Wenfei Liu, On
nonvanishing and abundance for generalized polarized surfaces,
arXiv:1808.06361, submitted.

4.
Jingjun Han, Zhan Li, Weak
Zariski decompositions and log terminal models for generalized polarized pairs,
arXiv:1806.01234, submitted.

5.
Weichung Chen, Gabriele Di Cerbo,
Jingjun Han, Chen Jiang, and Roberto Svaldi, Birational
boundedness of rationally connected Calabi–Yau 3-folds, arXiv:1804.09127,
submitted.

6.
Christopher D. Hacon, Jingjun Han. On a
connectedness principle of Shokurov-Koll\'{a} r type. Science
China Mathematics, 2019(3), 62, 411--416. arXiv:1801.01801.

7.
Jingjun Han, Zhan Li, Lu Qi. ACC
for log canonical threshold polytopes, arXiv:1706.07628, submitted.

8.
Jingjun Han, Zhan Li. On
Fujita's conjecture for pseudo-effective thresholds, arXiv:1705.08862,
submitted, to appear in Mathematical Research Letters.

9.
Jingjun Han. Multivariate
Discriminant and Iterated Resultant. Acta Mathematica Sinica, English
Series, 32: 659--667, 2016.

10.
Jingjun Han, Liyun Dai, Hoon Hong,
Bican Xia. Open
Weak CAD and Its Applications. Journal of Symbolic Computation, 80,
785--816, 2017.

11.
Jingjun Han, Bican Xia, Zhi Jin. Proving
inequalities and solving global optimization problems via simplified CAD
projection. Journal of Symbolic Computation, 72: 209--230, 2016.

12.
Jingjun Han, Liyun Dai, Bican Xia, Constructing
Fewer Open Cells by GCD Computation in CAD Projection. Proceedings of the
39th International Symposium on Symbolic and Algebraic Computation. Pages
240--247, ACM, 2014.

13.
Jingjun Han, A
Complete Method Based on Successive Difference Substitution Method for Deciding
Positive Semi-definiteness of Polynomials, Acta Scientiarum Naturalium
Universitatis Pekinensis, 2013(49): 545--551. (in Chinese)

14. Jingjun Han, Simple
Quantifier-free Formula of Positive Semidefinite Cyclic Ternary Quartic Forms,
Computer Mathematics, 9th Asian Symposium (ASCM2009), Fukuoka, December 2009,
10th Asian Symposium (ASCM2012), Beijing, October 2012, Contributed Papers and
Invited Talks, Ruyong Feng, Wen-shin Lee, Yosuke Sato Eds, pp 261--274,
Springer, 2014.

**Books
and Chapters**

1.
Jingjun Han, Chen Jiang.
Effective birationality and special BAB, to appear in Contemp. Math series
of AMS, *Singularities, Linear Systems and Fano Varieties* (on the BAB
conjecture), Caucher Birkar and Jungkai Chen (eds).

2. An
introduction to the proving of elementary inequalities (in Chinese), Harbin
Institute of Technology Press, China, 2011 (2nd, 2014, 343 pp.).

**Software---Psdgcd, a Maple Package**

A package using Maple
language, which provides several functions for proving polynomial inequalities
and solving global optimization problems efficiently.

Download: Psdgcdv53,** User guide on Maple****.**

The software was
developed by myself during 2009-2014. The algorithm is based on the following
papers:

1. Jingjun Han, Liyun Dai, Hoon Hong, Bican Xia. Open
Weak CAD and Its Applications. Journal of Symbolic Computation, 80,
785--816, 2017.

2. Jingjun Han, Bican Xia, Zhi Jin. Proving
inequalities and solving global optimization problems via simplified CAD
projection. Journal of Symbolic Computation, 72: 209--230, 2016.

3. Jingjun Han, Liyun Dai, Bican Xia, Constructing
Fewer Open Cells by GCD Computation in CAD Projection. Proceedings of the
39th International Symposium on Symbolic and Algebraic Computation. Pages
240--247, ACM, 2014.

4. Jingjun Han, Simple
Quantifier-free Formula of Positive Semidefinite Cyclic Ternary Quartic Forms,
Computer Mathematics, 9th Asian Symposium (ASCM2009), Fukuoka, December 2009,
10th Asian Symposium (ASCM2012), Beijing, October 2012, Contributed Papers and
Invited Talks, Ruyong Feng, Wen-shin Lee, Yosuke Sato Eds, pp 261--274,
Springer, 2014.