首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Shubin  A. V. 《Doklady Mathematics》2020,101(3):235-238
Doklady Mathematics - Let 0 < α, σ < 1 be arbitrary fixed constants, let $${{q}_{1}} < {{q}_{2}} < \ldots < {{q}_{n}} < {{q}_{{n + 1}}}$$...  相似文献   

2.
Albanese  Angela A.  Bonet  José  Ricker  Werner J. 《Positivity》2019,23(1):177-193
Positivity - The Banach sequence spaces ces(p) are generated in a specified way via the classical spaces $$ \ell _p, 1< p < \infty .$$ For each pair $$ 1< p,q < \infty...  相似文献   

3.
Ukrainian Mathematical Journal - We prove that, for any 0 < ?? < 1, there exists a measurable set E?? ? [0, 1], mes (E??) > 1...  相似文献   

4.
Analysis Mathematica - LetT be a regular positive method of summation, $$n_k \in Z_ + , 0 = n_0< n_1< ...< n_k< ..., \mu _n \geqq 0 \left( {n \in N} \right).$$ Then an...  相似文献   

5.
Archiv der Mathematik - The discrete Cesàro spaces $${{\text {ces(p )}}}, 1< p < \infty ,$$ are well known and arise from the classical sequence spaces $$\ell ^p,1<\infty...  相似文献   

6.
In this paper, we propose and analyse a model of dynamics trans-mission of malaria, incorporating varying degrees p of susceptible and ofinfectious that makes the dynamic of the overall host population integrateSEIRS, SEIS, SIRS and SIS at the same time. For this model we compute anew threshold number and establish the global asymptotic stability of thedisease-free equilibrium when R0 < < 1. If < R0 < 1, the system admits aunique endemic equilibrium (EE) and if R0 > 1 depending on case the systemadmits one or two endemic equilibrium. Numerical simulations are presentedfor dierent value of R0, based on data collected in the literature. Finally,the impact of parameters p and of system dynamics are investigated.  相似文献   

7.
Lithuanian Mathematical Journal - In this paper, we show that for any fixed 1 < c < 967/805, every sufficiently large positive number N, and a small constant ?? >...  相似文献   

8.
Acta Mathematicae Applicatae Sinica, English Series - We prove that the weak Morrey space WM is contained in the Morrey space $$M_{{q_1}}^p$$ for 1 ≤ q1 < q ≤ p < ∞....  相似文献   

9.
Ricerche di Matematica - The main aim of this paper to provide several scales of equivalent conditions for the bilinear Hardy inequalities in the case $$1< q, p_1, p_2<\infty $$ with...  相似文献   

10.
Lithuanian Mathematical Journal - For 0 < α ≤ 1 and 0 < λ ≤ 1, let L(α, λ, s) denote the associated Lerch zeta-function, which is defined as $$...  相似文献   

11.
Lithuanian Mathematical Journal - Let 0?<?γ1?<???≤?γk?≤?? be the sequence of imaginary parts of...  相似文献   

12.
We prove that for every convex disk in the plane there exists a double-lattice covering of the plane with copies of with density ≤ 1.2281772 . This improves the best previously known upper bound ≤ 8/(3+2\sqrt{3}) 1.2376043 , due to Kuperberg, but it is still far from the conjectured value . <lsiheader> <onlinepub>7 August, 1998 <editor>Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; <pdfname>20n2p251.pdf <pdfexist>yes <htmlexist>no <htmlfexist>no <texexist>no <sectionname> </lsiheader> Received June 1, 1996, and in revised form January 24, 1997.  相似文献   

13.
Statistical Inference for Stochastic Processes - Let us consider a stochastic differential equation driven by a fractional Brownian motion with Hurst parameter $$1/4&lt; H &lt; 1/2$$ . We...  相似文献   

14.
Finding Convex Sets Among Points in the Plane   总被引:1,自引:0,他引:1  
Let g(n) denote the least value such that any g(n) points in the plane in general position contain the vertices of a convex n -gon. In 1935, Erdős and Szekeres showed that g(n) exists, and they obtained the bounds Chung and Graham have recently improved the upper bound by 1; the first improvement since the original Erdős—Szekeres paper. We show that <lsiheader> <onlinepub>26 June, 1998 <editor>Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; <pdfname>19n3p405.pdf <pdfexist>yes <htmlexist>no <htmlfexist>no <texexist>yes <sectionname> </lsiheader> Received January 1, 1997, and in revised form June 6, 1997.  相似文献   

15.
Delgado  Julio 《Results in Mathematics》2015,67(3-4):431-444
Results in Mathematics - Given a self-adjoint second order differential operator L with positive characteristic and subellipticity of order 1&nbsp;≤&nbsp;τ &lt;&nbsp;2....  相似文献   

16.
We study the anti-symmetric solutions to the Lane-Emden type system involving fractional Laplacian(-?)s(0 < s < 1). First, we obtain a Liouville type theorem in the often-used defining space L2s.An interesting lower bound on the solutions is derived to estimate the Lipschitz coefficient in the sub-linear cases. Considering the anti-symmetric property, one can naturally extend the defining space from L2 s to L2s+1.Surprisingly, with this extension...  相似文献   

17.
We prove an O(n(k+1) 1/3 ) upper bound for planar k -sets. This is the first considerable improvement on this bound after its early solution approximately 27 years ago. Our proof technique also applies to improve the current bounds on the combinatorial complexities of k -levels in the arrangement of line segments, k convex polygons in the union of n lines, parametric minimum spanning trees, and parametric matroids in general. <lsiheader> <onlinepub>26 June, 1998 <editor>Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; <pdfname>19n3p373.pdf <pdfexist>yes <htmlexist>no <htmlfexist>no <texexist>yes <sectionname> </lsiheader> Received May 31, 1997, and in revised form June 30, 1997.  相似文献   

18.
In a seminal paper from 1935, Erdős and Szekeres showed that for each n there exists a least value g(n) such that any subset of g(n) points in the plane in general position must always contain the vertices of a convex n -gon. In particular, they obtained the bounds which have stood unchanged since then. In this paper we remove the +1 from the upper bound for n ≥ 4 . <lsiheader> <onlinepub>26 June, 1998 <editor>Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; <pdfname>19n3p367.pdf <pdfexist>yes <htmlexist>no <htmlfexist>no <texexist>yes <sectionname> </lsiheader> Received January 1, 1997, and in revised form June 6, 1997.  相似文献   

19.
Let F=F(n) denote the largest number such that any set of n points in the plane with minimum distance 1 has at least F elements, no two of which are at unit distance. Improving a result by Pollack, we show that F(n)≥ (9/35)n . We also give an O(n log n) time algorithm for selecting at least (9/35)n elements in a set of n points with minimum distance 1 so that no two selected points are at distance 1. <lsiheader> <onlinepub>7 August, 1998 <editor>Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; <pdfname>20n2p179.pdf <pdfexist>yes <htmlexist>no <htmlfexist>no <texexist>no <sectionname> </lsiheader> Received June 12, 1996, and in revised form April 22, 1997.  相似文献   

20.
Let g(n) denote the least integer such that among any g(n) points in general position in the plane there are always n in convex position. In 1935, P. Erdős and G. Szekeres showed that g(n) exists and . Recently, the upper bound has been slightly improved by Chung and Graham and by Kleitman and Pachter. In this paper we further improve the upper bound to <lsiheader> <onlinepub>26 June, 1998 <editor>Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; <pdfname>19n3p457.pdf <pdfexist>yes <htmlexist>no <htmlfexist>no <texexist>yes <sectionname> </lsiheader> Received July 1, 1997, and in revised form July 14, 1997.  相似文献   

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

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