本網站搜尋 | Web Mail   
成大 | 理學院 | 系圖書室 | 系友會   
首頁 | 連絡我們 | English Version
  

最新消息 | 演講 | 系所資訊 | 人物 | 學程 | 課程 | 資源 | 獎學金 | 研究 | 導師 | 招生 | 高中生專區

   2週內演講 | 學生演講 | 11月演講 | 10月演講 | 9月演講 | 6月演講 | 演講日曆
 

 

11月演講

Colloquium, 國立中山大學應用數學系 林晉宏 教授
Thursday, November 4, 16:10—17:00 數學系3174
Title: Inverse Eigenvalue Problem of a Graph
Abstract:We often encounter matrices whose pattern (zero-nonzero, or sign) is known while the precise value of each entry is not clear. Thus, a natural question is what we can say about the spectral property of matrices of a given pattern. When the matrix is real and symmetric, one may use a simple graph to describe its off-diagonal nonzero support. For example, it is known that an irreducible tridiagonal matrix (whose pattern is described by a path) only allows eigenvalues of multiplicity one. In contrast, a periodic Jacobi matrix (whose pattern is described by a cycle) allows multiplicity two but no more. The inverse eigenvalue problem of a graph (IEPG) focuses on the matrices whose pattern is described by a given graph and studies their possible spectra. In this talk, we will go through some of the histories of the IEPG and see how combinatorial methods (zero forcing) and analytic methods (implicit function theorem) can come into play in modern-day research.

   
 


首頁 | 最新消息 | 演講安排 | 系所資訊 | 人物 | 學程 | 課程 | 資源 | 獎學金 | 研究 | 導師 | 招生 | 高中生專區 | 網站地圖


國立成功大學數學系
70101 台南市大學路一號
電話︰(06) 2757575 轉 65100   傳真︰(06) 2743191
em65100[at]email.ncku.edu.tw