On error estimates of some higher order projection and penalty-projection methods for Navier-Stokes equations

Summary This paper is a continuation of our previous work [10] on projection methods. We study first existing higher order projection schemes in the semidiscretized form for the Navier-Stokes equations. One error analysis suggests that the precision of these schemes is most likely plagued by the inconsistent Neumann boundary condition satisfied by the pressure approximations. We then propose a penalty-projection scheme for which we obtain improved error estimates.This work is partially supported by NSF grant MS-8802596.     

Evaluating the Frechet derivative of the matrix exponential

LetM _n denote the space ofn×n matrices. GivenX, ZM _n define

Oscillations of certain second order nonlinear differential equations

A second order nonlinear differential equation

Sur un théorème de Choquet

Résumé Le but de ce travail est de caractériser les éspaces topologiques qui possèdent la propriété suivant: pour toute famille(f _t ) _{t I} de fonctions numériques définies dansX il existe une partie dénombrableI ₀ de l'ensemble d'indicesI telle que les fonctions inf _tI f _i et inf _tI0 f _i ont la meme régularisation inférieurement semi-continue.On démontre que l'espace topologiqueX possède cette propriété si et seulement si pour tout sous-ensembleA deX il existe une sous-ensemble dénombrableA ₀,A ₀ A tel queA ₀.On généralise un résultat topologique de G. Choquet.

---

     

Functional inequality characterizing nonnegative concave functions in (0, ∞) k

Summary In the present note we prove that every functionf: (0, ) [0, ) satisfying the inequalityaf(s) + bf(t) f(as + bt), s, t > 0, for somea andb such that 0 <a < 1 <a + b must be of the formf(t) = f(1)t, (t > 0). This improves our recent result in [2], where the inequality is assumed to hold for alls, t 0, and gives a positive answer to the question raised there.An analogue for functions of several real variables of the above result characterizes concave functions. Conjugate functions and some relations to Hölder's and Minkowski's inequalities are mentioned.     

On computing the number of subgroups of a finite Abelian group

We consider the numberN _A (r) of subgroups of orderp ^r ofA, whereA is a finite Abelianp-group of type =₁,₂,..., _l ()), i.e. the direct sum of cyclic groups of order ⁱⁱ. Formulas for computingN _A (r) are well known. Here we derive a recurrence relation forN _A (r), which enables us to prove a conjecture of P. E. Dyubyuk about congruences betweenN _A (r) and the Gaussian binomial coefficient .     

Extending partial isomorphisms of graphs

Theorem Let X be a finite graph. Then there exists a finite graph Z containing X as an induced subgraphs, such that every isomorphism between induced subgraphs of X extends to an automorphism of Z.The graphZ may be required to be edge-transitive. The result implies that for anyn, there exists a notion of a genericn-tuple of automorphism of the Rado graphR (the random countable graph): for almost all automorphism ₁,..., _n and ₁ ofR (in the sense of Baire category), (R,₁,..., _n ), (R,₁,..., _n ). The problem arose in a recent paper of Hodges, Hodgkinson, Lascar and Shelah, where the theorem is used to prove the small index property forR.Work supported by a Sloan Fellowship and by NSF grant DMS-8903378.     

The number of edges of many faces in a line segment arrangement

We show that the maximum number of edges boundingm faces in an arrangement ofn line segments in the plane isO(m ^2/3 n ^2/3+n(n)+nlogm). This improves a previous upper bound of Edelsbrunner et al. [5] and almost matches the best known lower bound which is (m ^2/3 n ^2/3+n(n)). In addition, we show that the number of edges bounding anym faces in an arrangement ofn line segments with a total oft intersecting pairs isO(m ^2/3 t ^1/3+n(t/n)+nmin{logm,logt/n}), almost matching the lower bound of (m ^2/3 t ^1/3+n(t/n)) demonstrated in this paper.Work on this paper by the first and fourth authors has been partially supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grants DCR-83-20085 and CCR-89-01484. Work by the first author has also been supported by an AT&T Bell Laboratories Ph.D. scholarship at New York University and by DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center (NSF-STC88-09648). Work by the second author has been supported by NSF under Grants CCR-87-14565 and CCR-89-21421. Work by the fourth author has additionally been supported by grants from the U.S.-Israeli Binational Science Foundation, the NCRD (the Israeli National Council for Research and Development) and the Fund for Basic Research in Electronics, Computers and Communication, administered by the Israeli National Academy of Sciences.     

Comparison of location models for stochastic processes

Summary Let (Q) be the statistical experiment based on the observation of an unknown function in the presence of an additive noise process with distributionQ. The (possible) loss of information whenQ is replaced by some other noise distributionP is measured by the deficiency of (P) relative to (Q). This deficiency and its relation to the variational distance ofP andQ are studied mainly for Gaussian noise processes. Gaussian diffusion processes and special set-indexed processes are treated in detail.Research supported by a Heisenberg grant of the Deutsche Forschungsgemeinschaft     

Black holes on the plane drawn by a Wiener process

Summary We say that the discD()R ², of radius , located around the origin isp-covered in timeT by a Wiener processW(·) if for anyzD() there exists a 0tT such thatW(t) is a point of the disc of radiusp, located aroundz. The supremum of those 's (0) is studied for which,D() isp-covered inT.