Blow-up Sets to a Coupled Heat System

This paper deals with a heat system coupled via local and localized sources subject to null Dirichlet boundary conditions. In a previous paper of the authors, a complete result on the multiple blow-up rates was obtained. In the present paper, we continue to consider the blow-up sets to the system via a complete classification for the nonlinear parameters. That is the discussion on single point versus total blow-up of the solutions. It is mentioned that due to the influence of the localized sources, there is some substantial difficulty to be overcomed there to deal with the single point blow-up of the solutions.     

On defected colourings of graphs

Abstract A k-edge-coloring f of a connected graph G is a （A1, A2, , A）-defected k-edge-coloring if there is a smallest integer/ with 1 _ /3 _〈 k - i such that the multiplicity of each color j E {1,2,... ,/3} appearing at a vertex is equal to Aj _〉 2, and each color of {/3 -}- 1,/3 - 2, - , k} appears at some vertices at most one time. The （A1, A2,, A/）-defected chromatic index of G, denoted as X （A1, A2,, A/; G）, is the smallest number such that every （A1,A2,-.., A/）-defected t-edge-coloring of G holds t _〉 X（A1, A2 A;; G）. We obtain A（G） X（A1, ）2, , A/; G） ＋ -- （Ai - 1） _〈 /k（G） 1, and introduce two new chromatic indices of G i=1 as： the vertex pan-biuniform chromatic index X pb （G）, and the neighbour vertex pan-biuniform chromatic index Xnpb（G）, and furthermore find the structure of a tree T having X pb （T） =1.     

Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree

A proper [h]-total coloring c of a graph G is a proper total coloring c of G using colors of the set [h]={1,2,...,h}.Letw(u) denote the sum of the color on a vertex u and colors on all the edges incident to u.For each edge uv∈E(G),if w(u)≠w(v),then we say the coloring c distinguishes adjacent vertices by sum and call it a neighbor sum distinguishing [h]-total coloring of G.By tndi(G),we denote the smallest value h in such a coloring of G.In this paper,we obtain that G is a graph with at least two vertices,if mad(G)3,then tndi∑(G)≤k+2 where k=max{Δ(G),5}.It partially con?rms the conjecture proposed by Pil′sniak and Wozniak.     

Some results on distance two labelling of outerplanar graphs

Let G be an outerplanar graph with maximum degree △. Let χ（G^2） and A（G） denote the chromatic number of the square and the L（2, 1）-labelling number of G, respectively. In this paper we prove the following results： （1） χ（G^2） = 7 if △= 6; （2） λ（G） ≤ △ ＋5 if △ ≥ 4, and ）,（G）≤ 7 if △ = 3; and （3） there is an outerplanar graph G with △ = 4 such that ）λ（G） = 7. These improve some known results on the distance two labelling of outerplanar graphs.     

CHROMATIC NUMBER OF SQUARE OF MAXIMAL OUTERPLANAR GRAPHS

Let x（G^2） denote the chromatic number of the square of a maximal outerplanar graph G and Q denote a maximal outerplanar graph obtained by adding three chords y1 y3, y3y5, y5y1 to a 6-cycle y1y2…y6y1. In this paper, it is proved that △ ＋ 1 ≤ x（G^2） ≤△ ＋ 2, and x（G^2） = A ＋ 2 if and only if G is Q, where A represents the maximum degree of G.     

On Group Choosability of Total Graphs

In this paper, we study the group and list group colorings of total graphs and present group coloring versions of the total and list total colorings conjectures. We establish the group coloring version of the total coloring conjecture for the following classes of graphs: graphs with small maximum degree, two-degenerate graphs, planner graphs with maximum degree at least 11, planner graphs without certain small cycles, outerplanar graphs and near outerplanar graphs with maximum degree at least 4. In addition, the group version of the list total coloring conjecture is established for forests, outerplanar graphs and graphs with maximum degree at most two.     

Drawings of planar graphs with few slopes and segments

We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most segments and at most 2n slopes. We prove that every cubic 3-connected plane graph has a plane drawing with three slopes (and three bends on the outerface). In a companion paper, drawings of non-planar graphs with few slopes are also considered.     

On list‐coloring outerplanar graphs

We prove that a 2‐connected, outerplanar bipartite graph (respectively, outerplanar near‐triangulation) with a list of colors L (v ) for each vertex v such that (resp., ) can be L‐list‐colored (except when the graph is K₃ with identical 2‐lists). These results are best possible for each condition in the hypotheses and bounds. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 59–74, 2008     

Pathwidth of outerplanar graphs

We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geometric) dual plus two, conjectured that there exists a constant c such that the pathwidth of every biconnected outerplanar graph is at most c plus the pathwidth of its dual. They also conjectured that this was actually true with c being one for every biconnected planar graph. Fomin [10] proved that the second conjecture is true for all planar triangulations. First, we construct for each p ≥ 1, a biconnected outerplanar graph of pathwidth 2p + 1 whose (geometric) dual has pathwidth p + 1, thereby disproving both conjectures. Next, we also disprove two other conjectures (one of Bodlaender and Fomin [3], implied by one of Fomin [10]. Finally we prove, in an algorithmic way, that the pathwidth of every biconnected outerplanar graph is at most twice the pathwidth of its (geometric) dual minus one. A tight interval for the studied relation is therefore obtained, and we show that all cases in the interval happen. © 2006 Wiley Periodicals, Inc. J Graph Theory 55: 27–41, 2007     

Acyclic edge chromatic number of outerplanar graphs

A proper edge coloring of a graph G is called acyclic if there is no 2‐colored cycle in G. The acyclic edge chromatic number of G, denoted by χ(G), is the least number of colors in an acyclic edge coloring of G. In this paper, we determine completely the acyclic edge chromatic number of outerplanar graphs. The proof is constructive and supplies a polynomial time algorithm to acyclically color the edges of any outerplanar graph G using χ(G) colors. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 22–36, 2010     

STABILIZED FEM FOR CONVECTION-DIFFUSION PROBLEMS ON LAYER-ADAPTED MESHES

The application of a standard Galerkin finite element method for convection-diffusion problems leads to oscillations in the discrete solution, therefore stabilization seems to be necessary. We discuss several recent stabilization methods, especially its combination with a Galerkin method on layer-adapted meshes. Supercloseness results obtained allow an improvement of the discrete solution using recovery techniques.     

PREDUAL SPACES FOR Q SPACES

To find the predual spaces Pα（R^n） of Qα（R^n） is an important motivation in the study of Q spaces. In this article, wavelet methods are used to solve this problem in a constructive way. First, an wavelet tent atomic characterization of Pα（Rn） is given, then its usual atomic characterization and Poisson extension characterization are given. Finally, the continuity on Pα of Calderon-Zygmund operators is studied, and the result can be also applied to give the Morrey characterization of Pα（Rn）.     

FINITE ELEMENT APPROXIMATIONS FOR SCHROEDINGER EQUATIONS WITH APPLICATIONS TO ELECTRONIC STRUCTURE COMPUTATIONS

In this paper, both the standard finite element discretization and a two-scale finite element discretization for SchrSdinger equations are studied. The numerical analysis is based on the regularity that is also obtained in this paper for the Schroedinger equations. Very satisfying applications to electronic structure computations are provided, too.     

A TWO-SCALE HIGHER-ORDER FINITE ELEMENT DISCRETIZATION FOR SCHROEDINGER EQUATION

In this paper, a two-scale higher-order finite element discretization scheme is proposed and analyzed for a Schroedinger equation on tensor product domains. With the scheme, the solution of the eigenvalue problem on a fine grid can be reduced to an eigenvalue problem on a much coarser grid together with some eigenvalue problems on partially fine grids. It is shown theoretically and numerically that the proposed two-scale higher-order scheme not only significantly reduces the number of degrees of freedom but also produces very accurate approximations.     

Spectral gap and convergence rate for discrete-time Markov chains

Let P be a transition matrix which is symmetric with respect to a measure π.The spectral gap of P in L2(π)-space,denoted by gap(P),is defined as the distance between 1 and the rest of the spectrum of P.In this paper,we study the relationship between gap(P) and the convergence rate of Pn.When P is transient,the convergence rate of P n is equal to 1 gap(P).When P is ergodic,we give the explicit upper and lower bounds for the convergence rate of Pn in terms of gap(P).These results are extended to L∞(π)-space.     

RECENT PROGRESS ON SPHERICAL HARMONIC APPROXIMATION MADE BY BNU RESEARCH GROUP --In memory of Professor Sun Yongsheng

As early as in 1990, Professor Sun Yongsheng, suggested his students at Beijing Normal University to consider research problems on the unit sphere. Under his guidance and encouragement his students started the research on spherical harmonic analysis and approximation. In this paper, we incompletely introduce the main achievements in this area obtained by our group and relative researchers during recent 5 years （2001-2005）. The main topics are： convergence of Cesaro summability, a.e. and strong summability of Fourier-Laplace series; smoothness and K-functionals; Kolmogorov and linear widths.     

FINITE ELEMENTS WITH LOCAL PROJECTION STABILIZATION FOR INCOMPRESSIBLE FLOW PROBLEMS

In this paper we review recent developments in the analysis of finite element methods for incompressible flow problems with local projection stabilization （LPS）. These methods preserve the favourable stability and approximation properties of classical residual-based stabilization （RBS） techniques but avoid the strong coupling of velocity and pressure in the stabilization terms. LPS-methods belong to the class of symmetric stabilization techniques and may be characterized as variational multiscale methods. In this work we summarize the most important a priori estimates of this class of stabilization schemes developed in the past 6 years. We consider the Stokes equations, the Oseen linearization and the NavierStokes equations. Furthermore, we apply it to optimal control problems with linear（ized） flow problems, since the symmetry of the stabilization leads to the nice feature that the operations ＂discretize＂ and ＂optimize＂ commute.     

Projections,Birkhoff Orthogonality and Angles in Normed Spaces

Let X be a Minkowski plane, i.e., a real two dimensional normed linear space. We use projections to give a definition of the angle Aq（x, y） between two vectors x and y in X, such that x is Birkhoff orthogonal to y if and only if Aq（x,y）=π/2. Some other properties of this angle are also discussed.     

AN EFFICIENT METHOD FOR MULTIOBJECTIVE OPTIMAL CONTROL AND OPTIMAL CONTROL SUBJECT TO INTEGRAL CONSTRAINTS

We introduce a new and efficient numerical method for multicriterion optimal control and single criterion optimal control under integral constraints. The approach is based on extending the state space to include information on a ＂budget＂ remaining to satisfy each constraint; the augmented Hamilton-Jacobi-Bellman PDE is then solved numerically. The efficiency of our approach hinges on the causality in that PDE, i.e., the monotonicity of characteristic curves in one of the newly added dimensions. A semi-Lagrangian ＂marching＂ method is used to approximate the discontinuous viscosity solution efficiently. We compare this to a recently introduced ＂weighted sum＂ based algorithm for the same problem [25]. We illustrate our method using examples from flight path planning and robotic navigation in the presence of friendly and adversarial observers.     

TESTING OF CORRELATION AND HETEROSCEDASTICITY IN NONLINEAR REGRESSION MODELS WITH DBL（p,q, 1） RANDOM ERRORS

Chaos theory has taught us that a system which has both nonlinearity and random input will most likely produce irregular data. If random errors are irregular data, then random error process will raise nonlinearity （Kantz and Schreiber （1997））. Tsai （1986） introduced a composite test for autocorrelation and heteroscedasticity in linear models with AR（1） errors. Liu （2003） introduced a composite test for correlation and heteroscedasticity in nonlinear models with DBL（p, 0, 1） errors. Therefore, the important problems in regression model axe detections of bilinearity, correlation and heteroscedasticity. In this article, the authors discuss more general case of nonlinear models with DBL（p, q, 1） random errors by score test. Several statistics for the test of bilinearity, correlation, and heteroscedasticity are obtained, and expressed in simple matrix formulas. The results of regression models with linear errors are extended to those with bilinear errors. The simulation study is carried out to investigate the powers of the test statistics. All results of this article extend and develop results of Tsai （1986）, Wei, et al （1995）, and Liu, et al （2003）.