Using Fourier analysis, we prove that the limiting distribution of the standardized random number of comparisons used by Quicksort to sort an array of n numbers has an everywhere positive and infinitely differentiable density f , and that each derivative f (k) enjoys superpolynomial decay at ±∞. In particular, each f (k) is bounded. Our method is sufficiently computational to prove, for example...

X (F ωM ) , 2 we have the following: (1) (Apriori estimate) Suppose u is a weak solution in PSHF∗ωM (X) ∩ L(X) of the equation with the normalization supX u = 0, then there is a constant C such that ‖u‖L∞ ≤ C‖f‖Lp where C only depend on F , ω and p; (2) There would always be a bounded solution for this equation; (3) If F is locally birational, then any bounded solution is actually the unique co...

Let Ω ⊂ 2 be a bounded Lipschitz domain and let F : Ω× 2×2 + −→ be a Carathèodory integrand such that F (x, ·) is polyconvex for L2-a.e. x ∈ Ω. Moreover assume that F is bounded from below and satisfies the condition F (x, ξ) ↘ ∞ as det ξ ↘ 0 for L2-a.e. x ∈ Ω. The paper describes the effect of domain topology on the existence and multiplicity of strong local minimizers of the functional [u] := ∫

B. Preliminaries B.1. Functions of Bounded Variation. We begin by discussing the concept of bounded variation. This concept will be used to formulate our assumptions on the distribution function F in the subsection immediately following this one, namely Section B.2. More importantly, it plays an essential role in our proof of sufficiency in a much later section, namely Section P. The simplest d...

We show that if U is a bounded open set in a complete CAT(0) spaceX , and if f : U → X is nonexpansive, then f always has a fixed point if there exists p ∈U such that x / ∈ [p, f (x)) for all x ∈ ∂U . It is also shown that if K is a geodesically bounded closed convex subset of a complete R-tree with int(K) = ∅, and if f : K → X is a continuous mapping for which x / ∈ [p, f (x)) for some p ∈ int...

For any class C of computable total functions satisfying some mild conditions, we prove that the following decision problems are complete for level Σ2 of the arithmetical hierarchy: (A) Deciding whether a term rewriting system (TRS for short) has runtime complexity bounded by a function in C. (B) Deciding whether a TRS has derivational complexity bounded by a function in C. In particular, the p...

A class G of graphs is said to be χ-bounded if there is a function f : N → R such that for all G ∈ G and all induced subgraphs H of G, χ(H) ≤ f(ω(H)). In this paper, we show that if G is a χ-bounded class, then so is the closure of G under any one of the following three operations: substitution, gluing along a clique, and gluing along a bounded number of vertices. Furthermore, if G is χ-bounded...

Let X ,Z be a pair of real linear spaces put in duality by a separating bilinear form 〈, 〉, and endowed with compatible locally convex topologies respectively. A subset F of X is said to be p-bounded if sup p(x) : x ∈ F < ∞. We denote the collection of all nonempty p-bounded subsets of X by p(X ). Given x ∈ X , F ∈ p(X ), and V ⊆ X , write rp(F ; x) = sup p(y − x) : y ∈ F , radp(F ;V ) = inf rp...

We prove an extension theorem for a small perturbation of the Ornstein-Uhlenbeck operator (L,D(L)) in the space of all uniformly continuous and bounded functions f : H → R, where H is a separable Hilbert space. We consider a perturbation of the form N0φ = Lφ + 〈Dφ,F 〉 where F : H → H is bounded and Fréchet differentiable with uniformly continuous and bounded differential. Hence, we prove that N...

Let X be a complex Banach space, be bounded functions, and suppose that the singular points of the Laplace transforms of T and f do not coincide. Under various supplementary assumptions, we show that the convolution T f is bounded. When T(t) = I, this is a classical result of Ingham. Our results are applied to mild solutions of inhomogeneous Cauchy problems on R + : u 0 (t) = Au(t) + f(t) (t 0)...