Convergence analysis and error estimates for a parallel algorithm for solving the Navier-Stokes equations

Summary. This paper is concerned with the analysis of the convergence and the derivation of error estimates for a parallel algorithm which is used to solve the incompressible Navier-Stokes equations. As usual, the main idea is to split the main differential operator; this allows to consider independently the two main difficulties, namely nonlinearity and incompressibility. The results justify the observed accuracy of related numerical results. Received April 20, 2001 / Revised version received May 21, 2001 / Published online March 8, 2002 RID="*" ID="*" Partially supported by D.G.E.S. (Spain), Proyecto PB98–1134 RID="**" ID="**" Partially supported by D.G.E.S. (Spain), Proyecto PB96–0986 RID="**" ID="**" Partially supported by D.G.E.S. (Spain), Proyecto PB96–0986 RID="*" ID="*" Partially supported by D.G.E.S. (Spain), Proyecto PB98–1134 RID="**" ID="**" Partially supported by D.G.E.S. (Spain), Proyecto PB96–0986 RID="**" ID="**" Partially supported by D.G.E.S. (Spain) Proyecto PB96–0986     

Regularity and the Br?ndsted–Rockafellar Properties of Maximal Monotone Operators

The purpose of this paper is to establish connections between the class of maximal monotone operators of Br?ndsted–Rockafellar type and that of regular maximal monotone operators. ^†Partially supported by a WISE grant.     

The Length Spectrum of a Compact Constant Curvature Complex is Discrete

In this short note we prove that the length spectrum of a compact constant curvature complex is discrete. After recalling the relevant definitions and reducing to a relatively simple situation, the result follows easily from a foundational result about real semi-algebraic sets and the Morse–Sard theorem. We conclude with a conjecture which remains open, a few remarks and an easy application.Partially supported by NSF grant no. DMS-0123344 (N. Brady).Partially supported by NSF grant no. DMS-0101506 (J. McCammond)     

Polynomial representations of the orthogonal groups

This paper is concerned with realizations of the irreducible representations of the orthogonal group and construction of specific bases for the representation spaces. As is well known, Weyl's branching theorem for the orthogonal group provides a labeling for such bases, called Gelfand-Žetlin labels. However, it is a difficult problem to realize these representations in a way that gives explicit orthogonal bases indexed by these Gelfand-–etlin labels. Thus, in this paper the irreducible representations of the orthogonal group are realized in spaces of polynomial functions over the general linear groups and equipped with an invariant differentiation inner product, and the Gelfand-Žetlin bases in these spaces are constructed explicitly. The algorithm for computing these polynomial bases is illustrated by a number of examples. Partially supported by a grant from the Department of Energy. Partially supported by NSF grant No. MCS81-02345.     

Standard position for objects in hyperbolic space

It is shown that, by applying hyperbolic isometries, one may arrangen points in hyperbolic (n–1)-space in a certain standard position. Similar results are developed for complex hyperbolic space, as well as hyperbolic spaces defined over nearly arbitrary fields. The algebraic basis of the paper is the determination of the structure of a double coset space which occurs in representation theory.Partially supported by NSA grant # MDA-904-96-0018.Partially supported by NSA grant # MDA904-95-1-1089.     

The rate of convergence for spectra of GUE and LUE matrix ensembles

We obtain optimal bounds of order O(n ⁻¹) for the rate of convergence to the semicircle law and to the Marchenko-Pastur law for the expected spectral distribution functions of random matrices from the GUE and LUE, respectively. Research supported by the DFG-Forschergruppe FOR 399/1. Partially supported by INTAS grant N 03-51-5018, by RFBR grant N 02-01-00233, and by RFBR-DFG grant N 04-01-04000.     

The Maximal Graded Left Quotient Algebra of a Graded Algebra1)

We construct the maximal graded left quotient algebra of every graded algebra A without homogeneous total right zero divisors as the direct limit of graded homomorphisms （of left A-modules） from graded dense left ideals of A into a graded left quotient algebra of A. In the case of a superalgebra, and with some extra hypothesis, we prove that the component in the neutral element of the group of the maximal graded left quotient algebra coincides with the maximal left quotient algebra of the component in the neutral element of the group of the superalgebra.     

Statistics on wreath products and generalized binomial-stirling numbers

Various statistics on wreath products are defined via canonical words, “colored” right to left minima and “colored” descents. It is shown that refined counts with respect to these statistics have nice recurrence formulas of binomial-Stirling type. These extended Stirling numbers determine (via matrix inversion) dual systems, which are also shown to have combinatorial realizations within the wreath product. The above setting also gives rise to a MacMahon-type equi-distribution theorem over subsets with prescribed statistics. Partially supported by Minerva Grant No. 8441 and by EC's IHRP Programme, within the Research Training Network “Algebraic Combinatorics in Europe”, grant HPRN-CT-2001-00272. Partially supported by EC's IHRP Programme, within the Research Training Network “Algebraic Combinatorics in Europe”, grant HPRN-CT-2001-00272.     

Uniformity of stably integral points on principally polarized abelian varieties of dimension ≤2

The purpose of this paper is to prove, assuming that the conjecture of Lang and Vojta holds true, that there is a uniform bound on the number of stably integral points in the complement of the theta divisor on a principally polarized abelian surface defined over a number field. Most of our argument works in arbitrary dimension and the restriction on the dimension ≤2 is used only at the last step, where we apply Pacelli’s stronger uniformity results for elliptic curves. Partially supported by NSF grant DMS-9700520 and by an Alfred P. Sloan research fellowship. Partially supported by NSA grant MDA904-96-1-0008.     

A simple proof of the stability criterion of Gray and Griffeath

Summary Gray and Griffeath studied attractive nearest neighbor spin systems on the integers having “all 0's” and “all 1's” as traps. Using the contour method, they established a necessary and sufficient condition for the stability of the “all 1's” equilibrium under small perturbations. In this paper we use a renormalized site construction to give a much simpler proof. Our new approach can be used in many situations as a substitute for the contour method. Partially supported by a grant from the National Science Foundation Partially supported by the Army Research Office through the Mathematical Sciences Institute at Cornell University