The search session has expired. Please query the service again.
Rational numbers are used to classify maximal almost disjoint (MAD) families of subsets of the integers. Combinatorial characterization of indestructibility of MAD families by the likes of Cohen, Miller and Sacks forcings are presented. Using these it is shown that Sacks indestructible MAD family exists in ZFC and that implies that there is a Cohen indestructible MAD family. It follows that a Cohen indestructible MAD family is in fact indestructible by Sacks and Miller forcings. A connection with...
We study maximal almost disjoint (MAD) families of functions in that satisfy certain strong combinatorial properties. In particular, we study the notions of strongly and very MAD families of functions. We introduce and study a hierarchy of combinatorial properties lying between strong MADness and very MADness. Proving a conjecture of Brendle, we show that if , then there no very MAD families. We answer a question of Kastermans by constructing a strongly MAD family from = . Next, we study the...
We consider a combinatorial problem related to guessing the values of a function at various points based on its values at certain other points, often presented by way of a hat-problem metaphor: there are a number of players who will have colored hats placed on their heads, and they wish to guess the colors of their own hats. A visibility relation specifies who can see which hats. This paper focuses on the existence of minimal predictors: strategies guaranteeing at least one player guesses correctly,...
Given an ideal on let () be minimum of the cardinalities of infinite (uncountable) maximal -almost disjoint subsets of . We show that if is a summable ideal; but for any tall density ideal including the density zero ideal . On the other hand, you have for any analytic -ideal , and for each density ideal . For each ideal on denote and the unbounding and dominating numbers of where iff . We show that and for each analytic -ideal . Given a Borel ideal on...
We prove in ZFC that every additive set is additive, thus we solve Problem 20 from paper [Weiss T., A note on the intersection ideal , Comment. Math. Univ. Carolin. 54 (2013), no. 3, 437-445] in the negative.
Currently displaying 1 –
6 of
6