We study the rigidity of polyhedral surfaces and the moduli space of polyhedral surfaces using variational principles. Curvaturelike quantities for polyhedral surfaces are introduced and are shown to determine the polyhedral metric up to isometry. The action functionals in the variational approaches are derived from the cosine law. They can be considered as 2-dimensional counterparts of the Schlaefli formula.

Inspired by the work of Z. Lu and G. Tian (Duke Math. J. 125:351–387,2004) in the compact setting, in this paper we address the problem of studying the Szegö kernel of the disk bundle over a noncompact Kähler manifold. In particular we compute the Szegö kernel of the disk bundle over a Cartan–Hartogs domain based on a bounded symmetric domain. The main ingredients in our analysis are the fact that every Cartan–Hartogs domain can be viewed as an “iterated” disk bundle over its base and the ideas given in (Arezzo, Loi and Zuddas in Math. Z. 275:1207–1216,2013) for the computation of the Szegö kernel of the disk bundle over an Hermitian symmetric space of compact type.

No abstract uploaded!

Building on [BB1] we prove a general criterion for convergence of (possibly singular) Bergman measures towards pluripotential-theoretic equilibrium measures on complex manifolds. The criterion may be formulated in terms of the growth properties of the unit-balls of certain norms on holomorphic sections, or equivalently as an asymptotic minimization property for generalized Donaldson$L$-functionals. Our result settles in particular a well-known conjecture in pluripotential theory concerning the equidistribution of Fekete points and it gives the convergence of Bergman measures towards the equilibrium measure for Bernstein-Markov measures. Applications to interpolation of holomorphic sections are also discussed.

We prove a Harnack inequality for positive harmonic functions on graphs which is similar to a classical result of Yau on Riemannian manifolds. Also, we prove a mean value inequality of nonnegative subharmonic functions on graphs.