共查询到20条相似文献,搜索用时 24 毫秒
1.
2.
Two uniform asymptotic expansions are obtained for the Pollaczek polynomials Pn(cosθ;a,b). One is for , , in terms of elementary functions and in descending powers of . The other is for , in terms of a special function closely related to the modified parabolic cylinder functions, in descending powers of n. This interval contains a turning point and all possible zeros of Pn(cosθ) in θ(0,π/2]. 相似文献
3.
In this paper, we prove that every bijective map preserving Lie products from a factor von Neumann algebra into another factor von Neumann algebra is of the form A→ψ(A)+ξ(A), where is an additive isomorphism or the negative of an additive anti-isomorphism and is a map with ξ(AB-BA)=0 for all . 相似文献
4.
Juan de Dios Prez Florentino G. Santos 《Differential Geometry and its Applications》2008,26(2):218-223
We classify real hypersurfaces of complex projective space , m3, with -recurrent structure Jacobi operator and apply this result to prove the non-existence of such hypersurfaces with recurrent structure Jacobi operator. 相似文献
5.
We construct a two-point selection , where is the set of the irrational numbers, such that the space is not normal and it is not collectionwise Hausdorff either. Here, τf denotes the topology generated by the two-point selection f. This example answers a question posed by V. Gutev and T. Nogura. We also show that if is a two-point selection such that the topology τf has countable pseudocharacter, then τf is a Tychonoff topology. 相似文献
6.
In this work, the authors first show the existence of global attractors for the following lattice complex Ginzburg–Landau equation: and for the following lattice Schrödinger equation: Then they prove that the solutions of the lattice complex Ginzburg–Landau equation converge to that of the lattice Schrödinger equation as ε→0+. Also they prove the upper semicontinuity of as ε→0+ in the sense that . 相似文献
7.
Recently, it was proved by Leedham-Green and others that with a finite number of exceptions, every p-group of coclass r is a quotient of one of only a finite number of p-adic uniserial space groups. In this paper we use that structure to demonstrate that there are only finitely many isomorphism classes of cohomology rings of 2-groups of coclass r with coefficients in any fixed field k of characteristic 2. In addition, there is experimental evidence indicating that in many cases successive quotients of the uniserial space groups have isomorphic cohomology rings. 相似文献
8.
Let be a dilation-stable process on . We determine a Hausdorff measure function (a) such that the fractal set X[0,1]={X(t):0t1} has positive finite -measure. We also investigate the packing measure of X[0,1]. 相似文献
9.
A. Ballester-Bolinches L.A. Kurdachenko Tatiana Pedraza 《Journal of Pure and Applied Algebra》2007,210(3):665-671
A group G is said to be a -group if permutability is a transitive relation in the set of all subgroups of G. Our purpose in this paper is to study -groups in the class of periodic radical groups satisfying min-p for all primes p. 相似文献
10.
We work in set-theory without choice ZF. Denoting by the countable axiom of choice, we show in that the closed unit ball of a uniformly convex Banach space is compact in the convex topology (an alternative to the weak topology in ZF). We prove that this ball is (closely) convex-compact in the convex topology. Given a set I, a real number p1 (respectively p=0), and some closed subset F of [0,1]I which is a bounded subset of ℓp(I), we show that (respectively DC, the axiom of Dependent Choices) implies the compactness of F. 相似文献
11.
Discrete subspaces of countably tight compacta 总被引:1,自引:0,他引:1
Our main result is that the following cardinal arithmetic assumption, which is a slight weakening of GCH, “2κ is a finite successor of κ for every cardinal κ”, implies that in any countably tight compactum X there is a discrete subspace D with . This yields a (consistent) confirmation of Alan Dow’s Conjecture 2 from [A. Dow, Closures of discrete sets in compact spaces, Studia Math. Sci. Hung. 42 (2005) 227–234]. 相似文献
12.
For a Polish group let be the minimal number of translates of a fixed closed nowhere dense subset of required to cover . For many locally compact this cardinal is known to be consistently larger than which is the smallest cardinality of a covering of the real line by meagre sets. It is shown that for several non-locally compact groups . For example the equality holds for the group of permutations of the integers, the additive group of a separable Banach space with an unconditional basis and the group of homeomorphisms of various compact spaces. 相似文献
13.
Boris Aronov Mark de Berg Otfried Cheong Joachim Gudmundsson Herman Haverkort Michiel Smid Antoine Vigneron 《Computational Geometry》2008,40(3):207-219
Given a set S of n points in , and an integer k such that 0k<n, we show that a geometric graph with vertex set S, at most n−1+k edges, maximum degree five, and dilation O(n/(k+1)) can be computed in time O(nlogn). For any k, we also construct planar n-point sets for which any geometric graph with n−1+k edges has dilation Ω(n/(k+1)); a slightly weaker statement holds if the points of S are required to be in convex position. 相似文献
14.
Takeshi Torii 《Topology and its Applications》2005,150(1-3):33-57
We have a ring homomorphism Θ from the cohomology of the extended Morava stabilizer group Gn with coefficients in F[w±1] to the cohomology of Gn+1 with coefficients in the graded field F((un))[u±1]. In this note we study the behavior of Θ on H1. Then it is shown that Θ is injective on H1 for n1 and for all primes p. 相似文献
15.
The performance of a linear t-error correcting code over a q-ary symmetric memoryless channel with symbol error probability ε is characterized by the probability that a transmission error will remain undetected. This probability is a function of ε involving the code weight distribution and the weight distribution of the cosets of minimum weight at most t. When the undetectable error probability is an increasing function of ε, the code is called t-proper.
The paper presents sufficient conditions for t-properness and a list of codes known to be proper, many of which have been studied by these sufficient conditions. Special attention is paid to error detecting codes of interest in modern communication. 相似文献
16.
17.
Finding the closest or farthest line segment (line) from a point are fundamental proximity problems. Given a set S of n points in the plane and another point q, we present optimal O(nlogn) time, O(n) space algorithms for finding the closest and farthest line segments (lines) from q among those spanned by the points in S. We further show how to apply our techniques to find the minimum (maximum) area triangle with a vertex at q and the other two vertices in S{q} in optimal O(nlogn) time and O(n) space. Finally, we give an O(nlogn) time, O(n) space algorithm to find the kth closest line from q and show how to find the k closest lines from q in O(nlogn+k) time and O(n+k) space. 相似文献
18.
In this paper we first give a lower bound on multiplicities for Buchsbaum homogeneous k-algebras A in terms of the dimension d, the codimension c, the initial degree q, and the length of the local cohomology modules of A. Next, we introduce the notion of Buchsbaum k-algebras with minimal multiplicity of degree q, and give several characterizations for those rings. In particular, we will show that those algebras have linear free resolutions. Further, we will give many examples of those algebras. 相似文献
19.
20.
We consider the problem of computing a minimum weight pseudo-triangulation of a set of n points in the plane. We first present an -time algorithm that produces a pseudo-triangulation of weight which is shown to be asymptotically worst-case optimal, i.e., there exists a point set for which every pseudo-triangulation has weight , where is the weight of a minimum weight spanning tree of . We also present a constant factor approximation algorithm running in cubic time. In the process we give an algorithm that produces a minimum weight pseudo-triangulation of a simple polygon. 相似文献