This paper gives the definition and some properties of a new family of Padé-type approximants (PTA) for k-variate formal power series (FPS). These PTA have the form P(t)/Q(t) where Q(t) = Πri = 0(1 ? x(i)·t), {x(i), 0 ? i ? r} being a given set of points in , and x·t is the scalar product of x and t in . Some results about the approximation order, the unicity and some invariance properties of these PTA are proved together with a convergence result when the FPS is defined by a Stieltjes integral. 相似文献
We introduce the notion of an Hadamard foliation as a foliation of Hadamard manifold which all leaves are Hadamard.We prove that a foliation of an Hadamard manifold M of curvature −a2 with a norm of the second fundamental form is Hadamard. For
we construct a canonical embedding of the union of leaf boundaries into the boundary of
. This embedding is continuous and it is homeomorphism on any fixed leaf boundary.Some methods of hyperbolic geometry are developed. It is shown that a ray in
with the bounded by κ<1 curvature has a limit on the boundary. 相似文献
The notion of a shadow of a self-dual binary code is generalized to self-dual codes over
4. A Gleason formula for the symmetrized weight enumerator of the shadow of a Type I code is derived. Congruence properties of the weights follow; this yields constructions of self-dual codes of larger lengths. Weight enumerators and the highest minimum Lee, Hamming, and Euclidean weights of Type I codes of length up to 24 are studied. 相似文献
We study approximation of univariate functions defined over the reals. We assume that the rth derivative of a function is bounded in a weighted Lp norm with a weight ψ. Approximation algorithms use the values of a function and its derivatives up to order r−1. The worst case error of an algorithm is defined in a weighted Lq norm with a weight ρ. We study the worst case (information) complexity of the weighted approximation problem, which is equal to the minimal number of function and derivative evaluations needed to obtain error . We provide necessary and sufficient conditions in terms of the weights ψ and ρ, as well as the parameters r, p, and q for the weighted approximation problem to have finite complexity. We also provide conditions which guarantee that the complexity of weighted approximation is of the same order as the complexity of the classical approximation problem over a finite interval. Such necessary and sufficient conditions are also provided for a weighted integration problem since its complexity is equivalent to the complexity of the weighted approximation problem for q=1. 相似文献
Let X be a smooth toric variety. Cox introduced the homogeneous coordinate ring S of X and its irrelevant ideal
. Let A denote the ring of differential operators on Spec(S). We show that the category of
-modules on X is equivalent to a subcategory of graded A-modules modulo
-torsion. Additionally, we prove that the characteristic variety of a
-module is a geometric quotient of an open subset of the characteristic variety of the associated A-module and that holonomic
-modules correspond to holonomic A-modules. 相似文献
Given a finite sequence a{a1, …, aN} in a domain Ωn, and complex scalars v{v1, …, vN}, consider the classical extremal problem of finding the smallest uniform norm of a holomorphic function verifying f(aj)=vj for all j. We show that the modulus of the solutions to this problem must approach its least upper bound along a subset of the boundary of the domain large enough so that its A(Ω)-hull contains a subset of the original a large enough to force the same minimum norm. Furthermore, all the solutions must agree on a variety which contains the hull (in an appropriate, weaker, sense) of a measure supported on the maximum modulus set. An example is given to show that the inclusions can be strict. 相似文献