Attractors for 2D-Navier-Stokes models with delays

The existence of an attractor for a 2D-Navier-Stokes system with delay is proved. The theory of pullback attractors is successfully applied to obtain the results since the abstract functional framework considered turns out to be nonautonomous. However, on some occasions, the attractors may attract not only in the pullback sense but in the forward one as well. Also, this formulation allows to treat, in a unified way, terms containing various classes of delay features (constant, variable, distributed delays, etc.). As a consequence, some results for the autonomous model are deduced as particular cases of our general formulation.     

Expected Reflection Distance in G(r, 1, n) after a Fixed Number of Reflections

Extending to r > 1 a formula of the authors, we compute the expected reflection distance of a product of t random reflections in the complex reflection group G(r, 1, n). The result relies on an explicit decomposition of the reflection distance function into irreducible G(r, 1, n)-characters and on the eigenvalues of certain adjacency matrices.Received December 8, 2003     

The Witt ring of a Brauer–Severi variety

For a Brauer–Severi variety X over a field k of characteristic not two, every symmetric bilinear space over X up to Witt equivalence is defined over k. Received: 2 February 1998     

A direct independence proof of Buchholz's Hydra Game on finite labeled trees

We shall give a direct proof of the independence result of a Buchholz style-Hydra Game on labeled finite trees. We shall show that Takeuti-Arai's cut-elimination procedure of and of the iterated inductive definition systems can be directly expressed by the reduction rules of Buchholz's Hydra Game. As a direct corollary the independence result of the Hydra Game follows. Received: August 23, 1994 / Revised: July 24, 1995 and May 9, 1996     

A real algorithm for the Hermitian eigenvalue decomposition

Modifying complex plane rotations, we derive a new Jacobi-type algorithm for the Hermitian eigendecomposition, which uses only real arithmetic. When the fast-scaled rotations are incorporated, the new algorithm brings a substantial reduction in computational costs. The new method has the same convergence properties and parallelism as the symmetric Jacobi algorithm. Computational test results show that it produces accurate eigenvalues and eigenvectors and achieves great reduction in computational time.The work of this author was supported in part by the National Science Foundation grant CCR-8813493 and by the University of Minnesota Army High Performance Computing Research Center contract DAAL 03-89-C-0038.The work of this author was supported in part by the University of Minnesota Army High Performance Computing Research Center contract DAAL 03-89-C-0038.     

Diffusing particles with electrostatic repulsion

Summary. We study a diffusion model of an interacting particles system with general drift and diffusion coefficients, and electrostatic inter-particles repulsion. More precisely, the finite particle system is shown to be well defined thanks to recent results on multivalued stochastic differential equations (see [2]), and then we consider the behaviour of this system when the number of particles goes to infinity (through the empirical measure process). In the particular case of affine drift and constant diffusion coefficient, we prove that a limiting measure-valued process exists and is the unique solution of a deterministic PDE. Our treatment of the convergence problem (as ) is partly similar to that of T. Chan [3] and L.C.G. Rogers - Z. Shi [5], except we consider here a more general case allowing collisions between particles, which leads to a second-order limiting PDE. Received: 5 August 1996 / In revised form: 17 October 1996