Communication complexity studies the minimal amount of
information two parties need to exchange to compute a joint
function of their inputs. Results, especially lower bounds in this
basic model found applications in many other areas of
computer...
One of the great mysteries in computational condensed matter
physics is the remarkable practical success of the Density Matrix
Renormalization Group (DMRG) algorithm, since its invention a
quarter century ago, for finding low energy states of 1D...
Take \(E/Q\) to be an elliptic curve with full rational 2-torsion
(satisfying some extra technical assumptions). In this talk, we
will show that 100% of the quadratic twists of \(E\) have rank less
than two, thus proving that the BSD conjecture...
