共查询到20条相似文献,搜索用时 78 毫秒
1.
We extend the scalar curvature pinching theorems due to Peng-Terng, Wei-Xu and Suh-Yang. Let M be an n-dimensional compact minimal hypersurface in S n+1 satisfying Sf 4 f_3~2 ≤ 1/n S~3 , where S is the squared norm of the second fundamental form of M, and f_k =sum λ_i~k from i and λ_i (1 ≤ i ≤ n) are the principal curvatures of M. We prove that there exists a positive constant δ(n)(≥ n/2) depending only on n such that if n ≤ S ≤ n + δ(n), then S ≡ n, i.e., M is one of the Clifford torus S~k ((k/n)~1/2 ) ×S~... 相似文献
2.
Let n = p1p2 ··· pk, where pi(1 ≤ i ≤ k) are primes in the descending order and are not all equal. Let Ωk(n) = P(p1 + p2)P(p2 + p3) ··· P(pk-1+ pk)P(pk+ p1), where P(n) is the largest prime factor of n. Define w0(n) = n and wi(n) = w(wi-1(n)) for all integers i ≥ 1. The smallest integer s for which there exists a positive integer t such thatΩs k(n) = Ωs+t k(n) is called the index of periodicity of n. The authors investigate the index of periodicity of n. 相似文献
3.
Let {X, X n , n≥1} be a sequence of i.i.d.random variables with zero mean, and set Sn = Σ k=1 n X k , EX2=σ 2>0, λ(ε) =Σ n=1 ∞ P (|Sn|≥ nε). In this paper, we discuss the rate of the approximation of σ2 by ε2 λ(ε) under suitable conditions, and improve the corresponding results of Klesov (1994). 相似文献
4.
Let G =(V, E) be a connected graph and m be a positive integer, the conditional edge connectivity λ_δ~m is the minimum cardinality of a set of edges,if it exists, whose deletion disconnects G and leaves each remaining component with minimum degree δ no less than m. This study shows that λ_δ~1(Q_(n,k)) = 2 n,λ_δ~2(Q_(n,k)) = 4 n-4(2 ≤ k ≤ n-1, n ≥ 3) for n-dimensional enhanced hypercube Q_(n,k). Meanwhile, another easy proof about λ_δ~2(Q_n) = 4 n-8, for n ≥ 3 is proposed. The results of enhanced hypercube include the cases of folded hypercube. 相似文献
5.
Let p be a prime,q be a power of p,and let Fq be the field of q elements.For any positive integer n,the Wenger graph Wn(q)is defined as follows:it is a bipartite graph with the vertex partitions being two copies of the(n+1)-dimensional vector space Fq^n+1,and two vertices p=(p(1),…,p(n+1))and l=[l(1),…,l(n+1)]being adjacent if p(i)+l(i)=p(1)l(1)i-1,for all i=2,3,…,n+1.In 2008,Shao,He and Shan showed that for n≥2,Wn(q)contains a cycle of length 2 k where 4≤k≤2 p and k≠5.In this paper we extend their results by showing that(i)for n≥2 and p≥3,Wn(q)contains cycles of length 2k,where 4≤k≤4 p+1 and k≠5;(ii)for q≥5,0相似文献
6.
Letk be a positive integer and n a nonnegative integer,0 λ1,...,λk+1 ≤ 1 be real numbers and w =(λ1,λ2,...,λk+1).Let q ≥ max{[1/λi ]:1 ≤ i ≤ k + 1} be a positive integer,and a an integer coprime to q.Denote by N(a,k,w,q,n) the 2n-th moment of(b1··· bk c) with b1··· bk c ≡ a(mod q),1 ≤ bi≤λiq(i = 1,...,k),1 ≤ c ≤λk+1 q and 2(b1+ ··· + bk + c).We first use the properties of trigonometric sum and the estimates of n-dimensional Kloosterman sum to give an interesting asymptotic formula for N(a,k,w,q,n),which generalized the result of Zhang.Then we use the properties of character sum and the estimates of Dirichlet L-function to sharpen the result of N(a,k,w,q,n) in the case ofw =(1/2,1/2,...,1/2) and n = 0.In order to show our result is close to the best possible,the mean-square value of N(a,k,q) φk(q)/2k+2and the mean value weighted by the high-dimensional Cochrane sum are studied too. 相似文献
7.
Fa-en WU~ 《中国科学A辑(英文版)》2007,50(8):1078-1086
Let D be a bounded domain in an n-dimensional Euclidean space Rn. Assume that 0 < λ1 ≤λ2 ≤ … ≤ λκ ≤ … are the eigenvalues of the Dirichlet Laplacian operator with any order l{(-△)lu=λu, in D u=(δ)u/(δ)(→n)=…(δ)l-1u/(δ)(→n)l-1=0,on (δ)D.Then we obtain an upper bound of the (k 1)-th eigenvalue λκ 1 in terms of the first k eigenvalues.k∑i=1(λκ 1-λi) ≤ 1/n[4l(n 2l-2)]1/2{k∑i=1(λκ 1-λi)1/2λil-1/l k∑i=1(λκ 1-λi)1/2λ1/li}1/2.This ineguality is independent of the domain D. Furthermore, for any l ≥ 3 the above inequality is better than all the known results. Our rusults are the natural generalization of inequalities corresponding to the case l = 2 considered by Qing-Ming Cheng and Hong-Cang Yang. When l = 1, our inequalities imply a weaker form of Yang inequalities. We aslo reprove an implication claimed by Cheng and Yang. 相似文献
8.
WANG Jian 《高校应用数学学报(英文版)》2008,23(3)
A K1,k-factorization of λKm,n is a set of edge-disjoint K1,k-factors of λKm,n,which partition the set of edges of λKm,n.In this paper,it is proved that a sufficient condition for the existence of K1,k-factorization of λKm,n,whenever k is any positive integer,is that(1) m ≤ kn,(2) n ≤ km,(3) km-n ≡ kn-m ≡ 0(mod(k2-1)) and(4) λ(km-n)(kn-m) ≡ 0(mod k(k -1)(k2 -1)(m n)). 相似文献
9.
Let R be a left and right Noetherian ring and n,k be any non-negative integers.R is said to satisfy the Auslander-type condition G n (k) if the right flat dimension of the (i + 1)-th term in a minimal injective resolution of RR is at most i + k for any 0 i n 1.In this paper,we prove that R is Gn (k) if and only if so is a lower triangular matrix ring of any degree t over R. 相似文献
10.
康托洛维奇不等式的一个简证及其极限形式 总被引:3,自引:0,他引:3
线性规划中有一个康托洛维奇不等式 (Канторович) :若ai >0 (i=1 ,2 ,… ,n) ∑ni=1ai =1 ,0<λ1 ≤λ2 ≤… ≤λn,则 :(∑ni=1λiai) (∑ni=1aiλi) ≤(λ1 +λn) 24λ1 λn《中学数学》和《中学教研》杂志先后给出了该不等式的多种证明 ,有些需用高等方法 ,有些初等方法又相当复杂 ,本文给出该不等式一个极简证明和其极限形式。一、简证 :设f(x) =(∑ni=1λiai)x2 + (λ1 +λn)x +λ1 λn(∑ni=1aiλi)∵λi-(λ1 +λn) + λ1 λnλi (i=1 ,2 ,… ,n)=(λi-λ1 ) (λi-λn)λi≤ 0而ai>0∴λiai-(λ1 +λn)ai+ λ1 λnai… 相似文献
11.
Xiaomeng Li 《偏微分方程(英文版)》2020,33(2):171-192
Let $\Omega\subset \mathbb{R}^4$ be a smooth bounded domain, $W_0^{2,2}(\Omega)$ be the usual Sobolev space. For any positive integer $\ell$, $\lambda_{\ell}(\Omega)$ is the $\ell$-th eigenvalue of the bi-Laplacian operator. Define $E_{\ell}=E_{\lambda_1(\Omega)}\oplus E_{\lambda_2(\Omega)}\oplus\cdots\oplus E_{\lambda_{\ell}(\Omega)}$, where $E_{\lambda_i(\Omega)}$ is eigenfunction space associated with $\lambda_i(\Omega)$. $E^{\bot}_{\ell}$ denotes the orthogonal complement of $E_\ell$ in $W_0^{2,2}(\Omega)$. For $0\leq\alpha<\lambda_{\ell+1}(\Omega)$, we define a norm by $\|u\|_{2,\alpha}^{2}=\|\Delta u\|^2_2-\alpha \|u\|^2_2$ for $u\in E^\bot_{\ell}$. In this paper, using the blow-up analysis, we prove the following Adams inequalities$$\sup_{u\in E_{\ell}^{\bot},\,\| u\|_{2,\alpha}\leq 1}\int_{\Omega}e^{32\pi^2u^2}{\rm d}x<+\infty;$$moreover, the above supremum can be attained by a function $u_0\in E_{\ell}^{\bot}\cap C^4(\overline{\Omega})$ with $\|u_0\|_{2,\alpha}=1$. This result extends that of Yang (J. Differential Equations, 2015), and complements that of Lu and Yang (Adv. Math. 2009) and Nguyen (arXiv: 1701.08249, 2017). 相似文献
12.
AN INVERSE EIGENVALUE PROBLEM FOR JACOBI MATRICES 总被引:7,自引:0,他引:7
Er-xiong Jiang 《计算数学(英文版)》2003,21(5):569-584
Let T1,n be an n x n unreduced symmetric tridiagonal matrix with eigenvaluesand is an (n - 1) x (n - 1) submatrix by deleting the kth row and kth column, k = 1, 2,be the eigenvalues of T1,k andbe the eigenvalues of Tk+1,nA new inverse eigenvalues problem has put forward as follows: How do we construct anunreduced symmetric tridiagonal matrix T1,n, if we only know the spectral data: theeigenvalues of T1,n, the eigenvalues of Ti,k-1 and the eigenvalues of Tk+1,n?Namely if we only know the data: A1, A2, An,how do we find the matrix T1,n? A necessary and sufficient condition and an algorithm ofsolving such problem, are given in this paper. 相似文献
13.
Imre Tuba 《Proceedings of the American Mathematical Society》2001,129(9):2597-2606
We characterize all simple unitarizable representations of the braid group on complex vector spaces of dimension . In particular, we prove that if and denote the two generating twists of , then a simple representation (for ) is unitarizable if and only if the eigenvalues of are distinct, satisfy and 0$"> for , where the are functions of the eigenvalues, explicitly described in this paper.
14.
Let $\xi=(\xi_i, 1 \leq i \leq n)$ and $\eta= (\eta_i, 1 \leq i \leq n)$ be standard normal random variables with covariance
matrices $R^1=(r_{ij}^1)$ and $R^0=(r_{ij}^0)$, respectively. Slepian's lemma says that if $r_{ij}^1 \geq r_{ij}^0$ for $1
\leq i, j \leq n$, the lower bound $\P(\xi_i \leq u \mb{for} 1 \leq i \leq n ) /\P(\eta_i \leq u \mb{for} 1 \leq i \leq n
) $ is at least $1$. In this paper an upper bound is given. The usefulness of the upper bound is justified with three concrete
applications: (i) the new law of the iterated logarithm of Erdős and Révész, (ii) the probability that a random polynomial
does not have a real zero and (iii) the random pursuit problem for fractional Brownian particles. In particular, a conjecture
of Kesten (1992) on the random pursuit problem for Brownian particles is confirmed, which leads to estimates of principal
eigenvalues.
Received: 17 October 2000 / Revised version: 30 May 2001 / Published online: 22 February 2002 相似文献
15.
设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.这改进了之前的结果. 相似文献
16.
设α是环R的一个自同态,称环R是α-斜Armendariz环,如果在R[x;α]中,(∑_(i=0)~ma_ix~i)(∑_(j=0)~nb_jx~j)=0,那么a_ia~i(b_j)=0,其中0≤i≤m,0≤j≤n.设R是α-rigid环,则R上的上三角矩阵环的子环W_n(p,q)是α~—-斜Armendariz环. 相似文献
17.
设{X_(ni):1≤i≤n,n≥1}为行间NA阵列,g(x)是R~+上指数为α的正则变化函数,r>0,m为正整数,{a_(ni):1≤i≤n,n≥1}为满足条件(?)|a_(ni)|=O((g(n))~1)的实数阵列,本文得到了使sum from n=1 to ∞n~(r-1)Pr(|■multiply from j=1 to m a_(nij) X_(nij)|>ε)<∞,■ε>0成立的条件,推广并改进了Stout及王岳宝和苏淳等的结论。 相似文献
18.
假定Γ是一个有限的、单的、无向的且无孤立点的图,G是Aut(Γ)的一个子群.如果G在Γ的边集合上传递,则称Γ是G-边传递图.我们完全分类了当G为一个有循环的极大子群的素数幂阶群时的G-边传递图.结果为:设图Γ含有一个阶为pn(p是素数,n≥2)的自同构群,且G有一个极大子群循环,则Γ是G-边传递的,当且仅当Γ同构于下列图之一1)pmK1,pn-1-m,0≤m≤n-1;2)pmK1,pn-m,0≤m≤n;3)pmKp,pn-m-1,0≤m≤n-2;4)pn-mCpm,pm≥3,m<n;5)2n-2K1,1;6)pn-1-mCpm,pm≥3,m≤n-1;7)2pn-mCpm,pm≥3,m≤n-1;8)2pn-mK1,pm,0≤m≤n;9)pn-mK1,2pm,0≤m≤n;10)pn-mK2,pm,0<m≤n;11)C(2pn-m,1,pm);12)pkC(2pm-k,1,pn-m),0<k<m,0<m≤n;13)(t-s,2m)C(2m 1/(t-s,2m),1,2n-1-m),其中0≤m≤n-1,2n-2(s-1)≡0(mod 2m),t≡1(mod 2),s(≠)t(mod 2m),1≤s≤2m,1≤t≤2n-1;14)∪p i=1 Ci p n-1,其中Ci p n-1=Ca1a1 [1 (i-1)pn-2]a 1 2[1 (i--1)p n-2]…a 1 (pn-1-1)[1 (i-1)p n-2]≌Cp n-1,i=1,2,…,p;15)∪2 i=1 Ci 2n-1,其中Ci 2n-1=Ca1a 1 [1 (i-1)(2n-2-1)]a1 2[1 (i-1)(2n-2-1)]…a1 (2n-1-1)[1 (i-1)(2n-2-1)]≌C2n-1,i=1,2. 相似文献
19.
Let G(V, E) be a unicyclic graph, Cm be a cycle of length m and Cm G, and ui ∈ V(Cm). The G - E(Cm) are m trees, denoted by Ti, i = 1, 2,..., m. For i = 1, 2,..., m, let eui be the excentricity of ui in Ti and ec = max{eui : i = 1, 2 , m}. Let κ = ec+1. Forj = 1,2,...,k- 1, let δij = max{dv : dist(v, ui) = j,v ∈ Ti}, δj = max{δij : i = 1, 2,..., m}, δ0 = max{dui : ui ∈ V(Cm)}. Then λ1(G)≤max{max 2≤j≤k-2 (√δj-1-1+√δj-1),2+√δ0-2,√δ0-2+√δ1-1}. If G ≌ Cn, then the equality holds, where λ1 (G) is the largest eigenvalue of the adjacency matrix of G. 相似文献
20.
P(t,n)和C(t,n)分别表示在阶为n的路和圈中添加t条边后得到的图的最小直径;f(t,k)表示从直径为k的图中删去t条边后得到的连通图的最大直径.这篇文章证明了t≥4且n≥5时,P(t,n)≤(n-8)/(t 1) 3;若t为奇数,则C(t,n)≤(n-8)/(t 1) 3;若t为偶数,则C(t,n)≤(n-7)/(t 2) 3.特别地,「(n-1)/5」≤P(4,n)≤「(n 3)/5」,「n/4」-1≤C(3,n)≤「n/4」.最后,证明了:若k≥3且为奇数,则f(t,k)≥(t 1)k-2t 4.这些改进了某些已知结果. 相似文献