首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
We study the behavior of measures obtained as a result of the action of the Ornstein-Uhlenbeck semigroup T t associated with the Gaussian measure μ on an arbitrary probability measure ν in a separable Hilbert space as t → 0+. We prove that the densities of the parts of T t ν absolutely continuous with respect to μ converge in the measure μ to the density of the part of ν absolutely continuous with respect to μ. For a finite-dimensional space, we prove the convergence of these densities μ-almost everywhere. In the infinite-dimensional case, we give sufficient conditions for almost-everywhere convergence. We also consider conditions on the absolute continuity of T t ν with respect to μ in terms of the coefficients of the expansion of T t ν in a series in Hermite polynomials (an analog of the Ito- Wiener expansion) and the connection with finite absolute continuity.__________Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 56, No. 12, pp. 1654 – 1664, December, 2004.  相似文献   

2.
Let F be a free group on a countable set {x1, x2, …} and ν be a variety of groups, defined by the set of outer commutators V, in the free generators xi's.The paper is devoted to give the complete structure of a ν-covering of ν-perfect groups. Fur thermore necessary and sufficient conditions for the universality of a ν-central extension by a group and its ν-covering group will be presented.  相似文献   

3.
Let {Xi, i1} be a sequence of i.i.d. random vectors inRd, and letνp, 0<p<1, be a positive, integer valued random variable, independent ofXis. Theν-stable distributions are the weak limits of properly normalized random sums ∑νpi=1 Xiasνp ∞ andp ν. We study the properties ofν-stable laws through their representation via stable laws. In particular, we estimate their tail probabilities and provide conditions for finiteness of their moments.  相似文献   

4.
It follows from the theory of trace identities developed by Procesi and Razmyslov that the trace cocharacters arising from the trace identities of the algebra Mr(F) of r×r matrices over a field F of characteristic zero are given by TCr,n=∑λΛr(n)χλχλ where χλχλ denotes the Kronecker product of the irreducible characters of the symmetric group associated with the partition λ with itself and Λr(n) denotes the set of partitions of n with r or fewer parts, i.e. the set of partitions λ=(λ1λk) with kr. We study the behavior of the sequence of trace cocharacters TCr,n. In particular, we study the behavior of the coefficient of χ(ν,nm) in TCr,n as a function of n where ν=(ν1νk) is some fixed partition of m and nmνk. Our main result shows that such coefficients always grow as a polynomial in n of degree r−1.  相似文献   

5.
Using the realization of positive discrete series representations of in terms of a complex variable z, we give an explicit expression for coupled basis vectors in the tensor product of ν+1 representations as polynomials in ν+1 variables z1,…,zν+1. These expressions use the terminology of binary coupling trees (describing the coupled basis vectors), and are explicit in the sense that there is no reference to the Clebsch–Gordan coefficients of . In general, these polynomials can be written as (terminating) multiple hypergeometric series. For ν=2, these polynomials are triple hypergeometric series, and a relation between the two binary coupling trees yields a relation between two triple hypergeometric series. The case of is discussed next. Also here the polynomials are determined explicitly in terms of a known realization; they yield an efficient way of computing coupled basis vectors in terms of uncoupled basis vectors.  相似文献   

6.
We give interpretations for quotient Jν+1/Jν of q-Bessel functions. These q-analogs are related to generating function of weighted complete binary trees according to the number of leaves and to multichains on a partially ordered set, corresponding to weighted paths in the plane.Nous donnons des interprétations combinatoires du rapport Jν+1/Jν de q-fonctions de Bessel. Ces q-analogues énumèrent des classes d'arbres binaires complets valués suivant le nombre de feuilles et des multichaînes d'un ensemble partiellement ordonné, correspondant à des chemins valués dans le plan.  相似文献   

7.
A. W. Knapp   《Journal of Algebra》2003,270(2):728-754
D.E. Littlewood proved two branching theorems for decomposing the restriction of an irreducible finite-dimensional representation of a unitary group to a symmetric subgroup. One is for restriction of a representation of U(n) to the rotation group SO(n) when the given representation τλ of U(n) has nonnegative highest weight λ of depth n/2. It says that the multiplicity in τλ|SO(n) of an irreducible representation of SO(n) of highest weight ν is the sum over μ of the multiplicities of τλ in the U(n) tensor product τμτν, the allowable μ's being all even nonnegative highest weights for U(n). Littlewood's proof is character-theoretic. The present paper gives a geometric interpretation of this theorem involving the tensor products τμτν explicitly. The geometric interpretation has an application to the construction of small infinite-dimensional unitary representations of indefinite orthogonal groups and, for each of these representations, to the determination of its restriction to a maximal compact subgroup. The other Littlewood branching theorem is for restriction from U(2r) to the rank-r quaternion unitary group Sp(r). It concerns nonnegative highest weights for U(2r) of depth r, and its statement is of the same general kind. The present paper finds an analogous geometric interpretation for this theorem also.  相似文献   

8.
Let dλ(t) be a given nonnegative measure on the real line , with compact or infinite support, for which all moments exist and are finite, and μ0>0. Quadrature formulas of Chakalov–Popoviciu type with multiple nodes
where σ=σn=(s1,s2,…,sn) is a given sequence of nonnegative integers, are considered. A such quadrature formula has maximum degree of exactness dmax=2∑ν=1nsν+2n−1 if and only if
The proof of the uniqueness of the extremal nodes τ12,…,τn was given first by Ghizzetti and Ossicini (Rend. Mat. 6(8) (1975) 1–15). Here, an alternative simple proof of the existence and the uniqueness of such quadrature formulas is presented. In a study of the error term R(f), an influence function is introduced, its relevant properties are investigated, and in certain classes of functions the error estimate is given. A numerically stable iterative procedure, with quadratic convergence, for determining the nodes τν, ν=1,2,…,n, which are the zeros of the corresponding σ-orthogonal polynomial, is presented. Finally, in order to show a numerical efficiency of the proposed procedure, a few numerical examples are included.  相似文献   

9.
Our goal in this paper is to analyze carry propagation in addition using only elementary methods (that is, those not involving residues, contour integration, or methods of complex analysis). Our results concern the length of the longest carry chain when two independent uniformly distributed n-bit numbers are added. First, we show using just first- and second-moment arguments that the expected length Cn of the longest carry chain satisfies Cn = log2n + O(1). Second, we use a sieve (inclusion–exclusion) argument to give an exact formula for Cn. Third, we give an elementary derivation of an asymptotic formula due to Knuth, Cn = log2n + Φ(log2 n) + O((logn)4/n), where Φ(ν) is a bounded periodic function of ν, with period 1, for which we give both a simple integral expression and a Fourier series. Fourth, we give an analogous asymptotic formula for the variance Vn of the length of the longest carry chain: Vn = Ψ(log2 n) + O((logn)5/n), where Ψ(ν) is another bounded periodic function of ν, with period 1. Our approach can be adapted to addition with the “end-around” carry that occurs in the sign-magnitude and 1s-complement representations. Finally, our approach can be adapted to give elementary derivations of some asymptotic formulas arising in connection with radix-exchange sorting and collision-resolution algorithms, which have previously been derived using contour integration and residues.  相似文献   

10.
Suppose L is a second order elliptic differential operator in d and let α>1. Baras and Pierre have proved in 1984 that Γ is removable for Lu=uα if and only if its Bessel capacity Cap2, α(Γ)=0. We extend this result to a general equation Lu=Ψ(u) where Ψ(u) is an increasing convex function subject to Δ2 and 2 conditions. Namely, we prove that Γ is removable for Lu=Ψ(u) if and only if its Orlicz capacity is zero, that is, the integral ∫B dx Ψ(∫Γ |xy|2−d ν(dy)) is equal to 0 or ∞ for every measure ν concentrated on Γ, where B stands for any ball containing Γ.  相似文献   

11.
We present an algorithm for the routing problem for two-terminal nets in generalized switchboxes. A generalized switchbox is any subset R of the planar rectangular grid with no nontrivial holes, i.e., every finite face has exactly four incident vertices. A net is a pair of nodes of nonmaximal degree on the boundary of R. A solution is a set of edge-disjoint paths, one for each net. Our algorithm solves standard generalized switchbox routing problems in time O(n(log n)2) where n is the number of vertices of R, i.e., it either finds a solution or indicates that there is none. A problem is standard if deg(ν) + ter(ν) is even for all vertices ν where deg(ν) is the degree of ν and ter(ν) is the number of nets which have ν as a terminal. For nonstandard problems we can find a solution in time O(n(log n)2 + |U|2) where U is the set of vertices ν with deg(ν) + ter(ν) is odd.  相似文献   

12.
Let τ=σ+ν be a point mass perturbation of a classical moment functional σ by a distribution ν with finite support. We find necessary conditions for the polynomials {Qn(x)}n=0, orthogonal relative to τ, to be a Bochner–Krall orthogonal polynomial system (BKOPS); that is, {Qn(x)}n=0 are eigenfunctions of a finite order linear differential operator of spectral type with polynomial coefficients: LN[y](x)=∑Ni=1 ℓi(xy(i)(x)=λny(x). In particular, when ν is of order 0 as a distribution, we find necessary and sufficient conditions for {Qn(x)}n=0 to be a BKOPS, which strongly support and clarify Magnus' conjecture which states that any BKOPS must be orthogonal relative to a classical moment functional plus one or two point masses at the end point(s) of the interval of orthogonality. This result explains not only why the Bessel-type orthogonal polynomials (found by Hendriksen) cannot be a BKOPS but also explains the phenomena for infinite-order differential equations (found by J. Koekoek and R. Koekoek), which have the generalized Jacobi polynomials and the generalized Laguerre polynomials as eigenfunctions.  相似文献   

13.
Given a vector measure ν with values in a Banach space X, we consider the space L1(ν) of real functions which are integrable with respect to ν. We prove that every order continuous Banach function space Y continuously contained in L1(ν) is generated via a certain positive map related to ν and defined on X* x M, where X* is the dual space of X and M the space of measurable functions. This procedure provides a way of defining Orlicz spaces with respect to the vector measure ν.  相似文献   

14.
LetB1: n× N1m1,B2: n× N2m2andQ: m2m1be bilinear forms which are related as follows: ifμandνsatisfyB1(ξ, μ)=0 andB2(ξ, ν)=0 for someξ≠0, thenμτ=0. Supposep−1+q−1=1. Coifman, Lions, Meyer and Semmes proved that, ifuLp( n) andvLq( n), and the first order systemsB1(D, u)=0,B2(D, v)=0 hold, thenuτQvbelongs to the Hardy spaceH1( n), provided that both (i)p=q=2, and (ii) the ranks of the linear mapsBj(ξ, ·) : Njm1are constant. We apply the theory of paracommutators to show that this result remains valid when only one of the hypotheses (i), (ii) is postulated. The removal of the constant-rank condition whenp=q=2 involves the use of a deep result of Lojasiewicz from singularity theory.  相似文献   

15.
Let (Mn, g) be a compact Riemannian manifold with boundary and dimensionn2. In this paper we discuss the first non-zero eigenvalue problem \begin{align}\Delta\varphi & = & 0\qquad & on\quad M,\\ \frac{\partial\varphi}{\partial \eta} & = & \ u_1\varphi\qquad & on\quad\partial M.\end{align}\eqno (1) Problem (1) is known as the Stekloff problem because it was introduced by him in 1902, for bounded domains of the plane. We discuss estimates of the eigenvalueν1in terms of the geometry of the manifold (Mn, g). In the two-dimensional case we generalize Payne's Theorem [P] for bounded domains in the plane to non-negative curvature manifolds. In this case we show thatν1k0, wherekgk0andkgrepresents the geodesic curvature of the boundary. In higher dimensionsn3 for non-negative Ricci curvature manifolds we show thatν1>k0/2, wherek0is a lower bound for any eigenvalue of the second fundamental form of the boundary. We introduce an isoperimetric constant and prove a Cheeger's type inequality for the Stekloff eigenvalue.  相似文献   

16.
A new combinatorial rule for expanding the product of Schur functions as a sum of Schur functions is formulated. The rule has several advantages over the Littlewood-Richardson rule (D. E. Littlewood and A. R. Richardson, Philos. Trans. Roy. Soc. London Ser. A233 (1934), 49–141). First this rule allows for direct computation of the expansion of the product of any number of Schur functions, not just the product of two Schur functions. Also, the rule is easily stated and is well suited to computer implementation. It is shown that the rule implies the Littlewood-Richardson rule and gives a combinatorial proof that the coefficient of Sλ in the product SμSν equals the coefficient of Sν in the expansion of the skew Schur function Sλ/μ. The rule is derived from some results proved independently by A. P. Hillman and R. M. Grassl (J. Combin. Comput. Sci. Systems5 (1980), 305–316) and by D. White (J. Combin. Theory Ser. A30 (1981), 237–247) on the Robinson-Schensted-Knuth correspondence.  相似文献   

17.
Suppose μ and ν are integer partitions of n, and N>n. It is well known that the Ferrers boards associated to μ and ν are rook-equivalent iff the multisets [μi+i:1iN] and [νi+i:1iN] are equal. We use the Garsia–Milne involution principle to produce a bijective proof of this theorem in which non-attacking rook placements for μ are explicitly matched with corresponding placements for ν. One byproduct is a direct combinatorial proof that the matrix of Stirling numbers of the first kind is the inverse of the matrix of Stirling numbers of the second kind. We also prove q-analogues and p,q-analogues of these results. We also use the Garsia–Milne involution principle to show that for any two rook boards B and B, if B and B are bijectively rook-equivalent, then B and B are bijectively hit-equivalent.  相似文献   

18.
Our aim in this paper is to obtain error expansions in the Gauss–Turán quadrature formula ∫−11f(t)w(t) dt=∑ν=1ni=02sAi,νf(i)ν)+Rn,s(f), in the case when f is an analytic function in some region of the complex plane containing the interval [−1,1] in its interior. Using a representation of the remainder term Rn,s(f) in the form of contour integral over confocal ellipses, we obtain Rn,1(f) for the four Chebyshev weights and Rn,2(f) for the Chebyshev weight of the first kind. Also, we get a few new L1-estimates of the remainder term, which are stronger than the previous ones. Some numerical results, illustrations and comparisons are also given. AMS subject classification (2000) 41A55, 65D30, 65D32.Received January 2004. Accepted October 2004. Communicated by Lothar Reichel.M. M. Spalević: This work was supported in part by the Serbian Ministry of Science and Environmental Protection (Project: Applied Orthogonal Systems, Constructive Approximation and Numerical Methods, grant number 2002).  相似文献   

19.
We pursue the study of the multiscale spaces Sν introduced by Jaffard in the context of multifractal analysis. We give the necessary and sufficient condition for Sν to be locally p-convex, and exhibit a sequence of p-norms that defines its natural topology. The strong topological dual of Sν is identified to another sequence space depending on ν, endowed with an inductive limit topology. As a particular case, we describe the dual of a countable intersection of Besov spaces.  相似文献   

20.
Let ℓ(n) be the smallest possible length of addition chains for a positive integer n. Then Scholz conjectured that ℓ(2n − 1) ≤ n + ℓ(n) − 1, which still remains open. It is known that the Scholz conjecture is true when ν(n) ≤ 4, where ν(n) is the number of 1's in the binary representation of n. In this paper, we give some properties of nonstar steps in addition chains and prove that the Scholz conjecture is true for infinitely many new integers including the case where ν(n) = 5.  相似文献   

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

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