3 research outputs found

    Noise Kernel and Stress Energy Bi-Tensor of Quantum Fields in Hot Flat Space and Gaussian Approximation in the Optical Schwarzschild Metric

    Get PDF
    Continuing our investigation of the regularization of the noise kernel in curved spacetimes [N. G. Phillips and B. L. Hu, Phys. Rev. D {\bf 63}, 104001 (2001)] we adopt the modified point separation scheme for the class of optical spacetimes using the Gaussian approximation for the Green functions a la Bekenstein-Parker-Page. In the first example we derive the regularized noise kernel for a thermal field in flat space. It is useful for black hole nucleation considerations. In the second example of an optical Schwarzschild spacetime we obtain a finite expression for the noise kernel at the horizon and recover the hot flat space result at infinity. Knowledge of the noise kernel is essential for studying issues related to black hole horizon fluctuations and Hawking radiation backreaction. We show that the Gaussian approximated Green function which works surprisingly well for the stress tensor at the Schwarzschild horizon produces significant error in the noise kernel there. We identify the failure as occurring at the fourth covariant derivative order.Comment: 21 pages, RevTeX

    On the minimum corridor connection and other generalized geometric problems

    No full text
    In this paper we discuss the complexity and approximability of the minimum corridor connection problem where, given a rectilinear decomposition of a rectilinear polygon into "rooms", one has to find the minimum length tree along the edges of the decomposition such that every room is incident to a vertex of the tree. We show that the problem is strongly NP-hard and give an subexponential time exact algorithm. For the special case of k-outerplanar graphs the running time becomes O(n3). We develop a polynomial time approximation scheme for the case when all rooms are fat and have nearly the same size. When rooms are fat but are of varying size we give a polynomial time constant factor approximation algorithm
    corecore