Hebrew University
Amitsur Algebra Seminar
Time: Thursday, Nov 8 , 12:00-13:15
Place: math 209
Speaker: Alexander Guterman (Moscow State University)
Title: On the Polya problem of conversion between permanents and determinants

(See also the pdf file of the abstract at:
Two important functions in matrix theory, determinant and permanent,
look very similar.
While the computation of the determinant can be done in a polynomial
time, it is still an open question, if there exists a polynomial
algorithm to compute the permanent. Due to this reason, starting from
the work by Polya, 1913, different approaches to convert the permanent
into the determinant were under the intensive investigation.
Among our results we prove the following theorem:
Suppose n>=3, and let F be a finite field with char(F) not equal 2.
Then, no bijective map
T:M_n(F) ---> M_n(F) satisfies
per( A) = det (T(A)).
You are cordially invited!
Technion Math Net-2 (TECHMATH2)
Editor: Michael Cwikel   <techm@math.technion.ac.il> 
To see today's activities and other future and past activities go to
Announcement from: Gili Schul   <gili.schul@mail.huji.ac.il>