Correlation structure of intermittency in the parabolic Anderson model

Consider the Cauchy problem ∂u(x, t)/∂t = ℋu(x, t) (x∈ℤ^d, t≥ 0) with initial condition u(x, 0) ≡ 1 and with ℋ the Anderson Hamiltonian ℋ = κΔ + ξ. Here Δ is the discrete Laplacian, κ∈ (0, ∞) is a diffusion constant, and ξ = {ξ(x): x∈ℤ ^d } is an i.i.d.random field taking values in ℝ. G?rtner and Molchanov (1990) have shown that if the law of ξ(0) is nondegenerate, then the solution u is asymptotically intermittent. In the present paper we study the structure of the intermittent peaks for the special case where the law of ξ(0) is (in the vicinity of) the double exponential Prob(ξ(0) > s) = exp[−e ^{s /θ}] (s∈ℝ). Here θ∈ (0, ∞) is a parameter that can be thought of as measuring the degree of disorder in the ξ-field. Our main result is that, for fixed x, y∈ℤ ^d and t→∈, the correlation coefficient of u(x, t) and u(y, t) converges to ∥w _ρ∥⁻² _ℓ2Σ_{z ∈ℤd} w _ρ(x+z)w _ρ(y+z). In this expression, ρ = θ/κ while w _ρ:ℤ^d→ℝ⁺ is given by w _ρ = (v _ρ)^{⊗ d} with v _ρ: ℤ→ℝ⁺ the unique centered ground state (i.e., the solution in ℓ²(ℤ) with minimal l ²-norm) of the 1-dimensional nonlinear equation Δv + 2ρv log v = 0. The uniqueness of the ground state is actually proved only for large ρ, but is conjectured to hold for any ρ∈ (0, ∞). empty It turns out that if the right tail of the law of ξ(0) is thicker (or thinner) than the double exponential, then the correlation coefficient of u(x, t) and u(y, t) converges to δ _{x, y} (resp.the constant function 1). Thus, the double exponential family is the critical class exhibiting a nondegenerate correlation structure. Received: 5 March 1997 / Revised version: 21 September 1998     

How many cyclic subpolytopes can a non-cyclic polytope have?

Acyclic d-polytope is ad-polytope that is combinatorially equivalent to a polytope whose vertices lie on the moment curve {(t, t ², …,t ^d):t∈R}. Every subpolytope of an even-dimensional cyclic polytope is again cyclic. We show that a polytope [or neighborly polytope] withv vertices that is not cyclic has at mostd+1 [respectivelyd]d-dimensional cyclic subpolytopes withv−1 vertices, providedd is even andv≧d+5.     

Realizability of the <Emphasis Type="Italic">H</Emphasis><Subscript><Emphasis Type="Italic">k</Emphasis></Subscript>-distance functions by homology classes of path spaces

In previous papers, we have constructed and studied mappings d _k : M × M → ℝ called the H _k -distance functions. The main result of this paper is a theorem on realizability of the generalized distances d _k (υ, w), υ, w ∈ M, by critical values of the length functional L: Ω(M, υ, w) → ℝ generated by nontrivial homology classes of the space Ω(M, υ, w) of paths joining the points υ and w.     

Absolute continuities of exit measures for superdiffusions

Suppose X= X_t, X_T, P_μis a superdiffusion in ℝ^d with general branching mechanism ψ and general branching rate functionA. We discuss conditions onA to guarantee that the exit measure X_TL of the superdiffusionX from bounded smooth domains in ℝ^d have absolutely continuous states.     

Computation of betti numbers of monomial ideals associated with stacked polytopes

LetP(v, d) be a stackedd-polytope withv vertices, δ(P(v, d)) the boundary complex ofP(v, d), andk[Δ(P(v, d))] =A/I _Δ(P(v,d)) the Stanley-Reisner ring of Δ(P(v,d)) over a fieldk. We compute the Betti numbers which appear in a minimal free resolution ofk[Δ(P(v,d))] overA, and show that every Betti number depends only onv andd and is independent of the base fieldk. We also show that the Betti number sequences above are unimodal.     

On the Bethe-Sommerfeld conjecture for higher-order elliptic operators

 We consider the elliptic operator P(D)+V in ℝ ^d , d≥2 where P(D) is a constant coefficient elliptic pseudo-differential operator of order 2ℓ with a homogeneous convex symbol P(ξ), and V is a real periodic function in L ^∞(ℝ ^d ). We show that the number of gaps in the spectrum of P(D)+V is finite if 4ℓ>d+1. If in addition, V is smooth and the convex hypersurface {ξℝ ^d :P(ξ)=1} has positive Gaussian curvature everywhere, then the number of gaps in the spectrum of P(D)+V is finite, provided 8ℓ>d+3 and 9≥d≥2, or 4ℓ>d−3 and d≥10. Received: 10 October 2001 / Published online: 28 March 2003 Mathematics Subject Classification (1991): 35J10 Research supported in part by NSF Grant DMS-9732894.     

Hausdorff measures of different dimensions are not Borel isomorphic

We show that Hausdorff measures of different dimensions are not Borel isomorphic; that is, the measure spaces (ℝ, B, H ^s ) and (ℝ, B, H ^t ) are not isomorphic if s ≠ t, s, t ∈ [0, 1], where B is the σ-algebra of Borel subsets of ℝ and H ^d is the d-dimensional Hausdorff measure. This answers a question of B. Weiss and D. Preiss. To prove our result, we apply a random construction and show that for every Borel function ƒ: ℝ → ℝ and for every d ∈ [0, 1] there exists a compact set C of Hausdorff dimension d such that ƒ(C) has Hausdorff dimension ≤ d. We also prove this statement in a more general form: If A ⊂ ℝⁿ is Borel and ƒ: A → ℝ^m is Borel measurable, then for every d ∈ [0, 1] there exists a Borel set B ⊂ A such that dim B = d·dim A and dim ƒ(B) ≤ d·dim ƒ (A). Partially supported by the Hungarian Scientific Research Fund grant no. T 49786.     

Uniqueness of weak solutions of the Navier-Stokes equations

Consider the Navier-Stokes equation with the initial data a ∈ L _σ ²(ℝ ^d ). Let u and v be two weak solutions with the same initial value a. If u satisfies the usual energy inequality and if ∇v ∈ L ²((0, T); (ℝ ^d ) ^d ) where (ℝ ^d ) is the multiplier space, then we have u = v.     

On the completeness of algebraic polynomials in the spaces <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>(ℝ, <Emphasis Type="Italic">d</Emphasis>μ)

We prove that the theorem on the incompleteness of polynomials in the space C ₀ ^w established by de Branges in 1959 is not true for the space L _p (ℝ, dμ) if the support of the measure μ is sufficiently dense.     

A decomposition of the beta distribution,related order and asymptotic behavior

Let β _{v, w} be any beta variate with p.d.f.(Γ(v+w)/Γ(v)Γ(w))x ^v−1(1−x) ^w−1 and letU _{v, w} =-log β _{v, w} . ThenU _v,w =U ^CM +U ^PF , whereU ^CM andU ^PF are independent with completely monotone andPF _∞ densities, respectively. It is shown thatU _{v, w} is infinitely divisible and β _{v, w} correspondingly infinitely factorable. The asymptotic behavior ofU _{v, w} and β _{v, w} for largev, w is described. For different modes of increase ofv andw,U _{v, w} is asymptotically normal, gamma or extreme value distributed. The decomposition is employed to provide an algorithm for generating random β _{v, w} distributed numbers. Many of the results are based on insights provided by the classical theory of the Gamma function in the complex plane. This work was supported in part by the United States Air Force, Office of Scientific Research, under grant No. AFOSR-79-0043.     

On Radial and Conical Fourier Multipliers

We investigate connections between radial Fourier multipliers on ℝ ^d and certain conical Fourier multipliers on ℝ ^d+1. As an application we obtain a new weak type endpoint bound for the Bochner–Riesz multipliers associated with the light cone in ℝ ^d+1, where d≥4, and results on characterizations of L ^p →L ^p,ν inequalities for convolutions with radial kernels.     

S-polar sets of super-brownian motions and solutions of nonlinear differential equations

This paper gives probabilistic expressions of the minimal and maximal positive solutions of the partial differential equation -1/2△v(x) γ(x)v(x)α = 0 in D, where D is a regular domain in Rd(d ≥ 3) such that its complement Dc is compact, γ(x) is a positive bounded integrable function in D, and 1 < α≤ 2. As an application, some necessary and sufficient conditions for a compact set to be S-polar are presented.     

Non-Bicritical Critical Snarks

 Snarks are cubic graphs with chromatic index χ^′=4. A snark G is called critical if χ^′ (G−{v,w})=3 for any two adjacent vertices v and w, and it is called bicritical if χ^′ (G−{v,w})=3 for any two vertices v and w. We construct infinite families of critical snarks which are not bicritical. This solves a problem stated by Nedela and Škoviera. Revised: January 11, 1999     

A new sufficient condition for Hamiltonian graphs

The study of Hamiltonian graphs began with Dirac’s classic result in 1952. This was followed by that of Ore in 1960. In 1984 Fan generalized both these results with the following result: If G is a 2-connected graph of order n and max{d(u),d(v)}≥n/2 for each pair of vertices u and v with distance d(u,v)=2, then G is Hamiltonian. In 1991 Faudree–Gould–Jacobson–Lesnick proved that if G is a 2-connected graph and |N(u)∪N(v)|+δ(G)≥n for each pair of nonadjacent vertices u,v∈V(G), then G is Hamiltonian. This paper generalizes the above results when G is 3-connected. We show that if G is a 3-connected graph of order n and max{|N(x)∪N(y)|+d(u),|N(w)∪N(z)|+d(v)}≥n for every choice of vertices x,y,u,w,z,v such that d(x,y)=d(y,u)=d(w,z)=d(z,v)=d(u,v)=2 and where x,y and u are three distinct vertices and w,z and v are also three distinct vertices (and possibly |{x,y}∩{w,z}| is 1 or 2), then G is Hamiltonian.     

Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities

Bosse et al. conjectured that for every natural number d≥2 and every d-dimensional polytope P in ℝ ^d , there exist d polynomials p ₁(x),…,p _d (x) satisfying P={x∈ℝ ^d :p ₁(x)≥0,…,p _d (x)≥0}. We show that every three-dimensional polyhedron can be described by three polynomial inequalities, which confirms the conjecture for the case d=3 but also provides an analogous statement for the case of unbounded polyhedra. The proof of our result is constructive. Work supported by the German Research Foundation within the Research Unit 468 “Methods from Discrete Mathematics for the Synthesis and Control of Chemical Processes”.     

Path-closed sets

Given a digraphG = (V, E), call a node setT ⊆V path-closed ifv, v′ εT andw εV is on a path fromv tov′ impliesw εT. IfG is the comparability graph of a posetP, the path-closed sets ofG are the convex sets ofP. We characterize the convex hull of (the incidence vectors of) all path-closed sets ofG and its antiblocking polyhedron inR ^v , using lattice polyhedra, and give a minmax theorem on partitioning a given subset ofV into path-closed sets. We then derive good algorithms for the linear programs associated to the convex hull, solving the problem of finding a path-closed set of maximum weight sum, and prove another min-max result closely resembling Dilworth’s theorem.     

Approximating Euclidean distances by small degree graphs

Given an undirected edge-weighted graphG=(V,E), a subgraphG′=(V,E′) is at-spanner ofG if, for everyu, v∈V, the weighted distance betweenu andv inG′ is at mostt times the weighted distance betweenu andv inG. We consider the problem of approximating the distances among points of a Euclidean metric space: given a finite setV of points in ℝd, we want to construct a sparset-spanner of the complete weighted graph induced byV. The weight of an edge in these graphs is the Euclidean distance between the endpoints of the edge. We show by a simple greedy argument that, for anyt>1 and anyV ⊂ ℝd, at-spannerG ofV exists such thatG has degree bounded by a function ofd andt. The analysis of our bounded degree spanners improves over previously known upper bounds on the minimum number of edges of Euclideant-spanners, even compared with spanners of boundedaverage degree. Our results answer two open problems, one proposed by Vaidya and the other by Keil and Gutwin. The main result of the paper concerns the case of dimensiond=2. It is fairly easy to see that, for somet (t≥7.6),t-spanners of maximum degree 6 exist for any set of points in the Euclidean plane, but it was not known that degree 5 would suffice. We prove that for some (fixed)t, t-spanners of degree 5 exist for any set of points in the plane. We do not know if 5 is the best possible upper bound on the degree. This research was supported by Conselho Nacional de Desenvolvimento Cientifico e Tecnológico, Proc 203039/87.4 (Brazil).     

A Fan Type Condition For Heavy Cycles in Weighted Graphs

 A weighted graph is a graph in which each edge e is assigned a non-negative number w(e), called the weight of e. The weight of a cycle is the sum of the weights of its edges. The weighted degree d ^w (v) of a vertex v is the sum of the weights of the edges incident with v. In this paper, we prove the following result: Suppose G is a 2-connected weighted graph which satisfies the following conditions: 1. max{d ^w (x),d ^w (y)∣d(x,y)=2}≥c/2; 2. w(x z)=w(y z) for every vertex z∈N(x)∩N(y) with d(x,y)=2; 3. In every triangle T of G, either all edges of T have different weights or all edges of T have the same weight. Then G contains either a Hamilton cycle or a cycle of weight at least c. This generalizes a theorem of Fan on the existence of long cycles in unweighted graphs to weighted graphs. We also show we cannot omit Condition 2 or 3 in the above result. Received: February 7, 2000 Final version received: June 5, 2001     

The Existence and Uniqueness of the Solution for Neutral Stochastic Functional Differential Equations with Infinite Delay in Abstract Space

The main aim of this paper is to prove the existence and uniqueness of the solution for neutral stochastic functional differential equations with infinite delay, which the initial data belong to the phase space ℬ((−∞,0];ℝ ^d ). The vital work of this paper is to extend the initial function space of the paper (Wei and Wang, J. Math. Anal. Appl. 331:516–531, 2007) and give some examples to show that the phase space ℬ((−∞,0];ℝ ^d ) exists. In addition, this paper builds a Banach space ℳ²((−∞,T],ℝ ^d ) with a new norm in order to discuss the existence and uniqueness of the solution for such equations with infinite delay.     

Reciprocal polynomials with all zeros on the unit circle

Let f(x)=a _d x ^d +a _d−1 x ^d−1+⋅⋅⋅+a ₀∈ℝ[x] be a reciprocal polynomial of degree d. We prove that if the coefficient vector (a _d ,a _d−1,…,a ₀) or (a _d−1,a _d−2,…,a ₁) is close enough, in the l ¹-distance, to the constant vector (b,b,…,b)∈ℝ ^d+1 or ℝ ^d−1, then all of its zeros have moduli 1.