Search Results
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 |
Combinatorial properties of infinite sets. This is a corner-point of set theory and combinatorics.
7
votes
Commuting functions and fixpoints
The answer is no, even if you consider only injective functions.
Consider any infinite cardinal $\kappa$, and let
$X=\omega\times\kappa$ be the disjoint union of $\kappa$ many
copies of $\omega$. Le …
3
votes
Accepted
Extending almost disjoint family in a maximal set
Every family $\mathcal{F}$ containing $\omega$ itself as a member is trivially maximal, since no infinite set is almost disjoint from $\omega$. But the family could otherwise consist of an almost disj …
17
votes
Game involving 'asking questions about a real'
I claim that Q can have no winning strategy, even in the fully general game where there is no restriction on the complexity of sets to be played.
To see this, suppose that we have a strategy $\sigma$ …
3
votes
Accepted
Minimal coverings by maximal cliques
Nice question. The answer is no, not necessarily.
Theorem. There is a graph $G$ such that there is no minimal vertex
covering of it by maximal cliques. Indeed, in every vertex covering
$\cal C$ of $G …
3
votes
Accepted
Is there a subset of irrationals of size $\mathfrak{d}$ whose image, under any bijection to ...
For the title question, the answer is no, when d is less than c, because you could map your set into the 2-valued functions and map the complement to the rest. So the image would not be dominating.
12
votes
Accepted
Are there insane families in $L$?
Your requirements are inconsistent; there is no insane family.
Suppose towards contradiction that we have an insane family
$\mathcal{B}=\{B_\alpha\mid\alpha\lt\kappa\}$, witnessed by tower
$\langle A …
6
votes
Mutually non-isomorphic connected graphs on $\kappa$ points
The general fact is that every mathematical structure of size $\kappa$, in a language of size at most $\kappa$, can be coded as a (connected, undirected, simple) graph of size $\kappa$. What I mean is …
5
votes
Graph of functions sharing a point
Gerhard has pointed out that your sharing-a-point graph is not universal for uncountable graphs, since any uncountable collection of functions on $\omega$ must have many of them sharing a point. So th …
5
votes
Accepted
Is there a function from a Suslin tree to itself which send compatible elements to incompati...
Yes, this can happen, and indeed it happens in a subforest of any given Souslin tree.
Let's start with an illustrative case. Sometimes people consider Suslin trees that are not necessarily
normal, an …
2
votes
Accepted
Can the union of difference sets in towers equal $\omega$?
Take any increasing tower, but then modify it by adding all the numbers below $n$ to $A_n$, when $n$ is even, and removing them when $n$ is odd. This is a finite change to each set in the tower, and s …
2
votes
Relations between two tower numbers
This is not a full answer, but I claim that the restriction to regular towers is not relevant.
Theorem. The cardinal $\hat t$ is also the supremum of all tower sizes, not just the regular towers.
$$ …
9
votes
Sunflowers in maximal almost disjoint families
It is consistent with ZFC that the answer to your question is no. Specifically, I claim, if we assume the continuum hypothesis, then the answer is no, not even for sunflowers of size $n=3$.
Theorem. A …
9
votes
1
answer
536
views
Can there be a tree of height $\omega_2$ having all levels countable, with no cofinal branch?
For many years I had the idea that if a well-founded tree is both very tall and very narrow, then it must have a cofinal branch. For example, it is a fun exercise to show that any $\omega_1$-tree wit …
2
votes
Accepted
Can $\omega$ be parity-separated with finitely many bijections?
No, because if you have $n$ functions, then the number of possible parity patterns to be exhibited by a number with respect to them is $2^n$. So by the pigeon-hole principle there must be infinitely m …
10
votes
Dominating families in bigger cardinals
Here is some general background information. The relevant search phrases for this topic are generalized cardinal invariants or generalized cardinal characteristics, and the topic has a growing literat …