3
votes
1answer
138 views
Countable coloring of a plane
How does one prove existence decomposition of $R^2$ for countable many subsets $A(n)$
s
.t.$\forall$ $x,y$ $\epsilon$ $A(n)$ $|x-y|$ is nonrational?
I tried thinking of $R^2$ as …
24
votes
5answers
1k views
Game involving ‘asking questions about a real’
Consider the following game, played by two players,
called Q and A, in a time frame t = 1, 2, ....
At every time point i, Q mentions some $Q_i \subset \mathbb{R}$,
after which A m …
5
votes
0answers
215 views
Does every strictly increasing, unbounded sequence of positive real numbers contain arbitrarily long, finite subsequences which are “sort of increasing” or “sort of decreasing” (as defined below)?
Is the following true?
If $(x_0, x_1, \dots)$ is a strictly increasing, unbounded sequence of positive real numbers, then there exist fixed $M,N \geq 1$ such that the sequence $( …
3
votes
2answers
534 views
Partition calculus question
For $m,n,k < \omega$, consider the equation
$X \to (\omega \times k)^{m}_{n}$
What is the smallest $X$ known to satisfy it?
Baumgartner-Hajnal theorem gives a satisfactory an …
0
votes
1answer
139 views
Every vertex belongs to some component even in infinite graphs? [closed]
Defining a component as a maximally connected subgraph, is there a way to prove (or a counter-example) that every vertex belongs to some component, even in the case of infinite gra …
8
votes
0answers
212 views
Combinatorial Hilbert spaces
Any closed subspace $V\subset {\ell}^2(\omega)$ has associated to it a subset ${\cal S}_V$ of ${\cal P}(\omega)$, call it a combinatorial Hilbert space, namely the set of all suppo …

