Electrostatic boundary value problems in the Schwarzschild background

The electrostatic potential of any test charge distribution in Schwarzschild space with boundary values is derived. We calculate the Green's function, generalize the second Green's identity for p-forms and find the general solution. Boundary value problems are solved. With a multipole expansion the asymptotic property for the field of any charge distribution is derived. It is shown that one produces a Reissner--Nordstrom black hole if one lowers a test charge distribution slowly toward the horizon. The symmetry of the distribution is not important. All the multipole moments fade away except the monopole. A calculation of the gravitationally induced electrostatic self-force on a pointlike test charge distribution held stationary outside the black hole is presented.Comment: 18 pages, no figures, uses iopart.st

Differential Forms on Log Canonical Spaces

The present paper is concerned with differential forms on log canonical varieties. It is shown that any p-form defined on the smooth locus of a variety with canonical or klt singularities extends regularly to any resolution of singularities. In fact, a much more general theorem for log canonical pairs is established. The proof relies on vanishing theorems for log canonical varieties and on methods of the minimal model program. In addition, a theory of differential forms on dlt pairs is developed. It is shown that many of the fundamental theorems and techniques known for sheaves of logarithmic differentials on smooth varieties also hold in the dlt setting. Immediate applications include the existence of a pull-back map for reflexive differentials, generalisations of Bogomolov-Sommese type vanishing results, and a positive answer to the Lipman-Zariski conjecture for klt spaces.Comment: 72 pages, 6 figures. A shortened version of this paper has appeared in Publications math\'ematiques de l'IH\'ES. The final publication is available at http://www.springerlink.co

On the accuracy of language trees

Historical linguistics aims at inferring the most likely language phylogenetic tree starting from information concerning the evolutionary relatedness of languages. The available information are typically lists of homologous (lexical, phonological, syntactic) features or characters for many different languages. From this perspective the reconstruction of language trees is an example of inverse problems: starting from present, incomplete and often noisy, information, one aims at inferring the most likely past evolutionary history. A fundamental issue in inverse problems is the evaluation of the inference made. A standard way of dealing with this question is to generate data with artificial models in order to have full access to the evolutionary process one is going to infer. This procedure presents an intrinsic limitation: when dealing with real data sets, one typically does not know which model of evolution is the most suitable for them. A possible way out is to compare algorithmic inference with expert classifications. This is the point of view we take here by conducting a thorough survey of the accuracy of reconstruction methods as compared with the Ethnologue expert classifications. We focus in particular on state-of-the-art distance-based methods for phylogeny reconstruction using worldwide linguistic databases. In order to assess the accuracy of the inferred trees we introduce and characterize two generalizations of standard definitions of distances between trees. Based on these scores we quantify the relative performances of the distance-based algorithms considered. Further we quantify how the completeness and the coverage of the available databases affect the accuracy of the reconstruction. Finally we draw some conclusions about where the accuracy of the reconstructions in historical linguistics stands and about the leading directions to improve it.Comment: 36 pages, 14 figure

Feed, food and fuel: Competition and potential impacts on small-scale crop-livestock-energy farming systems

CGIAR System-wide Livestock Programm