Large deviations for the invariant measure of a reaction-diffusion equation with non-Gaussian perturbations

Summary In this paper we establish a large deviations principle for the invariant measure of the non-Gaussian stochastic partial differential equation (SPDE) _t v =v +f(x,v )+(x,v ) . Here is a strongly-elliptic second-order operator with constant coefficients, h:=DH _xx-h, and the space variablex takes values on the unit circleS ¹. The functionsf and are of sufficient regularity to ensure existence and uniqueness of a solution of the stochastic PDE, and in particular we require that 0<mM wherem andM are some finite positive constants. The perturbationW is a Brownian sheet. It is well-known that under some simple assumptions, the solutionv ² is aC ^k (S ¹)-valued Markov process for each 0<1/2, whereC (S ¹) is the Banach space of real-valued continuous functions onS ¹ which are Hölder-continuous of exponent . We prove, under some further natural assumptions onf and which imply that the zero element ofC (S ¹) is a globally exponentially stable critical point of the unperturbed equation _t ⁰ = ⁰ +f(x,⁰), that has a unique stationary distributionv ^K, on (C (S ¹), (C ^K (S ¹))) when the perturbation parameter is small enough. Some further calculations show that as tends to zero,v ^K, tends tov ^K,0, the point mass centered on the zero element ofC (S ¹). The main goal of this paper is to show that in factv ^K, is governed by a large deviations principle (LDP). Our starting point in establishing the LDP forv ^K, is the LDP for the process , which has been shown in an earlier paper. Our methods of deriving the LDP forv ^K, based on the LDP for are slightly non-standard compared to the corresponding proofs for finite-dimensional stochastic differential equations, since the state spaceC (S ¹) is inherently infinite-dimensional.This work was performed while the author was with the Department of Mathematics, University of Maryland, College Park, MD 20742, USA     

On covering designs with block size 5 and index 5

LetV be a finite set of order . A (, , ) covering design of index and block size is a collection of -element subsets, called blocks, such that every 2-subset ofV occurs in at least blocks. The covering problem is to determine the minimum number of blocks, (, , ), in a covering design. It is well known that , where [x] is the smallest integer satisfyingx[X]. It is shown here that (, 5, 5)=(, 5, 5) for all positive integers 5 with the possible exception of =24, 28, 56, 104, 124, 144, 164, 184.     

A finitely based theory of a non-trivial language,with exactly ℵ0 subcovers

LetL=f, g be the language with two unary operation symbols. I prove that the finitely based equational theory =[f₀=₀] ofL covers exactly ₀ others.Presented by S. Burris.Dedicated to George McNulty, my mentor in equational logic.     

On term by term dyadic differentiability of Walsh series

. . . . : {ja _j },j=1,2,... — , f(x) , , f ^[1](x) — f .     

Local controllability of observables in finite and infinite dimensional nonlinear control systems

LetA, be evolution operators (possibly nonlinear) which act within a Banach spaceB andu(·) a measurable, real valued, control function. We study control systems of the form _t /t=A _t +u(t) _t , ₀= B. An observation of this system is defined to be a continuous linear mapg:B ^k . Our main result gives a computable sufficient condition to assure that fort > 0 and sufficiently small, the observation of the reference solution (which corresponds tou(t)0) at timet is interior to the set of observations of all solutions at timet. An example to illustrate the theory is the local controllability, via tension, of various observations of a vibrating string.This research was supported by NSF Grant MCS 76-04419 A01.     

Blocking Sets in (υ,{2, 4}, 1)-Designs

The existence of blocking sets in (, {2, 4}, 1)-designs is examined. We show that for 0, 3, 5, 6, 7, 8, 9, 11 (mod 12>), blocking sets cannot exist. We prove that for each 1, 2, 4 (mod 12) there is a (, {2, 4}, 1)-design with a blocking set with three possible exceptions. The case 10 (mod 12) is still open; we consider the first four values of in this situation.     

Subsets with Restricted Movement

Let G be a finite permutation group on a set with no fixed points in and let m and k be integers with 0 < m < k. For a finite subset of the movement of is defined as move() = max_gG| ^g \ |. Suppose further that G is not a 2-group and that p is the least odd prime dividing |G| and move() m for all k-element subsets of . Then either || k + m or k (7m – 5) / 2, || (9m – 3)/2. Moreover when || > k + m, then move() m for every subset of .     

Total flux estimates for a finite element approximation of the Dirichlet problem using the boundary penalty method

Summary This paper considers a fully practical piecewise linear finite element approximation of the Dirichlet problem for a second order self-adjoint elliptic equation,Au=f, in a smooth region< ⁿ (n=2 or 3) by the boundary penalty method. Using an unfitted mesh; that is ^h , an approximation of with dist (, ^h )Ch ² is not in general a union of elements; and assuminguH ⁴ () we show that one can recover the total flux across a segment of the boundary of with an error ofO(h ²⁾. We use these results to study a fully practical piecewise linear finite element approximation of an elliptic equation by the boundary penalty method when the prescribed data on part of the boundary is the total flux.Supported by a SERC research studentship     

On the uniform (C, 1)-summability of Fourier series and integrability of series with respect to multiplicative orthonormal systems

H (G), f(g)H (G) , (, 1)- OHMC G. , OHMC, A. H. . , . , OHMC, lim supp _n=, , ,n .. . , 117 234 . . -      

The quickest flow problem

Consider a network =(G, c, ) whereG=(N, A) is a directed graph andc _ij and _ij , respectively, denote the capacity and the transmission time of arc (i, j) A. The quickest flow problem is then to determine for a given value the minimum numberT() of time units that are necessary to transmit (send) units of flow in from a given sources to a given sinks.In this paper we show that the quickest flow problem is closely related to the maximum dynamic flow problem and to linear fractional programming problems. Based on these relationships we develop several polynomial algorithms and a strongly polynomial algorithm for the quickest flow problem.Finally we report computational results on the practical behaviour of our metholds. It turns out that some of them are practically very efficient and well-suited for solving large problem instances.Partial financial support by the Air Force Office of Scientific Research under grants AFOSR-89-0512 and AFOSR-90-0008 is gratefully acknowledged by the first author.     

Абсолютная сходимос ть рядов Фурье—Хаара от суперпозиций функци й

A necessary and sufficient condition is found for the function to ensure absolute convergence of the Haar—Fourier series of all functions(f) provided that the Haar—Fourier series off converges absolutely. Absolute convergence means absolute convergence of the series of coefficients, and the condition is that should be in Lip 1.

---

—

     

An infinite dimensional analogue of the Albeverio-Röckner's theorem on Fukushima's conjecture

LetX be the solution of the SDE:dX _t = (X _t)dB _t +b(X _t)dt, with andb C _b (R) such that >0 for some constant , andB a real Brownian motion. Let be the law ofX onE=C([0, 1],R) andk E* – {0}, whereE* is the topological dual space ofE. Consider the classical form: _k (u, v)=u / kv / kd, whereu andv are smooth functions onE. We prove that, if _k is closable for anyk in a dense subset ofE* and if the smooth functions are contained in the domain of the generator of the closure of _k , must be a constant function.     

The odd ordér analogue of Dempwolff's B-group problem

Let be a translation plane of odd order p^2R for p a prime. Let admit at least two p-groups, B_i, i=1, 2, B₁B₂ of orders > p^R/2 which fix Baer subplanes _i, i = 1,2, ₁₂ pointwise. It is shown that under these assumptions must be a Hall plane.     

Nicht endlich erzeugte Primideale in Steinschen Algebren

In this note we exhibit a closed prime idealF in the ring Ó(³) of all holomorphic functions on ³ which is not finitely generated.F is the ideal of a certain irreducible curve Y³, obtained as the image of a proper holomorphic map f³.

---

---

Herrn Karl Stein gewidmet     

An evolution problem for plastic antiplanar shear

We study the parabolic problemu/t=div_{x p}() in the function space L²(0, T; BV()). Here is the linear growth functional arising from the study of plastic antiplanar shear deformations.     

Some Ramsey-Turán type results for hypergraphs

To everyk-graphG let(G) be the minimal real number such that for every>0 andn>n ₀(,G) everyk-graphH withn vertices and more than (+) ( ) edges contains a copy ofG. The real number (G) is defined in the same way adding the constraint that all independent sets of vertices inH have sizeo(n). Answering a problem of Erds and Sós it is shown that there exist infinitely manyk-graphs with 0<(G)<(G) for everyk3. It is worth noting that we were unable to find a singleG with the above property.This paper was written while the authors were visiting AT&T Bell Laboratories, Murray Hill, NJ 07974.     

On some problems of interpolation by ℒ-splines

_n (D) — ,s — _n (D), _v (v=1, 2, ...,s/2) — . _m={0x ₀<x ₁<...<x _2m–1<2,x _2m =x ₀+2} , x _j +1–x _j <(4s max _v )^–1,j=0, 1, ..., 2m –1, ( ) 2- - _n,m 2m , _m . , L _q - (1q) W ( _n )={f ₂ :f ^(n–1)AC ₂ , _n (D)f 1} 2- - (s _n f), _m . , - - _n,m .

---

---

The author expresses his gratitude to Yu. N. Subbotin for a useful discussion on the results of this paper.     

Signed Total Domination Nnumber of a Graph

The signed total domination number of a graph is a certain variant of the domination number. If is a vertex of a graph G, then N() is its oper neighbourhood, i.e. the set of all vertices adjacent to in G. A mapping f: V(G)-1, 1, where V(G) is the vertex set of G, is called a signed total dominating function (STDF) on G, if for each V(G). The minimum of values , taken over all STDF's of G, is called the signed total domination number of G and denoted by _st(G). A theorem stating lower bounds for _st(G) is stated for the case of regular graphs. The values of this number are found for complete graphs, circuits, complete bipartite graphs and graphs on n-side prisms. At the end it is proved that _st(G) is not bounded from below in general.     

Representations of tensor product l.m.c.*-algebras

If E is a l.m.c.*-algebra with a b.a.i., (E), (E) denote the enveloping algebra and the space of representations of E respectively, while (E) stands for the non-zero extreme points of the continuous positive linear forms on E. Thus, for suitable l.m.c.*-algebras E, F and an admissible topology on E F, (E F) is given by the completed-tensor product of (E), (F) (where is the projective tensorial l.m.c.C*-topology), while (E F) by the cartesian product of (E), (F). An analogous decomposition of (E F) is not valid in general.This paper is partly based on the author's Ph.D. Thesis (Univ. of Athens)     

Factorization of a selfadjoint nonanalytic operator function II. Single spectral zone

We consider a selfadjoint and smooth enough operator-valued functionL() on the segment [a, b]. LetL(a)0,L(b)0, and there exist two positive numbers and such that the inequality |(L()f, f)|< ([a, b] f=1) implies the inequality (L'()f, f)>. Then the functionL() admits a factorizationL()=M()(I-Z) whereM() is a continuous and invertible on [a, b] operator-valued function, and operatorZ is similar to a selfadjoint one. This result was obtained in the first part of the present paper [10] under a stronge conditionL()0 ( [a,b]). For analytic functionL() the result of this paper was obtained in [13].