The spread of a matrix is defined as the diameter of its
spectrum. This quantity has been well-studied for general matrices
and has recently grown in popularity for the specific case of the
adjacency matrix of a graph. Most notably, Gregory...
The ABNNR encoding is a classical encoding scheme that amplifies
the distance of an error correcting code. The encoding takes an
error correcting code with a small distance and constructs an error
correcting code with distance approaching one, by...
We introduce a theoretical framework to study experimental
physics using quantum complexity theory. This allows us to address:
what is the computational complexity of an experiment? For several
'model' experiments, we prove that there is an...
We take the tensor network describing explicit p-adic CFT
partition functions proposed in 1902.01411, and consider boundary
conditions of the network describing a deformed Bruhat-Tits (BT)
tree geometry. We demonstrate that this geometry satisfies...
I shall present joint work with Maxim Kontsevich
(arXiv:2105.10161) describing an interesting domain of complex
metrics on a smooth manifold. It is a complexification of the space
of ordinary Riemannian metrics, and has the Lorentzian metrics
(but...
We explain our proof of the unbounded denominators conjecture.
This talk will require the main theorem of the lecture on Nov. 17,
2021, as a “black box” but otherwise be logically independent of
that talk.
In this talk, we discuss the Diophantine study of relative
SL2-character varieties of surfaces. In particular, we prove that
the integral points on these varieties are effectively finitely
generated in a precise sense, and in particular their...
