首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
For any numerical function we give sufficient conditions for resolving the controlled extension problem for a closed subset A of a normal space X. Namely, if the functions , and satisfy the equality E(f(a),g(a))=h(a), for every aA, then we are interested to find the extensions f? and ? of f and g, respectively, such that , for every xX. We generalize earlier results concerning E(u,v)=u·v by using the techniques of selections of paraconvex-valued LSC mappings and soft single-valued mappings.  相似文献   

2.
3.
Here we deal with the following question: Is it true that, for any closed interval on the real line ? that does not contain the origin, there exists a characteristic function f such that f(x) coincides with the normal characteristic function \( {\mathrm{e}}^{-{x}^2/2} \) on this interval but f(x) ? \( {\mathrm{e}}^{-{x}^2/2} \) on ?? The answer to this question is positive. We study a more general case of an arbitrary characteristic function g of a continuous probability density, instead of \( {\mathrm{e}}^{-{x}^2/2} \).  相似文献   

4.
The problem of extending partial functions is considered from the general viewpoint. Some aspects of this problem are illustrated by examples, which are concerned with typical real-valued partial functions (e.g. semicontinuous, monotone, additive, measurable, possessing the Baire property).  相似文献   

5.
6.
Summary Let be a natural exponential family on and (V, ) be its variance function. Here, is the mean domain of andV, defined on , is the variance of . A problem of increasing interest in the literature is the following: Given an open interval and a functionV defined on , is the pair (V, ) a variance function of some natural exponential family? Here, we consider the case whereV is a polynomial. We develop a complex-analytic approach to this problem and provide necessary conditions for (V, ) to be such a variance function. These conditions are also sufficient for the class of third degree polynomials and certain subclasses of polynomials of higher degree.  相似文献   

7.
8.
9.
10.
Classical results on the expansion of complex functions in a series of special polynomials (namely inverse similar sets of polynomials) are extended to the Clifford setting. This expansion is shown to be valid in closed balls. Copyright © 2011 John Wiley & Sons, Ltd.  相似文献   

11.
12.
This paper discusses the problem of choosing the Lagrange interpolation points T = (t0, t1,…, tn) in the interval −1 t 1 to minimize the norm of the error, considered as an operator from the Hardy space H2(R) of analytic functions to the space C[−1, 1]. It is shown that such optimal choices converge for fixed n, as R → ∞, to the zeros of a Chebyshev polynomial. Asymptotic estimates are given for the norm of the error for these optimal interpolations, as n → ∞ for fixed R. These results are then related to the problem of choosing optimal interpolation points with respect to the Eberlein integral. This integral is based on a probability measure over certain classes of analytic functions, and is used to provide an average interpolation error over these classes. The Chebyshev points are seen to be limits of optimal choices in this case also.  相似文献   

13.
14.
15.
In his recent book, Henrici (1974) gave an axiomatic treatment of the method of descent applied to the solution of polynomial equations, dealing in particular with the non-existence of continuous descent functions defined on the whole complex plane. This note presents an alternative account of this question, in which a somewhat stronger theorem is proved. At the same time, a certain problematical step, to which Henrici himself drew attention, is avoided.
Zusammenfassung Henrici (1974) gibt in einem kürzlich erschienenen Buch eine axiomatische Behandlung der Absteigungsmethode zur Lösung von Polynomialgleichungen. Dort wird insbesondere die Nichtexistenz von stetigen Absteigungsfunktionen, die auf der ganzen komplexen Ebene definiert sind, behandelt. In dieser Arbeit wird das gleiche Problem von einem anderen Standpunkt aus betrachtet, und es wird ein etwas stärkerer Satz bewiesen. Dabei wird eine kleine Schwierigkeit vermieden, auf die Henrici selber aufmerksam gemacht hat.
  相似文献   

16.
By using the LITTLEWOOD matrices A2n we generalize CLARKSON' S inequalities, or equivalently, we determine the norms ‖A2n: l(LP) → l(LP)‖ completely. The result is compared with the norms ‖A2n: ll‖, which are calculated implicitly in PIETSCH [6].  相似文献   

17.
The celebrated U-conjecture states that under the Nn(0,In) distribution of the random vector X=(X1,…,Xn) in Rn, two polynomials P(X) and Q(X) are unlinkable if they are independent [see Kagan et al., Characterization Problems in Mathematical Statistics, Wiley, New York, 1973]. Some results have been established in this direction, although the original conjecture is yet to be proved in generality. Here, we demonstrate that the conjecture is true in an important special case of the above, where P and Q are convex nonnegative polynomials with P(0)=0.  相似文献   

18.
19.
20.
Constructions and equivalence of APN functions play a significant role in the research of cryptographic functions. On finite fields of characteristic 2, 6 families of power APN functions and 14 families of polynomial APN functions have been constructed in the literature. However, the study on the equivalence among the aforementioned APN functions is rather limited to the equivalence in the power APN functions. Meanwhile, the theoretical analysis on the equivalence between the polynomial APN functions and the power APN functions, as well as the equivalence in the polynomial APN functions themselves, is far less studied. In this paper, we give the theoretical analysis on the inequivalence in 8 known families of polynomial APN functions and power APN functions.  相似文献   

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

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