Search
Talk

Solving decomposable sparse systems

  • Thomas Yahl (Texas A&M)
G3 10 (Lecture hall)

Abstract

Solutions to sparse polynomial systems can be viewed as fibres of a branched cover determined by the support of the equations. A system is decomposable if this branched cover factors as a composition of nontrivial branched covers on an open set. This leads to a method of solving sparse polynomial systems by completely factoring the branched cover and iteratively solving simpler polynomial systems as fibres of these factors.

Mirke Olschewski

MPI for Mathematics in the Sciences Contact via Mail

Upcoming Events of This Seminar