首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 140 毫秒
1.
In the preceding papers [H. Hamanaka, A. Kono, On [X,U(n)], when dimX is 2n, J. Math. Kyoto Univ. 43 (2) (2003) 333-348; H. Hamanaka, On [X,U(n)], when dimX is 2n+1, J. Math. Kyoto Univ. 44 (3) (2004) 655-667; H. Hamanaka, Adams e-invariant, Toda bracket and [X,U(n)], J. Math. Kyoto Univ. 43 (4) (2003) 815-828], the group structure of the homotopy set [X,U(n)] with the pointwise multiplication is studied, where X is a finite CW-complex and U(n) is the unitary group. It is seen that nil[X,U(n)]=2 for some X with its dimension 2n, and, when dimX=2n+1 and n is even, [X,U(n)] is expressed as the two stage central extension of an Abelian group, i.e., nil[X,U(n)]?3.In this paper, we consider the nilpotency class of [X,U(n)], especially, for given k, the maximum of the nil[X,U(n)] under the condition dimX?2n+k is estimated and determined for k=0,1,2.  相似文献   

2.
A sequence of prime numbers p1,p2,p3,…, such that pi=2pi−1+? for all i, is called a Cunningham chain of the first or second kind, depending on whether ?=1 or −1 respectively. If k is the smallest positive integer such that 2pk+? is composite, then we say the chain has length k. It is conjectured that there are infinitely many Cunningham chains of length k for every positive integer k. A sequence of polynomials f1(x),f2(x),… in Z[x], such that f1(x) has positive leading coefficient, each fi(x) is irreducible in Q[x] and fi(x)=xfi−1(x)+? for all i, is defined to be a polynomial Cunningham chain of the first or second kind, depending on whether ?=1 or −1 respectively. If k is the least positive integer such that fk+1(x) is reducible in Q[x], then we say the chain has length k. In this article, for polynomial Cunningham chains of both kinds, we prove that there are infinitely many chains of length k and, unlike the situation in the integers, that there are infinitely many chains of infinite length, by explicitly giving infinitely many polynomials f1(x), such that fk+1(x) is the only term in the sequence that is reducible.  相似文献   

3.
In a seminal paper, Erd?s and Rényi identified a sharp threshold for connectivity of the random graph G(n,p). In particular, they showed that if p?logn/n then G(n,p) is almost always connected, and if p?logn/n then G(n,p) is almost always disconnected, as n.The clique complexX(H) of a graph H is the simplicial complex with all complete subgraphs of H as its faces. In contrast to the zeroth homology group of X(H), which measures the number of connected components of H, the higher dimensional homology groups of X(H) do not correspond to monotone graph properties. There are nevertheless higher dimensional analogues of the Erd?s-Rényi Theorem.We study here the higher homology groups of X(G(n,p)). For k>0 we show the following. If p=nα, with α<−1/k or α>−1/(2k+1), then the kth homology group of X(G(n,p)) is almost always vanishing, and if −1/k<α<−1/(k+1), then it is almost always nonvanishing.We also give estimates for the expected rank of homology, and exhibit explicit nontrivial classes in the nonvanishing regime. These estimates suggest that almost all d-dimensional clique complexes have only one nonvanishing dimension of homology, and we cannot rule out the possibility that they are homotopy equivalent to wedges of a spheres.  相似文献   

4.
Let A be an n-square normal matrix over C, and Qm, n be the set of strictly increasing integer sequences of length m chosen from 1,…, n. For α,βQm, n denote by A[α|β] the submatrix obtained from A by using rows numbered α and columns numbered β. For k∈{0,1,…,m} write z.sfnc;αβ|=k if there exists a rearrangement of 1,…,m, say i1,…,ik, ik+1,…,im, such that α(ij)=β(ij), j=1,…,k, and {α(ik+1),…,α(im)};∩{β(ik+1),…,β(im)}=ø. Let
be the group of n-square unitary matrices. Define the nonnegative number
?k(A)= maxU∈|det(U1AU) [α|β]|
, where |αβ|=k. Theorem 1 establishes a bound for ?k(A), 0?k<m?1, in terms of a classical variational inequality due to Fermat. Let A be positive semidefinite Hermitian, n?2m. Theorem 2 leads to an interlacing inequality which, in the case n=4, m=2, resolves in the affirmative the conjecture that
?m(A)??m?1(A)????0(A)
.  相似文献   

5.
Let k,n be integers with 2≤kn, and let G be a graph of order n. We prove that if max{dG(x),dG(y)}≥(nk+1)/2 for any x,yV(G) with xy and xyE(G), then G has k vertex-disjoint subgraphs H1,…,Hk such that V(H1)∪?∪V(Hk)=V(G) and Hi is a cycle or K1 or K2 for each 1≤ik, unless k=2 and G=C5, or k=3 and G=K1C5.  相似文献   

6.
Denote by pk(M) or υk(M) the number of k-gonal faces or k-valent of the convex 3-polytope M, respectively. Completely solving a problem by B. Grünbaum, the following theorem is proved: Given sequences of nonnegative integers p = (p3, p4,…pm), υ = (υ3, υ4,…,υn) satisfying ∑k?3(6−k)pk + 2∑k?3(3−kk = 12, there exists a convex 3-polytope M with pk(M) = pk for all k ≠ 6 and υk for all k ≠ 3 if and only if for the sequences p, υ the following does not hold: ∑pi = 0 for i odd and ∑υi = 1 for i ? 0 (mod 3).  相似文献   

7.
An operator between Banach spaces is said to be finitely strictly singular if for every ε>0 there exists n such that every subspace EX with dimE?n contains a vector x such that ‖Tx‖<εx‖. We show that, for 1?p<q<∞, the formal inclusion operator from Jp to Jq is finitely strictly singular. As a consequence, we obtain that the strictly singular operator with no invariant subspaces constructed by C. Read is actually finitely strictly singular. These results are deduced from the following fact: if k?n then every k-dimensional subspace of Rn contains a vector x with ‖x?=1 such that xmi=i(−1) for some m1<?<mk.  相似文献   

8.
We construct the first known complex-valued harmonic morphisms from the non-compact Lie groups SLn(R), SU(2n) and Sp(n,R) equipped with their standard Riemannian metrics. We then introduce the notion of a bi-eigenfamily and employ this to construct the first known solutions on the non-compact Riemannian SO(2n), SO(p,q), SU(p,q) and Sp(p,q). Applying a duality principle we then show how to manufacture the first known complex-valued harmonic morphisms from the compact Lie groups SO(n), SU(n) and Sp(n) equipped with semi-Riemannian metrics.  相似文献   

9.
A Hilbert bundle (p, B, X) is a type of fibre space p:BX such that each fibre p?1(x) is a Hilbert space. However, p?1(x) may vary in dimension as x varies in X. We generalize the classical homotopy classification theory of vector bundles to a “homotopy” classification of certain Hilbert bundles. An (m, n)-bundle over the pair (X, A) is a Hilbert bundle (p, B, X) such that the dimension of p?1(x) is m for x in A and n otherwise. The main result here is that if A is a compact set lying in the “edge” of the metric space X (e.g. if X is a topological manifold and A is a compact subset of the boundary of X), then the problem of classifying (m, n)-bundles over (X, A) reduces to a problem in the classical theory of vector bundles. In particular, we show there is a one-to-one correspondence between the members of the orbit set, [A, Gm(Cn)]/[X, U(n)] ¦ A, and the isomorphism classes of (m, n)-bundles over (X, A) which are trivial over X, A.  相似文献   

10.
Let Fn be a binary form with integral coefficients of degree n?2, let d denote the greatest common divisor of all non-zero coefficients of Fn, and let h?2 be an integer. We prove that if d=1 then the Thue equation (T) Fn(x,y)=h has relatively few solutions: if A is a subset of the set T(Fn,h) of all solutions to (T), with r:=card(A)?n+1, then
(#)
h divides the numberΔ(A):=1?k<l?rδ(ξk,ξl),
where ξk=〈xk,yk〉∈A, 1?k?r, and δ(ξk,ξl)=xkylxlyk. As a corollary we obtain that if h is a prime number then, under weak assumptions on Fn, there is a partition of T(Fn,h) into at most n subsets maximal with respect to condition (#).  相似文献   

11.
Jin Ho Kwak 《Discrete Mathematics》2008,308(11):2156-2166
In this paper, we classify the reflexible regular orientable embeddings and the self-Petrie dual regular orientable embeddings of complete bipartite graphs. The classification shows that for any natural number n, say (p1,p2,…,pk are distinct odd primes and ai>0 for each i?1), there are t distinct reflexible regular embeddings of the complete bipartite graph Kn,n up to isomorphism, where t=1 if a=0, t=2k if a=1, t=2k+1 if a=2, and t=3·2k+1 if a?3. And, there are s distinct self-Petrie dual regular embeddings of Kn,n up to isomorphism, where s=1 if a=0, s=2k if a=1, s=2k+1 if a=2, and s=2k+2 if a?3.  相似文献   

12.
Let V be a complex inner product space of positive dimension m with inner product 〈·,·〉, and let Tn(V) denote the set of all n-linear complex-valued functions defined on V×V×?×V (n-copies). By Sn(V) we mean the set of all symmetric members of Tn(V). We extend the inner product, 〈·,·〉, on V to Tn(V) in the usual way, and we define multiple tensor products A1A2⊗?⊗An and symmetric products A1·A2?An, where q1,q2,…,qn are positive integers and AiTqi(V) for each i, as expected. If ASn(V), then Ak denotes the symmetric product A·A?A where there are k copies of A. We are concerned with producing the best lower bounds for ‖Ak2, particularly when n=2. In this case we are able to show that ‖Ak2 is a symmetric polynomial in the eigenvalues of a positive semi-definite Hermitian matrix, MA, that is closely related to A. From this we are able to obtain many lower bounds for ‖Ak2. In particular, we are able to show that if ω denotes 1/r where r is the rank of MA, and , then
  相似文献   

13.
A sequence m1m2≥?≥mk of k positive integers isn-realizable if there is a partition X1,X2,…,Xk of the integer interval [1,n] such that the sum of the elements in Xi is mi for each i=1,2,…,k. We consider the modular version of the problem and, by using the polynomial method by Alon (1999) [2], we prove that all sequences in Z/pZ of length k≤(p−1)/2 are realizable for any prime p≥3. The bound on k is best possible. An extension of this result is applied to give two results of p-realizable sequences in the integers. The first one is an extension, for n a prime, of the best known sufficient condition for n-realizability. The second one shows that, for n≥(4k)3, an n-feasible sequence of length k isn-realizable if and only if it does not contain forbidden subsequences of elements smaller than n, a natural obstruction forn-realizability.  相似文献   

14.
For an n×n Boolean matrix R, let AR={n×n matrices A over a field F such that if rij=0 then aij=0}. We show that a collection AR〈1〉,…,ARk generates all n×n matrices over F if and only if the matrix J all of whose entries are 1 can be expressed as a Boolean product of Hall matrices from the set {R〈1〉,…,Rk〉}. We show that J can be expressed as a product of Hall matrices Ri〉 if and only if ΣRi〉?Ri〉 is primitive.  相似文献   

15.
The purpose of this paper is to study the stable extendibility of the tangent bundle τn(p) over the (2n+1)-dimensional standard lens space Ln(p) for odd prime p. We investigate for which m the tangent bundle τn(p) is stably extendible to Lm(p) but is not stably extendible to Lm+1(p), where we consider m=∞ if τn(p) is stably extendible to Lk(p) for any k?n, and determine m in the case n?p−3.  相似文献   

16.
The class of metrizable spaces M with the following approximation property is introduced and investigated: MAP(n,0) if for every ε>0 and a map g:InM there exists a 0-dimensional map g:InM which is ε-homotopic to g. It is shown that this class has very nice properties. For example, if MiAP(ni,0), i=1,2, then M1×M2AP(n1+n2,0). Moreover, MAP(n,0) if and only if each point of M has a local base of neighborhoods U with UAP(n,0). Using the properties of AP(n,0)-spaces, we generalize some results of Levin and Kato-Matsuhashi concerning the existence of residual sets of n-dimensional Lelek maps.  相似文献   

17.
For a graph G=(V(G),E(G)), a strong edge coloring of G is an edge coloring in which every color class is an induced matching. The strong chromatic index of G, χs(G), is the smallest number of colors in a strong edge coloring of G. The strong chromatic index of the random graph G(n,p) was considered in Discrete Math. 281 (2004) 129, Austral. J. Combin. 10 (1994) 97, Austral. J. Combin. 18 (1998) 219 and Combin. Probab. Comput. 11 (1) (2002) 103. In this paper, we consider χs(G) for a related class of graphs G known as uniform or ε-regular graphs. In particular, we prove that for 0<ε?d<1, all (d,ε)-regular bipartite graphs G=(UV,E) with |U|=|V|?n0(d,ε) satisfy χs(G)?ζ(ε)Δ(G)2, where ζ(ε)→0 as ε→0 (this order of magnitude is easily seen to be best possible). Our main tool in proving this statement is a powerful packing result of Pippenger and Spencer (Combin. Theory Ser. A 51(1) (1989) 24).  相似文献   

18.
Let X(i,n,m,k), i=1,…,n, be generalized order statistics based on F. For fixed rN, and a suitable counting process N(t), t>0, we mainly discuss the precise asymptotic of the generalized stochastic order statistics X(N(n)−r+1,N(n),m,k). It not only makes the results of Yan, Wang and Cheng [J.G. Yan, Y.B. Wang, F.Y. Cheng, Precise asymptotics for order statistics of a non-random sample and a random sample, J. Systems Sci. Math. Sci. 26 (2) (2006) 237-244] as the special case of our result, and presents many groups of weighted functions and boundary functions, but also permits a unified approach to several models of ordered random variables.  相似文献   

19.
We suggest a method for describing some types of degenerate orbits of orthogonal and unitary groups in the corresponding Lie algebras as level surfaces of a special collection of polynomial functions. This method allows one to describe orbits of the types SO(2n)/SO(2kSO(2) n?k , SO(2n+1)/SO(2k+1)×SO(2) n?k , and (S)U(n)/(S)(U(2kU(2) n?k ) in so(2n), so(2n+1), and (s)u(n), respectively. In addition, we show that the orbits of minimal dimensions of the groups under consideration can be described in the corresponding algebras as intersections of quadries. In particular, this approach is used for describing the orbit CP n?1?u(n).  相似文献   

20.
Using old results on the explicit calculation of determinants, formulae are given for the coefficients of P0(z) and P0(z)fi(z) ? Pi(z), where Pi(z) are polynomials of degree σ ? ρi (i=0,1,…,n), P0(z)fi(z) ? Pi(z) are power series in which the terms with zk, 0?k?σ, vanish (i=1,2,…,n), (ρ0,ρ1,…,ρn) is an (n+1)-tuple of nonnegative integers, σ=ρ0+ρ1+?+ρn, and {fi}ni=1 is the set of hypergeometric functions {1F1(1;ci;z)}ni=1(ci?Zz.drule;N, ci ? cj?Z) or {2F0(ai,1;z)}ni=1(ai ?Z?N, ai ? aj?Z) under the condition ρ0?ρi ? 1 (i=1,2,…,n).  相似文献   

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

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