Titlebook: Numbers, Information and Complexity; Ingo Alth?fer,Ning Cai,Zhen Zhang Book 2000 Springer Science+Business Media New York 2000 Symbol.code

exigent

The Extreme Points of the Probabilistic Capacities Cone ProblemLet . be the empty set and . be the reals. Let . = {1, 2, ..., n} and . be the set of subsets of .. Let . be the set of maps .: . → . satisfying

STENT

On Shifts of CascadesFor . ≥ 1 the cascade .has.The (.) = Δ shift of binco .. We show when Δ..(.)+Δ..(.) ≥ Δ.. (. + .), and when ≤. We compare Δ..(.) and Δ...(.). If . with . real, we show when ., and when ≤. This generalises results for (1, ?1) known from Kruskal—Katona and Lovász For (1, ?1), if . and . then . increases with .. Most results are best possible.