题目：Ramanujan congruences in modular forms with applications.报告人：Michael Dewar 博士University of Illinois at Urbana-Champaign时间：2010年6月7日，星期一下午3：30—4：30地点：数学系致远楼106欢迎各位参加

Two graphs of same number of vertices pack if they can be embedded in the same vertex set so that the resulting graph is simple. Alternatively, two graphs pack if and only if one graph is a subgraph of the complement of the other graph. Many extremal graph theory problems can be stated naturally in terms of graph packing. In this talk, I will mainly talk about the recent progress on graph packing in terms of degree conditions. Some open problems will be mentioned as well

Two graphs of same number of vertices pack if they can be embedded in the same vertex set so that the resulting graph is simple. Alternatively, two graphs pack if and only if one graph is a subgraph of the complement of the other graph. Many extremal graph theory problems can be stated naturally in terms of graph packing. In this talk, I will mainly talk about the recent progress on graph packing in terms of degree conditions. Some open problems will be mentioned as well.

Workshop Venue: Tongji University (Siping Road ), Zhiyuan Building, Room 107，311Oganizer: Xiaochun FangScientific director: Huaxin LinSpecial Lectures: Huaxin Lin (University of Oregon , USA)Speakers:Qingzhai Fan (Shanghai Maritime University)Fugen, Gao (Tongji University)Jiajie, Hua (East China Normal University)Lin, Wang (Qingdao University)Xiaoming, Xu (Tongji University)Xinbing, Yang (Tong...

报告人：楼元教授(Ohio State University, USA）题目：Tracking prey or tracking prey’s resource?时间：2009年7月16日(星期四) 上午10：10—11：10地点：数学系致远楼107欢迎各位参加

题目：定时截尾下指数分布产品可靠性抽样检验报告人：中国科学院数学与系统科学研究院系统所吴启光研究员时间：2006年10月24日（星期二）上午9：30—10：30地点：致远楼106室欢迎各位老师和同学参加

题目：嵌入马氏链与Motif检验报告人：中国科学院数学与系统科学研究院系统所李国英研究员时间：2006年10月24日（星期二）上午10：40—11：40地点：致远楼106室欢迎各位老师和同学参加！

题目： Efficient Frontier of Utility and Conditional VaR报告人：Dr. Harry ZhengImperial College London时间： 2006年11月23日（星期四）下午 2：30时地点： 致远楼106