We show that for any amenable group \Gamma and any Z\Gamma-module M of type FL with vanishing Euler characteristic, the entropy of the natural \Gamma-action on the Pontryagin dual of M is equal to the L^2-torsion of M. As a particular case, the entropy of the principal algebraic action associated with the module Z\Gamma / Z\Gamma f is equal to the logarithm of the Fuglede-Kadison determinant of f whenever f is a non-zero-divisor in Z\Gamma. This confirms a conjecture of Deninger. As a key step in the proof we provide a general Szeg\H{o}-type approximation theorem for the Fuglede-Kadison determinant on the group von Neumann algebra of an amenable group. As a consequence of the equality between L^2-torsion and entropy, we show that the L^2-torsion of a non-trivial amenable group with finite classifying space vanishes. This was conjectured by Lueck. Finally, we establish a Milnor-Turaev formula for the L^2-torsion of a finite \Delta-acyclic chain complex.

In this paper we show that for a generic strictly convex domain, one can recover the eigendata corresponding to Aubry–Mather periodic orbits of the induced billiard map from the (maximal) marked length spectrum of the domain.

We study the resonances of the Laplacian acting on the compactly supported sections of a homogeneous vector bundle over a Riemannian symmetric space of the non-compact type. The symmetric space is assumed to have rank-one but the irreducible representation τ of K defining the vector bundle is arbitrary. We determine the resonances. Under the additional assumption that τ occurs in the spherical principal series, we determine the resonance representations. They are all irreducible. We find their Langlands parameters, their wave front sets and determine which of them are unitarizable.

In this paper, a brief introduction of the nonlinear filtering problems and a review of the quasi-implicit Euler method are presented. The major contribution of this paper is that we propose a nonnegativity-preserving algorithm of Yau-Yau method for solving high-dimensional nonlinear filtering problems by applying quasi-implicit Euler method with discrete sine transform. Furthermore, our algorithms are directly applicable on the compact difference schemes, so that the number of spatial points can be substantially reduced and retain the same accuracy. Numerical results indicate that the proposed algorithm is capable of solving up to six-dimensional nonlinear filtering problems efficiently and accurately.

No abstract uploaded!