[Discrete-math-seminar] Today's Seminar at CS, 11AM, Room 225 SB

[Xiang-Yang Li]

Title: Holographic Algorithms: From Art to Science

Presentation:  PinYan Lu

Date:  Monday, February 26, 2007

Time:  11:00am-12:00pm

Location:  Stuart Building, Room 225

Abstract: We develop the theory of holographic algorithms. We give
characterizations of algebraic varieties of realizable symmetric generators
and recognizers on the basis manifold, and a polynomial time decision
algorithm for the simultaneous realizability problem. Using the general
machinery we are able to give unexpected holographic algorithms for some
counting problems, modulo certain Mersenne type integers. These counting
problems are #P-complete without the moduli. Going beyond symmetric
signatures, we define d-admissibility and d-realizability for general
signatures, and give a characterization of 2-admissibility and some general
constructions of admissible and realizable families.



 Joint work with Jin-Yi Cai.



********************************************
Dawn DeBartolo
Administrative Associate
Illinois Institute of Technology
Department of Computer Science
10 West 31st Street, SB Room 236C
Chicago, Illinois  60616

312-567-5124
312-567-5067 fax
-------------- next part --------------
A non-text attachment was scrubbed...
Name: PinYan Lu.doc
Type: application/msword
Size: 30208 bytes
Desc: 
Url : http://math.iit.edu/pipermail/discrete-math-seminar/attachments/20070226/87bb3d19/attachment-0001.doc