首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 29 毫秒
1.
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?  相似文献   

2.
The relationship between sequence entropy and mixing is examined. Let T be an automorphism of a Lebesgue space X, L0 denote the set of all partitions of X possessing finite entropy, and S denote the set of all increasing sequences of positive integers. It is shown that: (1) T is mixing /a2 supA ? BhA(T, α) = H(α) for all BI and αZ0. (2) T is weakly mixing /a2 supAhA(T, α) = H(α) for all αZ0. (3) If T is partially mixing with constant c (1 ? 1e < c < 1), then supA ? BhA(T, α) > cH(α) for all BI and nontrivial αZ0. (4) If supA ? BhA(T, α) > 0 for all BI and nontrivial αZ0, then T is weakly mixing.  相似文献   

3.
For finite graphs F and G, let NF(G) denote the number of occurrences of F in G, i.e., the number of subgraphs of G which are isomorphic to F. If F and G are families of graphs, it is natural to ask then whether or not the quantities NF(G), FF, are linearly independent when G is restricted to G. For example, if F = {K1, K2} (where Kn denotes the complete graph on n vertices) and F is the family of all (finite) trees, then of course NK1(T) ? NK2(T) = 1 for all TF. Slightly less trivially, if F = {Sn: n = 1, 2, 3,…} (where Sn denotes the star on n edges) and G again is the family of all trees, then Σn=1(?1)n+1NSn(T)=1 for all TG. It is proved that such a linear dependence can never occur if F is finite, no FF has an isolated point, and G contains all trees. This result has important applications in recent work of L. Lovász and one of the authors (Graham and Lovász, to appear).  相似文献   

4.
Given a polynomial P(X1,…,XN)∈R[X], we calculate a subspace Gp of the linear space 〈X〉 generated by the indeterminates which is minimal with respect to the property P∈R[Gp] (the algebra generated by Gp, and prove its uniqueness. Furthermore, we use this result to characterize the pairs (P,Q) of polynomials P(X1,…,Xn) and Q(X1,…,Xn) for which there exists an isomorphism T:X〉 →〈X〉 that “separates P from Q,” i.e., such that for some k(1<k<n) we can write P and Q as P1(Y1,…,Yk) and Q1(Yk+1,…,Yn) respectively, where Y=TX.  相似文献   

5.
Let X(ω) be a random element taking values in a linear space X endowed with the partial order ≤; let G0 be the class of nonnegative order-preserving functions on X such that, for each g∈G0, E[g(X)] is defined; and let G1?G0 be the subclass of concave functions. A version of Markov's inequality for such spaces in P(X ≥ x) ≤ infG0E[g(X)]/g(x). Moreover, if E(X) = ξ is defined and if Jensen's inequality applies, we have a further inequality P(X≥x) ≤ infG1E[g(X)]/g(x) ≤ infG1g(ξ)/g(x). Applications are given using a variety or orderings of interest in statistics and applied probability.  相似文献   

6.
Define coefficients (κλ) by Cλ(Ip + Z)/Cλ(Ip) = Σk=0l Σ?∈Pk (?λ) Cκ(Z)/Cκ(Ip), where the Cλ's are zonal polynomials in p by p matrices. It is shown that C?(Z) etr(Z)/k! = Σl=k Σλ∈Pl (?λ) Cλ(Z)/l!. This identity is extended to analogous identities involving generalized Laguerre, Hermite, and other polynomials. Explicit expressions are given for all (?λ), ? ∈ Pk, k ≤ 3. Several identities involving the (?λ)'s are derived. These are used to derive explicit expressions for coefficients of Cλ(Z)l! in expansions of P(Z), etr(Z)k! for all monomials P(Z) in sj = tr Zj of degree k ≤ 5.  相似文献   

7.
In this paper, we are studying Dirichlet series Z(P,ξ,s) = Σn?N1rP(n)?s ξn, where PR+ [X1,…,Xr] and ξn = ξ1n1ξrnr, with ξiC, such that |ξi| = 1 and ξi ≠ 1, 1 ≦ ir. We show that Z(P, ξ,·) can be continued holomorphically to the whole complex plane, and that the values Z(P, ξ, ?k) for all non negative integers, belong to the field generated over Q by the ξi and the coefficients of P. If, there exists a number field K, containing the ξi, 1 ≦ ir, and the coefficients of P, then we study the denominators of Z(P, ξ, ?k) and we define a B-adic function ZB(P, ξ,·) which is equal, on class of negative integers, to Z(P, ξ, ?k).  相似文献   

8.
Let G be a finite group having a faithful irreducible character χ for which χ(1) is prime to ¦G¦/χ(1). Let n=[Q(χ):Q]χ(1), and assume that the factors are not both even. Then G can be embedded in GLn(Q) in such a way that its normalizer therein splits over its centralizer.  相似文献   

9.
Let {Xn}n≥1 be a sequence of independent and identically distributed random variables. For each integer n ≥ 1 and positive constants r, t, and ?, let Sn = Σj=1nXj and E{N(r, t, ?)} = Σn=1 nr?2P{|Sn| > ?nrt}. In this paper, we prove that (1) lim?→0+?α(r?1)E{N(r, t, ?)} = K(r, t) if E(X1) = 0, Var(X1) = 1, and E(| X1 |t) < ∞, where 2 ≤ t < 2r ≤ 2t, K(r, t) = {2α(r?1)2Γ((1 + α(r ? 1))2)}{(r ? 1) Γ(12)}, and α = 2t(2r ? t); (2) lim?→0+G(t, ?)H(t, ?) = 0 if 2 < t < 4, E(X1) = 0, Var(X1) > 0, and E(|X1|t) < ∞, where G(t, ?) = E{N(t, t, ?)} = Σn=1nt?2P{| Sn | > ?n} → ∞ as ? → 0+ and H(t, ?) = E{N(t, t, ?)} = Σn=1 nt?2P{| Sn | > ?n2t} → ∞ as ? → 0+, i.e., H(t, ?) goes to infinity much faster than G(t, ?) as ? → 0+ if 2 < t < 4, E(X1) = 0, Var(X1) > 0, and E(| X1 |t) < ∞. Our results provide us with a much better and deeper understanding of the tail probability of a distribution.  相似文献   

10.
Let X be a finite-dimensional compactum. Let R(X) and N(X) be the spaces of retractions and non-deformation retractions of X, respectively, with the compact-open (=sup-metric) topology. Let 2Xh be the space of non-empty compact ANR subsets of X with topology induced by the homotopy metric. Let RXh be the subspace of 2Xh consisting of the ANR's in X that are retracts of X.We show that N(Sm) is simply-connected for m > 1. We show that if X is an ANR and A0?RXh, then limi→∞Ai=A0 in 2Xh if and only if for every retraction r0 of X onto A0 there are, for almost all i, retractions ri of X onto Ai such that limi→∞ri=ro in R(X). We show that if X is an ANR, then the local connectedness of R(X) implies that of RXh. We prove that R(M) is locally connected if M is a closed surface. We give examples to show how some of our results weaken when X is not assumed to be an ANR.  相似文献   

11.
Let X and Y be Banach spaces, Y ?X, and let V be a neighborhood of zero in Y. We consider the equation G(λ, u) ≡ A(λ)u + F(λ, u) = 0, where G: [?d1, d1] × VX, G(λ, 0) = 0, and A(λ) is the Fréchet derivative of G with respect to u at (λ, 0). Furthermore, we assume that G is analytic with respect to λ and u. Bifurcation at a simple eigenvalue means that zero is a simple eigenvalue of A (0). Let μ(λ) be the simple eigenvalue of the perturbed operator A(λ) for λ near zero. Let djμ(0)j = 0, j = 0,…, m ? 1, dmμ(0)m Am ≠ 0, or μ(λ) ≡ 0. Under the nondegeneracy condition m = 1 the existence of a unique curve of solutions intersecting the trivial solution (λ, 0) at (0, 0) is well known. Furthermore the “Principle of Exchange of Stability” was established in this case. We show that in the degenerate case (m > 1) up to m bifurcating curves of solutions can exist and that at least one nontrivial curve exists if m is odd. Our approach supplies all curves of solutions near (0, 0) together with their direction of bifurcation and their linearized stability. The decisive fact is that Am is also the leading term of the bifurcation equation. A consequence is a “Generalized Principle of Exchange of Stability”, which means that adjacent solutions for the same λ have opposite stability properties in a weakened sense. For practical use we give a criterion for asymptotic stability or instability which follows from the construction of the curves of solutions themselves.  相似文献   

12.
Let (Ω, B, μ) be a measure space, X a separable Banach space, and X1 the space of all bounded conjugate linear functionals on X. Let f be a weak1 summable positive B(X, X1)-valued function defined on Ω. The existence of a separable Hilbert space K, a weakly measurable B(X, K)-valued function Q satisfying the relation Q1(ω)Q(ω) = f(ω) is proved. This result is used to define the Hilbert space L2,f of square integrable operator-valued functions with respect to f. It is shown that for B+(X, X1)-valued measures, the concepts of weak1, weak, and strong countable additivity are all the same. Connections with stochastic processes are explained.  相似文献   

13.
If Λ is a ring and A is a Λ-module, then a terminal completion of Ext1Λ(A, ) is shown to exist if, and only if, ExtjΛ(A, P)=0 for all projective Λ-modules P and all sufficiently large j. Such a terminal completion exists for every A if, and only if, the supremum of the injective lengths of all projective Λ-modules, silp Λ, is finite. Analogous results hold for Ext1Λ(,A) and involve spli Λ, the supremum of the projective lengths of the injective Λ-modules. When Λ is an integral group ring ZG, spliZG is finite implies silp ZG is finite. Also the finiteness of spli is preserved under group extensions. If G is a countable soluble group, the spli ZG is finite if, and only if, the Hirsch number of G is finite.  相似文献   

14.
Let Ωm be the set of partitions, ω, of a finite m-element set; induce a uniform probability distribution on Ωm, and define Xms(ω) as the number of s-element subsets in ω. We alow the existence of an integer-valued function n=n(m)(t), t?[0, 1], and centering constants bms, 0?s? m, such that
Z(m)(t)=s=0n(m)(t)(Xms?bms)s=0mbms
converges to the ‘Brownian Bridge’ process in terms of its finite-dimensional distributions.  相似文献   

15.
Let R = (r1,…, rm) and S = (s1,…, sn) be nonnegative integral vectors, and let U(R, S) denote the class of all m × n matrices of 0's and 1's having row sum vector R and column sum vector S. An invariant position of U(R, S) is a position whose entry is the same for all matrices in U(R, S). The interchange graph G(R, S) is the graph where the vertices are the matrices in U(R, S) and where two matrices are joined by an edge provided they differ by an interchange. We prove that when 1 ≤ rin ? 1 (i = 1,…, m) and 1 ≤ sjm ? 1 (j = 1,…, n), G(R, S) is prime if and only if U(R, S) has no invariant positions.  相似文献   

16.
Let K/Q be an algebraic number field and ζK(s) be the associated Dedekind ζ function. A quantitative estimate is proved which shows that the average order of the coefficients of ζkm(s) (for mZ+) arises from infrequent occurrences of very large values of these coefficients. This leads to new Ω-estimates for the associated error terms, improving results of Szegö and Walfisz.  相似文献   

17.
Let N be a regular chain-group on E (see W. T. Tutte, Canad. J. Math.8 (1956), 13–28); for instance, N may be the group of integer flows or tensions of a directed graph with edge-set E). It is known that the number of proper Zλ-chains of N (λ ∈ Z, λ ≥ 2) is given by a polynomial in λ, P(N, λ) (when N is the chain-group of integer tensions of the connected graph G, λP(N, λ) is the usual chromatic polynomial of G). We prove the formula: P(N, λ) = Σ[E′]∈O(N)+/~Q(R[E′](N), λ), where O(N)+ is the set of orientations of N with a proper positive chain, ~ is a simple equivalence relation on O(N)+ (sequence of reversals of positive primitive chains), and Q(R[E′](N), λ) is the number of chains with values in [1, λ ? 1] in any reorientation of N associated to an element of [E′]. Moreover, each term Q(R[E′](N), λ) is a polynomial in λ. As applications we obtain: P(N, 0) = (?1)r(N)O(N)+/~∥; P(N, ?1) = (?1)r(N)O(N)+∥ (a result first proved by Brylawski and Lucas); P(N, λ + 1) ≥ P(N, λ) for λ ≥ 2, λ ∈ Z. Our result can also be considered as a refinement of the following known fact: A regular chain-group N has a proper Zλ-chain iff it has a proper chain in [?λ + 1, λ ? 1].  相似文献   

18.
Let Z = {Z0, Z1, Z2,…} be a martingale, with difference sequence X0 = Z0, Xi = Zi ? Zi ? 1, i ≥ 1. The principal purpose of this paper is to prove that the best constant in the inequality λP(supi |Xi| ≥ λ) ≤ C supiE |Zi|, for λ > 0, is C = (log 2)?1. If Z is finite of length n, it is proved that the best constant is Cn = [n(21n ? 1)]?1. The analogous best constant Cn(z) when Z0z is also determined. For these finite cases, examples of martingales attaining equality are constructed. The results follow from an explicit determination of the quantity Gn(z, E) = supzP(maxi=1,…,n |Xi| ≥ 1), the supremum being taken over all martingales Z with Z0z and E|Zn| = E. The expression for Gn(z,E) is derived by induction, using methods from the theory of moments.  相似文献   

19.
For irrational numbers θ define α(θ) = lim sup{1/(q(p ? qθ))|pZ, qN, p ? qθ > 0} and α(θ) = 0 for rationals. Put α(θ) = max{α(θ), α(?0)}. Then U = α(RβQ) is an asymmetric analogue to the Lagrange spectrum U = α(RβQ). Our results concerning U partly contrast the known properties of U. In fact, U is a perfect set, each element of which is a condensation point of the spectrum and has continuously many preimages. U is the closure of its rational elements and of its elements of the form pm (pQ), as well. The arbitrarily well approximable numbers form a Gδ-set of 2. category. One has, roughly speaking, α → ∞ for α → 1. Finally, the well-known Markov sequence which constitutes the lower Lagrange and Markov spectrum is proved to be a (small) subset of U?[√5,3).  相似文献   

20.
Let Fn(x) be the empirical distribution function based on n independent random variables X1,…,Xn from a common distribution function F(x), and let X = Σi=1nXin be the sample mean. We derive the rate of convergence of Fn(X) to normality (for the regular as well as nonregular cases), a law of iterated logarithm, and an invariance principle for Fn(X).  相似文献   

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

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