On the f-vectors of Cutsets in the Boolean Lattice
β Scribed by Matthew Haines; Shahriar Shahriari
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 102 KB
- Volume
- 93
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
β¦ Synopsis
A cutset in the poset 2 [n] , of subsets of [1, ..., n] ordered by inclusion, is a subset of 2 [n] that intersects every maximal chain. Let 0 : 1 be a real number. Is it possible to find a cutset in 2 [n] that, for each 0 i n, contains at most : ( n i ) subsets of size i ? Let :(n) be the greatest lower bound of all real numbers for which the answer is positive. In this note we prove the rather surprising fact that lim n Γ :(n)=0.
π SIMILAR VOLUMES
Let G=(V, E) be an undirected graph and C a subset of vertices. If the sets B r (v) 5 C, v Β₯ V, are all nonempty and different, where B r (v) denotes the set of all points within distance r from v, we call C an r-identifying code. We give bounds on the best possible density of r-identifying codes in
## Abstract We consider the sets definable in the countable models of a weakly oβminimal theory __T__ of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic (hence __T__ is pβ__Ο__βcategorical), in other words when each of these definable sets adm
## Abstract The use of Moloney murine leukaemia virus (MoMLV) derived retroviral vectors in gene therapy requires the production of high titer preparations. However, obtaining high titers of infective MoMLV retroviral vectors is difficult due to the vector inherent instability. In this work the eff