Department
Home Page

About Us:
Contact Info.
Faculty
Staff
Teaching Assistants

Academic Program:
Admission
Undergraduate
Graduate
Certificates

Courses:
Course Description
Class Web Pages
Class Syllabi

Research:
Colloquium
Interdisciplinary Seminar
Seminars
Steve Goldman Lectures in Mathematical Physics

Links:
Completing Online
GEP Courses
Best Jobs
Newsletter
Math Lab
Math Placement Test
Careers
American
Mathematical
Society
Mathematical
Association
of America


Phone: (407) 823-6284;   Fax: (407) 823-6253;   MAP  207

04/18/05 Colloquium

Dr. Fengshan Bai
Department of Mathematical Sciences
Tsinghua University, Beijing, China

Computing the Permanents of
Matrices with Applications

Abstract:   The permanents of a matrix are introduced. It looks similar to the determinant. But its computational complexity is P-C. There are wide applications of the permanent in combinatorial counting, graph theory and statistic physics. It is also an interested structural invariant in computational molecular chemistry.

This work is concentrated on the computation of the permanents of adjacency matrices of fullerenes. They are all (0,1) sparse matrices. The comparisons of several alternative algorithms are also presented.
get acrobat reader


Copyright(c) 2003, University of Central Florida, Department of Mathematics.
webmaster@math.ucf.edu