where gjΩ for 1jn−1 and arrival times for x1,x2,…,xn, we describe a cubic-time algorithm that determines a circuit for f over Ω that is of linear size and whose delay is at most 1.44 times the optimum delay plus some small constant.  相似文献   

3.
On a problem of H. Shapiro     
Iossif Ostrovskii  Alexander Ulanovskii   《Journal of Approximation Theory》2004,126(2):218-232
Let μ be a real measure on the line such that its Poisson integral M(z) converges and satisfies|M(x+iy)|Aecyα, y→+∞,for some constants A,c>0 and 0<α1. We show that for 1/2<α1 the measure μ must have many sign changes on both positive and negative rays. For 0<α1/2 this is true for at least one of the rays, and not always true for both rays. Asymptotical bounds for the number of sign changes are given which are sharp in some sense.  相似文献   

4.
On the Positivity of the Fundamental Polynomials for Generalized Hermite–Fejér Interpolation on the Chebyshev Nodes     
Simon J. Smith 《Journal of Approximation Theory》1999,96(2):338
It is shown that the fundamental polynomials for (0, 1, …, 2m+1) Hermite–Fejér interpolation on the zeros of the Chebyshev polynomials of the first kind are non-negative for −1x1, thereby generalising a well-known property of the original Hermite–Fejér interpolation method. As an application of the result, Korovkin's 10theorem on monotone operators is used to present a new proof that the (0, 1, …, 2m+1) Hermite–Fejér interpolation polynomials offC[−1, 1], based onnChebyshev nodes, converge uniformly tofasn→∞.  相似文献   

5.
Universal Polynomial Majorants on Convex Bodies     
Andrs Kro 《Journal of Approximation Theory》2001,111(2):303
Let K be a convex body in d (d2), and denote by Bn(K) the set of all polynomials pn in d of total degree n such that |pn|1 on K. In this paper we consider the following question: does there exist a p*nBn(K) which majorates every element of Bn(K) outside of K? In other words can we find a minimal γ1 and p*nBn(K) so that |pn(x)|γ |p*n(x)| for every pnBn(K) and x d\K? We discuss the magnitude of γ and construct the universal majorants p*n for evenn. It is shown that γ can be 1 only on ellipsoids. Moreover, γ=O(1) on polytopes and has at most polynomial growth with respect to n, in general, for every convex body K.  相似文献   

6.
A Nonsymmetric Correlation Inequality for Gaussian Measure     
Stanislaw J. Szarek  Elisabeth Werner   《Journal of multivariate analysis》1999,68(2):138
Letμbe a Gaussian measure (say, onRn) and letK,LRnbe such thatKis convex,Lis a “layer” (i.e.,L={xaxub} for someabRanduRn), and the centers of mass (with respect toμ) ofKandLcoincide. Thenμ(KL)μ(Kμ(L). This is motivated by the well-known “positive correlation conjecture” for symmetric sets and a related inequality of Sidak concerning confidence regions for means of multivariate normal distributions. The proof uses the estimateΦ(x)> 1−((8/π)1/2/(3x+(x2+8)1/2))ex2/2,x>−1, for the (standard) Gaussian cumulative distribution function, which is sharper than the classical inequality of Komatsu.  相似文献   

7.
Rook-by-rook rook theory: Bijective proofs of rook and hit equivalences     
Nicholas A. Loehr  Jeffrey B. Remmel   《Advances in Applied Mathematics》2009,42(4):483-503
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.  相似文献   

8.
A pointwise convergence for Sobolev space functions     
Javad Namazi 《Journal of Mathematical Analysis and Applications》2004,290(2):553-562
Let 1<p<∞, and k,m be positive integers such that 0(k−2m)pn. Suppose ΩRn is an open set, and Δ is the Laplacian operator. We will show that there is a sequence of positive constants cj such that for every f in the Sobolev space Wk,p(Ω), for all xΩ except on a set whose Bessel capacity Bk−2m,p is zero.  相似文献   

9.
Arithmetic progressions consisting of unlike powers     
N. Bruin  K. Gy&#x;ry  L. Hajdu  Sz. Tengely 《Indagationes Mathematicae》2006,17(4):539-555
In this paper we present some new results about unlike powers in arithmetic progression. We prove among other things that for given k 4 and L 3 there are only finitely many arithmetic progressions of the form with xi , gcd(x0, xl) = 1 and 2 li L for i = 0, 1, …, k − 1. Furthermore, we show that, for L = 3, the progression (1, 1,…, 1) is the only such progression up to sign. Our proofs involve some well-known theorems of Faltings [9], Darmon and Granville [6] as well as Chabauty's method applied to superelliptic curves.  相似文献   

10.
On groups with conjugacy classes of distinct sizes     
Zvi Arad  Mikhail Muzychuk  Avital Oliver   《Journal of Algebra》2004,280(2):537
A finite group G is called an ah-group if any two distinct conjugacy classes of G have distinct cardinality. We show that if G is an ah-group, then the non-abelian socle of G is isomorphic to one of the following:
1. , for 1a5, a≠2.
2. A8.
3. PSL(3,4)e, for 1e10.
4. A5×PSL(3,4)e, for 1e10.
Based on this result, we virtually show that if G is an ah-group with π(G) 2,3,5,7 , then F(G)≠1, or equivalently, that G has an abelian normal subgroup.In addition, we show that if G is an ah-group of minimal size which is not isomorphic to S3, then the non-abelian socle of G is either trivial or isomorphic to one of the following:
1. , for 3a5.
2. PSL(3,4)e, for 1e10.
Our research lead us to interesting results related to transitivity and homogeneousity in permutation groups, and to subgroups of wreath products of form Z2Sn. These results are of independent interest and are located in appendices for greater autonomy.  相似文献   

11.
Hankel determinants and orthogonal polynomials     
Alexandre Junod 《Expositiones Mathematicae》2003,21(1):63
We develop a general context for the computation of the determinant of a Hankel matrix Hn = (αi+j)0i,jn, assuming some suitable conditions for the exponential (or ordinary) generating function of the sequence (αn)n0. Several well-known particular cases are thus derived in a unified way.  相似文献   

12.
13.
On Equivalence of Moduli of Smoothness     
Yingkang Hu 《Journal of Approximation Theory》1999,97(2):182
It is known that iffWkp, thenωm(ft)pm−1(f′, t)p…. Its inverse with any constants independent offis not true in general. Hu and Yu proved that the inverse holds true for splinesSwith equally spaced knots, thusωm(St)pm−1(S′, t)pt2ωm−2(S″, t)p…. In this paper, we extend their results to splines with any given knot sequence, and further to principal shift-invariant spaces and wavelets under certain conditions. Applications are given at the end of the paper.  相似文献   

14.
The maximum spectral radius of -free graphs of given order and size     
Vladimir Nikiforov   《Linear algebra and its applications》2009,430(11-12):2898-2905
Suppose that G is a graph with n vertices and m edges, and let μ be the spectral radius of its adjacency matrix.Recently we showed that if G has no 4-cycle, then μ2-μn-1, with equality if and only if G is the friendship graph.Here we prove that if m9 and G has no 4-cycle, then μ2m, with equality if G is a star. For 4m8 this assertion fails.  相似文献   

15.
16.
On the chromatic number of random graphs     
Amin Coja-Oghlan  Konstantinos Panagiotou  Angelika Steger   《Journal of Combinatorial Theory, Series B》2008,98(5):980-993
In this paper we consider the classical Erdős–Rényi model of random graphs Gn,p. We show that for p=p(n)n−3/4−δ, for any fixed δ>0, the chromatic number χ(Gn,p) is a.a.s. , +1, or +2, where is the maximum integer satisfying 2(−1)log(−1)p(n−1).  相似文献   

17.
Group actions and invariants in algebras of generic matrices     
Z. Reichstein  N. Vonessen   《Advances in Applied Mathematics》2006,37(4):481
We show that the fixed elements for the natural GLm-action on the universal division algebra UD(m,n) of m generic n×n-matrices form a division subalgebra of degree n, assuming n3 and 2mn2−2. This allows us to describe the asymptotic behavior of the dimension of the space of SLm-invariant homogeneous central polynomials p(X1,…,Xm) for n×n-matrices. Here the base field is assumed to be of characteristic zero.  相似文献   

18.
Pseudoprime values of the Fibonacci sequence, polynomials and the Euler function     
Florian Luca  Igor E. Shparlinski   《Indagationes Mathematicae》2006,17(4):611-625
We show that if α > 1 is any fixed integer, then for a sufficiently large x > 1, the nth Fibonacci number Fn is a base α pseudopfime only for at most (4 + o(1))π(x) of posifive integers n x. The same result holds for Mersenne numbers 2n — 1 and for one more general class of Lucas sequences. A slight modification of our method also leads to similar results for polynomial sequences f(n), where f ∊ [X]. Finally, we use a different technique to get a much sharper upper bound on the counting fimction of the positive integers n such that φ(n) is a base α pseudoprime, where φ is the Euler function.  相似文献   

19.
disjoint cycles containing specified independent vertices     
Jiuying Dong   《Discrete Mathematics》2008,308(22):5269-5273
Let k1 be an integer and G be a graph of order n3k satisfying the condition that σ2(G)n+k-1. Let v1,…,vk be k independent vertices of G, and suppose that G has k vertex-disjoint triangles C1,…,Ck with viV(Ci) for all 1ik.Then G has k vertex-disjoint cycles such that
(i) for all 1ik.
(ii) , and
(iii) At least k-1 of the k cycles are triangles.
The condition of degree sum σ2(G)n+k-1 is sharp.
Keywords: Degree sum condition; Independent vertices; Vertex-disjoint cycles  相似文献   

20.
On Weighted Mean Convergence of Lagrange Interpolation for General Arrays     
D. S. Lubinsky 《Journal of Approximation Theory》2002,118(2):153-162
For n1, let {xjn}j=1n be n distinct points and let Ln[·] denote the corresponding Lagrange Interpolation operator. Let W : →[0,∞). What conditions on the array {xjn}1jn, n1 ensure the existence of p>0 such
for every continuous f : → with suitably restricted growth, and some “weighting factor” φb? We obtain a necessary and sufficient condition for such a p to exist. The result is the weighted analogue of our earlier work for interpolation arrays contained in a compact set.  相似文献   

  首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
In this paper, we present a method that allows one to obtain a number of sharp inequalities for expectations of functions of infinite-degree U-statistics. Using the approach, we prove, in particular, the following result: Let D be the class of functions f :R+R+ such that the function f(x+z)−f(x) is concave in xR+ for all zR+. Then the following estimate holds: for all fD and all U-statistics ∑1i1<<ilnYi1,…,il(Xi1,…,Xil) with nonnegative kernels Yi1,…,il :RlR+, 1ikn; iris, rs; k,r,s=1,…,l; l=0,…,m, in independent r.v.'s X1,…,Xn. Similar inequality holds for sums of decoupled U-statistics. The class D is quite wide and includes all nonnegative twice differentiable functions f such that the function f″(x) is nonincreasing in x>0, and, in particular, the power functions f(x)=xt, 1<t2; the power functions multiplied by logarithm f(x)= (x+x0)t ln(x+x0), 1<t<2, x0max(e(3t2−6t+2)/(t(t−1)(2−t)),1); and the entropy-type functions f(x)=(x+x0)ln(x+x0), x01. As an application of the results, we determine the best constants in Burkholder–Rosenthal-type inequalities for sums of U-statistics and prove new decoupling inequalities for those objects. The results obtained in the paper are, to our knowledge, the first known results on the best constants in sharp moment estimates for U-statistics of a general type.  相似文献   

2.
We consider boolean circuits C over the basis Ω={,} with inputs x1, x2,…,xn for which arrival times are given. For 1in we define the delay of xi in C as the sum of ti and the number of gates on a longest directed path in C starting at xi. The delay of C is defined as the maximum delay of an input.Given a function of the form
f(x1,x2,…,xn)=gn−1(gn−2(…g3(g2(g1(x1,x2),x3),x4)…,xn−1),xn)
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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