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.     

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日病逝于北京.     

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.     

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.     

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.     

智慧窗

1 趣解等式七个文字与三个拼音字头组成了一道加法等式,你能否把它们分别换成0～9的数字. (相同文字、字母必须要换相同的数字)使其等式成立吗? (上海市长宁路476弄8号1602室(200042) 张刘福) 2 质数趣题请将5～20各数分别填入圆圈内,使每相邻的两个数之和都是质数.试试看,你能填出     

Hölder,Sobolev,weak-type and BMO estimates in mixed-norm with weights for parabolic equations

We prove weighted mixed-norm Lqt(W2,px)and Lqt(C2,αx)estimates for 10,x∈Rn.x∈Rn,The coefficients a(t)=(aij(t))are just bounded,measurable,symmetric and uniformly elliptic.Furthermore,we show strong,weak type and BMO-Sobolev estimates with parabolic Muckenhoupt weights.It is quite remarkable that most of our results are new even for the classical heat equation?tu?Δu+u=f.     

ON THE DIFFERENTIAL AND DIFFERENCE INDEPENDENCE OFΓANDζ

In this paper,we study the algebraic differential and the difference independence between the Riemann zeta function and the Euler gamma function.It is proved that the Riemann zeta function and the Euler gamma function cannot satisfy a class of nontrivial algebraic differential equations and algebraic difference equations.     

PRECISE VALUES OF THE BLOCH CONSTANTS OF CERTAIN LOG-p-HARMONIC MAPPINGS

The aim of this article is twofold.One aim is to establish the precise forms of Landau-Bloch type theorems for certain polyharmonic mappings in the unit disk by applying a geometric method.The other is to obtain the precise values of Bloch constants for certain log-p-harmonic mappings.These results improve upon the corresponding results given in Bai et al.(Complex Anal.Oper.Theory,13(2):321-340,2019).     

On eigenvalues of Seidel matrices and Haemers’ conjecture

For a graph G, let S(G) be the Seidel matrix of G and \({\theta }_1(G),\ldots ,{\theta }_n(G)\) be the eigenvalues of S(G). The Seidel energy of G is defined as \(|{\theta }_1(G)|+\cdots +|{\theta }_n(G)|\). Willem Haemers conjectured that the Seidel energy of any graph with n vertices is at least \(2n-2\), the Seidel energy of the complete graph with n vertices. Motivated by this conjecture, we prove that for any \(\alpha \) with \(0<\alpha <2,|{\theta }_1(G)|^\alpha +\cdots +|{\theta }_n(G)|^\alpha \geqslant (n-1)^\alpha +n-1\) if and only if \(|\hbox {det}\,S(G)|\geqslant n-1\). This, in particular, implies the Haemers’ conjecture for all graphs G with \(|\hbox {det}\,S(G)|\geqslant n-1\). A computation on the fraction of graphs with \(|\hbox {det}\,S(G)|<n-1\) is reported. Motivated by that, we conjecture that almost all graphs G of order n satisfy \(|\hbox {det}\,S(G)|\geqslant n-1\). In connection with this conjecture, we note that almost all graphs of order n have a Seidel energy of order \(\Theta (n^{3/2})\). Finally, we prove that self-complementary graphs G of order \(n\equiv 1\pmod 4\) have \(\det S(G)=0\).     

Exponent of a finite group with a four-group of automorphisms

Let A be a group isomorphic with either S ₄, the symmetric group on four symbols, or D ₈, the dihedral group of order 8. Let V be a normal four-subgroup of A and ?? an involution in ${A\setminus V}$ . Suppose that A acts on a finite group G in such a manner that C _G (V)?=?1 and C _G (??) has exponent e. We show that if ${A\cong S_4}$ then the exponent of G is e-bounded and if ${A\cong D_8}$ then the exponent of the derived group G?? is e-bounded. This work was motivated by recent results on the exponent of a finite group admitting an action by a Frobenius group of automorphisms.     

An Improved Upper Bound on the Total Restrained Domination Number in Cubic Graphs

In this paper, we continue the study of total restrained domination in graphs. A set S of vertices in a graph G = (V, E) is a total restrained dominating set of G if every vertex of G is adjacent to some vertex in S and every vertex of ${V {\setminus} S}$ is adjacent to a vertex in ${V {\setminus} S}$ . The minimum cardinality of a total restrained dominating set of G is the total restrained domination number γ _tr(G) of G. Jiang et?al. (Graphs Combin 25:341–350, 2009) showed that if G is a connected cubic graph of order n, then γ _tr(G) ≤ 13n/19. In this paper we improve this upper bound to γ _tr(G) ≤ (n?+?4)/2. We provide two infinite families of connected cubic graphs G with γ _tr(G) = n/2, showing that our new improved bound is essentially best possible.     

Degree Sum Conditions for Cyclability in Bipartite Graphs

We denote by G[X, Y] a bipartite graph G with partite sets X and Y. Let d _G (v) be the degree of a vertex v in a graph G. For G[X, Y] and ${S \subseteq V(G),}$ we define ${\sigma_{1,1}(S):=\min\{d_G(x)+d_G(y) : (x,y) \in (X \cap S,Y) \cup (X, Y \cap S), xy \not\in E(G)\}}$ . Amar et al. (Opusc. Math. 29:345–364, 2009) obtained σ _1,1(S) condition for cyclability of balanced bipartite graphs. In this paper, we generalize the result as it includes the case of unbalanced bipartite graphs: if G[X, Y] is a 2-connected bipartite graph with |X| ≥ |Y| and ${S \subseteq V(G)}$ such that σ _1,1(S) ≥ |X| + 1, then either there exists a cycle containing S or ${|S \cap X| > |Y|}$ and there exists a cycle containing Y. This degree sum condition is sharp.     

Minimal decompositions of graphs into mutually isomorphic subgraphs

SupposeG _n={G ₁, ...,G _k } is a collection of graphs, all havingn vertices ande edges. By aU-decomposition ofG _n we mean a set of partitions of the edge setsE(G _t ) of theG _i , sayE(G _t )== \(\sum\limits_{j = 1}^r {E_{ij} } \) E _ij , such that for eachj, all theE _ij , 1≦i≦k, are isomorphic as graphs. Define the functionU(G _n) to be the least possible value ofr aU-decomposition ofG _n can have. Finally, letU _k (n) denote the largest possible valueU(G) can assume whereG ranges over all sets ofk graphs havingn vertices and the same (unspecified) number of edges. In an earlier paper, the authors showed that $$U_2 (n) = \frac{2}{3}n + o(n).$$ In this paper, the value ofU _k (n) is investigated fork>2. It turns out rather unexpectedly that the leading term ofU _k (n) does not depend onk. In particular we show $$U_k (n) = \frac{3}{4}n + o_k (n),k \geqq 3.$$      

Remarks on D-integral complete multipartite graphs

A graph is called distance integral (or D-integral) if all eigenvalues of its distance matrix are integers. In their study of D-integral complete multipartite graphs, Yang and Wang (2015) posed two questions on the existence of such graphs. We resolve these questions and present some further results on D-integral complete multipartite graphs. We give the first known distance integral complete multipartite graphs \({K_{{p_1},{p_2},{p_3}}}\) with p₁ < p₂ < p₃, and \({K_{{p_1},{p_2},{p_3},{p_4}}}\) with p₁ < p₂ < p₃ < p₄, as well as the infinite classes of distance integral complete multipartite graphs \({K_{{a_1}{p_1},{a_2}{p_2},...,{a_s}{p_s}}}\) with s = 5, 6.     

A Spanning Tree with High Degree Vertices

Let G be a connected graph, let ${X \subset V(G)}$ and let f be a mapping from X to {2, 3, . . .}. Kaneko and Yoshimoto (Inf Process Lett 73:163–165, 2000) conjectured that if |N _G (S) ? X| ≥ f (S) ? 2|S| + ω _G (S) + 1 for any subset ${S \subset X}$ , then there exists a spanning tree T such that d _T (x) ≥ f (x) for all ${x \in X}$ . In this paper, we show a result with a stronger assumption than this conjecture; if |N _G (S) ? X| ≥ f (S) ? 2|S| + α(S) + 1 for any subset ${S \subset X}$ , then there exists a spanning tree T such that d _T (x) ≥ f (x) for all ${x \in X}$ .     

The cardinality of β A (S J )

Let J be an infinite set and let $I=\mathcal{P}_{f}( J)$ . For i??I, define $\mathcal{B}_{J}( i) =\{ f\mid f:\mathcal{P}( i) \rightarrow \mathcal{P}( i) \} $ and let $$S_{J}=\{ ( i,f) \mid i\in I\text{ and } f\in \mathcal{B}_{J}( i) \}.$$ For (i,f), (k,g)??S _J , define $f\ast g:\mathcal{P}( i\cup k) \rightarrow \mathcal{P}( i\cup k) $ as follows. For $x\in \mathcal{P}( i\cup k) $ , let $$( f\ast g) ( x) =\left\{\begin{array}{l@{\quad }l}g( x) , & \text{if\ }x=\emptyset, \\g( x\cap k) , & \text{if\ }x\cap k\neq \emptyset, \\f( x) , & \text{if\ }x\in \mathcal{P}( i\backslash k)\text{ and }x\neq \emptyset.\end{array}\right.$$ Define (i,f)?(k,g)=(i??k,f?g). It is shown that (S _J ,?) is a semigroup. Let ??S _J denote the collection of all ultrafilters on the set S _J . We consider (??S _J ,?), the compact (Hausdorff) right topological semigroup that is the Stone?C?ech Compactification of the semigroup (S _J ,?) equipped with the discrete topology. Similar to the construction in Grainger (Semigroup Forum 73:234?C242, 2006), it is shown that there is an injective map A???? _A (S _J ) of $\mathcal{P}( J) $ into $\mathcal{P}( \beta S_{J}) $ such that each ?? _A (S _J ) is a closed subsemigroup of (??S _J ,?), the set ?? _J (S _J ) is the smallest ideal of (??S _J ,?) and the collection $\{ \beta_{A}( S_{J}) \mid A\in \mathcal{P}( J) \} $ is a partition of???S _J . The main result is establishing that the cardinality of??? _A (S _J ) is $2^{2^{\vert J\vert }}$ for any?A?J.     

Expansion in perfect groups

Let ?? be a subgroup of ${{\rm GL}_d(\mathbb{Z}[1/q_0])}$ generated by a finite symmetric set S. For an integer q, denote by ?? _q the projection map ${\mathbb{Z}[1/q_0] \to \mathbb{Z}[1/q_0]/q \mathbb{Z}[1/q_0]}$ . We prove that the Cayley graphs of ?? _q (??) with respect to the generating sets ?? _q (S) form a family of expanders when q ranges over square-free integers with large prime divisors if and only if the connected component of the Zariski-closure of ?? is perfect, i.e. it has no nontrivial Abelian quotients.     

Cops and Robber Game with a Fast Robber on Expander Graphs and Random Graphs

We consider a variant of the Cops and Robber game, in which the robber has unbounded speed, i.e., can take any path from her vertex in her turn, but she is not allowed to pass through a vertex occupied by a cop. Let ${c_{\infty}(G)}$ denote the number of cops needed to capture the robber in a graph G in this variant. We characterize graphs G with c _??(G) =? 1, and give an ${O( \mid V(G)\mid^2)}$ algorithm for their detection. We prove a lower bound for c _?? of expander graphs, and use it to prove three things. The first is that if ${np \geq 4.2 {\rm log}n}$ then the random graph ${G= \mathcal{G}(n, p)}$ asymptotically almost surely has ${\eta_{1}/p \leq \eta_{2}{\rm log}(np)/p}$ , for suitable positive constants ${\eta_{1}}$ and ${\eta_{2}}$ . The second is that a fixed-degree random regular graph G with n vertices asymptotically almost surely has ${c_{\infty}(G) = \Theta(n)}$ . The third is that if G is a Cartesian product of m paths, then ${n/4km^2 \leq c_{\infty}(G) \leq n/k}$ , where ${n = \mid V(G)\mid}$ and k is the number of vertices of the longest path.