Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options answers only not deleted user 6794

Combinatorial properties of infinite sets. This is a corner-point of set theory and combinatorics.

17 votes

Independent families of subsets of $\mathbb N$ of size continuum

The original proof by Fichtenholz and Kantorovich is, in my opinion, a nice one. It suffices to find continuum many independent subsets of some countably infinite set $C$; let's take $C$ to be the co …
Andreas Blass's user avatar
7 votes
Accepted

On infinite combinatorics of ultrafilters

Like your previous question, Selective ultrafilter and bijective mapping , this fails for all nonprincipal ultrafilters $\mathcal U$ on $\omega$, and for essentially the same reason. If there were suc …
Andreas Blass's user avatar
4 votes
Accepted

Dense filter and selective ultrafilter

No, there are no such $\mathcal U$ and $\varphi$. Let me start the proof with two simplifying observations. First, $\varphi$ is irrelevant, because bijections of $\omega$ to itself preserve selectivi …
Andreas Blass's user avatar
5 votes

Sunflowers in $\omega$ consisting of infinite sets

Let $C$ be the set of finite sequences of zeros and ones. I'll exhibit uncountably many infinite subsets of $C$ such that no three form a sunflower. Since $C$ is countably infinite, the example can be …
Andreas Blass's user avatar
15 votes
Accepted

Selective ultrafilter and bijective mapping

No, this fails not only for selective ultrafilters but for all non-principal ultrafilters $\mathcal F$ on $\omega$. The main ingredient in the proof is the theorem that, if an ultrafilter $\mathcal U …
Andreas Blass's user avatar
4 votes
Accepted

Steiner-like systems on $\omega$

Sure, let $K$ be any countably infinite field and let $P$ be the projective plane (or a higher-dimensional projective space) over $K$. Let $S'$ be the set of lines in $P$ (where a line is regarded as …
Andreas Blass's user avatar
7 votes
Accepted

Minimum number of dense sets to make a filter an ultrafilter

No; $\mathfrak u'=\mathfrak c$. To prove it, consider any $\mathcal C\subseteq[\omega]^\omega$ with cardinality $<\mathfrak c$. Working modulo finoite subsets of $\omega$ , and closing under (finitary …
Andreas Blass's user avatar
12 votes
Accepted

Maximal intersecting families on $\omega$ that are not ultrafilters

Let $U,V,W$ be three distinct ultrafilters on $\omega$. Let $M$ be the family of those subsets of $\omega$ that belong to at least two of $U,V,W$. Then $M$ is a maximal intersecting family, it is not …
Andreas Blass's user avatar
9 votes

Separation of almost disjoint families by ground model almost disjoint families

Here's a possibly simpler example than Joel's, in the case of $\omega$. Let $A_0$ be $c$ (where I think of the Cohen real as a subset of $\omega$), and let the rest of the $A_n$'s be any partition of …
Andreas Blass's user avatar
4 votes

Ideals on $\mathbb N$ and large sets that have small intersection

I'm not sure the following example is different from the ones already given, but the description is different, and so I hope some readers might find it useful. Fix a countable family $\mathcal F$ of …
Andreas Blass's user avatar
4 votes
Accepted

Are complete regular linear hypergraphs on $\omega$ isomorphic?

If $K$ is a field of cardinality $\aleph_0$, then the points and lines of the projective plane over $F$ constitute a complete regular linear hypergraph. The field $K$ can be recovered (up to isomorphi …
Andreas Blass's user avatar
3 votes

"Coloring" the greatest common divisor relation

There is no such $n$. Proof: Suppose $n$ and $f$ are as in the problem. Of the $2n+1$ numbers $1,2,4,8, \dots, 2^{2n}$, some three have the same $f$-value. And the smallest of those three is the grea …
Andreas Blass's user avatar
6 votes
Accepted

Property ${\bf B}$ for families of large sets with small intersection

EDIT: I'll leave my previous answer up for now (at the end of this one), but here's an easier answer that doesn't need assumptions like CH that go beyond ZFC. It's well-known that there is a family of …
Andreas Blass's user avatar
9 votes
Accepted

Large almost disjoint family on $\mathbb{N}$ with property $\mathbf{B}$

One of the standard examples of an almost disjoint family of cardinality $\mathfrak c$ is the set of paths through the complete binary tree $2^{<\omega}$ (identified with $\omega$ via your favorite bi …
Andreas Blass's user avatar