首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 78 毫秒
1.
We consider the class P n * of algebraic polynomials of a complex variable with complex coefficients of degree at most n with real constant terms. In this class we estimate the uniform norm of a polynomial P nP n * on the circle Γr = z ∈ ?: ¦z¦ = r of radius r = 1 in terms of the norm of its real part on the unit circle Γ1 More precisely, we study the best constant μ(r, n) in the inequality ||Pn||C(Γr) ≤ μ(r,n)||Re Pn||C(Γ1). We prove that μ(r,n) = rn for rn+2 ? r n ? 3r2 ? 4r + 1 ≥ 0. In order to justify this result, we obtain the corresponding quadrature formula. We give an example which shows that the strict inequality μ(r, n) = r n is valid for r sufficiently close to 1.  相似文献   

2.
We consider the classical extremal problem of estimating norms of higher order derivatives of algebraic polynomials when their norms are given. The corresponding extremal problem for general polynomials in uniform norm was solved by A. A. Markov, while Bernstein found the exact constant in the Markov inequality for monotone polynomials. In this note we give Markov-type inequalities for higher order derivatives in the general class of k-monotone polynomials. In particular, in case of first derivative we find the exact solution of this extremal problem in both uniform and L 1-norms. This exact solution is given in terms of the largest zeros of certain Jacobi polynomials.  相似文献   

3.
Abstract. Let G be a simply connected domain in the complex plane bounded by a closed Jordan curve L and let P n , n≥ 0 , be polynomials of respective degrees n=0,1,··· that are orthonormal in G with respect to the area measure (the so-called Bergman polynomials). Let ? be a conformal map of G onto the unit disk. We characterize, in terms of the asymptotic behavior of the zeros of P n 's, the case when ? has a singularity on L . To investigate the opposite case we consider a special class of lens-shaped domains G that are bounded by two orthogonal circular arcs. Utilizing the theory of logarithmic potentials with external fields, we show that the limiting distribution of the zeros of the P n 's for such lens domains is supported on a Jordan arc joining the two vertices of G . We determine this arc along with the distribution function.  相似文献   

4.
Denote by πn the set of all algebraic polynomials of degree at most n with complex coefficients. An inequality of I. Schur asserts that the first derivative of the transformed Tchebycheff polynomial has the greatest uniform norm in [?1, 1] among all f ∈ ??n, where (1) Here we show that this extremal property of persists in the wider class of polynomials f ∈ πn which vanish at ±1, and for which there exist n ? 1 points separating the zeros of and such that for j = 1, …, n ? 1. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

5.
We prove the path sum formula for computing the U(n) invariant denominator functions associated to stretched U(n) Wigner operators. A family of U(n) invariant polynomials G[λ](n) is then defined which generalize the μGq(n) polynomials previously studied. The G[λ](n) polynomials are shown to satisfy a number of difference equations and have symmetry properties similar to the μGq(n) polynomials. We also give a direct proof of the important transposition symmetry for the G[λ](n) polynomials. To enable the non-specialist to understand the foundations for these remarkable polynomials, we provide an exposition of the boson calculus and the construction of the multiplicity-free U(n) Wigner operators.  相似文献   

6.
This paper is devoted to refining the Bernstein inequality. Let D be the differentiation operator. The action of the operator Λ = D/n on the set of trigonometric polynomials T n is studied: the best constant is sought in the inequality between the measures of the sets {xT: |Λt(x)| > 1} and {xT: |t(x)| > 1}. We obtain an upper estimate that is order sharp on the set of uniformly bounded trigonometric polynomials T n C = {tT n : ‖t‖ ≤ C}.  相似文献   

7.
Let H be a simple graph with n vertices and G be a sequence of n rooted graphs G1,G2,…,Gn. Godsil and McKay [C.D. Godsil, B.D. McKay, A new graph product and its spectrum, Bull. Austral. Math. Soc. 18 (1978) 21-28] defined the rooted product H(G), of H by G by identifying the root vertex of Gi with the ith vertex of H, and determined the characteristic polynomial of H(G). In this paper we prove a general result on the determinants of some special matrices and, as a corollary, determine the characteristic polynomials of adjacency and Laplacian matrices of H(G).Rojo and Soto [O. Rojo, R. Soto, The spectra of the adjacency matrix and Laplacian matrix for some balanced trees, Linear Algebra Appl. 403 (2005) 97-117] computed the characteristic polynomials and the spectrum of adjacency and Laplacian matrices of a class of balanced trees. As an application of our results, we obtain their conclusions by a simple method.  相似文献   

8.
Given a positive integerq, the ratio of the 2q-norm of a polynomial which its coefficients form a binary sequence and its 2-norm arose from telecommunication engineering consists of finding any type of such polynomials having the ratio “small”. In this paper we consider some special types of these polynomials, discuss the sharpest possible upper bound, and prove a result for the ratio. MAIN FACTS: A conjecture over a Rudin-Shapiro polynomialP n which has degree 2 n ?1 is that for any integerq, the ratio of its 2 q norm and its 2 norm is asymptotic to the 2qth root of 2 q (q+1)?1. In other words $||P_n ||_{2q} \sim ||P_n ||_2 \sqrt[{2q}]{{\frac{{2q}}{{q + 1}}}}$ . So far only up toq= 2 has been verified. However if the asymptotic behavior is valid for an evenq, then it is also valid for its next consecutive odd integer.  相似文献   

9.
For a fixed positive integer k, a k-tuple dominating set of a graph G=(V,E) is a subset D?V such that every vertex in V is dominated by at least k vertex in D. The k-tuple domination number γ ×k (G) is the minimum size of a k-tuple dominating set of G. The special case when k=1 is the usual domination. The case when k=2 was called double domination or 2-tuple domination. A 2-tuple dominating set D 2 is said to be minimal if there does not exist any D′?D 2 such that D′ is a 2-tuple dominating set of G. A 2-tuple dominating set D 2, denoted by γ ×2(G), is said to be minimum, if it is minimal as well as it gives 2-tuple domination number. In this paper, we present an efficient algorithm to find a minimum 2-tuple dominating set on permutation graphs with n vertices which runs in O(n 2) time.  相似文献   

10.
11.
For the weights exp (?|x|λ), 0<λ≤1, we prove the exact analogue of the Markov-Bernstein inequality. The Markov-Bernstein constant turns out to be of order logn for λ=1 and of order 1 for 0<λ<1. The proof is based on the solution of the problem of how fast a polynomialP n can decrease on [?1,1] ifP n (0)=1. The answer to this problem has several other consequences in different directions; among others, it leads to a general theorem about the incompleteness of the set of polynomials in weightedL p spaces.  相似文献   

12.
In this paper continuous embeddings in spaces of harmonic functions with mixed norm on the unit ball in ? n are established, generalizing some Hardy-Littlewood embeddings for similar spaces of holomorphic functions in the unit disc. Differences in indices between the spaces of harmonic and holomorphic spaces are revealed. As a consequence an analogue of classical Fejér-Riesz inequality is obtained. Embeddings in the special case of Riesz systems are also established.  相似文献   

13.
We consider a classical problem of estimating norms of higher order derivatives of an algebraic polynomial via the norms of the polynomial itself. The corresponding extremal problem for general polynomials in the uniform norm was solved by V. A. Markov. In 1926, Bernstein found the exact constant in the Markov inequality for monotone polynomials. It was shown in [3] that the order of the constants in constrained Markov–Nikolskii inequality for k-absolutely monotone polynomials is the same as in the classical one in case \({0 < p \leqq q \leqq \infty}\) . In this paper, we find the exact order for all values of \({0 < p, q \leqq \infty}\) . It turnes out that for the case q < p the constrained Markov–Nikolskii inequality is significantly better than the unconstrained one.  相似文献   

14.
A characterization is given of the sets supporting the uniform norms of weighted polynomials [w(x)] n P n (x), whereP n is any polynomial of degree at mostn. The (closed) support ∑ ofw(x) may be bounded or unbounded; of special interest is the case whenw(x) has a nonempty zero setZ. The treatment of weighted polynomials consists of associating each admissible weight with a certain functional defined on subsets of ∑ —Z. One main result of this paper states that there is a unique compact set (independent ofn andP n ) maximizing this functional that contains the points where the norms of weighted polynomials are attained. The distribution of the zeros of Chebyshev polynomials corresponding to the weights [w(x)] n is also studied. The main theorems give a unified method of investigating many particular examples. Applications to weighted approximation on the real line with respect to a fixed weight are included.  相似文献   

15.
Shelly L. Harvey 《Topology》2005,44(5):895-945
We define an infinite sequence of new invariants, δn, of a group G that measure the size of the successive quotients of the derived series of G. In the case that G is the fundamental group of a 3-manifold, we obtain new 3-manifold invariants. These invariants are closely related to the topology of the 3-manifold. They give lower bounds for the Thurston norm which provide better estimates than the bound established by McMullen using the Alexander norm. We also show that the δn give obstructions to a 3-manifold fibering over S1 and to a 3-manifold being Seifert fibered. Moreover, we show that the δn give computable algebraic obstructions to a 4-manifold of the form X×S1 admitting a symplectic structure even when the obstructions given by the Seiberg-Witten invariants fail. There are also applications to the minimal ropelength and genera of knots and links in S3.  相似文献   

16.
In this paper, we consider the general variational inequality GVI(F, g, C), whereF andg are mappings from a Hilbert space into itself andC is the fixed point set of a nonexpansive mapping. We suggest and analyze a new modified hybrid steepest-descent method of type methodu n+1=(1?α+θ n+1)Tu n +αu n ?θ n+1 g (Tu n )?λ n+1 μF(Tu n ),n≥0. for solving the general variational inequalities. The sequencex n is shown to converge in norm to the solutions of the general variational inequality GVI(F, g, C) under some mild conditions. Application to constrained generalized pseudo-inverse is included. Results proved in the paper can be viewed as an refinement and improvement of previously known results.  相似文献   

17.
In [Mineno K., Nakamura Y., Ohwada T., Characterization of the intermediate values of the triangle inequality, Math. Inequal. Appl., 2012, 15(4), 1019–1035] there was established a norm inequality which characterizes all intermediate values of the triangle inequality, i.e. C n that satisfy 0 ≤ C n ≤ Σ j=1 n x j ‖ ? ‖Σ j=1 n x j ‖, x 1,...,x n X. Here we study when this norm inequality attains equality in strictly convex Banach spaces.  相似文献   

18.
We prove the right Lax-type inequality on subarcs of the unit circle of the complex plane for complex algebraic polynomials of degree n having no zeros in the open unit disk. This is done by establishing the right Bernstein–Szeg?–Videnskii type inequality for real trigonometric polynomials of degree at most n on intervals shorter than the period. The paper is closely related to recent work by B. Nagy and V. Totik. In fact, their asymptotically sharp Bernstein-type inequality for complex algebraic polynomials of degree at most n on subarcs of the unit circle is recaptured by using more elementary methods. Our discussion offers a somewhat new way to see V.S. Videnskii’s Bernstein and Markov type inequalities for trigonometric polynomials of degree at most n on intervals shorter than a period, two classical polynomial inequalities first published in 1960. A new Riesz–Schur type inequality for trigonometric polynomials is also established. Combining this with Videnskii’s Bernstein-type inequality gives Videnskii’s Markov-type inequality immediately.  相似文献   

19.
We prove that Holman's hypergeometric series well-poised in SU(n) satisfy a general difference equation. We make use of the “path sum” function developed by Biedenharn and this equation to show that a special class of these series, multiplied by simple products, may be regarded as a U(n) generalization of Biedenharn and Louck's G(Δ; X) functions for U(3). The fact that these generalized G-functions are polynomials follows from a detailed study of their symmetries and zeros. As a further application of our general difference equations, we give an elementary proof of Holman's U(n) generalization of the 5F4(1) summation theorem.  相似文献   

20.
To each isolated singularity of a hypersurface of dimensionn, one associates the local fundamental groupG of the moduli space minus the discriminant locus, and a representation σ:G→Aut(H), whereH is then-homology group, with integer coefficients, of the non singular fibre. Although, in general it is very difficult to determine even a presentation ofG, we show that the image of σ can be computed rather easily, by exploiting some relations in a first aproximate presentation ofG, in the case of Brieskorn polynomials namely, polynomials of the type \(x_0^{a_0 } + \cdot \cdot \cdot + x_0^{a_n } \) . In this way we solve an open problem stated by Brieskorn [1] and Pham [8].  相似文献   

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

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