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.
-2
votes
2
answers
156
views
Set "crossing" all arithmetical integer sets [duplicate]
We say a set $A\subseteq\mathbb{Z}$ is arithmetical if there are integers $a>0,b\geq 0$ such that $A=\{ax+b:x\in\mathbb{Z}\}$.
Is there $S\subseteq\mathbb{Z}$ such that $$S\cap A\neq\varnothing \neq ( …
0
votes
1
answer
93
views
Can the absolute difference of bijections on $\omega$ also be a bijection?
For $\alpha,\beta\in \omega$ we set the absolute difference of $\alpha,\beta$ to be $$\lVert\alpha - \beta\rVert := |(\alpha\setminus\beta)\cup (\beta\setminus\alpha)|.$$ The absolute difference $\lVe …
0
votes
1
answer
110
views
Critical coverings of $\omega$
A covering of a non-empty set $X$ is a collection ${\cal U} \subseteq ({\cal P}(X)\setminus\{\emptyset\})$ such that $\bigcup {\cal U} = X$. If ${\cal U}$ is a covering of $X$ then a function $f:{\cal …
-1
votes
1
answer
59
views
Size of smallest set in critical covering of $\omega$
A covering of a non-empty set $X$ is a collection ${\cal U} \subseteq ({\cal P}(X)\setminus\{\emptyset\})$ such that $\bigcup {\cal U} = X$. If ${\cal U}$ is a covering of $X$ then a function $f:{\cal …
0
votes
1
answer
75
views
Maximizing set systems with property $\mathbf{B}$
Let $X$ be an infinite set, and let ${\cal E}$ be a collection of non-empty subsets of $X$. We say that ${\cal E}$ has property $\mathbf{B}$ if there is $B\subseteq X$ such that $B\cap E\neq \emptyset …
4
votes
1
answer
181
views
Does every finite simple graph embed into the "fixed point graph"?
For every set $X$, let $[X]^2=\{\{x,y\}: x\neq y\in X\}$.
Let $\omega^\omega$ denote the set of all functions $f:\omega\to\omega$. Note that, thanks to @Wojowu's comment below, the following holds. If …
2
votes
4
answers
147
views
$k$-regular linear set systems
For any set $X$ and cardinal $\kappa$, we denote by
$\ [X]^\kappa :=\ \binom X\kappa\ $ the collection of subsets of $X$ having cardinality $\kappa$.
If $X$ is a set, we call a set system $E\subseteq …
4
votes
3
answers
253
views
Commuting functions and fixpoints
Let $X$ be an infinite set and let $\text{End}(X)$ be the set of all functions $f:X\to X$. For $f\in\text{End}(X)$ let $$\text{fix}(f) = \{x\in X: x = f(x)\},$$ and $$\text{Com}(f) = \{g\in\text{End}( …
2
votes
2
answers
227
views
Functions $f:X\to X$ that commute with "almost no others"
Let $X$ be an infinite set and let $\text{End}(X)$ be the set of all functions $f:X\to X$. For $f\in\text{End}(X)$ let $$\text{Com}(f) = \{g\in\text{End}(X): g\circ f = f \circ g\}.$$
Is there $f\in \ …
6
votes
2
answers
241
views
Existence of a path in a set of subsets of $\omega$
Suppose that $L\subseteq {\cal P}(\omega)$ has the following properties:
$\omega \notin L$, and for $e\in L$ we have $|e|\geq 2$;
if $e_1\neq e_2 \in L$ then $|e_1\cap e_2|\leq 1$;
if $m,n\in \omega …
0
votes
1
answer
170
views
Coloring non-principal ultrafilters on $\omega$
Let ${\cal U}$ be a non-principal ultrafilter on $\omega$. If $\kappa>0$ is a cardinal, we say that a function $c:\omega \to \kappa$ is a coloring for ${\cal U}$ if for all $U\in{\cal U}$ the restrict …
0
votes
2
answers
159
views
"Arithmetically diverse" infinite binary string
For $a,b \in \omega$ with $a > 0$, let $f_{a,b}: \omega\to\omega$ be defined by $n \mapsto an+b$. What is an example of an infinite binary string $s:\omega\to\{0,1\}$ with the following property?
Whe …
3
votes
1
answer
118
views
Can every number be realised as the chromatic number of a countable hypergraph?
If $H=(V,E)$ is a hypergraph and $\kappa$ is a cardinal,we say a map $c:V\to\kappa$ is a coloring if the restriction $c\restriction_e$ of $c$ to $e$ is non-constant whenever $e\in E$ and $|e|>1$. The …
2
votes
1
answer
89
views
Partitioning an infinite cardinal $\kappa$ into pairwise neighboring subsets
We say that two disjoint, non-empty subsets $S, T$ of an infinite cardinal $\kappa$ are neighboring if there is $\alpha\in \kappa$ such that $$S\cap\{\alpha,\alpha+1\} \neq \varnothing \neq T\cap\{\al …
4
votes
1
answer
142
views
Injective choice function for infinite complete linear hypergraphs
A hypergraph $H=(V,E)$ is said to be complete and linear if
whenever $e_1\neq e_2\in E$ then $|e_1\cap e_2|=1$, and
for $v,w\in V$ there is $e\in E$ such that $\{v,w\}\subseteq e$.
Assuming that $V$ …