/explore
|
You are here 
|
wildtopology.com | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
fabricebaudoin.blog
Exercise 1.Solve Exercise 44 in Chapter 1 of the book. Exercise 2.Solve Exercise 3 in Chapter 1 of the book. Exercise 3.Solve Exercise 39 in Chapter 1 of the book. Exercise 4.The heat kernel on $latex \mathbb{S}^1$ is given by $latex p(t,y) =\frac{1}{2\pi}\sum_{m \in \mathbb{Z}} e^{-m^2 t} e^{im y} =\frac{1}{\sqrt{4\pi t}} \sum_{k \in \mathbb{Z}} e^{-\frac{(y... |
|
| | | | | ||
| | | | |
dominiczypen.wordpress.com
Let $latex \omega$ denote the first infinite cardinal - that is, the set of non-negative integers. Let $latex p_0 = 2$ be the smallest prime number, and let $latex (p_n)_{n\in\omega}$ enumerate all prime numbers in ascending order. Let $latex \mathcal{U}$ be a free ultrafilter on $latex \omega$. We consider the field $latex F = \big(\prod_{n\in\omega}\mathbb{Z}/p_n\mathbb{Z}\big)/{\mathcal... |
|
| | | | | ||
| | | | |
thatsmaths.com
We are all familiar with Pascal's Triangle, also known as the Arithmetic Triangle (AT). Each entry in the AT is the sum of the two closest entries in the row above it. The $latex {k}&fg=000000$-th entry in row $latex {n}&fg=000000$ is the binomial coefficient $latex {\binom{n}{k}}&fg=000000$ (read $latex {n}&fg=000000$-choose-$latex {k}&fg=000000$), the number of ways of... |
|
| | | |||
