首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
In this paper, we firstly consider the Brück conjecture itself and show that it holds exactly for the entire function c(Ae^cz-a)+a{f(z)=\frac{1}{c}(Ae^{cz}-a)+a} , where A, a, c are nonzero constants. Then we give a necessary and sufficient condition that f(z) and f (z) share a finite value a CM for some special cases. Finally, we investigate two analogues of the Brück conjecture including the difference analogue of the Brück conjecture raised by Liu and Yang (Arch. Math. 92, 270–278 (2009)) and the shifted analogue of the Brück conjecture raised by Heittokangas et al. (J. Math. Anal. Appl. 355, 352–363 (2009)). And we give some necessary conditions when f(z) shares a finite value a CM with its difference operators or shifts.  相似文献   

3.
4.
A Weitzenböck manifold is a triplet defined by a differentiable manifold with a metric g of certain signature and a linear connection with zero curvature tensor and nonzero torsion tensor which is a metric connection with respect to g. The theory of such manifolds is called the “new theory of gravity”. We study properties of three classes of Weitzenböck manifolds and prove some vanishing thorems.  相似文献   

5.
In the article “A note on the Brück conjecture” (Arch. Math. 95 (2010), 257–268), the proofs of our results Theorem 1.4 and Theorem 1.6 mainly depend on Lemma 2.6, which is wrong. In this corrigendum, we give a correct proof of Theorem 1.4. Theorem 1.6 can be proved similarly; so we omit its proof.  相似文献   

6.
7.
It is shown that control of the Schrödinger maximal function sup0 <t<1 ?eitΔf? for fHs(Rn) requires sn/2(n + 1).  相似文献   

8.
Science China Mathematics - We make some observations concerning the one-dimensional collapsing geometry of four-dimensional hyperkähler metrics.  相似文献   

9.
This note gives a positive answer to an old question in elementary probability theory that arose in Furstenberg’s seminal article “Disjointness in Ergodic Theory.” As a consequence, Furstenberg’s filtering theorem holds without any integrability assumption.  相似文献   

10.
The well-known Hölder inequality is generalized and refined, a condition at which the equality holds is obtained.  相似文献   

11.
12.
In a recent paper published in Optimization Letters, Montoya et al. (Optim Lett 8:1721–1734, 2014) proposed a branch-and-price approach for a multi-skill project scheduling problem. In that paper, an integer linear programming formulation was first introduced which, unfortunately, has a number of inconsistences. At the interest of mathematical rigor, in this note, we refine such formulation.  相似文献   

13.
The notion of σ?-properness of a subset of a frame is introduced. Using this notion, we give necessary and su?cient conditions for a frame to be weakly Lindelöf. We show that a frame is weakly Lindelöf if and only if its semiregularization is weakly Lindelöf. For a completely regular frame L, we introduce a condition equivalent to weak realcompactness based on maximal ideals of the cozero part of L. This enables us to show that every weakly realcompact almost P -frame is realcompact. A new characterization of weakly Lindelöf frames in terms of neighbourhood strongly divisible ideals of ?? is provided. The closed ideals of ?? equipped with the uniform topology are applied to describe weakly Lindelöf frames.  相似文献   

14.
15.
In this short note, we show the illposedness of anisotropic Schroedinger equation in L^2 if the growth of nonlinearity is larger than a threshold power pc which is also the critical power for blowup, as Fibich, Ilan and Schochet have pointed out recently. The illposedness in anisotropic Sobolev space Hk,d-d^2s,s where 0 〈 s 〈 sc, sc =d/2-k/4-2/p-1, and the illposedness in Sobolev space of negative order H^s, s 〈 0 are also proved.  相似文献   

16.
In this paper, we almost completely solve the Hamilton–Waterloo problem with C8-factors and Cm-factors where the number of vertices is a multiple of 8m.  相似文献   

17.
The Turán number T(n, l, k) is the smallest possible number of edges in a k-graph on n vertices such that every l-set of vertices contains an edge. Given a k-graph H = (V(H), E(H)), we let Xs(S) equal the number of edges contained in S, for any s-set S?V(H). Turán's problem is equivalent to estimating the expectation E(Xl), given that min(Xl) ≥ 1. The following lower bound on the variance of Xs is proved:
Var(Xs)?mmn?2ks?kns?1nk1
, where m = |E(H)| and m = (kn) ? m. This implies the following: putting t(k, l) = limn→∞T(n, l, k)(kn)?1 then t(k, l) ≥ T(s, l, k)((ks) ? 1)?1, whenever sl > k ≥ 2. A connection of these results with the existence of certain t-designs is mentioned.  相似文献   

18.
Let τ(n) be the Ramanujan τ-function, x ≥ 10 be an integer parameter. We prove that
We also show that
where ω(n) is the number of distinct prime divisors of n and p denotes prime numbers. These estimates improve several results from [6, 9]. Received: 23 November 2006  相似文献   

19.
Some properties of a class of path-dependent options based on the α-quantiles of Brownian motion are discussed. In particular, it is shown that such options are well behaved in relation to standard options and comparatively cheaper than an equivalent class of lookback options.  相似文献   

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

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