Flat rank of automorphism groups of buildings

The flat rank of a totally disconnected locally compact group G, denoted flat-rk(G), is an invariant of the topological group structure of G. It is defined thanks to a natural distance on the space of compact open subgroups of G. For a topological Kac-Moody group G with Weyl group W, we derive the inequalities alg-rk(W) ≤ flat-rk(G) ≤ rk(|W|₀). Here, alg-rk(W) is the maximal Z-rank of abelian subgroups of W, and rk(|W|₀) is the maximal dimension of isometrically embedded flats in the CAT0-realization |W|₀. We can prove these inequalities under weaker assumptions. We also show that for any integer n ≥ 1 there is a simple, compactly generated, locally compact, totally disconnected group G, with flat-rk(G) = n and which is not linear.     

Shape Hessian for generalized Oseen flow by differentiability of a minimax: A Lagrangian approach

The goal of this paper is to compute the shape Hessian for a generalized Oseen problem with nonhomogeneous Dirichlet boundary condition by the velocity method. The incompressibility will be treated by penalty approach. The structure of the shape gradient and shape Hessian with respect to the shape of the variable domain for a given cost functional are established by an application of the Lagrangian method with function space embedding technique. This work was supported by the National Natural Science Fund of China (No. 10371096) for ZM Gao and YC Ma.     

Study on a Cross Diffusion Parabolic System

This paper considers a kind of strongly coupled cross diffusion parabolic system,which can be usedas the multi-dimensional Lyumkis energy transport model in semiconductor science.The global existence andlarge time behavior are obtained for smooth solution to the initial boundary value problem.When the initialdata are a small perturbation of an isothermal stationary solution,the smooth solution of the problem under theinsulating boundary condition,converges to that stationary solution exponentially fast as time goes to infinity.     

Some Properties of an Operator on L^∞（△） and Its Applications

In this paper, we introduce an operator Hμ（z） on L^∞（△） and obtain some of its properties. Some applications of this operator to the extremal problem of quasiconformal mappings are given. In particular, a sufficient condition for a point r in the universal Teichmfiller space T（△） to be a Strebel point is obtained.     

The characteristic of noncompact convexity and random fixed point theorem for set-valued operators

Let (Ω, Σ) be a measurable space, X a Banach space whose characteristic of noncompact convexity is less than 1, C a bounded closed convex subset of X, KC(C) the family of all compact convex subsets of C. We prove that a set-valued nonexpansive mapping T: C → KC(C) has a fixed point. Furthermore, if X is separable then we also prove that a set-valued nonexpansive operator T: Ω × C → KC(C) has a random fixed point.     

Estimates of the rate of convergence of a dynamic reconstruction algorithm under incomplete information about the phase state

In this paper, we study a dynamic reconstruction algorithm which reconstructs the unknown unbounded input and all unobservable phase coordinates from the results of measurements of part of the coordinates. An upper and a lower bound for the accuracy of the reconstruction is obtained. We determine the class of inputs for which the upper bound is uniform. We give a condition for optimally matching the algorithm parameters, ensuring the highest order of the upper bound and equating the orders of the upper and lower bounds. Thus, we establish the sharpness of the upper bound.     

On the equitability of multiply-connected monolayered cyclofusene

Multiply-connected monolayered cyclofusene (MMC) is a fused hexacyclic system with an exterior region and at least two interior empty regions called holes, as in figure 1. Each hexacyle has either: (a) two edges belonging to an exterior boundary and at least one hole, or (b) two edges belonging to boundaries of at least two holes. Let G be the graph of a given MMC. We show that G is equitable if and only if the set of vertices belonging to three hexacycles is equitable.     

How to Exhibit Toroidal Maps in Space

Steinitz's theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of the embedded graph. Its faces are bounded by convex polygons whose points are coplanar. A map on the torus does not necessarily have such a geometric realization. In this paper we relax the condition that faces are the convex hull of coplanar points. We require instead that the convex hull of the points on a face can be projected onto a plane so that the boundary of the convex hull of the projected points is the image of the boundary of the face. We also require that the interiors of the convex hulls of different faces do not intersect. Call this an exhibition of the map. A map is polyhedral if the intersection of any two closed faces is simply connected. Our main result is that every polyhedral toroidal map can be exhibited. As a corollary, every toroidal triangulation has a geometric realization.     

Reducing system of parameters and the Cohen-Macaulay property

Let R be a local ring and let (x ₁, …, x _r) be part of a system of parameters of a finitely generated R-module M, where r < dim_R M. We will show that if (y ₁, …, y _r) is part of a reducing system of parameters of M with (y ₁, …, y _r) M = (x ₁, …, x _r) M then (x ₁, …, x _r) is already reducing. Moreover, there is such a part of a reducing system of parameters of M iff for all primes P ε Supp M ∩ V _R(x ₁, …, x _r) with dim_R R/P = dim_R M − r the localization M _P of M at P is an r-dimensional Cohen-Macaulay module over R _P. Furthermore, we will show that M is a Cohen-Macaulay module iff y _d is a non zero divisor on M/(y ₁, …, y _d−1) M, where (y ₁, …, y _d) is a reducing system of parameters of M (d:= dim_R M).     

The <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">G</Emphasis>/∞ system revisited: finiteness,summability, long range dependence,and reverse engineering

We explore M/G/∞ systems ‘fed’ by Poissonian inflows with infinite arrival rates. Three processes – corresponding to the system's state, workload, and queue-size – are studied and analyzed. Closed form formulae characterizing the system's stationary structure and correlation structure are derived. And, the issues of queue finiteness, workload summability, and Long Range Dependence are investigated. We then turn to devise a ‘reverse engineering’ scheme for the design of the system's correlation structure. Namely: how to construct an M/G/∞ system with a pre-desired ‘target’ workload/queue auto-covariance function. The ‘reverse engineering’ scheme is applied to various examples, including ones with infinite queues and non-summable workloads. AMS Subject Classifications Primary: 60K25; Secondary: 60G55, 60G10