We prove uniqueness and stability for the inverse boundary value problem of the two dimensional Schr "odinger equation. We do not assume the potentials to be continuous or even bounded. Instead, we assume that some of their positive fractional derivatives are in a specific Lorentz space. These spaces are a natural generalization to the usual fractional Sobolev spaces. The thesis consists of two parts. In the first part, we define the generalized fractional Sobolev spaces and prove some of their properties including embeddings and interpolation identities. In particular we sharpen the usual Sobolev embedding into the space of H "older-continuous functions, by showing that a particular kind of space embeds into the space of continuous functions without any modulus of continuity. The inverse problem is considered in the second part of the thesis. We prove a new Carleman estimate for @math . This estimate has a fast decay rate, which will allow us to consider potentials with very low regularity. After that we use Bukhgeim's oscillating exponential solutions, Alessandrini's identity and stationary phase to get information about the difference of the potentials from the difference of the Cauchy data. The stability estimate will be of logarithmic type, but works with potentials of low regularity.
Sylvester and Uhlmann solved the problem in dimensions @math at least three for smooth conductivities bounded away from zero @cite_16 . They constructed solutions!complex geometric optics|textbf , that is, solutions of the form where the complex vectors @math satisfy where @math are perpendicular vectors satisfying @math . Using a well-known orthogonality relation for the potentials @math and @math , called the Alessandrini identity @cite_9 Alessandrini's identity , they got and after taking @math they saw that the Fourier transforms of @math and @math are the same, so the potentials are so too. Note that the only part that requires @math in this solution is the existence of the three vectors @math .
@cite_9 @cite_16
2498247430 2537174396 1659004305 1971773339
We extend the De Giorgi--Nash--Moser theory to a class of kinetic Fokker-Planck equations and deduce new results on the Landau-Coulomb equation. More precisely, we first study the H o lder regularity and establish a Harnack inequality for solutions to a general linear equation of Fokker-Planck type whose coefficients are merely measurable and essentially bounded, i.e. assuming no regularity on the coefficients in order to later derive results for non-linear problems. This general equation has the formal structure of the hypoelliptic equations "of type II" , sometimes also called ultraparabolic equations of Kolmogorov type, but with rough coefficients: it combines a first-order skew-symmetric operator with a second-order elliptic operator involving derivatives along only part of the coordinates and with rough coefficients. These general results are then applied to the non-negative essentially bounded weak solutions of the Landau equation with inverse-power law @math @math [--d, 1] whose mass, energy and entropy density are bounded and mass is bounded away from 0, and we deduce the H o lder regularity of these solutions. This paper considers recovering @math -dimensional vectors @math , and @math from their circular convolutions @math . The vector @math is assumed to be @math -sparse in a known basis that is spread out in the Fourier domain, and each input @math is a member of a known @math -dimensional random subspace. We prove that whenever @math , the problem can be solved effectively by using only the nuclear-norm minimization as the convex relaxation, as long as the inputs are sufficiently diverse and obey @math . By “diverse inputs,” we mean that the @math ’s belong to different, generic subspaces. To the best of our knowledge, this is the first theoretical result on blind deconvolution where the subspace to which @math belongs is not fixed but needs to be determined. We discuss the result in the context of multipath channel estimation in wireless communications. Both the fading coefficients and the delays in the channel impulse response @math are unknown. The encoder codes the @math -dimensional message vectors randomly and then transmits coded messages @math ’s over a fixed channel one after the other. The decoder then discovers all of the messages and the channel response when the number of samples taken for each received message are roughly greater than @math , and the number of messages is roughly at least @math . The equation dealt with in this paper is in three dimensions. It comes from minimizing the functional which, in turn, comes from an approximation to the Hartree-Fock theory of a plasma. It describes an electron trapped in its own hole. The interesting mathematical aspect of the problem is that & is not convex, and usual methods to show existence and uniqueness of the minimum do not apply. By using symmetric decreasing rearrangement inequalities we are able to prove existence and uniqueness (modulo translations) of a minimizing Φ. To prove uniqueness a strict form of the inequality, which we believe is new, is employed. Consider a network of @math n processes, where each process inputs a @math d-dimensional vector of reals. All processes can communicate directly with others via reliable FIFO channels. We discuss two problems. The multidimensional Byzantine consensus problem, for synchronous systems, requires processes to decide on a single @math d-dimensional vector @math v?Rd, inside the convex hull of @math d-dimensional vectors that were input by the non-faulty processes. Also, the multidimensional Byzantine approximate agreement (MBAA) problem, for asynchronous systems, requires processes to decide on multiple @math d-dimensional vectors in @math Rd, all within a fixed Euclidean distance @math ∈ of each other, and inside the convex hull of @math d-dimensional vectors that were input by the non-faulty processes. We obtain the following results for the problems above, while tolerating up to @math f Byzantine failures in systems with complete communication graphs: (1) In synchronous systems, @math n>max 3f,(d+1)f is necessary and sufficient to solve the multidimensional consensus problem. (2) In asynchronous systems, @math n>(d+2)f is necessary and sufficient to solve the multidimensional approximate agreement problem. Our sufficiency proofs are constructive, giving explicit protocols for the problems. In particular, for the MBAA problem, we give two protocols with strictly different properties and applications.