首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 62 毫秒
1.
This paper presents sufficient conditions for the existence of a nonnegative and stable equilibrium point of a dynamical system of Volterra type, (1) (ddt) xi(t) = ?xi(t)[fi(x1(t),…, xn(t)) ? qi], i = 1,…, n, for every q = (q1,…, qn)T?Rn. Results of a nonlinear complementarity problem are applied to obtain the conditions. System (1) has a nonnegative and stable equilibrium point if (i) f(x) = (f1(x),…,fn(x))T is a continuous and differentiable M-function and it satisfies a certain surjectivity property, or (ii), f(x) is continuous and strongly monotone on R+0n.  相似文献   

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

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

4.
If AT(m, N), the real-valued N-linear functions on Em, and σSN, the symmetric group on {…,N}, then we define the permutation operator Pσ: T(m, N) → T(m, N) such that Pσ(A)(x1,x2,…,xN = A(xσ(1),xσ(2),…, xσ(N)). Suppose Σqi=1ni = N, where the ni are positive integers. In this paper we present a condition on σ that is sufficient to guarantee that 〈Pσ(A1?A2???Aq),A1?A2?? ? Aq〉 ? 0 for AiS(m, ni), where S(m, ni) denotes the subspace of T(m, ni) consisting of all the fully symmetric members of T(m, ni). Also we present a broad generalization of the Neuberger identity which is sometimes useful in answering questions of the type described below. Suppose G and H are subgroups of SN. We let TG(m, N) denote all AT(m, N) such that Pσ(A) = A for all σ∈G. We define the symmetrizer SG: T(m, N)→TG(m,N) such that SG(A) = 1/|G|Σσ∈G Pσ(A). Suppose H is a subgroup of G and ATH(m, N). Clearly 6SG6(A) 6? 6A6. We are interested in the reverse type of comparison. In particular, if D is a suitably chosen subset of TH(m,N), then can we explicitly present a constant C>0 such that 6 SG(A)6?C6A6 for all AD?  相似文献   

5.
Let?(x1,…,xp) be a polynomial in the variables x1,…,xp with nonnegative real coefficients which sum to one, let A1,…,Ap be stochastic matrices, and let ??(A1,…,Ap) be the stochastic matrix which is obtained from ? by substituting the Kronecker product of An11,…,Anppfor each term Xn11·?·Xnpp. In this paper, we present necessary and sufficient conditions for the Cesàro limit of the sequence of the powers of ??(A1,…,Ap) to be equal to the Kronecker product of the Cesàro limits associated with each of A1,…,Ap. These conditions show that the equality of these two matrices depends only on the number of ergodic sets under??(A1,…,Ap) and?or the cyclic structure of the ergodic sets under A1,…,Ap, respectively. As a special case of these results, we obtain necessary and sufficient conditions for the interchangeability of the Kronecker product and the Cesàro limit operator.  相似文献   

6.
Let p, q be arbitrary parameter sets, and let H be a Hilbert space. We say that x = (xi)i?q, xi ? H, is a bounded operator-forming vector (?HFq) if the Gram matrixx, x〉 = [(xi, xj)]i?q,j?q is the matrix of a bounded (necessarily ≥ 0) operator on lq2, the Hilbert space of square-summable complex-valued functions on q. Let A be p × q, i.e., let A be a linear operator from lq2 to lp2. Then exists a linear operator ǎ from (the Banach space) HFq to HFp on D(A) = {x:x ? HFq, A〈x, x〉12 is p × q bounded on lq2} such that y = ǎx satisfies yj?σ(x) = {space spanned by the xi}, 〈y, x〉 = Ax, x〉 and 〈y, y〉 = A〈x, x〉12(A〈x, x〉12)1. This is a generalization of our earlier [J. Multivariate Anal.4 (1974), 166–209; 6 (1976), 538–571] results for the case of a spectral measure concentrated on one point. We apply these tools to investigate q-variate wide-sense Markov processes.  相似文献   

7.
Let V denote a finite dimensional vector space over a field K of characteristic 0, let Tn(V) denote the vector space whose elements are the K-valued n-linear functions on V, and let Sn(V) denote the subspace of Tn(V) whose members are the fully symmetric members of Tn(V). If Ln denotes the symmetric group on {1,2,…,n} then we define the projection PL : Tn(V) → Sn(V) by the formula (n!)?1Σσ ? Ln Pσ, where Pσ : Tn(V) → Tn(V) is defined so that Pσ(A)(y1,y2,…,yn = A(yσ(1),yσ(2),…,yσ(n)) for each A?Tn(V) and yi?V, 1 ? i ? n. If xi ? V1, 1 ? i ? n, then x1?x2? … ?xn denotes the member of Tn(V) such that (x1?x2· ? ? ?xn)(y1,y2,…,yn) = Пni=1xi(yi) for each y1 ,2,…,yn in V, and x1·x2xn denotes PL(x1?x2? … ?xn). If B? Sn(V) and there exists x i ? V1, 1 ? i ? n, such that B = x1·x2xn, then B is said to be decomposable. We present two sets of necessary and sufficient conditions for a member B of Sn(V) to be decomposable. One of these sets is valid for an arbitrary field of characteristic zero, while the other requires that K = R or C.  相似文献   

8.
If k is a perfect field of characteristic p ≠ 0 and k(x) is the rational function field over k, it is possible to construct cyclic extensions Kn over k(x) such that [K : k(x)] = pn using the concept of Witt vectors. This is accomplished in the following way; if [β1, β2,…, βn] is a Witt vector over k(x) = K0, then the Witt equation yp ? y = β generates a tower of extensions through Ki = Ki?1(yi) where y = [y1, y2,…, yn]. In this paper, it is shown that there exists an alternate method of generating this tower which lends itself better for further constructions in Kn. This alternate generation has the form Ki = Ki?1(yi); yip ? yi = Bi, where, as a divisor in Ki?1, Bi has the form (Bi) = qΠpjλj. In this form q is prime to Πpjλj and each λj is positive and prime to p. As an application of this, the alternate generation is used to construct a lower-triangular form of the Hasse-Witt matrix of such a field Kn over an algebraically closed field of constants.  相似文献   

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

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

11.
12.
Let X1, X2, X3, … be i.i.d. r.v. with E|X1| < ∞, E X1 = μ. Given a realization X = (X1,X2,…) and integers n and m, construct Yn,i, i = 1, 2, …, m as i.i.d. r.v. with conditional distribution P1(Yn,i = Xj) = 1n for 1 ? j ? n. (P1 denotes conditional distribution given X). Conditions relating the growth rate of m with n and the moments of X1 are given to ensure the almost sure convergence of (1mmi=1 Yn,i toμ. This equation is of some relevance in the theory of Bootstrap as developed by Efron (1979) and Bickel and Freedman (1981).  相似文献   

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

14.
The probability generating function (pgf) of an n-variate negative binomial distribution is defined to be [β(s1,…,sn)]?k where β is a polynomial of degree n being linear in each si and k > 0. This definition gives rise to two characterizations of negative binomial distributions. An n-variate linear exponential distribution with the probability function h(x1,…,xn)exp(Σi=1n θixi)f(θ1,…,θn) is negative binomial if and only if its univariate marginals are negative binomial. Let St, t = 1,…, m, be subsets of {s1,…, sn} with empty ∩t=1mSt. Then an n-variate pgf is of a negative binomial if and only if for all s in St being fixed the function is of the form of the pgf of a negative binomial in other s's and this is true for all t.  相似文献   

15.
Let Sp×p ~ Wishart (Σ, k), Σ unknown, k > p + 1. Minimax estimators of Σ?1 are given for L1, an Empirical Bayes loss function; and L2, a standard loss function (RiE(LiΣ), i = 1, 2). The estimators are Σ??1 = aS?1 + br(S)Ip×p, a, b ≥ 0, r(·) a functional on Rp(p+2)2. Stein, Efron, and Morris studied the special cases Σa?1 = aS?1 (EΣ?k?p?1?1 = Σ?1) and Σ?1?1 = aS?1 + (b/tr S)I, for certain, a, b. From their work R1?1, Σ?1?1; S) ≤ R1?1, Σ?a?1; S) (?Σ), a = k ? p ? 1, b = p2 + p ? 2; whereas, we prove R2?1Σ?a?1; S) ≤ R2?1, Σ?1?1; S) (?Σ). The reversal is surprising because L1?1, Σ?1?1; S) → L2?1, Σ?1?1; S) a.e. (for a particular L2). Assume R (compact) ? S, S the set of p × p p.s.d. matrices. A “divergence theorem” on functions Fp×p : RS implies identities for Ri, i = 1, 2. Then, conditions are given for Ri?1, Σ??1; S) ≤ Ri?1, Σ?1?1; S) ≤ Ri?1, Σ?a?1; S) (?Σ), i = 1, 2. Most of our results concern estimators with r(S) = t(U)/tr(S), U = p ∣S1/p/tr(S).  相似文献   

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

17.
This paper presents a demonstrably convergent method of feasible directions for solving the problem min{φ(ξ)| gi(ξ)?0i=1,2,…,m}, which approximates, adaptively, both φ(x) and ▽φ(x). These approximations are necessitated by the fact that in certain problems, such as when φ(x) = max{f(x, y) ¦ y ? Ωy}, a precise evaluation of φ(x) and ▽φ(x) is extremely costly. The adaptive procedure progressively refines the precision of the approximations as an optimum is approached and as a result should be much more efficient than fixed precision algorithms.It is outlined how this new algorithm can be used for solving problems of the form miny ? Ωxmaxy ? Ωyf(x, y) under the assumption that Ωmξ={x|gi(x)?0, j=1,…,s} ∩Rn, Ωy={y|ζi(y)?0, i-1,…,t} ∩ Rm, with f, gj, ζi continuously differentiable, f(x, ·) concave, ζi convex for i = 1,…, t, and Ωx, Ωy compact.  相似文献   

18.
Let X1, …, Xp have p.d.f. g(x12 + … + xp2). It is shown that (a) X1, …, Xp are positively lower orthant dependent or positively upper orthant dependent if, and only if, X1,…, Xp are i.i.d. N(0, σ2); and (b) the p.d.f. of |X1|,…, |Xp| is TP2 in pairs if, and only if, In g(u) is convex. Let X1, X2 have p.d.f. f(x1, x2) = |Σ|?12 g((x1, x2) Σ?1(x1, x2)′). Necessary and sufficient conditions are given for f(x1, x2) to be TP2 for fixed correlation ?. It is shown that if f is TP2 for all ? >0. then (X1, X2)′ ~ N(0, Σ). Related positive dependence results and applications are also considered.  相似文献   

19.
Author index     
A matrix T=(tik) is introduced, the coefficients of which are defined by kik:= (ik(ik)!)Σx?Snai(x)k, i, k?N={1, 2, 3,…,}, where ai(x) denotes the s the number of i cycles in the element x of the symmetric group Sn. It is shown that these numbers are natural numbers, that they are easy to evaluate, and that they serve very well in order to formulate an infinite number of characterizations of multiply transitive subgroups of symmetric groups in terms of the cycle structure of their elements.  相似文献   

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

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

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