I will discuss some well-known and less-known papers of Turing,
exemplify the scope of deep, prescient ideas he put forth, and
mention follow-up work on these by the Theoretical CS
community.
The well-known Zig-Zag product and related graph operators, like
derandomized squaring, are fundamentally combinatorial in nature.
Classical bounds on their behavior often rely on a mix of
combinatorics and linear algebra. However, these traditional...
Given a path-connected topological space X, a differential
graded (DG) local system (or derived local system) is a module over
the DGA of chains on the based loop space of X. I will explain how
to define in the symplectically aspherical case...
In the third talk, I will concentrate on inequalities for linear
extensionsof finite posets. I will start with several
inequalities which do have a combinatorial proof. I will then
turn to Stanley's inequality and outline the proof why its
defect...
The Arithmetic Quantum Unique Ergodicity (AQUE) conjecture
predicts that the L2 mass of Hecke-Maass cusp forms on an
arithmetic hyperbolic manifold becomes equidistributed as the
Laplace eigenvalue grows. If the underlying manifold is
non-compact...
In the second talk, I will concentrate on polynomial
inequalities and whether the defect (the difference of two sides)
has a combinatorial interpretation. For example, does the
inequality x2+y2≥2xy
In the previous talk, we defined Subgroup Tests and the
interactive proof system induced by them. In addition, we showed
that if the Aldous--Lyons conjecture was true, then this
interactive proof system contains only decidable languages. In
this...
By Deligne's Hodge theory, the integral cohomology groups
H^n(X^h, Z) of the C-analytification of a separated scheme X of
finite type over C are provided with a mixed Hodge structure,
functorial in X. Given a non-Archimedean field K isomorphic
to...