Page 1

Displaying 1 – 18 of 18

Showing per page

MAD families and P -points

Salvador García-Ferreira, Paul J. Szeptycki (2007)

Commentationes Mathematicae Universitatis Carolinae

The Katětov ordering of two maximal almost disjoint (MAD) families 𝒜 and is defined as follows: We say that 𝒜 K if there is a function f : ω ω such that f - 1 ( A ) ( ) for every A ( 𝒜 ) . In [Garcia-Ferreira S., Hrušák M., Ordering MAD families a la Katětov, J. Symbolic Logic 68 (2003), 1337–1353] a MAD family is called K -uniform if for every X ( 𝒜 ) + , we have that 𝒜 | X K 𝒜 . We prove that CH implies that for every K -uniform MAD family 𝒜 there is a P -point p of ω * such that the set of all Rudin-Keisler predecessors of p is dense in the...

MAD families and the rationals

Michael Hrušák (2001)

Commentationes Mathematicae Universitatis Carolinae

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...

MAD families with strong combinatorial properties

Jörg Brendle, Greg Piper (2007)

Fundamenta Mathematicae

In his paper in Fund. Math. 178 (2003), Miller presented two conjectures regarding MAD families. The first is that CH implies the existence of a MAD family that is also a σ-set. The second is that under CH, there is a MAD family concentrated on a countable subset. These are proved in the present paper.

Maximal almost disjoint families of functions

Dilip Raghavan (2009)

Fundamenta Mathematicae

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 c o v ( ) < , then there no very MAD families. We answer a question of Kastermans by constructing a strongly MAD family from = . Next, we study the...

Metric spaces with point character equal to their size

C. Avart, P. Komjath, Vojtěch Rödl (2010)

Commentationes Mathematicae Universitatis Carolinae

In this paper we consider the point character of metric spaces. This parameter which is a uniform version of dimension, was introduced in the context of uniform spaces in the late seventies by Jan Pelant, Cardinal reflections and point-character of uniformities, Seminar Uniform Spaces (Prague, 1973–1974), Math. Inst. Czech. Acad. Sci., Prague, 1975, pp. 149–158. Here we prove for each cardinal κ , the existence of a metric space of cardinality and point character κ . Since the point character can...

Minimal predictors in hat problems

Christopher S. Hardin, Alan D. Taylor (2010)

Fundamenta Mathematicae

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,...

Minimality of non-σ-scattered orders

Tetsuya Ishiu, Justin Tatch Moore (2009)

Fundamenta Mathematicae

We will characterize-under appropriate axiomatic assumptions-when a linear order is minimal with respect to not being a countable union of scattered suborders. We show that, assuming PFA⁺, the only linear orders which are minimal with respect to not being σ-scattered are either Countryman types or real types. We also outline a plausible approach to demonstrating the relative consistency of: There are no minimal non-σ-scattered linear orders. In the process of establishing these results, we will...

More remarks on the intersection ideal 𝒩

Tomasz Weiss (2018)

Commentationes Mathematicae Universitatis Carolinae

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.

More set-theory around the weak Freese–Nation property

Sakaé Fuchino, Lajos Soukup (1997)

Fundamenta Mathematicae

We introduce a very weak version of the square principle which may hold even under failure of the generalized continuum hypothesis. Under this weak square principle, we give a new characterization (Theorem 10) of partial orderings with κ-Freese-Nation property (see below for the definition). The characterization is not a ZFC theorem: assuming Chang’s Conjecture for ω , we can find a counter-example to the characterization (Theorem 12). We then show that, in the model obtained by adding Cohen reals,...

Multiple gaps

Antonio Avilés, Stevo Todorcevic (2011)

Fundamenta Mathematicae

We study a higher-dimensional version of the standard notion of a gap formed by a finite sequence of ideals of the quotient algebra 𝓟(ω)/fin. We examine different types of such objects found in 𝓟(ω)/fin both from the combinatorial and the descriptive set-theoretic side.

Currently displaying 1 – 18 of 18

Page 1