On Fractional Brownian Processes

We use Liouville spaces in order to prove the existence of some different fractional -Brownian motion ( 0 < 1 ), or fractional ( , )-Brownian sheets. There are also applications to the Wiener stochastic integral with respect to these -Brownian.     

Sharp constants in the doubly weighted Hardy-Littlewood-Sobolev inequality

It is well known that the doubly weighted Hardy-Littlewood-Sobolev inequality is as follows,Z Rn Z Rn f(x)g(y)|x||x.y||y|dxdy6 B(p,q,,,,n)kfkLp(Rn)kgkLq(Rn).The main purpose of this paper is to give the sharp constants B(p,q,,,,n)for the above inequality for three cases:(i)p=1 and q=1;(ii)p=1 and 1q 6∞,or 1p 6∞and q=1;(iii)1p,q∞and 1p+1q=1.In addition,the explicit bounds can be obtained for the case 1p,q∞and 1p+1q1.     

关于拟d-Koszul模的一个注记

本文研究了文献[4]中给出的极小马蹄型引理成立的充分条件.借助拟d-Koszul模给出了一个充要条件并给出了一个极小马蹄型引理的应用.     

关于二阶半线性椭圆方程的Dirichlet边值问题一个注记(英文)

本文研究二阶半线性椭圆方程的Dirichlet边值问题.利用山路引理和最小作用原理,获得了在新条件下具有Dirichlet边值问题的二阶半线性椭圆方程的弱解的存在性的结果.     

图的2-强边色数的上界

本文研究了图的2-强边色数的上界. 利用图染色的概率方法中的一般局部引理, 得到了3 ≤Δ ≤ 730时,χ''_s(G,2) ≤ 2Δ + 1, 推广了参考文献[11,12]中的结果     

一类奇异临界椭圆方程非平凡解的存在性

研究了一类带Sobolev-Hardy临界指数的奇异椭圆方程,应用变分方法,通过能量估计和证明对应的能量泛函满足(PS)_c条件,运用山路引理得到了这类方程非平凡解的存在性.     

Schwarz引理与Schwarz-Pick引理在单位球B_n上的推广

对单复变中的Schwarz引理与Schwarz-Pick引理在C~n中的超球上进行了推广.考虑C~n中单位球B_n上模小于1的全纯函数f(z),并在f(0)=0的条件下给出函数在原点的任意阶导数的估计.更进一步地,得到了B_n上模小于1的任意全纯函数在任意点的高阶导数的估计.     

带有位势的拟线性椭圆型方程正解的存在性

本文利用Ekeland的变分原理及山路引理,研究了以下问题在一定条件下的正解的存在性：{-△pu=λuq/|x|s+ur,u＞0,x∈Ω(∩)RN,{u(x)=0,x∈(a)Ω,其中△pu=div(| ▽ u |p-2 ▽u),u∈W1,p0(Ω),Ω是RN中的有界区域,且0∈Ω,0＜q＜p-1,N≥3,0＜s＜N(p-q-1)p-1 +q+1,p-1＜r≤p*-1,p*=Np(N-p)-1,λ＞0.此时,s可以大于p,从而推广了p=2时的某些结果.     

Sparse partition universal graphs for graphs of bounded degree

In 1983, Chvátal, Trotter and the two senior authors proved that for any Δ there exists a constant B such that, for any n, any 2-colouring of the edges of the complete graph KN with N?Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree Δ. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and edges, with N=⌈B^′n⌉ for some constant B^′ that depends only on Δ. Consequently, the so-called size-Ramsey number of any H with n vertices and maximum degree Δ is . Our approach is based on random graphs; in fact, we show that the classical Erd?s–Rényi random graph with the numerical parameters above satisfies a stronger partition property with high probability, namely, that any 2-colouring of its edges contains a monochromatic universal graph for the class of graphs on n vertices and maximum degree Δ.The main tool in our proof is the regularity method, adapted to a suitable sparse setting. The novel ingredient developed here is an embedding strategy that allows one to embed bounded degree graphs of linear order in certain pseudorandom graphs. Crucial to our proof is the fact that regularity is typically inherited at a scale that is much finer than the scale at which it is assumed.