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).     

混合型多属性决策的灰色关联分析法

针对属性权重信息不完全且属性取值为精确数,区间数和模糊数相结合的混合型多属性决策问题,提出了一种基于理想解的多属性决策的灰色关联分析方法.首先将三种不同形式的属性值均转化为区间数形式,然后依据灰色关联分析的思路,给出了解决该问题的计算步骤,其核心是构建并求解一个单目标最优化模型,得到每个方案与正、负理想方案的关联度,进而计算出每个方案对正理想方案的相对关联度,即可得到所有方案的排序结果.最后给出了一个数值例子,结果表明方法简单,有效和易于计算.     

Upper bounds for Ramsey numbers

The Ramsey number R(G₁,G₂,…,G_k) is the least integer p so that for any k-edge coloring of the complete graph K_p, there is a monochromatic copy of G_i of color i. In this paper, we derive upper bounds of R(G₁,G₂,…,G_k) for certain graphs G_i. In particular, these bounds show that R(9,9)6588 and R(10,10)23556 improving the previous best bounds of 6625 and 23854.     

Calabi-Yau 4-folds and toric fibrations

We present a general scheme for identifying fibrations in the framework of toric geometry and provide a large list of weights for Calabi-Yau 4-folds. We find 914 164 weights with degree d ≤ 150 whose maximal Newton polyhedra are reflexive and 525 572 weights with degree d ≤ 4000 that give rise to weighted projective spaces such that the polynomial defining a hypersurface of trivial canonical class is transversal. We compute all Hodge numbers, using Batyrev's formulas (derived by toric methods) for the first and Vafa's formulas (obtained by counting of Ramond ground states in N = 2 LG models) for the latter class, checking their consistency for the 109 308 weights in the overlap. Fibrations of k-folds, including the elliptic case, manifest themselves in the N lattice in the following simple way: The polyhedron corresponding to the fiber is a subpolyhedron of that corresponding to the k-fold, whereas the fan determining the base is a linear projection of the fan corresponding to the k-fold.     

Partition numbers

We continue [21] and study partition numbers of partial orderings which are related to (ω)/fin. In particular, we investigate P_f, be the suborder of ((ω)/fin)^ω containing only filtered elements, the Mathias partial order M, and (ω), (ω)^ω the lattice of (infinite) partitions of ω, respectively. We show that Solomon's inequality holds for M and that it consistently fails for P_f. We show that the partition number of (ω) is C. We also show that consistently the distributivity number of (ω)^ω is smaller than the distributivity number of (ω)/fin. We also investigate partitions of a Polish space into closed sets. We show that such a partition either is countable or has size at least D, where D is the dominating number. We also show that the existence of a dominating family of size ₁ does not imply that a Polish space can be partitioned into ₁ many closed sets.     

Refinement of the Gibbs and Bose-Einstein Distributions

A rigorous derivation of the Gibbs and Bose-Einstein distributions on a finite set of energies is stated, in essence, as a theorem in number theory. If there are not very many particles, then the discussion of this question reduces to an exact theorem. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 145, No. 3, pp. 433–436, December, 2005.     

数域Q(P_1~(1/2),…,P_t~(1/2))(t≥4)的类数为偶数

设t≥4，ｐ１，…，ｐｔ为不同的模４余１的素数，本文证明了数域P1~(1/2)，…，Pt~(1/2)的类数为偶数．     

Generating non-jumping numbers recursively

Let r?2 be an integer. A real number α∈[0,1) is a jump for r if there is a constant c>0 such that for any ε>0 and any integer m where m?r, there exists an integer n₀ such that any r-uniform graph with n>n₀ vertices and density ?α+ε contains a subgraph with m vertices and density ?α+c. It follows from a fundamental theorem of Erd?s and Stone that every α∈[0,1) is a jump for r=2. Erd?s asked whether the same is true for r?3. Frankl and Rödl gave a negative answer by showing some non-jumping numbers for every r?3. In this paper, we provide a recursive formula to generate more non-jumping numbers for every r?3 based on the current known non-jumping numbers.     

Trapezoidal approximations of fuzzy numbers preserving the expected interval — Algorithms and properties

Fuzzy number approximation by trapezoidal fuzzy numbers which preserves the expected interval is discussed. Algorithms for calculating the proper approximations are proposed and some properties of the approximation operators are discussed. It is shown that an adequate approximation operator might be chosen through the comparisons of some characteristics of the fuzzy number, like its ambiguity, width, its value and weighted expected value.     

Stability of the Cournot process – experimental evidence

We report results of experiments designed to test the predictions of the best-reply process. In a Cournot oligopoly with four firms, the best-reply process should theoretically explode if demand and cost functions are linear. We find, however, no experimental evidence of such instability. Moreover, we find no differences between a market which theoretically should not converge to Nash equilibrium and one which should converge because of inertia. We investigate the power of several learning dynamics to explain this unpredicted stability. Received May 1997/Revised June 2002