关于一类弱-Berwald的$(\alpha,\beta)$-度量

In this paper, we study an important class of （α,β）-metrics in the form F = （α＋β）^m＋1/α^m on an n-dimensional manifold and get the conditions for such metrics to be weakly- Berwald metrics, where α = √aij（x）y^iy^j is a Riemannian metric and β = bi（x）y^i is a 1-form and m is a real number with m ≠ -1,0,-1/n. Furthermore, we also prove that this kind of （α,β）-metrics is of isotropic mean Berwald curvature if and only if it is of isotropic S-curvature. In this case, S-curvature vanishes and the metric is weakly-Berwald metric.     

Constructions of Metric $(n+1)$-Lie Algebras

Metric n-Lie algebras have wide applications in mathematics and mathematical physics. In this paper, the authors introduce two methods to construct metric (n+1)-Lie algebras from metric n-Lie algebras for n≥2. For a given m-dimensional metric n-Lie algebra(g, [, ···, ], B_g), via one and two dimensional extensions ￡=g+IFc and g0= g+IFx~(-1)+IFx~0 of the vector space g and a certain linear function f on g, we construct(m+1)-and (m+2)-dimensional (n+1)-Lie algebras(￡, [, ···, ]cf) and(g0, [, ···, ]1), respectively.Furthermore, if the center Z(g) is non-isotropic, then we obtain metric(n + 1)-Lie algebras(L, [, ···, ]cf, B) and(g0, [, ···, ]1, B) which satisfy B|g×g = Bg. Following this approach the extensions of all(n + 2)-dimensional metric n-Lie algebras are discussed.     

Graph Sparsification by Universal Greedy Algorithms

Graph sparsification is to approximate an arbitrary graph by a sparse graph and is useful in many applications, such as simplification of social networks, least squares problems, and numerical solution of symmetric positive definite linear systems. In this paper, inspired by the well-known sparse signal recovery algorithm called orthogonal matching pursuit (OMP), we introduce a deterministic, greedy edge selection algorithm, which is called the universal greedy approach (UGA) for the graph sparsification problem. For a general spectral sparsification problem, e.g., the positive subset selection problem from a set of $m$ vectors in $\mathbb{R}^n$, we propose a nonnegative UGA algorithm which needs $O(mn^2+ n^3/\epsilon^2)$ time to find a $\frac{1+\epsilon/\beta}{1-\epsilon/\beta}$-spectral sparsifier with positive coefficients with sparsity at most $\lceil\frac{n}{\epsilon^2}\rceil$, where $\beta$ is the ratio between the smallest length and largest length of the vectors. The convergence of the nonnegative UGA algorithm is established. For the graph sparsification problem, another UGA algorithm is proposed which can output a $\frac{1+O(\epsilon)}{1-O(\epsilon)}$-spectral sparsifier with $\lceil\frac{n}{\epsilon^2}\rceil$ edges in $O(m+n^2/\epsilon^2)$ time from a graph with $m$ edges and $n$ vertices under some mild assumptions. This is a linear time algorithm in terms of the number of edges that the community of graph sparsification is looking for. The best result in the literature to the knowledge of the authors is the existence of a deterministic algorithm which is almost linear, i.e. $O(m^{1+o(1)})$ for some $o(1)=O(\frac{(\log\log(m))^{2/3}}{\log^{1/3}(m)})$. Finally, extensive experimental results, including applications to graph clustering and least squares regression, show the effectiveness of proposed approaches.     

Almost Periodic Solutions of Equation $[\dot x = {x^3} + \lambda g(t)x + \mu f(t)\]$ and Their Stability

By using the Liapunov function and the contraction mapping principle, the author investigates the existence and stability of almost periodic solutions of the first order nonlinear equations $\frac{dx}{dt}=-h_1(x)+h_2(x)g(t)+f(t)$ and $\frac{dx}{dt}=r(t)x^n+\lambdag(t)x+\muf(t)$, where r(t), g(t), f(t) are given almost periodic functions, n(\geq 2) integer, and \lambda,\mu real parameters.     

笛卡尔乘积图的圈点连通度

图G的圈点连通度,记为κ_c(G),是所有圈点割中最小的数目,其中每个圈点割S满足G-S不连通且至少它的两个分支含圈.这篇文章中给出了两个连通图的笛卡尔乘积的圈点连通度:(1)如果G_1≌K_m且G_2≌K_n,则κ_c(G_1×G_2)=min{3m+n-6,m+3n-6},其中m+n≥8,m≥n+2,或n≥m+2,且κ_c(G_1×G_2)=2m+2n-8,其中m+n≥8,m=n,或n=m+1,或m=n+11;(2)如果G_1≌K_m(m≥3)且G_2■K_n,则min{3m+κ(G_2)-4,m+3κ(G_2)-3,2m+2κ(G_2)-4}≤κ_c(G_1×G_2)≤mκ(G2);(3)如果G_1■K_m,K_(1,m-1)且G_2■K_n,K_(1,n-1),其中m≥4,n≥4,则min{3κ(G_1)+κ(G_2)-1,κ(G_1)+3κ(G_2)-1,2_κ(G_1)+2_κ(G_2)-2}≤κ_c(G_1×G_2)≤min{mκ(G_2),nκ(G_1),2m+2n-8}.     

亚纯函数微分多项式f^kQ[f]+P[f]的零点分布

研究了超越亚纯函数$f$的微分多项式$f^kQ[f]+P[f]$的零点分布. 给出了以下结果:对于满足$\delta(\infty,f)\geq1-\alpha>0$ ($\alpha$为常数, $0\leq \alpha<1$ )的超越亚纯函数$f(z)$, 若$T(r,f)=O((\log r)^2)$,则微分多项式$f^kQ[f]+P[f]$ ($Q[f]\not\equiv 0,\ P[f] \not\equiv 0$)在 可数个圆盘并集之外有无穷多个零点,其中$k>\frac{1+\Gamma_{P}+\gamma_{P}+\alpha(1+\Gamma_Q+\Gamma_{P}-\gamma_{P})} {1-\alpha }$, $\Gamma_{Q}$是$Q[f]$的权, $\Gamma_{P}$和$\gamma_{P}$是$P[f]$的权和次数.     

一类具功能反应的食饵——捕食者系统定性分析

研究一类具功能反应的食饵-捕食者系统:x=xg(x)-y(?)(x),y=y(-d+e(?)(x)．在g(x)=α-bxm,(?)(x)=cxθ及m+θ=1,m=1/n,n>2为正整数情形下,分析了该系统的平衡点性态,并得到了系统在正平衡点外围的极限环的不存在性、存在性与唯一性的相关条件．     

在${\mathbb{R}}^m$中重对数广义律的精确速率

令\{$X$, $X_n$, $n\ge 1$\}是期望为${\mathbb{E}}X=(0,\ldots,0)_{m\times 1}$和协方差阵为${\rm Cov}(X,X)=\sigma^2I_m$的独立同分布的随机向量列, 记$S_n=\sum_{i=1}^{n}X_i$, $n\ge 1$. 对任意$d>0$和$a_n=o((\log\log n)^{-d})$, 本文研究了${{\mathbb{P}}(|S_n|\ge (\varepsilon+a_n)\sigma \sqrt{n}(\log\log n)^d)$的一类加权无穷级数的重对数广义律的精确速率.     

Clifford 环面 Sm(\sqrt{\frac{m}{n}})×Sn-m(\sqrt{\frac{n-m}{n}})的刚性定理

\small\zihao{-5}\begin{quote}{\heiti 摘要:} 设$M$为$n+1$维单位球面$S^{n+1}(1)$中的一个极小闭超曲面，如果 $ n \le S \le n+\frac{2}{3}$, 则有 $S=n$ 且 $M$ 与某一Clifford 环面 $S^m(\sqrt{m/n}) \times S^{n-m}(\sqrt{(n-m)/n})$等距.     

Multiple Axially Asymmetric Solutions to a Mean Field Equation on $\mathbb{S}^{2}$

We study the following mean field equation$$\Delta_{g}u+\rho\left(\frac{e^{u}}{\int_{\mathbb{S}^{2}}e^{u}d\mu}-\frac{1}{4\pi}\right)=0\ \ \mbox{in}\ \ \mathbb{S}^{2},$$where $\rho$ is a real parameter. We obtain the existence of multiple axially asymmetric solutions bifurcating from $u=0$ at the values $\rho=4n(n+1)\pi$ for any odd integer $n\geq3$.     

Multigrid Multi-Level Domain Decomposition

The domain decomposition method in this paper is based on PCG (Preconditioned Conjugate Gradient method). If $N$ is the number of subdomains, the number of sub-problems solved parallelly in a PCG step is $\frac{4}{3}(1-\frac{1}{4^{\log N+1}})N$. The condition number of the preconditioned system does not exceed $O(1+\log N)^3$. It is completely independent of the mesh size. The number of iterations required, to decrease the energy norm of the error by a fixed factor, is proportional to $O(1+\log N)^{\frac{3}{2}}$ .     

关于一类中心循环的有限P-群的自同构群

确定了一类中心循环的有限p-群G的自同构群.设G=X_3(p~m)~(*n)*Z_(p~(m+r)),其中m≥1,n≥1和r≥0,并且X_3(p~m)=x,y|x~(p~m)=y~(p~m)=1,[x,y]~(p~m)=1,[x,[x,y]]=[y,[x,y]]=1.Aut_nG表示Aut G中平凡地作用在N上的元素形成的正规子群,其中G'≤N≤ζG,|N|=p~(m+s),0≤s≤r,则(i)如果p是一个奇素数,那么AutG/Aut_nG≌Z_(p~((m+s-1)(p-1))),Aut_nG/InnG≌Sp(2n,Z_(p~m))×Z_(p~(r-s)).(ii)如果p=2,那么AutG/Aut_nG≌H,其中H=1(当m+s=1时)或者Z_(2~(m+s-2))×Z_2(当m+s≥2时).进一步地,Aut_nG/InnG≌K×L,其中K=Sp(2n,Z_(2~m))(当r0时)或者O(2n,Z_(2~m))(当r=0时),L=Z_(2~(r-1))×Z_2(当m=1,s=0,r≥1时)或者Z_(2~(r-s)).     

SOLVING SYSTEMS OF QUADRATIC EQUATIONS VIA EXPONENTIAL-TYPE GRADIENT DESCENT ALGORITHM

We consider the rank minimization problem from quadratic measurements, i.e., recovering a rank $r$ matrix $X \in \mathbb{R}^{n×r}$ from $m$ scalar measurements $y_i=a_i^T XX^T a_i,\;a_i\in \mathbb{R}^n,\;i=1,\ldots,m$. Such problem arises in a variety of applications such as quadratic regression and quantum state tomography. We present a novel algorithm, which is termed $exponential-type$ $gradient$ $descent$ $algorithm$, to minimize a non-convex objective function $f(U)=\frac{1}{4m}\sum_{i=1}^m(y_i-a_i^T UU^T a_i)^2$. This algorithm starts with a careful initialization, and then refines this initial guess by iteratively applying exponential-type gradient descent. Particularly, we can obtain a good initial guess of $X$ as long as the number of Gaussian random measurements is $O(nr)$, and our iteration algorithm can converge linearly to the true $X$ (up to an orthogonal matrix) with $m=O\left(nr\log (cr)\right)$ Gaussian random measurements.     

LIMIT CYCLES AND BIFURCATION CURVES FOR THE QUADRATIC DIFFERENTIAL SYSTEM （III）m=0 HAVING THREE ANTI-SADDLES （I）

For the quadratic system: x=-y δx lx2 ny2, y=x(1 ax-y) under conditions -10 the author draws in the (a, ()) parameter plane the global bifurcationdiagram of trajectories around O(0,0). Notice that when na2 l < 0 the system has one saddleN(0,1/n) and three anti-saddles.     

一个素变量丢番图问题

设k和r是满足k≥3及r≥Ψ(k)+1的正整数,这里当3≤k≤4时,Ψ(k)=2~(k-1);而当k≥5时,Ψ(k)=1/2k(k+1).假定δ和ε是给定的足够小的正数,λ_1,λ_2,…,λ_(r+1)是不全同号且两两之比不全为有理数的非零实数.对于任意实数η与0σ2~(1-2k)/r-1,证明了:存在一个正数序列X→+∞,使得不等式|λ_1p_1~k+λ_2p_2~k+···+λ_rp_r~k+λ_(r+1)p_(r+1)+η|(max(1≤j≤r+1)p_j)~(-σ)有》■X~(■-(2~(1-2k))/(r-1)+ε组素数解(p_1,p_2,…,p_(r+1)),这里(δX)~(1/k)≤p_j≤X~(1/k)(1≤j≤r)及δX≤p_(r+1)≤X.这改进了之前的结果.     

角域内代数体函数的唯一性定理

Let W (z) and M(z) be v-valued and k-valued algebroidal functions respectively,(θ) be a b-cluster line of order ∞ (or ρ(r)) of W (z) (or M(z)).It is shown that W (z) ≡ M(z) provided E(a j ,W (z)) = E(a j ,M(z)) (j = 1,...,2v + 2k + 1) holds in the angular domain Ω(θ- δ,θ + δ),where b,a j (j = 1,...,2v + 2k + 1) are complex constants.The same results are obtained for the case that (θ) is a Borel direction of order ∞ (or ρ(r)) of W (z) (or M(z)).     

有向圈的笛卡尔积有向图的双控制数

Let γ*(D) denote the twin domination number of digraph D and let Cm Cn denote the Cartesian product of C_m and C_n, the directed cycles of length m, n ≥ 2. In this paper, we determine the exact values: γ*(C_2?C_n) = n; γ*(C_3 ?C_n) = n if n ≡ 0(mod 3),otherwise, γ*(C_3?C_n) = n + 1; γ*(C_4?C_n) = n + n/2 if n ≡ 0, 3, 5(mod 8), otherwise,γ*(C_4?C_n) = n + n/2 + 1; γ*(C_5?C_n) = 2n; γ*(C_6?C_n) = 2n if n ≡ 0(mod 3), otherwise,γ*(C_6?C_n) = 2n + 2.     

逼近已知函数微商的广义Lanczos算法

给出逼近已知函数微商的广义Lanczos 算法, 构造了一列逼近算子$D_{h}^{n}$以提高稳定近似解的收敛速率. 当$n=2$时, 逼近精度达到$O(\delta^{6 \over 7})$, 而对一般的自然数$n$逼近精度为$O(\delta^{\frac{2n+2}{2n+3}})$, 这里$\delta$是近似函数的误差界.     

URS' For Weierstrass Products without Exponential Factors

Let $ \cal W $ be the set of entire functions equal to a Weierstrass product of the form $ {f(x)= Ax^q\lim_{r \to \infty} \prod_{|a_j|\leq r}{(1- \fraca {x} {a_j})}} $ where the convergence is uniform in all bounded subsets of $ {\shadC} $ , let $ \cal V $ be the set of $ f\in {\cal W} $ such that $ {\shadC} [\,f]\subset {\cal W} $ , and let $ {\cal H} $ be the $ {\shadC} $ -algebra of entire functions satisfying $ { {\lim_{r\to \infty } } ({\ln M(r,f) / r})=0} $ . Then $ \cal H $ is included in $ {\cal V} $ and strictly contains the set of entire functions of genus zero, (which, itself, strictly contains the $ {\shadC} $ -algebra of entire functions of order 𝜌 < 1). Let $ n, m\in {\shadN} ^* $ satisfy n > m S 3. Let $ a\in {\shadC}^* $ satisfies $ {a^n\not = \fraca{n^n}{(m^m(n-m)^{n-m}})} $ and assume that for every ( n m m )-th root ξ of 1 different from m 1, a satisfies further $ {a^{n}\neq (1+\xi )^{n-m} (\fraca{n^n}{((n-m)^{n-m}m^m}))} $ . Let P ( X ) = X n m aX m + 1 and let T n,m ( a ) be the set of its zeros. Then T n,m ( a ) has n distinct points and is a urs for $ {\cal V} $ . In particular this applies to functions such as sin x and cos x .     

Inequalities for the harmonic numbers

We present various inequalities for the harmonic numbers defined by ${H_n=1+1/2 +\ldots +1/n\,(n\in{\bf N})}$ . One of our results states that we have for all integers n ???2: $$\alpha \, \frac{\log(\log{n}+\gamma)}{n^2} \leq H_n^{1/n} -H_{n+1}^{1/(n+1)} < \beta \, \frac{\log(\log{n}+\gamma)}{n^2}$$ with the best possible constant factors $$\alpha= \frac{6 \sqrt{6}-2 \sqrt[3]{396}}{3 \log(\log{2}+\gamma)}=0.0140\ldots \quad\mbox{and} \quad\beta=1.$$ Here, ?? denotes Euler??s constant.