Sandbox

 The sandbox is the page where you can experiment with the wiki syntax. Feel free to write nonsense or clear the page whenever you want.

1 Images

Theorem 1.1. We have $f \colon X \to Y$ == Images == ; \begin{theorem} We have f \colon X \to Y \end{theorem} Reference \ref{test} By Theorem {{equation|\alpha|1.2}} {{eqref|1.2}} {{begineq|eqtest|\alpha}}{{endeq}} {{beginthm|Theorem}} Frog {{endthm}} \ref{qtest} \ref{eqtest} Here is some text leading up to an equation {{beginrem| }} A = B {{endrem}} Here is some more text after the equation to see how it looks. Here is some text leading up to an equation A = B Here is some more text after the equation to see how it looks. :{| border="1" cellpadding="2" class="wikitable" style="text-align:center" |- ! 4k !! 8 !! 12 !! 16 !! 20 !! 24 !! 28 !! 32 |- ! order bP4k | 22.7 || 25.31 || 26.127|| 29.511|| 210.2047.691 || 213.8191 || 214.16384.3617 |- |} :{| border="1" cellpadding="2" class="wikitable" style="text-align:center" |- ! k !! 1 !! 2 !! 3 !! 4 !! 5 !! 6 !! 7 !! 8 |- ! Bk | 1/6 || 1/30 || 1/42 || 1/30 || 5/66 || 691/2730 || 7/6 || 3617/510 || |- |} :{| border="1" cellpadding="2" class="wikitable" style="text-align:center" |- ! Dim n !! 1 !! 2 !! 3 !! 4 !! 5 !! 6 !! 7 !! 8 !! 9 !! 10 !! 11 !! 12 !! 13 !! 14 !! 15 !! 16 !! 17 !! 18 !! 19 !! 20 |- ! order Θ''n'' | 1 || 1 || 1 || 1 || 1 || 1 || 28 || 2 || 8 || 6 || 992 || 1 || 3 || 2 || 16256 || 2 || 16 || 16 || 523264 || 24 |- !''bP''''n''+1 | 1 || 1 || 1 || 1 || 1 || 1 || 28 || 1 || 2 || 1 || 992 || 1 || 1 || 1 || 8128 || 1 || 2 || 1 || 261632 || 1 |- !Θ''n''/''bP''''n''+1 | 1 || 1 || 1 || 1 || 1 || 1 || 1 || 2 ||2×2 || 6 || 1 || 1 || 3 || 2 || 2 || 2 || 2×2×2 || 8×2 || 2 || 24 |- !π''n''''S''/''J'' | 1 || 2 || 1 || 1 || 1 || 2 || 1 || 2 || 2×2 || 6 || 1 || 1 || 3 || 2×2 || 2 || 2 || 2×2×2 || 8×2 || 2 || 24 |- !index | - || 2 || - || - || - || 2 || - || - || - || - || - || - || - || 2 || - || - || - || - || - || - |} [[Media:Spaceform.tiff|link text]] f \colon X \to Y namespace=Main nottitlematch=Main_Page|Sandbox|Links ordermethod=lastedit order=descending minoredits=exclude author=%Diarmuid Crowley% count=10 Just a fest f \colon A \to B. \Q {{beginthm|a theorem}} \label{thma} {{endthm}} \text{Spin} by theorem \ref{thma}
1. Amsterdam
2. Rotterdam
3. The Hague
[[[#{{anchorencode:Mess1990}}|Mess1990]]]{{#RefAdd:Mess1990}} \left( \begin{array}{ll} \alpha & \beta \ \gamma & \delta \end{array} \right) f = T f : X \to Y f : X \to Y \Ker \mathscr{A} \mathscr{B} \bf{ bold} \it{italic} \em{emphasis}
[[Image:Foliation.png|thumb|300px|3-dimensional Reeb foliation]] == Tests == {{citeD|Ranicki1981}} {{cite|Milnor1956}} {{cite|Milnor1956|Theorem 1}} {{citeD|Milnor1956}} {{citeD|Milnor1956|Theorem 1}} {{citeD2|Milnor1956|Frog}} ; {{beginproof}} {{endproof}} == Section == === Subsection === \label{subsection} Refert to subsection \ref{subsection} \begin{theorem} \label{thm} test \end{theorem} Refer to theorem \ref{thm} == Section == ; An [[map-eds:Manifold Atlas:Projects in the Atlas|inter-Wiki link]]. Another Test1 [[map-eds:Manifold Atlas:Projects in the Atlas|inter-Wiki link]]. dfaTest2 ==Footnotes== == Images == ; \begin{theorem} We have f \colon X \to Y \end{theorem} Reference \ref{test} By Theorem {{equation|\alpha|1.2}} {{eqref|1.2}} {{begineq|eqtest|\alpha}}{{endeq}} {{beginthm|Theorem}} Frog {{endthm}} \ref{qtest} \ref{eqtest} Here is some text leading up to an equation {{beginrem| }} A = B {{endrem}} Here is some more text after the equation to see how it looks. Here is some text leading up to an equation A = B Here is some more text after the equation to see how it looks. :{| border="1" cellpadding="2" class="wikitable" style="text-align:center" |- ! 4k !! 8 !! 12 !! 16 !! 20 !! 24 !! 28 !! 32 |- ! order bP4k | 22.7 || 25.31 || 26.127|| 29.511|| 210.2047.691 || 213.8191 || 214.16384.3617 |- |} :{| border="1" cellpadding="2" class="wikitable" style="text-align:center" |- ! k !! 1 !! 2 !! 3 !! 4 !! 5 !! 6 !! 7 !! 8 |- ! Bk | 1/6 || 1/30 || 1/42 || 1/30 || 5/66 || 691/2730 || 7/6 || 3617/510 || |- |} :{| border="1" cellpadding="2" class="wikitable" style="text-align:center" |- ! Dim n !! 1 !! 2 !! 3 !! 4 !! 5 !! 6 !! 7 !! 8 !! 9 !! 10 !! 11 !! 12 !! 13 !! 14 !! 15 !! 16 !! 17 !! 18 !! 19 !! 20 |- ! order Θ''n'' | 1 || 1 || 1 || 1 || 1 || 1 || 28 || 2 || 8 || 6 || 992 || 1 || 3 || 2 || 16256 || 2 || 16 || 16 || 523264 || 24 |- !''bP''''n''+1 | 1 || 1 || 1 || 1 || 1 || 1 || 28 || 1 || 2 || 1 || 992 || 1 || 1 || 1 || 8128 || 1 || 2 || 1 || 261632 || 1 |- !Θ''n''/''bP''''n''+1 | 1 || 1 || 1 || 1 || 1 || 1 || 1 || 2 ||2×2 || 6 || 1 || 1 || 3 || 2 || 2 || 2 || 2×2×2 || 8×2 || 2 || 24 |- !π''n''''S''/''J'' | 1 || 2 || 1 || 1 || 1 || 2 || 1 || 2 || 2×2 || 6 || 1 || 1 || 3 || 2×2 || 2 || 2 || 2×2×2 || 8×2 || 2 || 24 |- !index | - || 2 || - || - || - || 2 || - || - || - || - || - || - || - || 2 || - || - || - || - || - || - |} [[Media:Spaceform.tiff|link text]] f \colon X \to Y namespace=Main nottitlematch=Main_Page|Sandbox|Links ordermethod=lastedit order=descending minoredits=exclude author=%Diarmuid Crowley% count=10 Just a fest f \colon A \to B. \Q {{beginthm|a theorem}} \label{thma} {{endthm}} \text{Spin} by theorem \ref{thma}
1. Amsterdam
2. Rotterdam
3. The Hague
[[[#{{anchorencode:Mess1990}}|Mess1990]]]{{#RefAdd:Mess1990}} \left( \begin{array}{ll} \alpha & \beta \ \gamma & \delta \end{array} \right) f = T f : X \to Y f : X \to Y \Ker \mathscr{A} \mathscr{B} \bf{ bold} \it{italic} \em{emphasis}
[[Image:Foliation.png|thumb|300px|3-dimensional Reeb foliation]] == Tests == {{citeD|Ranicki1981}} {{cite|Milnor1956}} {{cite|Milnor1956|Theorem 1}} {{citeD|Milnor1956}} {{citeD|Milnor1956|Theorem 1}} {{citeD2|Milnor1956|Frog}} ; {{beginproof}} {{endproof}} == Section == === Subsection === \label{subsection} Refert to subsection \ref{subsection} \begin{theorem} \label{thm} test \end{theorem} Refer to theorem \ref{thm} == Section == ; An [[map-eds:Manifold Atlas:Projects in the Atlas|inter-Wiki link]]. Another Test1 [[map-eds:Manifold Atlas:Projects in the Atlas|inter-Wiki link]]. dfaTest2 ==Footnotes== f \colon X \to Y

Reference \ref{test}

By Theorem

$\alpha$$\alpha$(1.2)

(1)$\alpha$$\alpha$eqtest

Theorem 1.2. Frog

1 \ref{eqtest}

Here is some text leading up to an equation

1.3.

$\displaystyle A = B$

Here is some more text after the equation to see how it looks.

Here is some text leading up to an equation

$\displaystyle A = B$

Here is some more text after the equation to see how it looks.

4k 8 12 16 20 24 28 32
order bP4k 22.7 25.31 26.127 29.511 210.2047.691 213.8191 214.16384.3617
k 1 2 3 4 5 6 7 8
Bk 1/6 1/30 1/42 1/30 5/66 691/2730 7/6 3617/510

Dim n 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
order Θn 1 1 1 1 1 1 28 2 8 6 992 1 3 2 16256 2 16 16 523264 24
bPn+1 1 1 1 1 1 1 28 1 2 1 992 1 1 1 8128 1 2 1 261632 1
Θn/bPn+1 1 1 1 1 1 1 1 2 2×2 6 1 1 3 2 2 2 2×2×2 8×2 2 24
πnS/J 1 2 1 1 1 2 1 2 2×2 6 1 1 3 2×2 2 2 2×2×2 8×2 2 24
index - 2 - - - 2 - - - - - - - 2 - - - - - -

$\displaystyle f \colon X \to Y$

Extension DPL (warning): current configuration allows execution of DPL code from protected pages only.

Just a fest $f \colon A \to B$$f \colon A \to B$.

$\Q$$\Q$

a theorem 1.4.

$\text{Spin}$$\text{Spin}$

by theorem 1.4

1. Amsterdam
2. Rotterdam
3. The Hague

[Mess1990]

$\left( \begin{array}{ll} \alpha & \beta \\ \gamma & \delta \end{array} \right)$$\left( \begin{array}{ll} \alpha & \beta \\ \gamma & \delta \end{array} \right)$

$f = T$$f = T$

$f : X \to Y$$f : X \to Y$

$\displaystyle f : X \to Y$

$\Ker$$\Ker$

$\mathscr{A}$$\mathscr{A}$ $\mathscr{B}$$\mathscr{B}$

bold italic emphasis

File:Foliation.png
3-dimensional Reeb foliation

2 Tests

[Ranicki1981] [Milnor1956] [Milnor1956, Theorem 1] [Milnor1956] [Milnor1956, Theorem 1] Frog

Proof.

$\square$$\square$

3 Section

3.1 Subsection

Refert to subsection 3.1

Theorem 3.1. test

Refer to theorem 3.1

dfa[2]

1. Test1
2. Test2