We will give an overview of this system, which has been at the
center of recent algorithmic and proof complexity developments. We
will give the definitions of the system (as a proof system for
polynomial inequalities, and as an SDP-based algorithm)...
We consider Galois cohomology groups over function fields F of
curves that are defined over a complete discretely valued
field.
Motivated by work of Kato and others for n=3, we show that
local-global principles hold for
$H^n(F, Z/mZ(n-1))$ for all...
This is from joint works with D. Knopf and I. M. Sigal. In this
talk I will present a new strategy in studying neckpinching of mean
curvature flow. Different from previous results, we do not use
backward heat kernel, entropy estimates or subsequent...
Does the world embody beautiful ideas? This is a question that
people have thought about for a long time. Pythagoras and Plato
intuited that the world should embody beautiful ideas; Newton and
Maxwell demonstrated how the world could embody...
The PCP theorem (Arora et. al., J. ACM 45(1,3)) asserts the
existence of proofs that can be verified by reading a very small
part of the proof. Since the discovery of the theorem, there has
been a considerable work on improving the theorem in terms...
Often mathematicians refer to a "beautiful" result or a
"beautiful" proof. In this special lecture, Enrico Bombieri,
Professor Emeritus in the School of Mathematics, addresses the
question, "What is beauty in mathematics?"
In the past ten years, the term “heritage” in African art
studies has gone from being a cliché used only by cultural
bureaucrats to a burgeoning academic growth industry, brought into
being by studies of collective memory or national trauma in...
For all practical purposes, the Micali-Vazirani algorithm,
discovered in 1980, is still the most efficient known maximum
matching algorithm (for very dense graphs, slight asymptotic
improvement can be obtained using fast matrix
multiplication)...