• 沒有找到結果。

KOZLOV: Maximizing the Mobius function of a poset and the sum of the Betti numbers of the order complex

N/A
N/A
Info
下載
Protected

Academic year: 2022

Share "KOZLOV: Maximizing the Mobius function of a poset and the sum of the Betti numbers of the order complex"

Copied!
1
0
0

加載中.... (立即查看全文)

立即下載 ( 1 頁 )

全文

(1)

COMBINATOR1CA • Volume 19 • Number 4 • 1999

CONTENTS

NOGA ALON, MICHAEL KRIVELEVICH, BENNY SUDAKOV: List coloring of random and pseudo-random g r a p h s . . . 453 B. BOLLOBAS, A. D. SCOTT: Exact bounds for judicious partitions of

g r a p h s . . . 473.

TOMAS FEDER, PAVOL HELL, JING HUANG: List homomorphisms and circular arc graphs . . . 487 MARTIN GROHE: Equivalence in finite-variable logics is complete for poly-

nomial t i m e . . . 507 DMITRY N. KOZLOV: Maximizing the Mobius function of a poset and the

sum of the Betti numbers of the order complex . . . 533 L. PYBER: A bound for the diameter of distance-regular g r a p h s . . . 549 , JIRI SGALL: Bounds on pairs of families with restricted intersections . . . 555 VAN H. Vu: Extremal set systems with weakly restricted intersections .... 567 NOTE

SOOJIN CHO: On the support size of null designs of finite ranked posets... 589

參考文獻

立即下載 ( PDF - 1 頁 - 13.60 KB )

相關文件

The 4-choosability of planar graphs and cycle adjacency

Wang and Lih proved the 4-choosability of planar graphs without 5-cycles, or without 6-cycles, or without intersecting 3-cycles in [10, 9, 11]5. Farzad [3] proved the 4-choosability

Modelling the spread of a disease

Let p be the probability that a healthy person gets the disease, r be the probability that an infected person recovers in each month.. Suppose there are 8

5.2. Uniqueness of the Determinant Function

利用 determinant 我 們可以判斷一個 square matrix 是否為 invertible, 也可幫助我們找到一個 invertible matrix 的 inverse, 甚至將聯立方成組的解寫下.

2 Overview and Contributions of the Paper

Wang, Solving pseudomonotone variational inequalities and pseudocon- vex optimization problems using the projection neural network, IEEE Transactions on Neural Networks 17

3 Properties of the function Ψ

Then, we tested the influence of θ for the rate of convergence of Algorithm 4.1, by using this algorithm with α = 15 and four different θ to solve a test ex- ample generated as

3 Smoothness of the function ψ

Numerical results are reported for some convex second-order cone programs (SOCPs) by solving the unconstrained minimization reformulation of the KKT optimality conditions,

3 Properties of the Merit Function

Particularly, combining the numerical results of the two papers, we may obtain such a conclusion that the merit function method based on ϕ p has a better a global convergence and

3 Properties of the New NCP-Function

Then, it is easy to see that there are 9 problems for which the iterative numbers of the algorithm using ψ α,θ,p in the case of θ = 1 and p = 3 are less than the one of the