For an abelian surface A over a number field k, we study the
limiting distribution of the normalized Euler factors of the
L-function of A. Under the generalized Sato-Tate conjecture, this
is equal to the distribution of characteristic...
Some important mechanisms considered in game theory require
solving optimization problems that are computationally hard.
Solving these problems approximately may not help, as it may change
the players’ rational behavior in the original mechanisms...
This talk is designed for a general mathematical audience; no
prior knowledge of type theory is presumed.
One of the main goals for the special year on univalent foundations
is the development of a logical formalism, called homotopy type
theory...
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...
Many problems from complexity theory can be phrased in terms of
tensors. I will begin by reviewing basic properties of tensors and
discussing several measures of the complexity of a tensor. I'll
then focus on the complexity of matrix...
This talk is intended for a general audience. The recent
discovery of an interpretation of constructive type theory into
abstract homotopy theory has led to a new approach to foundations
with both intrinsic geometric content and a computational...
