Quasilinear parabolic systems of several components

In this paper we investigate the blowup criteria of the quasilinear parabolic system with homogeneous Dirichlet boundary conditions on a bounded domain R ^N , where c >0, >0, p 0 (1, n) are constants. Denote by I the identity matrix and P=(p ), which is assumed to be irreducible. That I–P is a singular M-matrix is shown to be the critical case, in which ₁ plays a fundamental role, where ₁ is the first Dirichlet eigenvalue of the Laplacian on . As a result, we give a general answer to the question of Galaktionov and Levine on the porous medium systems. Mathematics Subject Classification (2000):35K50, 35K55, 35K65     

Un théorème de Choquet-Deny pour les groupes moyennables

Résumé SoitG un groupe moyennable connexe, locallement compact, à base dénombrable. Soit une mesure positive sur les boréliens deG. Nous étudions les fonctions boréliennes positivesh vérifiant: g G, . Sous de bonnes hypothèses sur , nous obtenons, pour ces fonctions, une représentation intégrale à l'aide d'exponentielles.

---

Summary LetG be a connected locally compact separable amenable group. Let be a positive measure on the Borel -field ofG. We study the positive Borel functionsh onG which satisfy: g G, . Under smooth assumptions on , we establish an integral representation of these functions in term of exponentials.

     

Existence for nonoscillatory solutions of higher order nonlinear neutral differential equations

Consider the forced higher-order nonlinear neutral functional differential equation

Limit theorems for multitype continuous time Markov branching processes

Summary Let X(t)=(X ₁ (t), X ₂ (t), , X _t (t)) be a k-type (2k<) continuous time, supercritical, nonsingular, positively regular Markov branching process. Let M(t)=((m _ij (t))) be the mean matrix where m _ij (t)=E(X _j (t)¦X _r (0)= _ir for r=1, 2, , k) and write M(t)=exp(At). Let be an eigenvector of A corresponding to an eigenvalue . Assuming second moments this paper studies the limit behavior as t of the stochastic process . It is shown that i) if 2 Re >₁, then · X(t)e{–t¦ converges a.s. and in mean square to a random variable. ii) if 2 Re ₁ then [ · X(t)] f(v · X(t)) converges in law to a normal distribution where f(x)=(x) ^–1 if 2 Re <₁ and f(x)=(x log x)^–1 if 2 Re =₁, ₁ the largest real eigenvalue of A and v the corresponding right eigenvector.Research supported in part under contracts N0014-67-A-0112-0015 and NIH USPHS 10452 at Stanford University.     

Infinitesimal obstructions to weakly mixing

Let ^t be the flow (parametrized with respect to arc length) of a smooth unit vector field v on a closed Riemannian manifold M ⁿ , whose orbits are geodesics. Then the (n-1)-plane field normal to v, v, is invariant under d ^t and, for each x M, we define a smooth real function _x (t) : (1 + _i (t)), where the _i(t) are the eigenvalues of AA ^T, A being the matrix (with respect to orthonormal bases) of the non-singular linear map d^2t , restricted to v at the point _x ^-t M ⁿ.Among other things, we prove the Theorem (Theorem II, below). Assume v is also volume preserving and that _x ^' (t) 0 for all x M and real t; then, if _x ^t : M M is weakly missng for some t, it is necessary that vx 0 at all x M.     

A preconditioner for constrained and weighted least squares problems with Toeplitz structure

We study methods for solving the constrained and weighted least squares problem min _x by the preconditioned conjugate gradient (PCG) method. HereW = diag (₁, , _m ) with _{1 m} 0, andA ^T = [T ₁ ^T , ,T _k ^T ] with Toeplitz blocksT _l R ^{n × n} ,l = 1, ,k. It is well-known that this problem can be solved by solving anaugmented linear 2 × 2 block linear systemM +Ax =b, A ^T = 0, whereM =W ^–1. We will use the PCG method with circulant-like preconditioner for solving the system. We show that the spectrum of the preconditioned matrix is clustered around one. When the PCG method is applied to solve the system, we can expect a fast convergence rate.Research supported by HKRGC grants no. CUHK 178/93E and CUHK 316/94E.     

Positive Solutions for a Singular Nonlinear Problem on a Bounded Domain in R 2

For a bounded regular Jordan domain in R ², we introduce and study a new class of functions K() related on its Green function G. We exploit the properties of this class to prove the existence and the uniqueness of a positive solution for the singular nonlinear elliptic equation u+(x,u)=0, in D(), with u=0 on and uC(), where is a nonnegative Borel measurable function in ×(0,) that belongs to a convex cone which contains, in particular, all functions (x,t)=q(x)t ^–,>0 with nonnegative functions qK(). Some estimates on the solution are also given.     

Sufficient Conditions for the Existence of Disintegrations

Let be a probability space and a partition of . A necessary and sufficient condition is given for the existence of a -additive and measurable disintegration of P on . It is also shown that P admits a -additive (but not measurable) disintegration on whenever is a standard space and the set (₁, ₂):₁ and ₂ are in the same element of } is coanalytic in ×. Finally, sufficient statistics (in the classical Fisherian sense) are investigated by using -additive disintegrations as conditional probabilities.     

On a Family of Hyperplane Arrangements Related to the Affine Weyl Groups

Let be an irreducible crystallographic rootsystem in a Euclidean space V, with ⁺ theset of positive roots. For , , let be the hyperplane . We define a set of hyperplanes . This hyperplane arrangement is significant inthe study of the affine Weyl groups. In this paper it is shown that thePoincaré polynomial of is , where n is the rank of and h is the Coxeter number of the finiteCoxeter group corresponding to .     

The Ramsey property for collections of sequences not containing all arithmetic progressions

A family of sequences has the Ramsey property if for every positive integerk, there exists a least positive integerf (k) such that for every 2-coloring of {1,2, ...,f (k)} there is a monochromatick-term member of . For fixed integersm > 1 and 0 q < m, let _q(m) be the collection of those increasing sequences of positive integers {x ₁,..., x_k} such thatx _i+1 – x_i q(modm) for 1 i k – 1. Fort a fixed positive integer, denote byA _t the collection of those arithmetic progressions having constant differencet. Landman and Long showed that for allm 2 and 1 q < m, _q(m) does not have the Ramsey property, while _q(m) A _m does. We extend these results to various finite unions of _q(m) 's andA _t 's. We show that for allm 2, _q=1 ^m–1 _q(m) does not have the Ramsey property. We give necessary and sufficient conditions for collections of the form _q(m) ( _{t T} A _t) to have the Ramsey property. We determine when collections of the form _a(m₁) _b(m₂) have the Ramsey property. We extend this to the study of arbitrary finite unions of _q(m)'s. In all cases considered for which has the Ramsey property, upper bounds are given forf .     

The Lattice of Interpretability Types of Cantor Varieties

For integers 1 m < n, a Cantor variety with m basic n-ary operations _i and n basic m-ary operations _k is a variety of algebras defined by identities _k(₁( ), ... , _m( )) = _k and i(₁( ), ... ,_n( )) = y _i, where = (x ₁., ... , x _n) and = (y ₁, ... , y _m). We prove that interpretability types of Cantor varieties form a distributive lattice, , which is dual to the direct product ₁ × ₂ of a lattice, ₁, of positive integers respecting the natural linear ordering and a lattice, ₂, of positive integers with divisibility. The lattice is an upper subsemilattice of the lattice of all interpretability types of varieties of algebras.     

Locally forced critical surface waves in channels of arbitrary cross section

Critical long surface waves forced by locally distributed external pressure applied on the free surface in channels of arbitrary cross section are studied in this paper. The fluid under consideration is inviscid and has constant density. The upstream flow is uniform and the upstream velocity is assumed to be near critical, i.e.,u ₀=u _c ++0(²), where 0<1 andu _c is the critical velocity determined by the geometry of the channel. The external pressure applied on the free surface as the forcing is ² P(x). Then the first order perturbation of the free surface elevation satisfies a forced Korteweg-de Vries equation (fK-dV). It is shown in this paper that: (i) If (supercritical), the stationaryfK-dV has two cusped solitary wave solutions; (ii) if (subcritical), the stationaryfK-dV has a downstream cnoidal wave solution; (iii) when= _L , the unique stationary solution of thefK-dV is a wave free hydraulic fall; (iv) if= _d =– _L , thefK-dV has a jump solution; and (v) if _L << _c , thefK-dV does not have stationary solutions. Some free surface profiles and bifurcation diagrams are presented.     

QUADRATIC ESTIMATORS OF QUADRATIC FUNCTIONS WITH PARAMETERS IN NORMAL LINEAR MODELS

ＱＵＡＤＲＡＴＩＣＥＳＴＩＭＡＴＯＲＳＯＦＱＵＡＤＲＡＴＩＣＦＵＮＣＴＩＯＮＳＷＩＴＨＰＡＲＡＭＥＴＥＲＳＩＮＮＯＲＭＡＬＬＩＮＥＡＲＭＯＤＥＬＳ￥ＷＵＱＩＧＵＡＮＧ（吴启光）（ＩｎｓｔｉｔｕｔｅｏｆＳｙｓｔｅｍｅＳｃｉｅｎｃｅ,ｔｈｅＣｈｉｎｅｓｅ...     

Isometries of symmetric operator spaces associated with AFD factors of typeII and symmetric vector-valued spaces

If is a surjective isometry of the separable symmetric operator spaceE(M, ) associated with the approximately finite-dimensional semifinite factorM and if · _E(M,) is not proportional to · _{L 2}, then there exist a unitary operatorUM and a Jordan automorphismJ ofM such that(x)=UJ(x) for allxME(M, ). We characterize also surjective isometries of vector-valued symmetric spacesF((0, 1), E(M, )).Research supported by the Australian Research Council     

Taut Distance-Regular Graphs of Odd Diameter

Let denote a bipartite distance-regular graph with diameter D 4, valency k 3, and distinct eigenvalues ₀ > ₁ > ··· > _D. Let M denote the Bose-Mesner algebra of . For 0 i D, let E _i denote the primitive idempotent of M associated with _i . We refer to E ₀ and E _D as the trivial idempotents of M. Let E, F denote primitive idempotents of M. We say the pair E, F is taut whenever (i) E, F are nontrivial, and (ii) the entry-wise product E F is a linear combination of two distinct primitive idempotents of M. We show the pair E, F is taut if and only if there exist real scalars , such that _{i + 1 i + 1} – _{i – 1 i – 1} = _i ( _{i + 1} – _{i – 1}) + _i ( _{i + 1} – _{i – 1}) + (1 i D – 1)where ₀, ₁, ..., _D and ₀, ₁, ..., _D denote the cosine sequences of E, F, respectively. We define to be taut whenever has at least one taut pair of primitive idempotents but is not 2-homogeneous in the sense of Nomura and Curtin. Assume is taut and D is odd, and assume the pair E, F is taut. We show

Inadmissibility and admissibility results for unbiased loss estimators based on gauss-markov estimators

LetY be distributed according to ann-variate normal distribution with a meanX and a nonsingular covariance matrix ² V, where bothX andV are known, R ^p is a parameter, > 0 is known or unknown. Denote and . Assume thatF is linearly estimable. When is known, it is proved that the unbiased loss estimator ²tr(F(XV ^–1 X)^– F) of is admissible for rank (F)=k4 and inadmissible fork 5 with the squared error loss . When is unknown and rank (X) <n, it is established that the loss estimatorcS ², wherec is any nonnegative constant, of is inadmissible and that the unbiased loss estimator tr(F(XV ^–1 X)^– F) of is admissible fork 4, and inadmissible fork 5 with squared error loss.This project is supported by the National Natural Science Foundation of China.     

On the Solvability and Asymptotics of Solutions of One Functional Differential Equation with Singularity

We prove the existence of continuously differentiable solutions with required asymptotic properties as t +0 and determine the number of solutions of the following Cauchy problem for a functional differential equation:

The quality of the Diophantine approximations found by the Jacobi-Perron algorithm and related algorithms

Given a vector of real numbers=(₁,... _d ) ^d , the Jacobi-Perron algorithm and related algorithms, such as Brun's algorithm and Selmer's algorithm, produce a sequence of (d+1)×(d+1) convergent matrices {C⁽ⁿ⁾():n1} whose rows provide Diophantine approximations to . Such algorithms are specified by two mapsT:[0, 1] ^d [0, 1] ^d and A:[0,1] ^d GL(d+1,), which compute convergent matrices C⁽ⁿ⁾())...A(T())A(). The quality of the Diophantine approximations these algorithms find can be measured in two ways. The best approximation exponent is the upper bound of those values of for which there is some row of the convergent matrices such that for infinitely many values ofn that row of C⁽ⁿ⁾() has . The uniform approximation exponent is the upper bound of those values of such that for all sufficiently large values ofn and all rows of C⁽ⁿ⁾⁽⁾ one has . The paper applies Oseledec's multiplicative ergodic theorem to show that for a large class of such algorithms and take constant values and on a set of Lebesgue measure one. It establishes the formula where are the two largest Lyapunov exponents attached by Oseledec's multiplicative ergodic theorem to the skew-product (T, A,d), whered is aT-invariant measure, absolutely continuous with respect to Lebesgue measure. We conjecture that holds for a large class of such algorithms. These results apply to thed-dimensional Jacobi-Perron algorithm and Selmer's algorithm. We show that; experimental evidence of Baldwin (1992) indicates (nonrigorously) that. We conjecture that holds for alld2.     

Affine completions of distributive lattices

For any distributive lattice L we construct its extension ((L)) with the property that every isotone compatible function on L can be interpolated by a polynomial of ((L)). Further, we characterize all extensions with this property and show that our construction is in some sense the simplest possible.This research was supported by the GA SAV Grant 1230/95.     

Lexicographic quasiconcave multiobjective programming

Summary Letf _i :A R ben real-valued objective functions on a convex setA -K ^m ,K:=R orC, n, mN. Letg: A R ⁿ be defined by , where for eachxA, (i ₁ (x), ..., i _n (x)) is a permutation of (1, ...,n) such that . In this paper we treat the problem of findingx ^*A such that , wherel-max denotes the lexicographic maximum. If the f_i's are strongly quasiconcave we can reduce the problem stepwise until finally it is in the form of a scalar programming problem. Further, we consider conditions for the existence and uniqueness of a solution and discuss the relationship of the problem to the vector maximum (i.e. Pareto) and maxmin (i.e. Chebychev) problems.

---

Zusammenfassung f _i :AR seienn reellwertige Zielfunktionen über einer konvexen MengeA-K ^m ,K:=R oderC, n, mN. g:AR ⁿ sei definiert durch , wobei für jedesxA (i ₁ (x), ... i _n (x)) eine Permutation von (1, ...,n) derart ist, daß Wir betrachten das Problem, einx ^*A so zu finden, daß , wobeil-max das lexikographische Maximum bedeute. Falls dief _i stark quasikonkav sind, läßt sich das Problem stufenweise reduzieren, bis es schließlich die Gestalt eines skalaren Optimierungsproblems annimmt. Wir geben Existenz- und Eindeutigkeitsbedingungen an und besprechen Zusammenhänge mit dem Vektormaximumproblem (d.h. Pareto-Optimierung) und dem Maxmin-Problem (d.h. Tschebyscheff-Optimierung).