共查询到20条相似文献,搜索用时 31 毫秒
1.
Let be the n-dimensional ice cream cone, and let Γ(Kn) be the cone of all matrices in nn mapping Kn into itself. We determine the structure of Γ(Kn), and in particular characterize the extreme matrices in Γ(Kn). 相似文献
2.
J.H Michael 《Journal of Mathematical Analysis and Applications》1981,79(1):203-217
We consider the mixed boundary value problem , where Ω is a bounded open subset of n whose boundary Γ is divided into disjoint open subsets Γ+ and Γ? by an (n ? 2)-dimensional manifold ω in Γ. We assume A is a properly elliptic second order partial differential operator on and Bj, for j = 0, 1, is a normal jth order boundary operator satisfying the complementing condition with respect to A on . The coefficients of the operators and Γ+, Γ? and ω are all assumed arbitrarily smooth. As announced in [Bull. Amer. Math. Soc.83 (1977), 391–393] we obtain necessary and sufficient conditions in terms of the coefficients of the operators for the mixed boundary value problem to be well posed in Sobolev spaces. In fact, we construct an open subset of the reals such that, if then for is a Fredholm operator if and only if s ∈ . Moreover, = ?xewx, where the sets x are determined algebraically by the coefficients of the operators at x. If n = 2, x is the set of all reals not congruent (modulo 1) to some exceptional value; if n = 3, x is either an open interval of length 1 or is empty; and finally, if n ? 4, x is an open interval of length 1. 相似文献
3.
Jorge L.C Sanz Thomas S Huang 《Journal of Mathematical Analysis and Applications》1984,104(1):302-308
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 ? , i=1, …, n, is uniquely determined from the magnitude of f(x1…,xn): | f(x1…,xn)|, xi ? , i=1,…, n, except for (1) linear shifts: i(α1z1+…+αn2n+β), β, αi?, i=1,…, n; and (2) conjugation: . 相似文献
4.
Dudley Paul Johnson 《Stochastic Processes and their Applications》1985,19(1):183-187
We show that under mild conditions the joint densities Px1,…,xn) of the general discrete time stochastic process Xn on can be computed via where ? is in a Hilbert space , and T (x), x ? are linear operators on . We then show how the Central Limit Theorem can easily be derived from such representations. 相似文献
5.
R.C. Griffiths 《Journal of multivariate analysis》1975,5(2):271-277
Orthogonal polynomials on the multivariate negative binomial distribution, where α > 0, Θ1 > 0, x = ΣΘi, x0, x1, …, xp = 0,1, … are constructed and their properties studied. 相似文献
6.
Rudolf Wegmann 《Journal of Mathematical Analysis and Applications》1976,56(1):113-132
For an n × n Hermitean matrix A with eigenvalues λ1, …, λn the eigenvalue-distribution is defined by · 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 (Ω, , p) with the same distribution Fa. Suppose that all moments | a | k, k = 1, 2, … are finite, a=0 and | a | 2. Let with complex numbers θσ and finite products Pσ of factors A and (= 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 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 , , , 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 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. 相似文献
7.
Stanley J Benkoski 《Journal of Number Theory》1976,8(2):218-223
If r, k are positive integers, then denotes the number of k-tuples of positive integers (x1, x2, …, xk) with 1 ≤ xi ≤ n and (x1, x2, …, xk)r = 1. An explicit formula for is derived and it is shown that .If S = {p1, p2, …, pa} is a finite set of primes, then 〈S〉 = {p1a1p2a2…psas; pi ∈ S and ai ≥ 0 for all i} and denotes the number of k-tuples (x1, x3, …, xk) with 1 ≤ xi ≤ n and (x1, x2, …, xk)r ∈ 〈S〉. Asymptotic formulas for are derived and it is shown that . 相似文献
8.
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 n denotes the symmetric group on {1,2,…,n} then we define the projection by the formula , 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 , then x1?x2? … ?xn denotes the member of Tn(V) such that for each y1 ,2,…,yn in V, and x1·x2… xn denotes . If B? Sn(V) and there exists , such that B = x1·x2…xn, 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. 相似文献
9.
H.J Ryser 《Journal of Combinatorial Theory, Series A》1982,32(2):162-177
10.
11.
R.S. Singh 《Journal of multivariate analysis》1976,6(2):338-342
Let Xj = (X1j ,…, Xpj), j = 1,…, n be n independent random vectors. For x = (x1 ,…, xp) in Rp and for α in [0, 1], let Fj(x) = αI(X1j < x1 ,…, Xpj < xp) + (1 ? α) I(X1j ≤ x1 ,…, Xpj ≤ xp), where I(A) is the indicator random variable of the event A. Let Fj(x) = E(Fj(x)) and Dn = supx, α max1 ≤ N ≤ n |Σ0n(Fj(x) ? Fj(x))|. It is shown that P[Dn ≥ L] < 4pL exp{?2(L2n?1 ? 1)} for each positive integer n and for all L2 ≥ n; and, as n → ∞, with probability one. 相似文献
12.
David S. Jerison 《Journal of Functional Analysis》1981,43(2):224-257
Let L = ∑j = 1mXj2 be sum of squares of vector fields in n satisfying a Hörmander condition of order 2: span{Xj, [Xi, Xj]} is the full tangent space at each point. A point x??D of a smooth domain D is characteristic if X1,…, Xm are all tangent to ?D at x. We prove sharp estimates in non-isotropic Lipschitz classes for the Dirichlet problem near (generic) isolated characteristic points in two special cases: (a) The Grushin operator in 2. (b) The real part of the Kohn Laplacian on the Heisenberg group in 2n + 1. In contrast to non-characteristic points, C∞ regularity may fail at a characteristic point. The precise order of regularity depends on the shape of ?D at x. 相似文献
13.
Let Ω be a simply connected domain in the complex plane, and , the space of functions which are defined and analytic on , if K is the operator on elements defined in terms of the kernels ki(t, s, a1, …, an) in by is the identity operator on , 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 defined in terms of a kernel w(t, s, a1, …, an) in 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 ? 1 ∝aitki(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 and maps elements of into itself by multiplication. The function m is uniquely derived from K in the following manner. The operator K defines an operator on functions u in , by . A determinant of the operator is defined as an element of . This is mapped into 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 , 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. 相似文献
14.
R.J Cook 《Journal of Number Theory》1983,17(1):80-92
Let k be an odd positive integer. Davenport and Lewis have shown that the equations with integer coefficients, have a nontrivial solution in integers x1,…, xN provided that Here it is shown that for any ? > 0 and k > k0(?) the equations have a nontrivial solution provided that 相似文献
15.
John Riordan 《Discrete Mathematics》1973,4(4):383-387
The level code representation of the simplest ballot problem (weak lead lattice paths from (0, 0) to (n, n) is the set of sequences (b1,…, bn) defined by b1 = 1, bi ?1 ≤ bi ≤ i, 2 ≤ i ≤n. Each sequence is monotone non-decreasing, has a specification (c1, c2,…, cn) with ci the number of sequence elements equal to i (hence c1 + c2…+ cn = n), and may be permuted in ways. The set of permuted sequences, as noted in [4], is the set of parking functions, introduced by Konheim and Weiss in [1]. To count parking functions by number of fixed points, associate the rook polynomial for matching a deck of cards of specification (c1,…,cn), ci cards marked i, with a deck of n distinct cards. The hit polynomial Hn(x) corresponding to the sum of such rook polynomials over all sequences (I am using the terminology of [2]) is the required enumerator and turns out to be simply . 相似文献
16.
J.R. Tort 《Discrete Mathematics》1983,44(2):181-185
Let X be a set of n elements. Let 3(X) be the set of all triples of X. We define a clique as a set of triples which intersect pairwise in two elements. In this paper we prove that if n?6, the minimum cardinality of a partition of 3(X) into cliques is . 相似文献
17.
《Journal of Functional Analysis》1987,73(1):122-134
Let Ω denote a connected and open subset of n. The existence of n commuting self-adjoint operators H1,…, Hn on such that each Hj is an extension of (acting on is shown to be equivalent to the existence of a measure μ on n such that f → tf (the Fourier transform of f) is unitary from onto Ω. It is shown that the support of μ can be chosen as a subgroup of n iff H1,…, Hn can be chosen such that the unitary groups generated by H1,…, Hn act multiplicatively on . This happens iff Ω (after correction by a null set) forms a system of representatives for the quotient of n by some subgroup, i.e., iff Ω is essentially a fundamental domain. 相似文献
18.
C.R Putnam 《Journal of Functional Analysis》1974,17(3):263-273
Let T be a subnormal, nonnormal operator on a Hilbert space and suppose that the point spectrum of is empty. Then there exist vectors x ≠ 0 for which exists and is weakly continuous for all z. It is shown that under certain conditions, the Cauchy integral of this vector function taken around an appropriate contour, not necessarily lying in the resolvent set of , leads to a proper (nontrivial) invariant subspace of . 相似文献
19.
R.J Cook 《Journal of Combinatorial Theory, Series B》1979,26(3):337-345
Let G be a planar graph having n vertices with vertex degrees d1, d2,…,dn. It is shown that . The main term in this upper bound is best possible. 相似文献
20.
Let Ω = {1, 0} and for each integer n ≥ 1 let (n-tuple) and for all k = 0,1,…,n. Let {Ym}m≥1 be a sequence of i.i.d. random variables such that . For each A in , let TA be the first occurrence time of A with respect to the stochastic process {Ym}m≥1. R. Chen and A.Zame (1979, J. Multivariate Anal. 9, 150–157) prove that if n ≥ 3, then for each element A in , there is an element B in such that the probability that TB is less than TA is greater than . This result is sharpened as follows: (I) for n ≥ 4 and 1 ≤ k ≤ n ? 1, each element A in , there is an element B also in such that the probability that TB is less than TA is greater than ; (II) for n ≥ 4 and 1 ≤ k ≤ n ? 1, each element A = (a1, a2,…,an) in , there is an element C also in such that the probability that TA is less than TC is greater than if n ≠ 2m or n = 2m but ai = ai + 1 for some 1 ≤ i ≤ n?1. These new results provide us with a better and deeper understanding of the fair coin tossing process. 相似文献