校园生活
当前位置: 首页 >> 校园生活 >> 学术活动 >> 学院讲座 >> 正文
统计数据 / lectrue notice
  • 排序 学院 发文量
    1 机械与运载工程学院 124
    2 物理与微电子科学学院 119
    3 化学化工学院 115
    4 岳麓书院 115
    5 数学与计量经济学院 57
    6 土木工程学院 52
    7 材料科学与工程学院 51
    8 建筑学院 40
    9 经济与贸易学院 38
    10 信息科学与工程学院 37
  • 排序 学院 发文量
    11 电气与信息工程学院 33
    12 教务处 30
    13 工商管理学院 28
    14 生物学院 20
    15 外国语学院 15
    16 法学院 15
    17 新闻传播与影视艺术学院 8
    18 研究生院 7
    19 经济与管理研究中心 6
    20 马克思主义学院 5
    21 中国语言文学学院 4
数学院:Tutte polynomial of an Eulerian graph
学术地点 数学院425 主讲人 马俊博士,上海交通大学
讲座时间 2018/1/12(周六)10:00-11:00

题目:Tutte polynomial of an Eulerian graph

报告人: 马俊博士,上海交通大学

时间:2018/1/12(周六)10:00-11:00

地点:数学院425

Abstract:

William Tutte is one of the founders of the modern graph theory. For every undirected graph G, Tutte de_ned a polynomial TG(x; y) in two variables which plays an important role in graph theory. It encodes information about subgraphs of G. For example, for a connected graph G, TG(1; 1) is the number of spanning trees of G, TG(2; 1) is the number of spanning forests of G, TG(1; 2) is the number of connected spanning subgraphs of G, TG(2; 2) is the number of spanning subgraphs of G. One has been looking for analogues of the Tutte polynomial for digraphs for a long time. Recently, considering an Eulerian digraph and a Chip-_ring game on this digraph, K_evin Perrot [1] and Swee Hong Chan [2] gave generalizations of the partial Tutte polynomial TG(1; y) from the point of view of recurrent congurations of the Chip-ring game. In this talk, let D be an weak-connected Eulerian digraph and v be a vertex of D. We will introduce two polynomials PD;v(y) and QD;v(y), which are de_ned on the set of v-sink subgaphs and the set of acyclic v-sink subgaphs of D, respectively. We _nd that these two polynomials have very good invariance properties. In particular, these two polynomials are independent of the choice of the vertex v. Moreover, we will introduce two polynomials ~ PD;v(y) and ~QD;v(y), which are de_ned on the set of v-source subgaphs and the set of acyclic v-source subgaphs of D, respectively. We prove that PD;v(y) = ~ PD;v(y) and QD;v(y) = ~QD;v(y). For these reason, we simply write PD;v(y) and ~ PD;v(y) as PD(y), and QD;v(y) and ~Q D;v(y) as QD(y). Thus, the polynomials PD(y) and QD(y) depends only on the Eulerian digraph D. Furthermore, PD(y) can be viewed as a generalization of the partial Tutte polynomial TG(1; y) on an undirected graph G.

报告人介绍: 马俊, 2006年从上海交通大学数学系博士毕业, 后2006年至2009年,在台北中央研究院数学所从事过为期三年的博士后研究工作,2010年到上海交通大学工作, 现为上海交通大学数学科学学院副教授, 主要研究组合设计与编码、代数组合、计数组合学及其应用等方面的问题。最近几年,研究主要围绕在图上的多项式(尤其是图的Tutte多项式)的性质、计算、推广,及其与图上其他相关组合结构之间的关系,如与图的生成树、与图上泊车函数和与图上沙堆模型的关系上, 得到了一系列的成果。

上一条:信科院:Beyond Deep Recognition: Discovering Visual Patterns in Big Visual Data
下一条:化工院:Coordinationof carbon defect and atomic species as active site for catalysis

湖大官网
湖大微信
湖大微博