首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
Zarankiewicz (Colloq. Math.2 (1951), 301) raised the following problem: Determine the least positive integer z(m, n, j, k) such that each 0–1-matrix with m rows and n columns containing z(m, n, j, k) ones has a submatrix with j rows and k columns consisting entirely of ones. This paper improves a result of Hylten-Cavallius (Colloq. Math.6 (1958), 59–65) who proved: [k2]12 ? limn→∞inf z(n, n, 2, k)n?32 ? limn→∞sup z(n, n, 2, k)n?32 ? (k ? 1)12. We prove that limn→∞ z(n, n, 2, k)n?32 exists and is equal to (k ? 1)12. For the special case where k = 2 resp. k = 3 this result was proved earlier by Kövari, Sos and Turan (Colloq. Math.3 (1954), 50–57) resp. Hylten-Cavallius.  相似文献   

2.
Let τ: [0, 1] → [0, 1] possess a unique invariant density f1. Then given any ? > 0, we can find a density function p such that ∥ p ? f1 ∥ < ?, and p is the invariant density of the stochastic difference equation xn + 1 = τ(xn) + W, where W is a random variable. It follows that for all starting points x0 ? [0, 1], limn→∞(1n)i = 0n ? 1 χB(xi) = ∝B p(ξ) dξ.  相似文献   

3.
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
  相似文献   

4.
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.  相似文献   

5.
For a(1) ? a(2) ? ··· ? a(n) ? 0, b(1) ? b(2) ? ··· ? b(n) ? 0, the ordered values of ai, bi, i = 1, 2,…, n, m fixed, m ? n, and p ? 1 it is shown that
1naibi ? 1map(i)1p1m?k?1 bq(i)+bq[m?k](k+1)qp1q
where 1p + 1q = 1, b[j] = b(j) + b(j + 1) + ··· + b(n), and k is the integer such that b(m ? k ? 1) ? b[m ? k](k + 1) and b(m ? k) < b[m ? k + 1]k. The inequality is shown to be sharp. When p < 1 and a(i)'s are in increasing order then the inequality is reversed.  相似文献   

6.
In this paper we obtain a growth relation for entire functions of qth order with respect to the distribution of its zeros. We also derive certain relations between the qth convergence exponents of two or more entire functions. The most striking result of the paper is: If f(z) has at least one zero, then
lim supr→∞log n(r)log[q+1]r=?(q)
, where n(r) is the number of zeros of f(z) in ¦z¦ ? r and
?(q)=g.l.b.α:α>0 and n=1(log[q]rn)<∞
.  相似文献   

7.
Here it is proved that a cyclic (n, k) code over GF(q) is equidistant if and only if its parity check polynomial is irreducible and has exponent e = (qk ? 1)a where a divides q ? 1 and (a, k) = 1. The length n may be any multiple of e. The proof of this theorem also shows that if a cyclic (n,k) code over GF(q) is not a repetition of a shorter code and the average weight of its nonzero code words is integral, then its parity check polynomial is irreducible over GF(q) with exponent n = (qk ? 1)a where a divides q ? 1.  相似文献   

8.
Let V be a set of n points in Rk. Let d(V) denote the diameter of V, and l(V) denote the length of the shortest circuit which passes through all the points of V. (Such a circuit is an “optimal TSP circuit”.) lk(n) are the extremal values of l(V) defined by lk(n)=max{l(V)|VVnk}, where Vnk={V|V?Rk,|V|=n, d(V)=1}. A set VVnk is “longest” if l(V)=lk(n). In this paper, first some geometrical properties of longest sets in R2 are studied which are used to obtain l2(n) for small n′s, and then asymptotic bounds on lk(n) are derived. Let δ(V) denote the minimal distance between a pair of points in V, and let: δk(n)=max{δ(V)|VVnk}. It is easily observed that δk(n)=O(n?1k). Hence, ck=lim supn→∞δk(n)n1k exists. It is shown that for all n, ckn?1k≤δk(n), and hence, for all n, lk(n)≥ ckn1?1k. For k=2, this implies that l2(n)≥(π212)14n12, which generalizes an observation of Fejes-Toth that limn→∞l2(n)n?12≥(π212)14. It is also shown that lk(n) ≤ [(3?√3)k(k?1)]nδk(n) + o(n1?1k) ≤ [(3?√3)k(k?1)]n1?1k + o(n1?1k). The above upper bound is used to improve related results on longest sets in k-dimensional unit cubes obtained by Few (Mathematika2 (1955), 141–144) for almost all k′s. For k=2, Few's technique is used to show that l2(n)≤(πn2)12 + O(1).  相似文献   

9.
In this paper, the problem of phase reconstruction from magnitude of multidimensional band-limited functions is considered. It is shown that any irreducible band-limited function f(z1…,zn), zi ? C, i=1, …, n, is uniquely determined from the magnitude of f(x1…,xn): | f(x1…,xn)|, xi ? R, i=1,…, n, except for (1) linear shifts: i(α1z1+…+αn2n+β), β, αi?R, i=1,…, n; and (2) conjugation: f1(z11,…,zn1).  相似文献   

10.
Chebyshev has noticed a certain predominance of primes of the form 4n + 3 over those of the form 4n + 1. He asserted that limx→∞p > 2 (?1)(p ? 1)2e?px = ?∞. This was unproven until today. G. H. Hardy, J. E. Littlewood and E. Landau have shown its equivalence with an analogue to the famous Riemann hypothesis, namely, L(s, χ1mod 4) ≠ 0, Re(s) >12. S. Knapowski and P. Turán have given some similar (unproven) relations, e.g., limx→∞p > 2(?1)(p ? 1)2logpe?log2(px) = ?∞, which are also equivalent to the above. Using Explixit Formulas the author shows that
limx→∞p > 2(?1)(p ? 1)2logpp?12e?(log2p)x = ?∞ (1)
holds without any conjecture. (In addition, the order of magnitude of divergence is calculated.) It turns out that (1) is only a special case (in several respects). At first, it may be enlarged into
limx→∞p > 2(?1)(p ? 1)2logppe?(log2p)x) = ?∞, 0?α?12.
Then, it can be generalised to a wider class of progressions. For example, the same is true if one sums over the primes in the classes 3n + 2 and 3n + 1, with a “?” and a “+” sign, respectively. All results of this type depend on the location of the first nontrivial zero of the corresponding L-series. D. Shanks has given some arguments for the predominance of primes in residue classes of nonquadratic type. He conjectured “If m1 mod k is a quadratic residue and m2 mod k a non-residue, then there are “more” primes congruent m2 than congruent m1 mod k.” This indeed turns out to be true in the sense of (1), not only for k = 3, 4, but for some higher moduli as well. Finally, numerical calculations were made to investigate the behaviour of Δ3(X) ? π(X, 2 mod 3) ? π(X, 1 mod 3) in the interval 2 ≤ X ≤ 18, 633, 261. No zero was found in this range. In the analogue case of Δ4(X) ? π(X, 3 mod 4) ? π(X, 1 mod 4) the first sign change occurs at X = 26, 861.  相似文献   

11.
If r, k are positive integers, then Tkr(n) denotes the number of k-tuples of positive integers (x1, x2, …, xk) with 1 ≤ xin and (x1, x2, …, xk)r = 1. An explicit formula for Tkr(n) is derived and it is shown that limn→∞Tkr(n)nk = 1ζ(rk).If S = {p1, p2, …, pa} is a finite set of primes, then 〈S〉 = {p1a1p2a2psas; piS and ai ≥ 0 for all i} and Tkr(S, n) denotes the number of k-tuples (x1, x3, …, xk) with 1 ≤ xin and (x1, x2, …, xk)r ∈ 〈S〉. Asymptotic formulas for Tkr(S, n) are derived and it is shown that limn→∞Tkr(S, n)nk = (p1 … pa)rkζ(rk)(p1rk ? 1) … (psrk ? 1).  相似文献   

12.
An n-tournament is a complete labelled digraph on n vertices without loops or multiple arcs. A tournament's score sequence is the sequence of the out-degrees of its vertices arranged in nondecreasing order. The number Sn of distinct score sequences arising from all possible n-tournaments, as well as certain generalizations are investigated. A lower bound of the form
Sn > C14nn52
(C1 a constant) and an upper bound of the form Sn < C24nn2 are proved. A q-extension of the Catalan numbers
c1(q)=1 and cn(q)=i?1n?1ci(q)cn?1(q)qi(n?i?1)
is defined. It is conjectured that all coefficients in the polynomial Cn(q) are at most O(4nn3). It is shown that if this conjecture is true, then
Sn<C34nn52
  相似文献   

13.
A single serving queueing model is studied where potential customers are discouraged at the rate λn = λqn, 0 < q < 1, n is the queue length. The serving rate is μn = μ(1 ? qn), n = 0, 1,…. The spectral function is computed and the corresponding set of orthogonal polynomials is studied in detail. The slightly more general model with λn = λqn(1 + bqn), μn = μ(1 ? qn)(1 + bqn) and the analogous orthogonal polynomials are also investigated. In both cases a method developed by Pollaczek is used which has been used very successfully to study new sets of orthogonal polynomials by Askey and Ismail.  相似文献   

14.
Real constant coefficient nth order elliptic operators, Q, which generate strongly continuous semigroups on L2(Rk) are analyzed in terms of the elementary generator,
A = (?n)(n2 ? 1)(n!)?1kj = 1?n?xjn
, for n even. Integral operators are defined using the fundamental solutions pn(x, t) to ut = Au and using real polynomials ql,…, qk on Rm by the formula, for q = (ql,…, qk),
(F(t)?)(x) = ∫
Rm
?(x + q(z)) Pn(z, t)dz
. It is determined when, strongly on L2(Rk),
etQ = limj → ∞ Ftjj
. If n = 2 or k = 1, this can always be done. Otherwise the symbol of Q must have a special form.  相似文献   

15.
A construction is given for difference sets in certain non-cyclic groups with the parameters v = qs+1{[(qs+1 ? 1)(q ? 1)] + 1}, k = qs(qs+1 ? 1)(q ? 1), λ = qs(qs ? 1)(q ? 1), n = q2s for every prime power q and every positive integer s. If qs is odd, the construction yields at least 12(qs + 1) inequivalent difference sets in the same group. For q = 5, s = 2 a difference set is obtained with the parameters (v, k, λ, n) = (4000, 775, 150, 625), which has minus one as a multiplier.  相似文献   

16.
Using results from the theory of B-splines, various inequalities involving the nth order divided differences of a function f with convex nth derivative are proved; notably, f(n)(z)n! ? [x0,…, xn]f ? i = 0n(f(n)(xi)(n + 1)!), where z is the center of mass (1(n + 1))i = 0nxi.  相似文献   

17.
We prove a Szegö-type theorem for some Schrödinger operators of the form H = ?1 + V with V smooth, positive and growing like V0¦x¦k, k > 0. Namely, let πλ be the orthogonal projection of L2 onto the space of the eigenfunctions of H with eigenvalue ?λ; let A be a 0th order self-adjoint pseudo-differential operator relative to Beals-Fefferman weights ?(x, ξ) = 1, Φ(x, ξ) = (1 + ¦ξ¦2 + V(x))12 and with total symbol a(x, ξ); and let fC(R). Then
limλ→∞1rankπλtrf(πλλ)=limλ→∞1vol(H(x, ξ)?λ)H?λf(a(x, ξ))dxdξ
(assuming one limit exists).  相似文献   

18.
Let Cn×n and Hn denote respectively the space of n×n complex matrices and the real space of n×n hermitian matrices. Let p,q,n be positive integers such that p?q?n. For A?Cn×n, the (p,q)-numerical range of A is the set
Wp,q(A)={trCp(JqUAU1):U unitary}
, where Cp(X) is the pth compound matrix of X, and Jq is the matrix Iq?On-q. Let L denote Hn or Cn×n. The problem of determining all linear operators T: LL such that
Wp,q(T(A))=Wp,q(A) for all A?L
is treated in this paper.  相似文献   

19.
It is known that the classical orthogonal polynomials satisfy inequalities of the form Un2(x) ? Un + 1(x) Un ? 1(x) > 0 when x lies in the spectral interval. These are called Turan inequalities. In this paper we will prove a generalized Turan inequality for ultraspherical and Laguerre polynomials. Specifically if Pnλ(x) and Lnα(x) are the ultraspherical and Laguerre polynomials and Fnλ(x) = Pnλ(x)Pnλ(1), Gnα(x) = Lnα(x)Lnα(0), then Fnα(x) Fnβ(x) ? Fn + 1α(x) Fn ? 1β(x) > 0, ? 1 < x < 1, ?12 < α ? β ? α + 1 and Gnα(x) Gnβ(x) ? Gn + 1α(x) Gn ? 1β(x) > 0, x > 0, 0 < α ? β ? α + 1. We also prove the inequality (n + 1) Fnα(x) Fnβ(x) ? nFn + 1α(x) Fn ? 1β(x) > An[Fnα(x)]2, ?1 < x < 1, ?12 < α ? β < α + 1, where An is a positive constant depending on α and β.  相似文献   

20.
Presented in this report are two further applications of very elementary formulae of approximate differentiation. The first is a new derivation in a somewhat sharper form of the following theorem of V. M. Olovyani?nikov: LetNn (n ? 2) be the class of functionsg(x) such thatg(x), g′(x),…, g(n)(x) are ? 0, bounded, and nondecreasing on the half-line ?∞ < x ? 0. A special element ofNnis
g1(x) = 0 if ?∞ < x < ?1, g1(x) = (1 + x)nif ?1 ? x ? 0
. Ifg(x) ∈ Nnis such that
g(0) ? g1(0) = 1, g(n)(0) ? g1(n)(0) = n!
, then
g(v)(0) ? g1(v)(0)
for
1v = 1,…, n ? 1
. Moreover, if we have equality in (1) for some value of v, then we have there equality for all v, and this happens only if g(x) = g1(x) in (?∞, 0].The second application gives sufficient conditions for the differentiability of asymptotic expansions (Theorem 4).  相似文献   

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

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