A Finite Difference Scheme for Blow-Up Solutions of Nonlinear Wave Equations

<正>We consider a finite difference scheme for a nonlinear wave equation,whose solutions may lose their smoothness in finite time,i.e.,blow up in finite time.In order to numerically reproduce blow-up solutions,we propose a rule for a time-stepping, which is a variant of what was successfully used in the case of nonlinear parabolic equations.A numerical blow-up time is defined and is proved to converge,under a certain hypothesis,to the real blow-up time as the grid size tends to zero.     

一些组合地图新算法的实现

本文主要讨论组合地图列举问题.刘的一部专著中提出了一个判定两个地图是否同构的算法.该算法的时间复杂度为O(m2),其中m为下图的规模.在此基础上,本文给出一个用于地图列举以及进而计算任意连通下图的地图亏格分布的通用算法.本文所得结果比之前文献中所给结果更优.     

KAM Theory for Partial Differential Equations

In the last years much progress has been achieved in KAM theory concerning bifurcation of quasi-periodic solutions of Hamiltonian or reversible partial differential equations.We provide an overview of the state of the art in this field.     

傅种孙先生在北京师大附中

1 傅种孙先生简介 1.1 傅先生基本情况介绍 傅种孙先生(1898～1962)1898年2月27日生于江西省高安县.1920年在北京高等师范学校数理部毕业,留母校附中(即现北京师大附中)任教;1921年任母校数理部的讲师;1928年任教授:抗日战争以前,曾先后兼任北京女子师范大学,北平大学女子文理学院,北京大学,辅仁大学教授;1933年当选北平(北京)市数学会理事长秘书;1935年当选中国数学会评议委员兼<数学杂志>编辑;1945年11月至1946年8月在牛津大学、1946年9月至1947年11月在剑桥大学考察;1947～1962年任北京师范大学数学系教授,1956年前曾兼系主任;在1949～1957年间,曾任北京师范大学教务长(3年)及副校长(5年);1952～1957年任北京市人民代表大会代表,中国数学会及其北京市分会常务理事,<中国数学杂志>及其后身<数学通报>总编辑;1962年1月18日病逝于北京.     

Propagation of traveling wave solutions for nonlinear evolution equation through the implementation of the extended modi ed direct algebraic method

In this work,di erent kinds of traveling wave solutions and uncategorized soliton wave solutions are obtained in a three dimensional(3-D)nonlinear evolution equations(NEEs)through the implementation of the modi ed extended direct algebraic method.Bright-singular and dark-singular combo solitons,Jacobi's elliptic functions,Weierstrass elliptic functions,constant wave solutions and so on are attained beside their existing conditions.Physical interpretation of the solutions to the 3-D modi ed KdV-Zakharov-Kuznetsov equation are also given.     

Sign-based Test for Mean Vector in High-dimensional and Sparse Settings

In this article, we introduce a robust sparse test statistic which is based on the maximum type statistic. Both the limiting null distribution of the test statistic and the power of the test are analysed. It is shown that the test is particularly powerful against sparse alternatives. Numerical studies are carried out to examine the numerical performance of the test and to compare it with other tests available in the literature. The numerical results show that the test proposed significantly outperforms those tests in a range of settings, especially for sparse alternatives.     

Local Unstable Entropy and Local Unstable Pressure for Partially Hyperbolic Endomorphisms*

In this paper, local unstable metric entropy, local unstable topological entropy and local unstable pressure for partially hyperbolic endomorphisms are introduced and investigated. Specially, two variational principles concerning relationships among the above mentioned numbers are formulated.     

Multiple Positive Solutions for One Dimensional Third Order p-Laplacian Equations with Integral Boundary Conditions

In this paper,we consider the one dimensional third order p-Laplacian equation■u^′′(0)=0.By using kernel functions and the Avery-Peterson fixed point theorem,we establish the existence of at least three positive solutions.     

Nonconforming Finite Element Methods for the Constrained Optimal Control Problems Governed by Nonsmooth Elliptic Equations

In this paper,nonconforming finite element methods(FEMs)are proposed for the constrained optimal control problems(OCPs)governed by the nonsmooth elliptic equations,in which the popular EQr1 ot element is employed to approximate the state and adjoint state,and the piecewise constant element is used to approximate the control.Firstly,the convergence and superconvergence properties for the nonsmooth elliptic equation are obtained by introducing an auxiliary problem.Secondly,the goal-oriented error estimates are obtained for the objective function through establishing the negative norm error estimate.Lastly,the methods are extended to some other well-known nonconforming elements.     

A Direct Method of Moving Planes to Fractional Power SubLaplace Equations on the Heisenberg Group

We give the direct method of moving planes for solutions to the conformally invariant fractional power sub Laplace equation on the Heisenberg group.The method is based on four maximum principles derived here.Then symmetry and nonexistence of positive cylindrical solutions are proved.     

The strong chromatic index of complete cubic Halin graphs

A complete cubic Halin graph is a cubic Halin graph whose characteristic tree is a complete cubic tree, in which all leaves are at the same distance from the root vertex. In this work, we determine the strong chromatic index of the complete cubic Halin graph.     

Halin图中的Hamilton路径

本文证明了所有的Ｈａｌｉｎ图都是Ｈａｍｉｌｔｏｎ连通的，并给出反例，说明Ｈａｌｉｎ图中存在两条独立边不包含在任何Ｈａｍｉｌｔｏｎ圈中。     

Halin图$Q$-谱半径的最大值

The Q-index of a graph G is the largest eigenvalue q(G) of its signless Laplacian matrix Q(G). In this paper, we prove that the wheel graph W_n = K_1 ∨C_(n-1)is the unique graph with maximal Q-index among all Halin graphs of order n. Also we obtain the unique graph with second maximal Q-index among all Halin graphs of order n.     

A 3-approximation for the pathwidth of Halin graphs

We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings of trees. Using this result we prove that the linear width of Halin graph is always at most three times the linear width of its skeleton.     

平面Halin图的强最大亏格

本文给出了平面Halin图的可定向与不可定向强最大亏格．     

Upper bounds on vertex distinguishing chromatic index of some Halin graphs

A vertex distinguishing edge coloring of a graph G is a proper edge coloring of G such that any pair of vertices has the distinct sets of colors. The minimum number of colors required for a vertex distinguishing edge coloring of a graph G is denoted by ???? _s (G). In this paper, we obtained upper bounds on the vertex distinguishing chromatic index of 3-regular Halin graphs and Halin graphs with ??(G) ?? 4, respectively.     

On the tightness conditions for maximal planar graphs

We characterize the tight structure of a vertex-accumulation-free maximal planar graph with no separating triangles. Together with the result of Halin who gave an equivalent form for such graphs, this yields that a tight structure always exists in every 4-connected maximal planar graph with one end.     

On the edge-binding number of some plane graphs

1. IntroductionSince WOodall gave out the concept of biIldi11g Ilu1lJber in 1973[l] ! the bil1ding nunlber fOrsome specia1 classes have beeIl studied by Kane and WaIlg Jianfang[']. Mirolawa Skowronskahave studied the binding number of Halin-graph[']. ZI1ang Zhongfu, Liu Li1lzhong andZhang Jianxun have extended the bil1di11g nuInber to the edges and studied tlle edge-bindingnumber of path, cycle, coInplete grapl1. I1l this paper, we study the edge-binding number ofouter plane graph, Ha…     

A proof of the bounded graph conjecture

Summary An infinite graph is called bounded if for every labelling of its vertices with natural numbers there exists a sequence of natural numbers which eventually exceeds the labelling along any ray in the graph. We prove an old conjecture of Halin, which characterizes the bounded graphs in terms of four forbidden topological subgraphs.Oblatum 17-IV-1991 & 25-X-1991     

Maximum Genus of Strong Embeddings

The strong embedding conjecture states that any 2-connected graph has a strong embedding on some surface. It implies the circuit double cover conjecture: Any 2-connected graph has a circuit double cover.Conversely, it is not true. But for a 3-regular graph, the two conjectures are equivalent. In this paper, a characterization of graphs having a strong embedding with exactly 3 faces, which is the strong embedding of maximum genus, is given. In addition, some graphs with the property are provided. More generally, an upper bound of the maximum genus of strong embeddings of a graph is presented too. Lastly, it is shown that the interpolation theorem is true to planar Halin graph.