Math
A Computer-Checked Proof that the Fundamental Group of the Circle is the Integers
This talk is designed for a general mathematical audience; no prior knowledge of type theory is presumed.
Polynomial Identity Testing of Read-Once Oblivious Algebraic Branching Progress
Polynomial Identity Testing (PIT) is the problem of identifying whether a given algebraic circuit computes the identically zero polynomial. It is well-known that this problem can be solved with small error probability by testing whether the circuit evaluates to zero on random evaluation points.
Uniqueness and Nondegeneracy of Ground States for Non-Local Equations
On the Parity of Coefficients of Modular Forms
On the AND- and OR-Conjectures: Limits to Efficient Preprocessing
One of the major insights of the ``fixed-parameter tractability’’ (FPT) approach to algorithm design is that, for many NP-hard problems, it is possible to efficiently *shrink* instances which have some underlying simplicity.
How to Find Periodic Orbits and Exotic Symplectic Manifolds
A Multi-Prover Interactive proof for NEXP Sound Against Entangled Provers
We prove a strong limitation on the ability of entangled provers to collude in a multiplayer game. Our main result is the first nontrivial lower bound on the class MIP* of languages having multi-prover interactive proofs with entangled provers; namely MIP* contains NEXP, the class of languages decidable in non-deterministic exponential time.
Kan Simplicial Set Model of Type Theory
The Strauss Conjecture on Black Holes
Algebraic K-Theory Via Binary Complexes
