首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
The well known Shannon entroy −∑ pk log pk satisfies the inequality −∑ pk log pk − ∑ pk log qk. Extensive studies have been made on the inequality ∑ pkƒk(qk) ∑ pkƒk(pk) which contains the above inequality as a special case. In this paper, we consider the most general inequality ∑ gk(pkk(pk) ∑ gk(pkk(qk) above type and obtain its general solution on an open domain.  相似文献   

2.
For an integer k 1 and a geometric mesh (qi)−∞ with q ε (0, ∞), let Mi,k(x): = k[qi + k](· − x)+k − 1, Ni,k(x): = (qi + kqiMi,k(x)/k, and let Ak(q) be the Gram matrix (∝Mi,kNj,k)i,jεz. It is known that Ak(q)−1 is bounded independently of q. In this paper it is shown that Ak(q)−1 is strictly decreasing for q in [1, ∞). In particular, the sharp upper bound and lower bound for Ak (q)−1 are obtained: for all q ε (0, ∞).  相似文献   

3.
Let denote the subspace arrangement formed by all linear subspaces in given by equations of the form
1xi1=2xi2==kxik,
where 1i1<<ikn and (1,…,k){+1,−1}k.Some important topological properties of such a subspace arrangement depend on the topology of its intersection lattice. In a previous work on a larger class of subspace arrangements by Björner and Sagan (J. Algebraic Combin. 5 (1996) 291–314) the topology of the intersection lattice turned out to be a particularly interesting and difficult case.We prove in this paper that Pure(Πn,k±) is shellable, hence that Πn,k± is shellable for k>n/2. Moreover, we prove that unless in−2 (mod k−2) or in−3 (mod k−2), and that is free abelian for in−2 (mod k−2). In the special case of Π2k,k± we determine homology completely. Our tools are generalized lexicographic shellability, as introduced in Kozlov (Ann. Combin. 1 (1997) 67–90), and a spectral sequence method for the computation of poset homology first used in Hanlon (Trans. Amer. Math. Soc. 325 (1991) 1–37).We state implications of our results on the cohomology of the complements of the considered arrangements.  相似文献   

4.
Let X be a Banach space with closed unit ball B. Given k , X is said to be k-β, respectively, (k + 1)-nearly uniformly convex ((k + 1)-NUC), if for every ε > 0 there exists δ, 0 < δ < 1, so that for every x B and every ε-separated sequence (xn) B there are indices (ni)ki = 1, respectively, (ni)k + 1i = 1, such that (1/(k + 1))||x + ∑ki = 1 xni|| ≤ 1 − δ, respectively, (1/(k + 1))||∑k + 1i = 1 xni|| ≤ 1 − δ. It is shown that a Banach space constructed by Schachermayer is 2-β, but is not isomorphic to any 2-NUC Banach space. Modifying this example, we also show that there is a 2-NUC Banach space which cannot be equivalently renormed to be 1-β.  相似文献   

5.
LetΛ :=(λk)k=0be a sequence of distinct nonnegative real numbers withλ0 :=0 and ∑k=1 1/λk<∞. Let(0, 1) and(0, 1−) be fixed. An earlier work of the authors shows that [formula]is finite. In this paper an explicit upper bound forC(Λ) is given. In the special caseλk :=kα,α>1, our bounds are essentially sharp.  相似文献   

6.
We consider the class of doubly infinite sequences {a k } k = −∞ whose truncated sequences {a k } n k = −n are 3-times positive in the sense of Pólya and Fekete for all n = 1, 2, ..., and a 0 ≠ 0. We obtain a characterization of this class in terms of independent parameters. We also find an estimate of the growth order of the corresponding Laurent series ∑ k= −∞ akz k .  相似文献   

7.
The wave equation for Dunkl operators   总被引:1,自引:0,他引:1  
Let k = (kα)αε, be a positive-real valued multiplicity function related to a root system , and Δk be the Dunkl-Laplacian operator. For (x, t) ε N, × , denote by uk(x, t) the solution to the deformed wave equation Δkuk,(x, t) = δttuk(x, t), where the initial data belong to the Schwartz space on N. We prove that for k 0 and N l, the wave equation satisfies a weak Huygens' principle, while a strict Huygens' principle holds if and only if (N − 3)/2 + Σαε+kα ε . Here + is a subsystem of positive roots. As a particular case, if the initial data are supported in a closed ball of radius R > 0 about the origin, the strict Huygens principle implies that the support of uk(x, t) is contained in the conical shell {(x, t), ε N × | |t| − R x |t| + R}. Our approach uses the representation theory of the group SL(2, ), and Paley-Wiener theory for the Dunkl transform. Also, we show that the (t-independent) energy functional of uk is, for large |t|, partitioned into equal potential and kinetic parts.  相似文献   

8.
In the separable Hilbert space (H, ·, ·) the following “operator moment problem” is solved: given a complex sequence (ck)k ε Z generated by a meromorphic function f, find T ε B(H) and u0 ε H such that Tku0, u0 = ck (k ε Z). If the sequence (ck)k ε Z is “normal,” an adapted form of Vorobyev's method of moments yields a sequence of two point Padé approximants to f. A sufficient condition for convergence of this sequence of approximants is given.  相似文献   

9.
It is shown that an algebraic polynomial of degree k−1 which interpolates ak-monotone functionfatkpoints, sufficiently approximates it, even if the points of interpolation are close to each other. It is well known that this result is not true in general for non-k-monotone functions. As an application, we prove a (positive) result on simultaneous approximation of ak-monotone function and its derivatives inLp, 0<p<1, metric, and also show that the rate of the best algebraic approximation ofk-monotone functions (with bounded (k−2)nd derivatives inLp, 1<p<∞, iso(nk/p).  相似文献   

10.
Let X be a (real) separable Banach space, let {Vk} be a sequence of random elements in X, and let {ank} be a double array of real numbers such that limn→∞ ank = 0 for all k and Σk=1 |ank| ≤ 1 for all n. Define Sn = Σnk=1 ank(VkEVk). The convergence of {Sn} to zero in probability is proved under conditions on the coordinates of a Schauder basis or on the dual space of X and conditions on the distributions of {Vk}. Convergence with probability one for {Sn} is proved for separable normed linear spaces which satisfy Beck's convexity condition with additional restrictions on {ank} but without distribution conditions for the random elements {Vk}. Finally, examples of arrays {ank}, spaces, and applications of these results are considered.  相似文献   

11.
The solvability of the equation a1a2ak = x2, a1, a2, …, ak ε is studied for fixed k and ‘dense’ sets of positive integers. In particular, it is shown that if k is even and k 4, and is of positive upper density, then this equation can be solved.  相似文献   

12.
Le nombre maximal de lignes de matrices seront désignées par:
1. (a) R(k, λ) si chaque ligne est une permutation de nombres 1, 2,…, k et si chaque deux lignes différentes coïncide selon λ positions;
2. (b) S0(k, λ) si le nombre de colonnes est k et si chaque deux lignes différentes coïncide selon λ positions et si, en plus, il existe une colonne avec les éléments y1, y2, y3, ou y1 = y2y3;
3. (c) T0(k, λ) si c'est une (0, 1)-matrice et si chaque ligne contient k unités et si chaque deux lignes différentes contient les unités selon λ positions et si, en plus, il existe une colonne avec les éléments 1, 1, 0.
La fonction T0(k, λ) était introduite par Chvátal et dans les articles de Deza, Mullin, van Lint, Vanstone, on montrait que T0(k, λ) max(λ + 2, (k − λ)2 + k − λ + 1). La fonction S0(k, λ) est introduite ici et dans le Théorème 1 elle est étudiée analogiquement; dans les remarques 4, 5, 6, 7 on donne les généralisations de problèmes concernant T0(k, λ), S0(k, λ), dans la remarque 9 on généralise le problème concernant R(k, λ). La fonction R(k, λ) était introduite et étudiée par Bolton. Ci-après, on montre que R(k, λ) S0(k, λ) T0(k, λ) d'où découle en particulier: R(k, λ) λ + 2 pour λ k + 1 − (k + 2)1/2; R(k, λ) = 0(k2) pour k − λ = 0(k); R(k, λ) (k − 1)2 − (k + 2) pour k 1191.  相似文献   

13.
For the p-norm condition number κkp of the B-spline basis of order k we prove the upper estimate κkp<k2k. This proves de Boor's 2k-conjecture up to a polynomial factor.  相似文献   

14.
We study certain subcomplexes Δ′ of an arbitrary simplicial complex Δ such that Hmi(k[Δ])-Hmi(k[Δ′]) for any 0i<dim(k[Δ′]). Here, Hmi(k[Δ]) is the ith local cohomology module of the Stanley-Reisner ring k[Δ] of Δ over a field k. Our technique is an elegant approach to one of the most generalized versions of the rank selection theorems of J. Munkres (1984, Michigan Math. J.31, 113–128, Theorem 6.4) and R. Stanley (1979, Trans. Amer. Math. Soc.249, 139–157, Theorem 4.3).  相似文献   

15.
Let Dd,k denote the discriminant variety of degree d polynomials in one variable with at least one of its roots being of multiplicity ≥ k. We prove that the tangent cones to Dd,k span Dd,k − 1 thus, revealing an extreme ruled nature of these varieties. The combinatorics of the web of affine tangent spaces to Dd,k in Dd,k − 1 is directly linked to the root multiplicities of the relevant polynomials. In fact, solving a polynomial equation P(z) = 0 turns out to be equivalent to finding hyperplanes through a given point which are tangent to the discriminant hypersurface Dd,2. We also connect the geometry of the Viète map Vd: , given by the elementary symmetric polynomials, with the tangents to the discriminant varieties {Dd,k}.Various d-partitions {μ} provide a refinement {Doμ} of the stratification of by the Dd,k's. Our main result, Theorem 7.1, describes an intricate relation between the divisibility of polynomials in one variable and the families of spaces tangent to various strata {Doμ}.  相似文献   

16.
We present in this paper a dynamic binary coding scheme α on CNF formulas ψ, and show that under a uniform distribution μα on binary string α(ψ), SAT is complete on average, where μα(ψ) is proportional to α(ψ)−22α(ψ). We then show that there is k0>2 such that for all kk0, kSAT under μα is complete on average.  相似文献   

17.
For some integer k0 and two graph parameters π and τ, a graph G is called πτ(k)-perfect, if π(H)−τ(H)k for every induced subgraph H of G. For r1 let αr and γr denote the r-(distance)-independence and r-(distance)-domination number, respectively. In (J. Graph Theory 32 (1999) 303–310), I. Zverovich gave an ingenious complete characterization of α1γ1(k)-perfect graphs in terms of forbidden induced subgraphs. In this paper we study αrγs(k)-perfect graphs for r,s1. We prove several properties of minimal αrγs(k)-imperfect graphs. Generalizing Zverovich's main result in (J. Graph Theory 32 (1999) 303–310), we completely characterize α2r−1γr(k)-perfect graphs for r1. Furthermore, we characterize claw-free α2γ2(k)-perfect graphs.  相似文献   

18.
Let {pk(x; q)} be any system of the q-classical orthogonal polynomials, and let be the corresponding weight function, satisfying the q-difference equation Dq(σ)=τ, where σ and τ are polynomials of degree at most 2 and exactly 1, respectively. Further, let {pk(1)(x;q)} be associated polynomials of the polynomials {pk(x; q)}. Explicit forms of the coefficients bn,k and cn,k in the expansions
are given in terms of basic hypergeometric functions. Here k(x) equals xk if σ+(0)=0, or (x;q)k if σ+(1)=0, where σ+(x)σ(x)+(q−1)xτ(x). The most important representatives of those two classes are the families of little q-Jacobi and big q-Jacobi polynomials, respectively.Writing the second-order nonhomogeneous q-difference equation satisfied by pn−1(1)(x;q) in a special form, recurrence relations (in k) for bn,k and cn,k are obtained in terms of σ and τ.  相似文献   

19.
Estimating the discrepancy of the set of all arithmetic progressions in the first N natural numbers was one of the famous open problems in combinatorial discrepancy theory for a long time, successfully solved by K. Roth (lower bound) and Beck (upper bound). They proved that D(N)=minχmaxA|∑xAχ(x)|=Θ(N1/4), where the minimum is taken over all colorings χ:[N]→{−1,1} and the maximum over all arithmetic progressions in [N]={0,…,N−1}.Sumsets of k arithmetic progressions, A1++Ak, are called k-arithmetic progressions and they are important objects in additive combinatorics. We define Dk(N) as the discrepancy of the set {P∩[N]:P is a k-arithmetic progression}. The second author proved that Dk(N)=Ω(Nk/(2k+2)) and Přívětivý improved it to Ω(N1/2) for all k≥3. Since the probabilistic argument gives Dk(N)=O((NlogN)1/2) for all fixed k, the case k=2 remained the only case with a large gap between the known upper and lower bounds. We bridge this gap (up to a logarithmic factor) by proving that Dk(N)=Ω(N1/2) for all k≥2.Indeed we prove the multicolor version of this result.  相似文献   

20.
A remarkable theorem proved by Komlòs [4] states that if {fn} is a bounded sequence in L1(R), then there exists a subsequence {fnk} and f L1(R) such that fnk (as well as any further subsequence) converges Cesaro to f almost everywhere. A similar theorem due to Révész [6] states that if {fn} is a bounded sequence in L2(R), then there is a subsequence {fnk} and f L2(R) such that Σk=1 ak(fnkf) converges a.e. whenever Σk=1 | ak |2 < ∞. In this paper, we generalize these two theorems to functions with values in a Hilbert space (Theorems 3.1 and 3.3).  相似文献   

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

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