首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Let X1, …, Xn be n disjoint sets. For 1 ? i ? n and 1 ? j ? h let Aij and Bij be subsets of Xi that satisfy |Aij| ? ri and |Bij| ? si for 1 ? i ? n, 1 ? j ? h, (∪i Aij) ∩ (∪i Bij) = ? for 1 ? j ? h, (∪i Aij) ∩ (∪i Bil) ≠ ? for 1 ? j < l ? h. We prove that h?Πi=1nri+siri. This result is best possible and has some interesting consequences. Its proof uses multilinear techniques (exterior algebra).  相似文献   

2.
A technique for the numerical approximation of matrix-valued Riemann product integrals is developed. For a ? x < y ? b, Im(x, y) denotes
χyχv2?χv2i=1mF(νi)dν12?dνm
, and Am(x, y) denotes an approximation of Im(x, y) of the form
(y?x)mk=1naki=1mF(χik)
, where ak and yik are fixed numbers for i = 1, 2,…, m and k = 1, 2,…, N and xik = x + (y ? x)yik. The following result is established. If p is a positive integer, F is a function from the real numbers to the set of w × w matrices with real elements and F(1) exists and is continuous on [a, b], then there exists a bounded interval function H such that, if n, r, and s are positive integers, (b ? a)n = h < 1, xi = a + hi for i = 0, 1,…, n and 0 < r ? s ? n, then
χr?χs(I+F dχ)?i=rsI+j=1pIji?1i)
=hpH(χr?1s)+O(hp+1)
Further, if F(j) exists and is continuous on [a, b] for j = 1, 2,…, p + 1 and A is exact for polynomials of degree less than p + 1 ? j for j = 1, 2,…, p, then the preceding result remains valid when Aj is substituted for Ij.  相似文献   

3.
Let a complex pxn matrix A be partitioned as A′=(A1,A2,…,Ak). Denote by ?(A), A′, and A? respectively the rank of A, the transpose of A, and an inner inverse (or a g-inverse) of A. Let A(14) be an inner inverse of A such that A(14)A is a Hermitian matrix. Let B=(A(14)1,A(14)2,…,Ak(14)) and ρ(A)=i=1kρ(Ai).Then the product of nonzero eigenvalues of BA (or AB) cannot exceed one, and the product of nonzero eigenvalues of BA is equal to one if and only if either B=A(14) or Ai>Aj1=0 for all ij,i, j=1,2,…,k . The results of Lavoie (1980) and Styan (1981) are obtained as particular cases. A result is obtained for k=2 when the condition ρ(A)=i=1kρ(Ai) is no longer true.  相似文献   

4.
For an n × n Hermitean matrix A with eigenvalues λ1, …, λn the eigenvalue-distribution is defined by G(x, A) := 1n · number {λi: λi ? x} for all real x. Let An for n = 1, 2, … be an n × n matrix, whose entries aik are for i, k = 1, …, n independent complex random variables on a probability space (Ω, R, p) with the same distribution Fa. Suppose that all moments E | a | k, k = 1, 2, … are finite, Ea=0 and E | a | 2. Let
M(A)=σ=1s θσPσ(A,A1)
with complex numbers θσ and finite products Pσ of factors A and A1 (= Hermitean conjugate) be a function which assigns to each matrix A an Hermitean matrix M(A). The following limit theorem is proved: There exists a distribution function G0(x) = G1x) + G2(x), where G1 is a step function and G2 is absolutely continuous, such that with probability 1 G(x, M(Ann12)) converges to G0(x) as n → ∞ for all continuity points x of G0. The density g of G2 vanishes outside a finite interval. There are only finitely many jumps of G1. Both, G1 and G2, can explicitly be expressed by means of a certain algebraic function f, which is determined by equations, which can easily be derived from the special form of M(A). This result is analogous to Wigner's semicircle theorem for symmetric random matrices (E. P. Wigner, Random matrices in physics, SIAM Review9 (1967), 1–23). The examples ArA1r, Ar + A1r, ArA1r ± A1rAr, r = 1, 2, …, are discussed in more detail. Some inequalities for random matrices are derived. It turns out that with probability 1 the sharpened form
lim supn→∞i=1ni(n)|2?6An62? 0.8228…
of Schur's inequality for the eigenvalues λi(n) of An holds. Consequently random matrices do not tend to be normal matrices for large n.  相似文献   

5.
The Dirichlet integral provides a formula for the volume over the k-dimensional simplex ω={x1,…,xk: xi?0, i=1,…,k, s?∑k1xi?T}. This integral was extended by Liouville. The present paper provides a matrix analog where now the region becomes Ω={V1,…,Vk: Vi>0, i=1,…,k, 0?∑Vi?t}, where now each Vi is a p×p symmetric matrix and A?B means that A?B is positive semidefinite.  相似文献   

6.
A variety of systems problems give rise to special cases of the linear matrix equation
iAip×sXs×tBit×q + jCjp×tXTt×sDjs×q = Fp×q (Z)
. F(Z) may be a matrix-valued function of a matrix argument Z. It is the purpose here to summarize and extend some of the applicable solution procedures through a systematic use of operators which convert the matrix equation to vector and dimension-reduced vector forms. The format and details of the results are convenient for machine computation.  相似文献   

7.
Let X = {x1, x2,…} be a finite set and associate to every xi a real number αi. Let f(n) [g (n)] be the least value such that given any family F of subsets of X having maximum degree n [cardinality n], one can find integers αi, i=1,2,… so that αi ? αi|<1 and
xi ? Eai?xi ? Eαi≤?(n) xi ? Eai? xi ? Eαig(n)
for all E ? F. We prove
f(n)≤n ? 1 and g(n)≤c(n log n)12
.  相似文献   

8.
The fundamental theorem of the title refers to a spectral resolution for the inverse of a lambda-matrix L(λ) = i=0lAiλi where the Ai are n×n complex matrices and detAl ≠ 0. In this paper general solutions are formulated for difference equations of the form i=0lAiur + i = ?γ, r = 1, 2,…. The use of these solutions is illustrated i new proof of Franklin's results describing the sums of powers of the eigenvalues of L(λ) (the generalized Newton identities), and in obtaining convergence proofs for the application of Bernoulli's method to the solution of i=0lAiSi = 0 for matrix S.  相似文献   

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

10.
Gauss's (2n+1)-point trigonometric interpolation formula, based upon f(xi), i = 1(1)2n+1, gives a trigonometric sum of the nth order, S2n+1(x = a0 + ∑jn = 1(ajcos jx + bjsin jx), which may be integrated to provide formulas for either direct quadrature or stepwise integration of differential equations having periodic (or near-periodic) solutions. An “orthogonal” trigonometric sum S2r+1(x) is one that satisfies
abS2r+1(x)S2r′+1(x)dx=0, r′<r
and two other arbitrarily imposable conditions needed to make S2r1(x) unique. Two proofs are given of a fundamental factor theorem for any S2n+1(x) (somewhat different from that for polynomials) from which we derive 2r-point Gaussian-type quadrature formulas, r = [n/2] + 1, which are exact for any S4r?1(x). We have
abS4r?1(x)dx=∑j=12rAjS4r?1(xj)
where the nodes xj, j = 1(1)2r, are the zeros of the orthogonal S2r+1(x). It is proven that Aj > 0 and that 2r-1 of the nodes must lie within the interval [a,b], and the remaining node (which may or may not be in [a,b]) must be real. Unlike Legendre polynomials, any [a′,b′] other than a translation of [a,b], requires different and unrelated sets of nodes and weights. Gaussian-type quadrature formulas are applicable to the numerical integration of the Gauss (2n+1)-point interpolation formulas, with extra efficiency when the latter are expressed in barycentric form. S2r+1(x), xjandAj, j = 1(1)2r, were calculated for [a,b] = [0, π/4], 2r = 2 and 4, to single-precision accuracy.  相似文献   

11.
Let ρ21,…,ρ2p be the squares of the population canonical correlation coefficients from a normal distribution. This paper is concerned with the estimation of the parameters δ1,…,δp, where δi = ρ2i(1 ? ρ2i), i = 1,…,p, in a decision theoretic way. The approach taken is to estimate a parameter matrix Δ whose eigenvalues are δ1,…,δp, given a random matrix F whose eigenvalues have the same distribution as r2i(1 ? r2i), i = 1,…,p, where r1,…,rp are the sample canonical correlation coefficients.  相似文献   

12.
Let π = (a1, a2, …, an), ? = (b1, b2, …, bn) be two permutations of Zn = {1, 2, …, n}. A rise of π is pair ai, ai+1 with ai < ai+1; a fall is a pair ai, ai+1 with ai > ai+1. Thus, for i = 1, 2, …, n ? 1, the two pairs ai, ai+1; bi, bi+1 are either both rises, both falls, the first a rise and the second a fall or the first a fall and the second a rise. These possibilities are denoted by RR, FF, RF, FR. The paper is concerned with the enumeration of pairs π, p with a given number of RR, FF, RF, FR. In particular if ωn denotes the number of pairs with RR forbidden, it is proved that 0ωnznn!n! = 1?(z), ?(z) = ∑0(-1) nznn!n!. More precisely if ω(n, k) denotes the number of pairs π, p with exactly k occurences of RR(or FF, RF, FR) then 1 + ∑n=1znn!n!n?1k=0 ω(n, k)xk = (1 ? x)(?(z(1 ? x)) ? x).  相似文献   

13.
Let g = (g1,…,gr) ≥ 0 and h = (h1,…,hr) ≥ 0, g?, h?J, be two vectors of nonnegative integers and let λ ? J, λ ≥ 0, λ ≡ 0 mod d, where d denotes g.c.d. (g1,…,gr). Define
Δ(λ)=Δ(λg,h):=min?=1rx?h?:x??0,x?∈J,?=1?x?g?
It is shown in this paper that Λ(λ) is periodic in λ with constant jump. If i? {1,…,r} is such that
detgihig?h?? (?1,…r)
then
Δ(λ)+giΔ(λ)+hi
holds true for all sufficiently large λ, λ ≡ 0 mod d.  相似文献   

14.
Let n1+n2+?+nm=n where the ni's are integers (possibly negative or greater than n). Let p=(k1,…,km), where k1+k2+?+km=k, be a partition of the nonnegative integer k into m nonnegative integers and let P denote the set of all such partitions. For m?2, we prove the combinatorial identity
p∈Pi=1mni+1?kiki=i?0j+m?2m?2n+1?k?2jk?2j
which implies the surprising result that the left side of the above equation depends on n but not on the ni's.  相似文献   

15.
Optimization problems are connected with maximization of three functions, namely, geometric mean, arithmetic mean and harmonic mean of the eigenvalues of (XΣX)?1ΣY(YΣY)?1YΣX, where Σ is positive definite, X and Y are p × r and p × s matrices of ranks r and s (≥r), respectively, and XY = 0. Some interpretations of these functions are given. It is shown that the maximum values of these functions are obtained at the same point given by X = (h1 + ?1hp, …, hr + ?rhp?r+1) and Y = (h1 ? ?1hp, …, hr ? ?rhp?r+1, Yr+1, …, Ys), where h1, …, hp are the eigenvectors of Σ corresponding to the eigenvalues λ1 ≥ λ2 ≥ … ≥ λp > 0, ?j = +1 or ?1 for j = 1,2,…, r and Yr+1, …, Ys, are linear functions of hr+1,…, hp?r. These results are extended to intermediate stationary values. They are utilized in obtaining the inequalities for canonical correlations θ1,…,θr and they are given by expressions (3.8)–(3.10). Further, some new union-intersection test procedures for testing the sphericity hypothesis are given through test statistics (3.11)–(3.13).  相似文献   

16.
With quasicommutative n-square complex matrices A1,…,As and s-square hermitian G=(gij), relationships are given between the image Σsi,j=1g ijAiHA1j of a linear transformation on Hn being positive definite and the action of H on generalized inertial decompositions of Cn.  相似文献   

17.
A set {b1,b2,…,bi} ? {1,2,…,N} is said to be a difference intersector set if {a1,a2,…,as} ? {1,2,…,N}, j > ?N imply the solvability of the equation ax ? ay = b′; the notion of sum intersector set is defined similarly. The authors prove two general theorems saying that if a set {b1,b2,…,bi} is well distributed simultaneously among and within all residue classes of small moduli then it must be both difference and sum intersector set. They apply these theorems to investigate the solvability of the equations (ax ? ayp = + 1, (au ? avp) = ? 1, (ar + asp) = + 1, (at + azp) = ? 1 (where (ap) denotes the Legendre symbol) and to show that “almost all” sets form both difference and sum intersector sets.  相似文献   

18.
The compactness method to weighted spaces is extended to prove the following theorem:Let H2,s1(B1) be the weighted Sobolev space on the unit ball in Rn with norm
6ν612,s=B1 (1rs)|ν|2 dx + ∫B1 (1rs)|Dν|2 dx.
Let n ? 2 ? s < n. Let u? [H2,s1(B1) ∩ L(B1)]N be a solution of the nonlinear elliptic system
B11rs, i,j=1n, h,K=1N AhKij(x,u) DiuhDK dx=0
, ψ ? ¦C01(B1N, where ¦Aijhk¦ ? L, Aijhk are uniformly continuous functions of their arguments and satisfy:
|η|2 = i=1n, j=1Nij|2 ? i,j=1n, 1rs, h,K=1N AhKijηihηik,?η?RNn
. Then there exists an R1, 0 < R1 < 1, and an α, 0 < α < 1, along with a set Ω ? B1 such that (1) Hn ? 2(Ω) = 0, (2) Ω does not contain the origin; Ω does not contain BR1, (3) B1 ? Ω is open, (4) u is Lipα(B1 ? Ω); u is LipαBR1.  相似文献   

19.
Sharp inequalities are derived for certain (polynomial-like) functions of the real variables pi (i = 1(1)σ) by interpreting pi as the probabilities that various switches be thrown in certain directions. Parameters mv in the inequalities are at first taken to be integers; later the inequalities are established when mv are arbitrary real numbers. The side condition ∑pi = 1 occurs throughout analysis, so there are many corollaries. Examples of the inequalities established are
i=1σ (1?pim)m>K?1,
valid ifm>1
j=0rnjpjm(1?pm)m?j+1?j=0rnjpj(1?p?s)n?jm > 1+smax[m,n]
valid if m > 1, n > r + 1, 0 < p, s, p + s ? 1, and also valid if 0 < m < 1, 0 < n < r + 1 (1 ? x)u + x1u < 1, if12 < x < 1, u > 1. (1.03)  相似文献   

20.
It is shown that the random voltage Vt resulting from pulses with independent random amplitude Yi Poisson arrivals, and exponential decay, can be asymptotically represented, in the stationary case, by the following random variable; namely a sum of products of random variables:
W=i=1 UiYi,
where
Ui=j=1i Xjβ/λ.
Here Xj are independent uniform random variables, β>0 is the decay parameter, λ>0 is the rate of the Poisson process.  相似文献   

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

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