/explore
|
You are here |
www.fredrikmeyer.net | ||
| | | | |
thehighergeometer.wordpress.com
Here's a fun thing: if you want to generate a random finite $latex T_0$ space, instead select a random subset from $latex \mathbb{S}^n$, the $latex n$-fold power of the Sierpinski space $latex \mathbb{S}$, since every $latex T_0$ space embeds into some (arbitrary) product of copies of the Sierpinski space. (Recall that $latex \mathbb{S}$ has underlying... |
|
| | | | | ||
| | | | |
blog.georgeshakan.com
I recently uploaded "On the largest sum-free subset problem in the integers," to the arXiv. Let $latex A \subset \mathbb{Z}$ be a finite subset of the integers. We say $latex A$ is sum-free if there are no solutions to $latex a + b = c,$ with $latex a,b,c \in A$. We define $latex S(A)$ to... |
|
| | | | | ||
| | | | |
xorshammer.com
Here's a puzzle: You and Bob are going to play a game which has the following steps. Bob thinks of some function $latex f\colon \mathbb{R}\to\mathbb{R}$ (it's arbitrary: it doesn't have to be continuous or anything). You pick an $latex x \in \mathbb{R}$. Bob reveals to you the table of values $latex \{(x_0, f(x_0))\mid x_0\ne x\}$... |
|
| | | | | ||
| | | | |
uncommongenders.home.blog
There is lettragender! -Admin Opal |
|
| | | |||