首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Let G be a (k + 1)-graph (a hypergraph with each hyperedge of size k + 1) with n vertices and average degreee t. Assume k ? t ? n. If G is uncrowded (contains no cycle of size 2, 3, or 4) then there exists and independent set of size ck(nt)(ln t)1k.  相似文献   

2.
The absolute Kähler module Ωwn(k) of the truncated generalized Witt vectors of a field k of positive characteristic is zero if and only if k is perfect. This recovers known information on K2(k[t](tn)) with which the structure of K2(k((t))) can be studied.  相似文献   

3.
A study is made of the number of cycles of length k which can be produced by a general n-stage feedback shift register. This problem is equivalent to finding the number of cycles of length k on the so-called de Bruijn-Good graph (Proc. K. Ned. Akad. Wet.49 (1946), 758–764; J. London Math. Soc.21 (3) (1946), 169–172). The number of cycles of length k in such a graph is denoted by β(n, k). From the-de Bruijn-Good graph, it can be shown that β(n, k) is also the number of cyclically distinct binary sequences of length k which have all k successive sets of n adjacent digits (called “n windows”) distinct (the sequence to be considered cyclically). After listing some known results for β(n, k), we show that
β(k?3, k)=β(k, k)?2φk, 2+2 fork?5
, where φk, r? the number of integers l ? k such that (k, l) ? r, and (k, l) denotes the greatest common divisor of k and l. From the results of several computer programs, it is conjectured that
β(k?4, k)=β(k, k)?4φk, 3?2(k, 2)+10 (k?8)
,
β(k?5, k)=β(k, k)?8φk, 4?(k, 3)+19 (k?11)
β(k?6, k)=β(k, k)?16φk, 5?4(k, 2)?2(k, 3)+48 (k?15)
  相似文献   

4.
The path-connectivity of a graph G is the maximal k for which between any k pairs of vertices there are k edge-disjoint paths (one between each pair). An upper bound for the path-connectivity of nq(q<1) separable graphs [6] is shown to exist.If the edge-connectivity of a graph is KE then between any two pairs of vertices and for every t?KE there exists a t?t′?t+1 such that there are t′ paths between the first pair and KE?t′ between the second pair. All paths are edge-disjoint.  相似文献   

5.
Let fk(n) denote the maximum of k-subsets of an n-set satisfying the condition in the title. It is proven that f2t ? 1(n) ? f2t(n + 1) ? (tn)(t2t?1) with equalities holding iff there exists a Steiner-system S(t, 2t ? 1, n). The bounds are approximately best possile for k ? 6 and of correct order of magnitude for k >/ 7, as well, even if the corresponding Steiner-systems do not exist.Exponential lower and upper bounds are obtained for the case if we do not put size restrictions on the members of the family (i.e., the nonuniform case).  相似文献   

6.
7.
8.
Given k directed graphs G1,…,Gk the Ramsey number R(G1,…, Gk) is the smallest integer n such that for any partition (U1,…,Uk) of the arcs of the complete symmetric directed graph Kn, there exists an integer i such that the partial graph generated by U1 contains G1 as a subgraph. In the article we give a necessary and sufficient condition for the existence of Ramsey numbers, and, when they exist an upper bound function. We also give exact values for some classes of graphs. Our main result is: R(Pn,….Pnk-1, G) = n1…nk-1 (p-1) + 1, where G is a hamltonian directed graph with p vertices and Pni denotes the directed path of length nt  相似文献   

9.
This paper treats the class of sequences {an} that satisfy the recurrence relation
a2n+1=∑k=0n(?1)k(nkakdn?k
between the odd and even terms of {an} that involves the coefficients of tan(t), namely
a2n+1=∑k=0n(?1)k(2n+12k+1)Tk(d/2)2k+1a2n?2k
A combinatorial setting is then provided to elucidate the appearance of the tangent coefficients in this equation.  相似文献   

10.
A simple proof is given for the fact that the number of nonsingular similarity relations on {1, 2,… n}, for which the transitive closure of k blocks, equals (2n?2k?1n?1) ?(2n?2k?1n)1 ? k ? n > ?2. In particular, this implies a recent result of Shapiro about Catalan numbers and Fine's sequence.  相似文献   

11.
Upper bounds are found for the Ramsey function. We prove R(3, x) < cx2lnx and, for each k ? 3, R(k, x) < ckxk ? 1(ln x)k ? 2 asymptotically in x.  相似文献   

12.
According to a result of A. Ghizzetti, for any solution y(t) of the differential equation where y(n)(t)+ i=0n?1 gi(t) yi(t)=0 (t ? 1), 1 ¦gi(x)¦xn?I?1 dx < ∞ (0 ?i ? n ?1, either y(t) = 0 for t ? 1 or there is an integer r with 0 ? r ? n ? 1 such that limt → ∞ y(t)tr exists and ≠0. Related results are obtained for difference and differential inequalities. A special case of the former has interesting applications in the study of orthogonal polynomials.  相似文献   

13.
The author discusses the best approximate solution of the functional differential equation x′(t) = F(t, x(t), x(h(t))), 0 < t < l satisfying the initial condition x(0) = x0, where x(t) is an n-dimensional real vector. He shows that, under certain conditions, the above initial value problem has a unique solution y(t) and a unique best approximate solution p?k(t) of degree k (cf. [1]) for a given positive integer k. Furthermore, sup0?t?l ¦ p?k(t) ? y(t)¦ → 0 as k → ∞, where ¦ · ¦ is any norm in Rn.  相似文献   

14.
It is shown that if A?Ωn?{Jn} satisfies
nkσk(A)?(n?k+1)2 σk?1(A)
(k=1,2,…,n)
, where σk(A) denotes the sum of all kth order subpermanent of A, then Per[λJn+(1?λ)A] is strictly decreasing in the interval 0<λ<1.  相似文献   

15.
Let Ω be a simply connected domain in the complex plane, and A(Ωn), the space of functions which are defined and analytic on Ωn, if K is the operator on elements u(t, a1, …, an) of A(Ωn + 1) defined in terms of the kernels ki(t, s, a1, …, an) in A(Ωn + 2) by Ku = ∑i = 1naitk i(t, s, a1, …, an) u(s, a1, …, an) ds ? A(Ωn + 1) and I is the identity operator on A(Ωn + 1), then the operator I ? K may be factored in the form (I ? K)(M ? W) = (I ? ΠK)(M ? ΠW). Here, W is an operator on A(Ωn + 1) defined in terms of a kernel w(t, s, a1, …, an) in A(Ωn + 2) by Wu = ∝antw(t, s, a1, …, an) u(s, a1, …, an) ds. ΠW is the operator; ΠWu = ∝an ? 1w(t, s, a1, …, an) u(s, a1, …, an) ds. ΠK is the operator; ΠKu = ∑i = 1n ? 1aitki(t, s, a1, …, an) ds + ∝an ? 1tkn(t, s, a1, …, an) u(s, a1, …, an) ds. The operator M is of the form m(t, a1, …, an)I, where m ? A(Ωn + 1) and maps elements of A(Ωn + 1) into itself by multiplication. The function m is uniquely derived from K in the following manner. The operator K defines an operator K1 on functions u in A(Ωn + 2), by K1u = ∑i = 1n ? 1ait ki(t, s, a1, …, an) u(s, a, …, an + 1) ds + ∝an + 1t kn(t, s, a1, …, an) u((s, a1, …, an + 1) ds. A determinant δ(I ? K1) of the operator I ? K1 is defined as an element m1(t, a1, …, an + 1) of A(Ωn + 2). This is mapped into A(Ωn + 1) by setting an + 1 = t to give m(t, a1, …, an). The operator I ? ΠK may be factored in similar fashion, giving rise to a chain factorization of I ? K. In some cases all the matrix kernels ki defining K are separable in the sense that ki(t, s, a1, …, an) = Pi(t, a1, …, an) Qi(s, a1, …, an), where Pi is a 1 × pi matrix and Qi is a pi × 1 matrix, each with elements in A(Ωn + 1), explicit formulas are given for the kernels of the factors W. The various results are stated in a form allowing immediate extension to the vector-matrix case.  相似文献   

16.
17.
It is proved that Wigner's semicircle law for the distribution of eigenvalues of random matrices, which is important in the statistical theory of energy levels of heavy nuclei, possesses the following completely deterministic version. Let An=(aij), 1?i, ?n, be the nth section of an infinite Hermitian matrix, {λ(n)}1?k?n its eigenvalues, and {uk(n)}1?k?n the corresponding (orthonormalized column) eigenvectors. Let v1n=(an1,an2,?,an,n?1), put
Xn(t)=[n(n-1)]-12k=1[(n-1)t]|vn1uf(n-1)|2,0?t?1
(bookeeping function for the length of the projections of the new row v1n of An onto the eigenvectors of the preceding matrix An?1), and let finally
Fn(x)=n-1(number of λk(n)?xn,1?k?n)
(empirical distribution function of the eigenvalues of Ann. Suppose (i) limnannn=0, (ii) limnXn(t)=Ct(0<C<∞,0?t?1). Then
Fn?W(·,C)(n→∞)
,where W is absolutely continuous with (semicircle) density
w(x,C)=(2Cπ)-1(4C-x212for|x|?2C0for|x|?2C
  相似文献   

18.
We suppose that K is a countable index set and that Λ = {λk¦ k ? K} is a sequence of distinct complex numbers such that E(Λ) = {eλkt¦ λk ? Λ} forms a Riesz (strong) basis for L2[a, b], a < b. Let Σ = {σ1, σ2,…, σm} consist of m complex numbers not in Λ. Then, with p(λ) = Πk = 1m (λ ? σk), E(Σ ∪ Λ) = {eσ1t…, eσmt} ∪ {eλktp(λk)¦ k ? K} forms a Riesz (strong) bas Sobolev space Hm[a, b]. If we take σ1, σ2,…, σm to be complex numbers already in Λ, then, defining p(λ) as before, E(Λ ? Σ) = {p(λk) eλkt¦ k ? K, λk ≠ σj = 1,…, m} forms a Riesz (strong) basis for the space H?m[a, b]. We also discuss the extension of these results to “generalized exponentials” tneλkt.  相似文献   

19.
Given a set S of positive integers let ZkS(t) denote the number of k-tuples 〈m1, …, mk〉 for which mi ∈ S ? [1, t] and (m1, …, mk) = 1. Also let PkS(n) denote the probability that k integers, chosen at random from S ? [1, n], are relatively prime. It is shown that if P = {p1, …, pr} is a finite set of primes and S = {m : (m, p1pr) = 1}, then ZkS(t) = (td(S))k Πν?P(1 ? 1pk) + O(tk?1) if k ≥ 3 and Z2S(t) = (td(S))2 Πp?P(1 ? 1p2) + O(t log t) where d(S) denotes the natural density of S. From this result it follows immediately that PkS(n) → Πp?P(1 ? 1pk) = (ζ(k))?1 Πp∈P(1 ? 1pk)?1 as n → ∞. This result generalizes an earlier result of the author's where P = ? and S is then the whole set of positive integers. It is also shown that if S = {p1x1prxr : xi = 0, 1, 2,…}, then PkS(n) → 0 as n → ∞.  相似文献   

20.
We prove that the pure global dimension of a polynomial ring over an integral domain k in a finite or countable number n?2 of commuting (non-commuting, resp.) variables is t + 1, provided |k| = ?t. As an application, we determine the pure global dimension of wild algebras of quiver type, also (in case k is an algebraically closed field) of the wild local and wild commutative algebras of finite k-dimension.  相似文献   

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

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