7,876 research outputs found

    Deformation of LeBrun's ALE metrics with negative mass

    Full text link
    In this article we investigate deformations of a scalar-flat K\"ahler metric on the total space of complex line bundles over CP^1 constructed by C. LeBrun. In particular, we find that the metric is included in a one-dimensional family of such metrics on the four-manifold, where the complex structure in the deformation is not the standard one.Comment: 20 pages, no figure. V2: added two references, filled a gap in the proof of Theorem 1.2. V3: corrected a wrong statement about Kuranishi family of a Hirzebruch surface stated in the last paragraph in the proof of Theorem 1.2, and fixed a relevant error in the proof. Also added a reference [24] about Kuranishi family of Hirzebruch surface

    Double solid twistor spaces: the case of arbitrary signature

    Full text link
    In a recent paper (math.DG/0701278) we constructed a series of new Moishezon twistor spaces which is a kind of variant of the famous LeBrun twistor spaces. In this paper we explicitly give projective models of another series of Moishezon twistor spaces on nCP^2 for arbitrary n>2, which can be regarded as a generalization of the twistor spaces of a 'double solid type' on 3CP^2 studied by Kreussler, Kurke, Poon and the author. Similarly to the twistor spaces of 'double solid type' on 3CP^2, projective models of present twistor spaces have a natural structure of double covering of a CP^2-bundle over CP^1. We explicitly give a defining polynomial of the branch divisor of the double covering whose restriction to fibers are degree four. If n>3 these are new twistor spaces, to the best of the author's knowledge. We also compute the dimension of the moduli space of these twistor spaces. Differently from math.DG/0701278, the present investigation is based on analysis of pluri-(half-)anticanonical systems of the twistor spaces.Comment: 30 pages, 3 figures; v2: title changed (the original title was "Explicit construction of new Moishezon twistor spaces, II".

    On Asynchronous Session Semantics

    Get PDF
    This paper studies a behavioural theory of the π-calculus with session types under the fundamental principles of the practice of distributed computing — asynchronous communication which is order-preserving inside each connection (session), augmented with asynchronous inspection of events (message arrivals). A new theory of bisimulations is introduced, distinct from either standard asynchronous or synchronous bisimilarity, accurately capturing the semantic nature of session-based asynchronously communicating processes augmented with event primitives. The bisimilarity coincides with the reduction-closed barbed congruence. We examine its properties and compare them with existing semantics. Using the behavioural theory, we verify that the program transformation of multithreaded into event-driven session based processes, using Lauer-Needham duality, is type and semantic preserving

    A new type of solution of the Schr\"odinger equation on a self-similar fractal potential

    Full text link
    Scattering a quantum particle by a self-similar fractal potential on a Cantor set is investigated. We present a new type of solution of the functional equation for the transfer matrix of this potential, which was derived earlier from the Schr\"odinger equation.Comment: Latex, 4 pages, 7 eps-figures; the old figures are renewed and new ones are adde

    Program logics for homogeneous meta-programming.

    Get PDF
    A meta-program is a program that generates or manipulates another program; in homogeneous meta-programming, a program may generate new parts of, or manipulate, itself. Meta-programming has been used extensively since macros were introduced to Lisp, yet we have little idea how formally to reason about metaprograms. This paper provides the first program logics for homogeneous metaprogramming – using a variant of MiniMLe by Davies and Pfenning as underlying meta-programming language.We show the applicability of our approach by reasoning about example meta-programs from the literature. We also demonstrate that our logics are relatively complete in the sense of Cook, enable the inductive derivation of characteristic formulae, and exactly capture the observational properties induced by the operational semantics
    • 

    corecore