Cloud of strings for radiating black holes in Lovelock gravity

We present exact spherically symmetric null dust solutions in the third order Lovelock gravity with a string cloud background in arbitrary $N$ dimensions,. This represents radiating black holes and generalizes the well known Vaidya solution to Lovelock gravity with a string cloud in the background. We also discuss the energy conditions and horizon structures, and explicitly bring out the effect of the string clouds on the horizon structure of black hole solutions for the higher dimensional general relativity and Einstein-Gauss-Bonnet theories. It turns out that the presence of the coupling constant of the Gauss-Bonnet terms and/or background string clouds completely changes the structure of the horizon and this may lead to a naked singularity. We recover known spherically symmetric radiating models as well as static black holes in the appropriate limits.Comment: 9 pages, To appear in Phys. Rev.

Clouds of strings in third-order Lovelock gravity

Lovelock theory is a natural extension of the Einstein theory of general relativity to higher dimensions in which the first and second orders correspond, respectively, to general relativity and Einstein-Gauss-Bonnet gravity. We present exact black hole solutions of $D\geq 4$-dimensional spacetime for first-, second-, and third-order Lovelock gravities in a string cloud background. Further, we compute the mass, temperature, and entropy of black hole solutions for the higher-dimensional general relativity and Einstein-Gauss-Bonnet theories and also perform thermodynamic stability of black holes. It turns out that the presence of the Gauss-Bonnet term and/or background string cloud completely changes the black hole thermodynamics. Interestingly, the entropy of a black hole is unaffected due to a background string cloud. We rediscover several known spherically symmetric black hole solutions in the appropriate limits.Comment: 13 pages, 7 figures, Accepted for publication in Physical Review

The effect of a two-fluid atmosphere on relativistic stars

We model the physical behaviour at the surface of a relativistic radiating star in the strong gravity limit. The spacetime in the interior is taken to be spherically symmetrical and shear-free. The heat conduction in the interior of the star is governed by the geodesic motion of fluid particles and a nonvanishing radially directed heat flux. The local atmosphere in the exterior region is a two-component system consisting of standard pressureless (null) radiation and an additional null fluid with nonzero pressure and constant energy density. We analyse the generalised junction condition for the matter and gravitational variables on the stellar surface and generate an exact solution. We investigate the effect of the exterior energy density on the temporal evolution of the radiating fluid pressure, luminosty, gravitational redshift and mass flow at the boundary of the star. The influence of the density on the rate of gravitational collapse is also probed and the strong, dominant and weak energy conditions are also tested. We show that the presence of the additional null fluid has a significant effect on the dynamical evolution of the star.Comment: 31 pages, Minor corrections implemente

On the Combinatorial Complexity of Approximating Polytopes

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error parameter $\varepsilon > 0$, the objective is to determine a polytope of minimum combinatorial complexity whose Hausdorff distance from $K$ is at most $\varepsilon \cdot \mathrm{diam}(K)$. By combinatorial complexity we mean the total number of faces of all dimensions of the polytope. A well-known result by Dudley implies that $O(1/\varepsilon^{(d-1)/2})$ facets suffice, and a dual result by Bronshteyn and Ivanov similarly bounds the number of vertices, but neither result bounds the total combinatorial complexity. We show that there exists an approximating polytope whose total combinatorial complexity is $\tilde{O}(1/\varepsilon^{(d-1)/2})$, where $\tilde{O}$ conceals a polylogarithmic factor in $1/\varepsilon$. This is a significant improvement upon the best known bound, which is roughly $O(1/\varepsilon^{d-2})$. Our result is based on a novel combination of both old and new ideas. First, we employ Macbeath regions, a classical structure from the theory of convexity. The construction of our approximating polytope employs a new stratified placement of these regions. Second, in order to analyze the combinatorial complexity of the approximating polytope, we present a tight analysis of a width-based variant of B\'{a}r\'{a}ny and Larman's economical cap covering. Finally, we use a deterministic adaptation of the witness-collector technique (developed recently by Devillers et al.) in the context of our stratified construction.Comment: In Proceedings of the 32nd International Symposium Computational Geometry (SoCG 2016) and accepted to SoCG 2016 special issue of Discrete and Computational Geometr