1,922,504 research outputs found

    Pseudohermitian invariants and classification of CR mappings in generalized ellipsoids

    Full text link
    We discuss the problem of classifying all local CR diffeomorphisms of a strictly pseudoconvex surface. Our method exploits the Tanaka--Webster pseudohermitian invariants, their transformation formulae, and the Chern--Moser invariants. Our main application concerns a class of generalized ellipsoids where we classify all local CR mappings.Comment: Accepted version, to appear on J. Math. Soc. Japa

    Global existence of solutions for a multi-phase flow: a drop in a gas-tube

    Get PDF
    In this paper we study the flow of an inviscid fluid composed by three different phases. The model is a simple hyperbolic system of three conservation laws, in Lagrangian coordinates, where the phase interfaces are stationary. Our main result concerns the global existence of weak entropic solutions to the initial-value problem for large initial data

    Perturbations of time optimal control problems for a class of abstract parabolic systems

    Get PDF
    In this work we study the asymptotic behavior of the solutions of a class of abstract parabolic time optimal control problems when the generators converge, in an appropriate sense, to a given strictly negative operator. Our main application to PDEs systems concerns the behavior of optimal time and of the associated optimal controls for parabolic equations with highly oscillating coefficients, as we encounter in homogenization theory. Our main results assert that, provided that the target is a closed ball centered at the origin and of positive radius, the solutions of the time optimal control problems for the systems with oscillating coefficients converge, in the usual norms, to the solution of the corresponding problem for the homogenized system. In order to prove our main theorem, we provide several new results, which could be of a broader interest, on time and norm optimal control problems

    On the structure of the essential spectrum of elliptic operators on metric spaces

    Get PDF
    We give a description of the essential spectrum of a large class of operators on metric measure spaces in terms of their localizations at infinity. These operators are analogues of the elliptic operators on Euclidean spaces and our main result concerns the ideal structure of the C∗C^*-algebra generated by them.Comment: Improved presentation, some new results

    Communication Complexity of Cake Cutting

    Full text link
    We study classic cake-cutting problems, but in discrete models rather than using infinite-precision real values, specifically, focusing on their communication complexity. Using general discrete simulations of classical infinite-precision protocols (Robertson-Webb and moving-knife), we roughly partition the various fair-allocation problems into 3 classes: "easy" (constant number of rounds of logarithmic many bits), "medium" (poly-logarithmic total communication), and "hard". Our main technical result concerns two of the "medium" problems (perfect allocation for 2 players and equitable allocation for any number of players) which we prove are not in the "easy" class. Our main open problem is to separate the "hard" from the "medium" classes.Comment: Added efficient communication protocol for the monotone crossing proble

    Structural matching by discrete relaxation

    Get PDF
    This paper describes a Bayesian framework for performing relational graph matching by discrete relaxation. Our basic aim is to draw on this framework to provide a comparative evaluation of a number of contrasting approaches to relational matching. Broadly speaking there are two main aspects to this study. Firstly we locus on the issue of how relational inexactness may be quantified. We illustrate that several popular relational distance measures can be recovered as specific limiting cases of the Bayesian consistency measure. The second aspect of our comparison concerns the way in which structural inexactness is controlled. We investigate three different realizations ai the matching process which draw on contrasting control models. The main conclusion of our study is that the active process of graph-editing outperforms the alternatives in terms of its ability to effectively control a large population of contaminating clutter
    • …