denote the zeros of nth m-orthogonal polynomial for a generalized Jacobi weight
This note proves . The gap left over , is filled.  相似文献   

12.
Construction of nonseparable dual -wavelet frames in     
Youfa Li  Shouzhi Yang   《Applied mathematics and computation》2009,215(6):2082-2094
Suppose and are two pairs of dual M-wavelet frames and N-wavelet frames in and , respectively, where M and N are s1×s1 and s2×s2 dilation matrices with a1(|det(M)|-1) and (2a2+1)(|det(N)|-1). Moreover, their mask symbols both satisfy mixed extension principle (MEP). Based on the mask symbols, a family of nonseparable dual Ω-wavelet frames in are constructed, where s=s1+s2, and with Θ and M-1Θ both being integer matrices. Then a convolution scheme for improving regularity of wavelet frames is given. From the nonseparable dual Ω-wavelet frames, nonseparable Ω-wavelet frames with high regularity can be constructed easily. We give an algorithm for constructing nonseparable dual symmetric or antisymmetric wavelet frames in . From the dual Ω-wavelet frames, nonseparable dual Ω-wavelet frames with symmetry can be obtained easily. In the end, two examples are given.  相似文献   

13.
Instance-optimality in probability with an -minimization decoder   总被引:1,自引:0,他引:1  
Ronald DeVore  Guergana Petrova  Przemyslaw Wojtaszczyk   《Applied and Computational Harmonic Analysis》2009,27(3):275-288
Let Φ(ω), ωΩ, be a family of n×N random matrices whose entries i,j are independent realizations of a symmetric, real random variable η with expectation and variance . Such matrices are used in compressed sensing to encode a vector by y=Φx. The information y holds about x is extracted by using a decoder . The most prominent decoder is the 1-minimization decoder Δ which gives for a given the element which has minimal 1-norm among all with Φz=y. This paper is interested in properties of the random family Φ(ω) which guarantee that the vector will with high probability approximate x in to an accuracy comparable with the best k-term error of approximation in for the range kan/log2(N/n). This means that for the above range of k, for each signal , the vector satisfies
with high probability on the draw of Φ. Here, Σk consists of all vectors with at most k nonzero coordinates. The first result of this type was proved by Wojtaszczyk [P. Wojtaszczyk, Stability and instance optimality for Gaussian measurements in compressed sensing, Found. Comput. Math., in press] who showed this property when η is a normalized Gaussian random variable. We extend this property to more general random variables, including the particular case where η is the Bernoulli random variable which takes the values with equal probability. The proofs of our results use geometric mapping properties of such random matrices some of which were recently obtained in [A. Litvak, A. Pajor, M. Rudelson, N. Tomczak-Jaegermann, Smallest singular value of random matrices and geometry of random polytopes, Adv. Math. 195 (2005) 491–523].  相似文献   

14.
Double point self-transverse immersions of     
Mohammad A. Asadi-Golmankhaneh   《Topology and its Applications》2009,156(15):2452-2461
A self-transverse immersion of a smooth manifold M8k in has a double point self-intersection set which is the image of an immersion of a smooth four-dimensional manifold, cobordent to P4, P2×P2, P4+P2×P2 or a boundary. We will prove that for any value of k>1 the double point self-intersection set is a boundary. If k=1, then there exists an immersion of P2×P2×P2×P2 in with double point manifold boundary and odd number of triple points. In particular any immersion of oriented manifold in this dimension has double point manifold cobordant to a boundary.  相似文献   

15.
Erdős–Ko–Rado theorems for permutations and set partitions     
Cheng Yeaw Ku  David Renshaw   《Journal of Combinatorial Theory, Series A》2008,115(6):1008-1020
Let Sym([n]) denote the collection of all permutations of [n]={1,…,n}. Suppose is a family of permutations such that any two of its elements (when written in its cycle decomposition) have at least t cycles in common. We prove that for sufficiently large n, with equality if and only if is the stabilizer of t fixed points. Similarly, let denote the collection of all set partitions of [n] and suppose is a family of set partitions such that any two of its elements have at least t blocks in common. It is proved that, for sufficiently large n, with equality if and only if consists of all set partitions with t fixed singletons, where Bn is the nth Bell number.  相似文献   

16.
Widths of weighted Sobolev classes on the ball     
Heping Wang  Hongwei Huang   《Journal of Approximation Theory》2008,154(2):126-139
We study the Kolmogorov n-widths and the linear n-widths of weighted Sobolev classes on the unit ball Bd in Lq,μ, where Lq,μ, 1≤q, denotes the weighted Lq space of functions on Bd with respect to weight . Optimal asymptotic orders of and as n are obtained for all 1≤p,q and μ≥0.  相似文献   

17.
Asymptotics of the orthogonal polynomials for the Szegő class with a polynomial weight     
S. Denisov  S. Kupin   《Journal of Approximation Theory》2006,139(1-2):8
Let p be a trigonometric polynomial, non-negative on the unit circle . We say that a measure σ on belongs to the polynomial Szegő class, if , σs is singular, and
For the associated orthogonal polynomials {n}, we obtain pointwise asymptotics inside the unit disc . Then we show that these asymptotics hold in L2-sense on the unit circle. As a corollary, we get an existence of certain modified wave operators.  相似文献   

18.
Quadratic and cubic invariants of unipotent affine automorphisms     
V.V. Bavula  T.H. Lenagan   《Journal of Algebra》2008,320(12):4132-4155
Let K be an arbitrary field of characteristic zero, Pn:=K[x1,…,xn] be a polynomial algebra, and , for n2. Let σAutK(Pn) be given by
It is proved that the algebra of invariants, , is a polynomial algebra in n−1 variables which is generated by quadratic and cubic (free) generators that are given explicitly.Let σAutK(Pn) be given by
It is well known that the algebra of invariants, , is finitely generated (theorem of Weitzenböck [R. Weitzenböck, Über die invarianten Gruppen, Acta Math. 58 (1932) 453–494]), has transcendence degree n−1, and that one can give an explicit transcendence basis in which the elements have degrees 1,2,3,…,n−1. However, it is an old open problem to find explicit generators for Fn. We find an explicit vector space basis for the quadratic invariants, and prove that the algebra of invariants is a polynomial algebra over in n−2 variables which is generated by quadratic and cubic (free) generators that are given explicitly.The coefficients of these quadratic and cubic invariants throw light on the ‘unpredictable combinatorics’ of invariants of affine automorphisms and of SL2-invariants.  相似文献   

19.
Spaces of holomorphic functions in regular domains     
M. Valdivia   《Journal of Mathematical Analysis and Applications》2009,350(2):651-662
Let Ω be a regular domain in the complex plane , . Let be the linear space over of the holomorphic functions f in Ω such that f(n) is bounded in Ω and is continuously extendible to the closure of Ω, n=0,1,2,… . We endow , in a natural manner, with a structure of Fréchet space and we obtain dense subspaces F of , with good topological linear properties, also satisfying that each function f of F, distinct from zero, does not extend holomorphically outside Ω.  相似文献   

20.
On linear combinations of two tripotent, idempotent, and involutive matrices     
Murat Sarduvan  Halim zdemir 《Applied mathematics and computation》2008,200(1):401-406
Let A=c1A1+c2A2, wherec1, c2 are nonzero complex numbers and (A1,A2) is a pair of two n×n nonzero matrices. We consider the problem of characterizing all situations where a linear combination of the form A=c1A1+c2A2 is (i) a tripotent or an involutive matrix when are commuting involutive or commuting tripotent matrices, respectively, (ii) an idempotent matrix when are involutive matrices, and (iii) an involutive matrix when are involutive or idempotent matrices.  相似文献   

  首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
In this paper, we prove a combinatorial rule describing the restriction of any irreducible representation of U(n+m) to the subgroup U(nU(m). We also derive similar rules for the reductions from SU(n+m) to S(U(nU(m)), and from SU(n+m) to SU(nSU(m). As applications of these representation-theoretic results, we compute the spectra of the Bochner–Laplacian on powers of the determinant bundle over the complex Grassmannian . The spectrum of the Dirac operator acting on the spin Grassmannian is also partially computed. A further application is given by the determination of the spectrum of the Hodge–Laplacian acting on the space of smooth functions on the unit determinant bundle over .  相似文献   

2.
We prove that the mixed discriminant of doubly stochastic n-tuples of semidefinite hermitian n×n matrices is bounded below by and that this bound is uniquely attained at the n-tuple . This result settles a conjecture posed by R. Bapat in 1989. We consider various generalizations and applications of this result.  相似文献   

3.
An m×n matrix A over a semiring is called regular if there is an n×m matrix G over such that AGA=A. We study the problem of characterizing those linear operators T on the matrices over a semiring such that T(X) is regular if and only if X is. Complete characterizations are obtained for many semirings including the Boolean algebra, the nonnegative reals, the nonnegative integers and the fuzzy scalars.  相似文献   

4.
An n-lift of a graph K is a graph with vertex set V(K)×[n], and for each edge (i,j)E(K) there is a perfect matching between {i}×[n] and {j}×[n]. If these matchings are chosen independently and uniformly at random then we say that we have a random n-lift. We show that there are constants h1,h2 such that if hh1 then a random n-lift of the complete graph Kh is hamiltonian and if hh2 then a random n-lift of the complete bipartite graph Kh,h is hamiltonian .  相似文献   

5.
In this paper we investigate the L2-solutions of vector refinement equations with exponentially decaying masks and a general dilation matrix. A vector refinement equation with a general dilation matrix and exponentially decaying masks is of the form
where the vector of functions φ=(φ1,…,φr)T is in is an exponentially decaying sequence of r×r matrices called refinement mask and M is an s×s integer matrix such that limn→∞M-n=0. Associated with the mask a and dilation matrix M is a linear operator Qa on given by
The iterative scheme is called vector subdivision scheme or vector cascade algorithm. The purpose of this paper is to provide a necessary and sufficient condition to guarantee the sequence to converge in L2-norm. As an application, we also characterize biorthogonal multiple refinable functions, which extends some main results in [B. Han, R.Q. Jia, Characterization of Riesz bases of wavelets generated from multiresolution analysis, Appl. Comput. Harmon. Anal., to appear] and [R.Q. Jia, Convergence of vector subdivision schemes and construction of biorthogonal multiple wavelets, Advances in Wavelet (Hong Kong, 1997), Springer, Singapore, 1998, pp. 199–227] to the general setting.  相似文献   

6.
We relate asymptotics of Jacobi parameters to asymptotics of the spectral weights near the edges. Typical of our results is that for an≡1, bn=−Cnβ (), one has on (−2,2), and near x=2, where
  相似文献   

7.
Paul D. Levy   《Journal of Algebra》2007,318(2):933-952
Let k be an algebraically closed field of characteristic 2. We prove that the restricted nilpotent commuting variety , that is the set of pairs of (n×n)-matrices (A,B) such that A2=B2=[A,B]=0, is equidimensional. can be identified with the ‘variety of n-dimensional modules’ for , or equivalently, for k[X,Y]/(X2,Y2). On the other hand, we provide an example showing that the restricted nilpotent commuting variety is not equidimensional for fields of characteristic >2. We also prove that if e2=0 then the set of elements of the centralizer of e whose square is zero is equidimensional. Finally, we express each irreducible component of as a direct sum of indecomposable components of varieties of -modules.  相似文献   

8.
The problem of finding the correct asymptotic rate of approximation by polynomial loops in dependence of the smoothness of the elements of a loop group seems not well-understood in general. For matrix Lie groups such as , it can be viewed as a problem of nonlinearly constrained trigonometric approximation. Motivated by applications to optical FIR filter design and control, we present some initial results for the case of -loops, N≥2. In particular, using representations via the exponential map and first order splitting methods, we prove that the best approximation of an -loop belonging to a Hölder–Zygmund class , α>1/2, by a polynomial -loop of degree ≤n is of the order O(nα/(1+α)) as n. Although this approximation rate is not considered final, to our knowledge it is the first general, nontrivial result of this type.  相似文献   

9.
The zero sets of (D+a)ng(t) with in the (t,a)-plane are investigated for and .The results are used to determine entire interpolations to functions , which give representations for the best approximation and best one-sided approximation from the class of functions of exponential type η>0 to .  相似文献   

10.
For any integers p,n≥2 necessary and sufficient conditions are given for scaling filters with pn many terms to generate a p-multiresolution analysis in . A method for constructing orthogonal compactly supported p-wavelets on is described. Also, an adaptive p-wavelet approximation in is considered.  相似文献   

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

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