朱绪鼎(数学)

作者:来源:发布时间:2017-04-14

个人简介

朱绪鼎,男,1959年4月出生,湖北省仙桃市人,现为 浙江师范大学数理信息工程学院教授、博士生导师。


学习经历

1978.2-1982.2   武汉水利电力学院基础课部获理学学士,数学专业;

1982.2-1984.12  武汉数字工程研究所获理学硕士学位,数学专业;

1988.1-1990.12  加拿大卡尔加里大学获理学博士学位,数学专业;


工作简历

1991.1-1993.10  加拿大西蒙弗莱瑟大学博士后;

1993.10-1995.8  德国比勒菲尔德大学博士后;

1995.9-2010.6   台湾中山大学应用数学系任教;

特案副研究员(1995.9)/副教授(1997.2)/教授(1999.1)

2010.6-至今   浙江师范大学数理信息工程学院任特聘教授;


学术兼职

European Journal of Combinatorics编委(2010.11-至今);

SIAM Journal on Discrete Mathematics编委(2004.1-2012.12);

Journal of Graph Theory编委(2009.1-至今);

Discrete Mathematics编委(2013.4-至今);

Contributions to Discrete Mathematics编委(2011.2-至今);

Discussiones Mathematicae Graph Theory编委(2010.12-至今);

Bulletin of Institute of Mathematics, Academia Sinica编委(2006.1-至今);

Taiwanese Journal of Mathematics编委(2004.1-2006.12);

中国运筹学会图论组合分会副理事长(2010.12-至今)

中科院数学与系统科学研究院图论组合与网络中心学术委员会副主任(2012.12-至今)


人才梯队、荣誉

国家千人计划入选者(2010.3);

台湾中山大学特聘研究教授(2007.8);

台湾西湾讲座教授(2008.8)


研究领域及成果

研究专长是图论、演算法和组合优化。在《Journal of CombinatorialTheory, Ser. B》, 《Journal of CombinatorialTheory, Ser. A》, 《Combinatorica》, 《SIAM Journal on Discrete Mathematics》, 《Journal of Graph Theory》, 《Transaction of American Mathematical Society》, 《Proceedings of American Mathematical Society》, 《Mathematical Proceedings of Combridge Philosophical Society》, 《Journal of Algebra》, 《European Journal of Combinatorics》, 《Discrete Mathematics》, 《Discrete Applied Mathematics》, 《Journal of Algorithms》等国际SCI期刊发表论文192篇。依MathSciNet统计,所发表论文被引用1462多次。Hirsch指数20。 2007年ISI世界数学家被引用次数排名第67名。二十多次应邀在重要的国际学术会议上作大会报告。曾获得台湾科学委员会杰出研究奖,台湾数学学会学术奖,主持台湾杰出学者研究计划。 曾任台湾数学会学术委员,台湾科学委员会数学审议委员、谘议委员。现任《SIAM J. Disc. Math.》, 《J. Graph Theory》, 《European J. Combin.》,《Discrete Mathematics》, 《Contrib. Discrete Math.》, 《Discuss. Math., Graph Theory》,《Bulletin of Academia Sinica》等国际学术期刊编委。

代表性论文、论著

1. Circular chromatic number, a survey.  Discrete Mathematics, Vol. 229(1-3):371-410, 2001.

2. Refined activation strategy for the marking game. Journal of Combinatorial Theory Ser. B, 98(2008), 1-18.  

3. Fractional Hedetniemi's conjecture is true. European J. Combin. 32(2011), no. 7, 1168-1175. 

4. Entire colouring of plane graphs. Journal of Combinatorial Theory Ser. B, 101, no. 6, 490-501. (Joint work with Weifan Wang).

5. Distinguishing labeling of the actions of almost simple groups. Combinatorica, 31(2011), no. 4, 489-506. (Joint work with Akos Seress, Tsai-Lien Wong).

6. Bipartite subgraphs of triangle-free subcubic graphs. J. Combin. Theory Ser. B 99 (2009), no. 1, 62–83.

7. The fractional chromatic number of graphs of maximum degree at most three. SIAM J. Discrete Math. 23 (2009/10), no. 4, 1762–1775. (Joint work with Hamed Hatami).

8. On-line list colouring of graphs. Electron. J. Combin. 16 (2009), no. 1, Research Paper 127, 16 pp.

9. Decomposing a graph into forests. J. Combin. Theory Ser. B 102 (2012), no. 1, 38–52. (Joint work with Montassier, Ossona de mendez and Raspaud).

10. Circular flow on signed graphs. J. Combin. Theory Ser. B 101 (2011), no. 6, 464–479. (Joint work with Andre Raspaud).

代表性科研项目

1.2011-2013,浙江省自然科学基金重点项目-“图的染色及其应用”: Z6110786;

2.2012-2015,国家自然科学基金一般项目-“图的圆环染色和分数染色”:11171310 Z6110786;

成果获奖

2007台湾科学委员会杰出研究奖,

2007台湾数学学会学术奖,

2008主持台湾杰出学者研究计划。

学术报告

1. 2013.3:Excel 2,University of Illinois at Urbana-Shampaign大会报告《Total weight choosability of graphs》;

2. 2013.6:International Conference in Dscrete Mathematics, Karnatak University, Dharwad, India,大会报告《Every graph is (2,3)-choosable》;

3. 2013.7:7th Czech-Slovak International Symposium on Combiantorics, Graph Theory, Algorithms and Applications, Kosice, Slovakia,大会报告《Total weight choosability of graphs》;

4. 2013.7:Erdos Centennial Conference, Budapest, Hungary,邀请报告《Circular flow on highly edge connected signed graphs》;

5. 2013.7:第五届华人数学家大会,台北,邀请报告《Total weight choosability of graphs》;

6. 2012.7:第五届全国组合图论会议,洛阳,大会报告《Circular colouring  of graphs》;


近三年教学情况

为本科生主讲课程有《算法图论》、《复变函数》、《数学分析》,指导本科生论文0篇;为研究生开设《代数图论》、《图论中概率方法》、《图论中的拓扑方法》等课程,指导培养硕士研究生1名,培养博士研究生2名。


Profile

Xuding Zhu, Professor, College of Mathematics,Physics and Information Engineering, Zhejiang Normal University.


Education Background

1978.2-1982.2   Wuhan Institute of Hydraulic and Electric Engineering.  B.S.

1982.2-1984.12  Wuhan Institute of Digital Engineering. M.S.

1988.1-1990.12  The University of Calgary, Canada. Ph.D.


Work Experiences

1991.1—1993.10  Post-doctoral Fellow at Simon Fraser University, Canada;

1993.10—1995.8  Post-doctoral Fellow at University of Bielefeld, Germany;

1995.9—2010.6   National Su Yat-sen University, Taiwan;
Associate Researcher(1995.9)/Associate Professor(1997.2)/Professor(1999.1)

2010.6—    Zhejiang Normal University, Professor;


Other Academic Positions/Memberships

Editor board of European Journal of Combinatorics (2010.11—present);

Editor board of  SIAM Journal on Discrete Mathematics (2004.1—2012.12);

Editor board of Journal of Graph Theory (2009.1—present);

Editor board of Discrete Mathematics (2013.4—present);
Editor board of Contributions to Discrete Mathematics (2011.2—present);

Editor board of Discussiones Mathematicae Graph Theory (2010.12—present);

Editor board of Bulletin of Institute of Mathematics, Academia Sinica(2006.1—present);

Editor board of Taiwanese Journal of Mathematics(2004.1—2006.12);


Honorable Titles and Awards:

Chinese National 1000 Talents Plan Expert (2010.3);

Special Research Professor of National Sun Yat-sen University, Taiwan (2007.8);

XiWan Chair Professor of National Sun Yat-sen University(2008.8)


Research Field and Achievements

Professor Zhu's main research interests are in graph theory, combinatorial optimization and algorithms. He systematically developed circular chromatic theory. Published about 50 papers on this subject, including two survey papers. Reference [1] is a survey paper on this subject, which is cited about 150 times. Through these papers and many talks at conferences, universities and research institutes, this research area became more and more active and many young researchers have done a lot of excellent work in this area. He also worked a lot on game coloring of graphs. The concept of game chromatic number of graphs was introduced by Brams Steven in the 1970's from the point of view of game theory, but remain unnoticed by graph theorists. Bodlaender re-introduced the concept in 1991. Zhu introduced the concept of game coloring number and new techniques in studying this parameter, which stimulated active research in this area, and leads to improvement of upper bounds for the game chromatic number of many classes of graphs. Reference [2] is a paper in this area, where it is proved that the game chromatic number of a planar graph is at most 17. The maximum game chromatic number of planar graphs is a benchmark problem in this area, and 17 is the currently known best upper bound.

Professor Zhu also studied many problems related to classical vertex coloring of graphs.   Reference [3] confirms a 36 year old conjecture of Burr, Erd\H{o}s and Lov\'{a}sz concerning chromatic Ramsey number of graphs. This paper also proves the fractional version of Hedetniemi's conjecture. The original Hedetniemi's conjecture  states that the chromatic number of the categorical product of two graphs is the minimum of the chromatic numbers of the two graphs. This conjecture attracted a lot of attention, however, very few cases are confirmed. It is proved in [3] that if chromatic number is replaced by fractional chromatic number, then the statement is true. This fractional version is used in the proof of Burr-Erd\H{o}s-Lov\'{a}sz Conjecture. In Reference [4], a 40 year old conjecture of Kronk-Mitchem on entire coloring of plane graphs is confirmed. Other areas in which zhu worked a lot include distinguish labeling of graphs and group actions (Reference [5] is such a paper), on-line list coloring of graphs, graph decomposition, graph labelings, combinatorial optimization, complexity of digraph homomorphism problems etc. He published about 180 papers and is cited more than 1450 times, and has H-index 20.
Professor Zhu was recruited by the Chinese government under the 1000 Talents Plan program, and moved from National Sun Yat-sen University of Taiwan to Zhejiang Normal University in Mainland China in 2010. He established the Center for Discrete Mathematics at Zhejiang Normal University. The center  has 18 members and hosts about 30 visitors each year from abroad, and organized two large international conferences, has regular seminars and organizes workshops from time to time.


Representative Works

1. Circular chromatic number, a survey.  Discrete Mathematics, Vol. 229(1-3):371-410, 2001.

2. Refined activation strategy for the marking game. Journal of Combinatorial Theory Ser. B, 98(2008), 1-18.  

3. Fractional Hedetniemi's conjecture is true. European J. Combin. 32(2011), no. 7, 1168-1175. 

4. Entire colouring of plane graphs. Journal of Combinatorial Theory Ser. B, 101, no. 6, 490-501. (Joint work with Weifan Wang).

5. Distinguishing labeling of the actions of almost simple groups. Combinatorica, 31(2011), no. 4, 489-506. (Joint work with Akos Seress, Tsai-Lien Wong).

6. Bipartite subgraphs of triangle-free subcubic graphs. J. Combin. Theory Ser. B 99 (2009), no. 1, 62–83.

7. The fractional chromatic number of graphs of maximum degree at most three. SIAM J. Discrete Math. 23 (2009/10), no. 4, 1762–1775. (Joint work with Hamed Hatami).

8. On-line list colouring of graphs. Electron. J. Combin. 16 (2009), no. 1, Research Paper 127, 16 pp.

9. Decomposing a graph into forests. J. Combin. Theory Ser. B 102 (2012), no. 1, 38–52. (Joint work with Montassier, Ossona de mendez and Raspaud).

10. Circular flow on signed graphs. J. Combin. Theory Ser. B 101 (2011), no. 6, 464–479. (Joint work with Andre Raspaud).

Research Projects

1. 2011-2013, Key Project of Natural Science Foundation of Zhejiang Province Z6110786-“Graph colorings and applications”

2. 2012-2015, Natural Science Foundation of China Grant NSFC11171310-“Circular and fractinal  coloring of graphs”

Awards

2007 Outstanding Research Award of Taiwan Scientific Committee.

2007 Academic Award of Taiwan Mathematical Association.

2008 PI of Outstanding Scholar Project of Taiwan Science Foundation.

Reports

1.2013.3: Excel 2,University of Illinois at Urbana-Shampaign, Plenary Talk:《Total weight choosability of graphs》;

2.2013.6: International Conference in Dscrete Mathematics, Karnatak University, Dharwad, India,Plenary Talk:《Every graph is (2,3)-choosable》;

3.2013.7: 7th Czech-Slovak International Symposium on Combiantorics, Graph Theory, Algorithms and Applications, Kosice, Slovakia,Plenary Talk:《Total weight choosability of graphs》;

4.2013.7: Erdos Centennial Conference, Budapest, Hungary,Plenary Talk:《Circular flow on highly edge connected signed graphs》;

5.2013.7: Fifth ICCM, Taipei, Invited talk《Total weight choosability of graphs》;

6.2012.7: Fifth Chinese Conference on Combiantorics and Graph Theory,Plenary Talk: 《Circular colouring  of graphs》;


Teaching and Supervision during Last 3 Years

Undergraduate courses: Algorithmic Graph Theory, Complex Analysis,Calculus.

Graduate  courses: Algebraic Graph Theory, Probabilistic Methods  in Graph Theory, Topological Methods in Graph Theory.

Supervised 1 Master thesis, and 2 Ph.D. thesis in the past three years.