Topology of positive zero sets of nvariate (n+4)nomials
MSRIUP 2017: Solving Systems of Polynomial Equations June 24, 2017  August 06, 2017
Location: SLMath: Baker Board Room
Boykin, Enriquez, Valdez
Let f be a polynomial of degree d with exactly n+4 monomial terms in R[x_1,…,x_n]. We show that one can efficiently compute an explicit polyhedral complex with the same isotopy type as the positive zero set of f. In particular, the complexity of our construction is polynomial in u + log d with high probability. Along the way, we derive and implement an algorithm that, given an nvariate (n+4)nomial f, outputs a plot of the reduced Adiscriminant contour in R^3.
Boykin, Enriquez, Valdez
H.264 Video 
Talk_6.mp4

Download 
Please report video problems to itsupport@slmath.org.
See more of our Streaming videos on our main VMath Videos page.