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 l
โฆ LIBER โฆ
On the universal Korovkin closure of subsets in vector lattices
โ Scribed by M Wolff
- Publisher
- Elsevier Science
- Year
- 1978
- Tongue
- English
- Weight
- 679 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0021-9045
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
On the f-vectors of Cutsets in the Boole
โ
Matthew Haines; Shahriar Shahriari
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 102 KB
The density of a maximum minimal cut in
โ
Feng Shi; Weixuan Li
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 319 KB
On the axial vector current and PCAC in
๐
Article
๐
1972
๐
Elsevier Science
๐
English
โ 81 KB
An explicit operator construction of the axial vector current in the boson o-model is given in perturbation theory. This current is finite and satisfies the PCAC condition with the renormalized pion field. It also (at least formally) satisfies the SU, x SlJ, equal-time time-component current algebra
41257 Research on the statistics of grai
๐
Article
๐
1990
๐
Elsevier Science
โ 174 KB