确定Ramsey数下界值的随机算法

文[1—2]借助于计算机得到了几个Ramsey数的下界值,但由于计算机确定Ramsey数的下界值往往需要判断多达指数级的各种情况,因此所需的计算时间常使人难以接受.本文提出了一种确定Ramsey数r(k,l)下界值的随机算法,该算法试图随机而有针对性地构造一个有n个顶点的简单图G,使G中既无k个顶点的团又无l个顶点的独立集,从而确定n+1是r     

关于扇和完全等二部图联图的均匀全色数

对于一个正常的全染色满足各种颜色所染元素(点和边)数量的和相差不超过1时,称为均匀全染色,其所用最少的染色数称为均匀全色数.本文得到了m+1阶扇Fm和完全等二部图Kn,n的联图Fm∨Kn,n的均匀全色数.     

由自共轭线性微分算子所确定的函数类在Lq(T)中的相对宽度

得到了使等式Kn(K2(Pr),MK2(Pr),L2(T))=dn(K2(Pr),L2(T))成立的最小M值,并计算了Kn(K2(Pr),K2(Pr),Lq(T))的渐近阶,其中Kn(.,.,Lq(T))和dn(.,Lq(T)),1≤q≤∞,分别代表Kolmogorov意义下在Lq(T)中的相对宽度和宽度,K2(Pr)表示定义在[-π,π]上由自共轭线性微分算子所确定的光滑函数类.     

广义图K(n,m)的全色数

1965年,M.Behzad和Vizing分别提出了著名的全着色猜想:即对于简单图G有:XT(G)≤△+2,其中△是图G的最大度.本文确定了完全图Kn的广义图K(n,m)的全色数,并利用它证明了Lm×Kn(m≥3)是第Ⅰ型的.     

关于Witt代数基本子代数的一点注记

设g=W_1是特征p3的代数闭域k上的Witt代数.本文确定了g的极大基本子代数.进一步具体给出了最大维数的基本子代数的G共轭类,这里G是g的自同构群.从而证明了最大维数为(p-1)/2的基本子代数射影簇E((p-1)/2,g)是不可约的且是一维的.更进一步,证明了E(1,g)是不可约的,具有维数p-2,而E(2,g)是等维的,共有(p-3)/2个不可约分支,且每个不可约分支的维数是p-4.而当3≤r≤(p-3)/2时,E(r,g)是可约的.给出了E(r,g)(3≤r≤(p-3)/2)维数的一个下界.     

关于Ramsey数下界的部分结果

本文得到 Ramsey数下界的一个计算公式 :R( l,s+ t-2 )≥ R( l,s) + R( l,t) -1 ,(式中 l、s、t≥ 3) .用此公式算得的 Ramsey数的下界比用其它公式算得的下界好 .     

Verlinde模性范畴上的Casimir数及其应用

本文计算了秩为n+1的一类特殊的Verlinde模性范畴L的Casimir数,计算结果表明该Casimir数为2n+4.作为应用,由Higman定理知域K上的Grothendieck代数Gr(L)_Z K是半单代数当且仅当2n+4在域K中不为零.这也给出了第二类型n+1次Dickson多项式E_(n+1)(X)在K[X]中无重因式的一个等价刻画.如果2n+4在域K中为零,借助于Dickson多项式的有关因式分解定理,本文完全给出了Grothendieck代数Gr(L)_Z K的Jacobson根.     

Ramsey Number With Largen

This is an announcement that r(C2m+1, Kn) ≤ c(m) has been proved. The Rarnsey number r(H, Kn) is the smallest integer N such that every H-free graph on N vertices has independence number at least n. The study of Ramsey number r(Ck, Kn) was initiated by Bondy and Erdos[2]. They proved that for any fixed n, r(Ck, Kn) = (k - 1)(n - 1) + 1if k≥n2-1, and r(Ck, Kn)≤kn2. For fixed k≥3, it is difficult to obtain a satisfied bound of r(Ck,Kn) for n →∞. The bound of Bondy and Erdos was improved as r(Ck, Kn)≤c(k)n1+1/m,where m = [(k - 1)/2] by Erdos, Faudree, Rousseau and Schelp[4]. For even cycle, a more refined     

高阶Lagrange中值定理“中值点”的渐近性

借助Stirling数研究了高阶Lagrange微分中值定理在f(n+1)(a)=0或f(n+1)(a)不存在时的“中值点”的渐近性,并给出了渐近性估计式.     

r-一致超图Ramsey函数的渐近下界(英文)

本文利用Lovasz局部引理的Spencer形式和对称形式给出r-一致超图Ramsey函数的渐近下界.证明了:对于任意取定的正整数f0,使得当n→∞时,有R~((r))(m~l,n~(k-l))≥(c-o(1))(n~(r-1)/logn)~■.特别地,R~((r))_k(n)≥(1-o(1))n/e k~■(n→∞).对于任意取定的正整数s≥r+1和常数δ>0,α≥0,如果F表示阶为s的r-一致超图,■表示阶为t的r-一致超图,且■的边数满足m(■)≥(δ-o(1))t~r/(logt)α(t→∞),则存在c=c(s,δ,α)>0,使得R~((r))(F,■)≥(c-o(1))(t~(r-1)/(logt)~l+(r-l)α)~(m(F)-l/s-r).     

代数构造及在Ramsey理论中的应用

这篇文章在伽罗瓦域上的代数构造和关于一些特定类型图的Ramsey数之间建立了一个关系. 研究了关于伽罗瓦域上的代数构造的方程及方程组的解. 我们得到了一些关于二部图的Ramsey数的新的下界和上界.     

非负张量谱半径的估计

本文给出了非负张量谱半径新的上下界, 且比参考文献[J. Inequal. Appl. 2015]中的结果更精确, 最后通过数值算例说明本文所给估计式的有效性.     

Bipartite Graphs Kn,n+r- A (|A| ≤ 3) Determined by Their Cycle Length Distributions

The cycle length distribution of a graph G of order n is a sequence (c1 (G),..., cn (G)), where ci(G) is the number of cycles of length i in G. In general, the graphs with cycle length distribution (c1(G),...,cn(G)) are not unique. A graph G is determined by its cycle length distribution if the graph with cycle length distribution (c1 (G),..., cn (G)) is unique. Let Kn,n+r be a complete bipartite graph and A(∈)E(Kn,n+r). In this paper, we obtain: Let s > 1 be an integer. (1) If r = 2s, n > s(s - 1) + 2|A|, then Kn,n+r - A (A(∈)E(Kn,n+r),|A| ≤ 3) is determined by its cycle length distribution; (2) If r = 2s + 1,n > s2 + 2|A|, Kn,n+r - A (A(∈)E(Kn,n+r), |A| ≤ 3) is determined by its cycle length distribution.     

Combined perturbation bounds: Ⅱ. Polar decompositions

In this paper, we study the perturbation bounds for the polar decomposition A= QH where Q is unitary and H is Hermitian. The optimal (asymptotic) bounds obtained in previous works for the unitary factor, the Hermitian factor and singular values of A are σ2r||△Q||2F ≤ ||△A||2F,1/2||△H||2F ≤ ||△A||2F and ||△∑||2F ≤ ||△A||2F, respectively, where ∑ = diag(σ1, σ2,..., σr, 0,..., 0) is the singular value matrix of A and σr denotes the smallest nonzero singular value. Here we present some new combined (asymptotic)perturbation bounds σ2r ||△Q||2F+1/2||△H||2F≤ ||△A||2F and σ2r||△Q||2F+||△∑ ||2F ≤||△A||2F which are optimal for each factor. Some corresponding absolute perturbation bounds are also given.     

Sharp estimates for Hübner’s upper bound function with applications

New better estimates, which are given in terms of elementary functions, for the function r → (2/π)(1 - r2)K(r)K (r) + log r appearing in Hübner's sharp upper bound for the Hersch-Pfluger distortion function are obtained. With these estimates, some known bounds for the Hersch-Pfluger distortion function in quasiconformal theory are improved, thus improving the explicit quasiconformal Schwarz lemma and some known estimates for the solutions to the Ramanujan modular equations.     

一类核具有连续横截面变换半群的秩

设X_n={1,2,…,n}并赋予自然数序,MCK_n是X_n上核具有连续横截面保序或反序变换所构成的半群.K_n是MCK_n的最大正则子半群.本文将考虑K_n的理想K(n,r)={α∈K_n:|im(α)|≤r}(3≤r≤n-1).证明了K(n,r)的秩为(n-r+1)(n-r+2)(n-r+3)/6.     

Bounds for Asian basket options

In this paper we propose pricing bounds for European-style discrete arithmetic Asian basket options in a Black and Scholes framework. We start from methods used for basket options and Asian options. First, we use the general approach for deriving upper and lower bounds for stop-loss premia of sums of non-independent random variables as in Kaas et al. [Upper and lower bounds for sums of random variables, Insurance Math. Econom. 27 (2000) 151–168] or Dhaene et al. [The concept of comonotonicity in actuarial science and finance: theory, Insurance Math. Econom. 31(1) (2002) 3–33]. We generalize the methods in Deelstra et al. [Pricing of arithmetic basket options by conditioning, Insurance Math. Econom. 34 (2004) 55–57] and Vanmaele et al. [Bounds for the price of discrete sampled arithmetic Asian options, J. Comput. Appl. Math. 185(1) (2006) 51–90]. Afterwards we show how to derive an analytical closed-form expression for a lower bound in the non-comonotonic case. Finally, we derive upper bounds for Asian basket options by applying techniques as in Thompson [Fast narrow bounds on the value of Asian options, Working Paper, University of Cambridge, 1999] and Lord [Partially exact and bounded approximations for arithmetic Asian options, J. Comput. Finance 10 (2) (2006) 1–52]. Numerical results are included and on the basis of our numerical tests, we explain which method we recommend depending on moneyness and time-to-maturity.     

ContributionsChromatic Ramsey numbers

Suppose G is a graph. The chromatic Ramsey number r_c(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: for any 2-colouring of the edges of F there is a monochromatic subgraph isomorphic to G. Let M_n = min[r_c(G): χ(G) = n]. It was conjectured by Burr et al. (1976) that M_n = (n − 1)² + 1. This conjecture has been confirmed previously for n 4. In this paper, we shall prove that the conjecture is true for n = 5. We shall also improve the upper bounds for M₆ and M₇.     

代数构造及在Ramsey理论中的应用

本文在Galois域上的代数构造和关于一些特定类型图的Ramseyr数之间建立了一个关系．关键问题是研究了关于Galois域上的代数构造的方程及方程组的解．我们得到了一些关于二部图的新的下界和上界．