科研动态

当前位置:学术交流 >> 科研动态 >> 浏览文章

2014年组合与图论研讨会

发布时间:2014年03月12日 浏览次数: 文章作者:03-21 发布者:高春玲

2014年组合与图论研讨会

2014321,星期五,海韵实验楼105报告厅

 

时间

主持人

报告人

08:30-09:00

开幕式

09:00-09:45

张福基教授

孙智伟教授 (南京大学)

09:45-10:30

高维东教授 (南开大学)

10:30-11:00

 

11:00-11:30

郭晓峰教授

钱建国教授 (厦门大学)

11:30-12:00

侯庆虎教授 (南开大学)

12:15

 

15:00-15:30

张莲珠教授

李书超教授 (华中师大)

15:30-16:00

陈海燕教授 (集美大学)

16:00-16:30

 

16:30-17:00

晏卫根教授

王光辉副教授  (山东大学)

17:00-17:30

王星炜副教授 (南开大学)

18:00

 

学术报告题目与摘要

 

1. 报告人:孙智伟,南京大学数学系

题目:Problems on Combinatorial Properties of Primes

摘要:For let (x) be the number of primes not exceeding x. The asymptotic behaviors of the prime-counting function (x) and the n-th prime pn  have been studied intensively in analytic number theory. Surprisingly, we find that (x) and pn have many combinatorial properties which should not be ignored. In this talk we will introduce many new open problems on combinatorial properties of primes as well as some connections between primes and partition functions.

 

. 报告人:高维东,南开大学组合数学中心

题目:On the EGZ-constant and short zerosum  sequences

摘要:Let G be a finite additively written abelian group with exponent exp(G)=m. We call a sequence S of elements from G a zero-sum sequence if the sum of all terms of S equals to zero, the identity element of G. We shall discuss some problems and present some new results on zero-sum subsequences of length between 1 and m.  

 

3. 报告人:钱建国,厦门大学数学科学学院

题目:Enumeration of unlabeled uniform hypergraphs and directed hypergraphs

摘要:We consider the enumeration of unlabeled uniform hypergraphs and directed hypergraphs by using Polya's counting theory and Burnside's counting lemma. Instead of characterizing the cycle index of the permutation group acting on the hyperedge setε, we treat each cycle in the disjoint cycle decomposition of a permutation ρacting onεas an equivalence class (or orbit) ofεunder the operation of the group generated by ρ. Compared to the cycle index-based method, our method is more effective in dealing with the enumeration of hypergraphs. Using this method we establish an explicit counting formula of the unlabeled k-uniform hypergraphs and directed hypergraphs for any integer k with 1kn, where n is the order of the hypergraphs.  Based on our counting formula, the asymptotic behaviour for the number of these two types of graphs are also analyzed.

 

 

4. 报告人:侯庆虎,南开大学组合数学中心

题目:扩展的Zeilberger算法及其应用

摘要:我们将简介扩展的Zeilberger算法的理论和算法,并以正交多项式计算、q级数等式推导、Bernoulli数等式证明为例,展示该算法的应用。

 

 

 

5. 报告人:李书超,华中师范大学数学与统计学学院

题目:Independent sets, independence polynomials and maximal independent sets of graphs

摘要: In this talk, we survey some results on independent sets, independence polynomials and maximal independent sets of graphs. In particular, we determined the largest number of maximal independent sets among all n-vertex bipartite graphs with at least one cycle. The corresponding external graphs are characterized.

 

6. 报告人:陈海燕,集美大学理学院

题目:Some results on the Abelian sandpile model

摘要: Let G be a connected graph with a distinguished vertex . The Abelian sandpile model is a Markoc chain on G. The recurrent states of this chain are main concerns of researchers. It has been found that the recurrent set has rich algebraic and combinatoric  structures, such as it has a finite abelian group structure( called the critical group) with order equal to the tree-number of G.  In this report, we simply introduce some our recent work about the height distribution function and the critical group of the recurrent states.

 

7. 报告人:王光辉,山东大学数学学院

题目:Neighbor sum distinguishing colorings of graphs

摘要: Colorings and labellings related to sums of the colors have been studied widely. The family of such problems
 includes e.g. vertex-coloring [k]-edge-weightings, total weight choosability, magic and antimagic labellings and the 
irregulaity strength. Among them there are the 1-2-3 Conjecture due to Karo'nski, Luczak and Thomasson  and 1-2 
Conjecture due to Przybylo and Wo'zniak. In a proer edge (total) coloring of G, let f(v) denote the total sum of colors 
around v. If for each edge uv, f(u)≠f(v), we call such edge (total) coloring a {\it neighbor sum distinguishing coloring}. 
We will give some results about neighbor sum distinguishing colorings. 
 

8. 报告人:王星炜,南开大学组合数学中心

题目:Analytical properties of combinatorial sequences

摘要:Log-concave and log-convex sequences often arise in combinatorics, algebra, analysis and geometry, as well as in probability and statistics. By establishing the connection between continued functions and combinatorial sequences, we prove that some combinatorial sequences propose analytical properties, including log-convexity, ratio log-convexity, infinitely log-monotonicity, Turan inequality.