Recursive Majority-of-three (3-Maj) is a deceptively simple
problem in the study of randomized decision tree complexity. The
precise complexity of this problem is unknown, while that of the
similarly defined Recursive NAND tree is completely...
I will start with a review the basic notions of
Hamiltonian/symplectic vector field and of Hamiltonian/symplectic
group action, and the classical structure theorems of Kostant,
Atiyah, Guillemin-Sternberg and Delzant on Hamiltonian torus
actions...
I will present a recent joint work with Ya.G. Sinai. We
investigate the ``randomness" of the classical Möbius function by
means of a statistical mechanical model for square-free numbers and
we prove some new results, including a non-standard...
I am going to talk about triangulated categories in algebra,
geometry and physics and about differential-graded (DG)
enhancements of triangulated categories. I will discuss such
properties of DG enhancements as uniqueness and existing. It can
be...
In this talk, I will give new proofs for the hardness
amplification of fficiently samplable predicates and of weakly
verifiable puzzles. More oncretely, in the first part of the talk,
I will give a new proof of Yao's XOR-Lemma as well as
related...