Partial Differential Operators and Edmonds' Problem

Time:

Venue/Location: Phòng C101, VIASM, 157 phố Chùa Láng, Hà Nội

Speaker: Cornelius Brand, Technical University of Vienna

Abstract: "Edmonds' Problem is a classic task in computational algebra:
Given a linear space of matrices over the rationals, does it contain an invertible matrix? Using the Schwartz-Zippel Lemma, this problem has straightforward efficient randomized algorithms. In this talk, I will present the currently best known *deterministic* algorithm for the problem, using methods based on partial differential operators and the so-called apolar inner product of polynomials. This is joint work with Kevin Pratt."