首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
Suppose r∈(0,1],mN and 1?k1<k2<?<k2m+1, and let S2m+1={1,2,…,2m+1}. We show that every positive solution to the difference equation
  相似文献   

2.
Let 1 ? p ? ∞, 0 < q ? p, and A = (an,k)n,k?0 ? 0. Denote by Lp,q(A) the supremum of those L satisfying the following inequality:
  相似文献   

3.
4.
Let An,nN, be a sequence of k×k matrices which converge to a matrix A as n. It is shown that if xn,nN, is a sequence of nonnegative nonzero vectors such that
  相似文献   

5.
Let Ej be the eigenvalues outside [-2,2] of a Jacobi matrix with an-1∈?2 and bn→0, and μ the density of the a.c. part of the spectral measure for the vector δ1. We show that if bn∉?4, bn+1-bn∈?2, then
  相似文献   

6.
In this paper, we present families of quasi-convex sequences converging to zero in the circle group T, and the group J3 of 3-adic integers. These sequences are determined by increasing sequences of integers. For an increasing sequence , put gn=an+1−an. We prove that
(a)
the set {0}∪{±3−(an+1)|nN} is quasi-convex in T if and only if a0>0 and gn>1 for every nN;
(b)
the set {0}∪{±an3|nN} is quasi-convex in the group J3 of 3-adic integers if and only if gn>1 for every nN.
Moreover, we solve an open problem from [D. Dikranjan, L. de Leo, Countably infinite quasi-convex sets in some locally compact abelian groups, Topology Appl. 157 (8) (2010) 1347-1356] providing a complete characterization of the sequences such that {0}∪{±2−(an+1)|nN} is quasi-convex in T. Using this result, we also obtain a characterization of the sequences such that the set {0}∪{±2−(an+1)|nN} is quasi-convex in R.  相似文献   

7.
In this paper, we show that, for every locally compact abelian group G, the following statements are equivalent:
(i)
G contains no sequence such that {0}∪{±xnnN} is infinite and quasi-convex in G, and xn?0;
(ii)
one of the subgroups {gG∣2g=0} or {gG∣3g=0} is open in G;
(iii)
G contains an open compact subgroup of the form or for some cardinal κ.
  相似文献   

8.
Fix integers k?3 and n?3k/2. Let F be a family of k-sets of an n-element set so that whenever A,B,CF satisfy |ABC|?2k, we have ABC≠∅. We prove that with equality only when ?FFF≠∅. This settles a conjecture of Frankl and Füredi [2], who proved the result for n?k2+3k.  相似文献   

9.
Let k,m,n?2 be integers. Let A be a subset of {0,1,…,n} with 0∈A and the greatest common divisor of all elements of A is 1. Suppose that
  相似文献   

10.
11.
Our starting point is the proof of the following property of a particular class of matrices. Let T={Ti,j} be a n×m non-negative matrix such that ∑jTi,j=1 for each i. Suppose that for every pair of indices (i,j), there exists an index l such that Ti,lTj,l. Then, there exists a real vector k=(k1,k2,…,km)T,kikj,ij;0<ki?1, such that, if ij.Then, we apply that property of matrices to probability theory. Let us consider an infinite sequence of linear functionals , corresponding to an infinite sequence of probability measures {μ(·)(i)}iN, on the Borel σ-algebra such that, . The property of matrices described above allows us to construct a real bounded one-to-one piecewise continuous and continuous from the left function f such that
  相似文献   

12.
Let S={Si}iI be an arbitrary family of complex n-by-n matrices, where 1?n<∞. Let denote the joint spectral radius of S, defined as
  相似文献   

13.
Let G be a graph of order n and rank(G) denotes the rank of its adjacency matrix. Clearly, . In this paper we characterize all graphs G such that or n + 2. Also for every integer n ? 5 and any k, 0 ? k ? n, we construct a graph G of order n, such that .  相似文献   

14.
15.
Let denote the non-selfadjoint operator generated in ?2(N,E) by the matrix difference expression (?y)n=An−1yn−1+Bnyn+Anyn+1, nN, and the boundary condition y0=0. In this paper we investigate the Jost solution, the continuous spectrum, the eigenvalues and the spectral singularities of L.  相似文献   

16.
17.
Let (|q|<1). For kN it is shown that there exist k rational numbers A(k,0),…,A(k,k−1) such that
  相似文献   

18.
19.
A long-standing conjecture of Erd?s and Simonovits is that ex(n,C2k), the maximum number of edges in an n-vertex graph without a 2k-gon is asymptotically as n tends to infinity. This was known almost 40 years ago in the case of quadrilaterals. In this paper, we construct a counterexample to the conjecture in the case of hexagons. For infinitely many n, we prove that
  相似文献   

20.
Starting with vector λ=(λ(k))kZ?p(Z), the subdivision scheme generates a sequence of vectors by the subdivision operator
  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号