We study the heat kernel of a regular symmetric Dirichlet form on a metric space with doubling measure, in particular, a connection between the properties of the jump measure and the long time behaviour of the heat kernel. Under appropriate optimal hypotheses, we obtain the Hölder regularity and lower estimates of the heat kernel.

No abstract uploaded!

No abstract uploaded!

The Standard Models contain chiral fermions coupled to gauge theories. It has been a long-standing problem to give such gauged chiral fermion theories a quantum non-perturbative definition. By classification of quantum anomalies and symmetric invertible topological orders via a mathematical cobordism theorem for differentiable and triangulable manifolds, and the existence of symmetric gapped boundary for the trivial symmetric invertible topological orders, we propose that Spin(10) chiral fermion theories with Weyl fermions in 16-dimensional spinor representations can be defined on a 3+1D lattice, and subsequently dynamically gauged to be a Spin(10) chiral gauge theory. As a result, the Standard Models from the 16n-chiral fermion SO(10) Grand Unification can be defined non-perturbatively via a 3+1D local lattice model of bosons or qubits. Furthermore, we propose that Standard Models from the 15n-chiral fermion SU(5) Grand Unification can also be realized by a 3+1D local lattice model of fermions.

Lattice problem such as NTRU problem and LWE problem is widely used as the security base of post-quantum cryptosystems. And currently doing lattice reduction by BKZ algorithm is the most efficient way to solve it. In this paper, we give several further improvements on BKZ algorithm, which can be used for different SVP subroutines base on both enumeration and sieving. These improvements in combination provide a speed up of 2^{3~4} in total. It is significant in concrete attacks. Using these new techniques, we solved the 656 dimensional ideal lattice challenge in only 380 thread hours (also with a enumeration based SVP subroutine), much less than the previous records (which costs 4600 thread hours in total). With these improvements enabled, we can still simulate the new BKZ algorithm easily. One can also use this simulator to find the blocksize strategy (and the corresponding cost) to make Pot of the basis (defined in section 5.2) decrease as fast as possible, which means the length of the first basis vector decrease the fastest if we accept the GSA assumption. It is useful for analyzing concrete attacks on lattice-based cryptography.