Timeline for Is this representation of Go (game) irreducible?
Current License: CC BY-SA 4.0
17 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 11, 2020 at 4:31 | comment | added | Sebastien Palcoux | @TeamBright: $\ell^2(\mathcal{F})$ is the Hilbert space of sequences $(a_i)_{i \in \mathcal{F}}$ with $a_i \in \mathbb{C}$ and $\sum_i \vert a_i \vert^2 < \infty$. | |
Apr 11, 2020 at 2:44 | comment | added | Blanco | @SebastienPalcoux I am not familiar with the meaning of $l^2(\mathcal{F})$, can you explain the structure of $H$? | |
Apr 10, 2020 at 16:52 | comment | added | Sebastien Palcoux | @TeamBright $\mathcal{F}$ is just a set, the addition and multiplication are not on it, but on the above operators defined on the Hilbert space $\ell^2(\mathcal{F})$. | |
Apr 10, 2020 at 15:00 | comment | added | Blanco | What are the addition and multiplication in $\mathcal{F}$? | |
Oct 23, 2019 at 15:36 | history | edited | Sebastien Palcoux | CC BY-SA 4.0 |
minor edit
|
Oct 23, 2019 at 13:38 | history | edited | Sebastien Palcoux | CC BY-SA 4.0 |
this question was motivated by a brief discussion with Stefaan Vaes
|
Sep 26, 2019 at 0:10 | comment | added | Santana Afton | Yeah, I’m wondering if the answer to this question gives some interesting information about the game. | |
Sep 25, 2019 at 4:48 | comment | added | Sebastien Palcoux | The representation $H$ is irreducible if it admits no proper closed subrepresenation. | |
Sep 25, 2019 at 4:47 | comment | added | Sebastien Palcoux | @SantanaAfton: Are you asking whether this question is interesting for a Go player? | |
Sep 24, 2019 at 13:23 | comment | added | Santana Afton | Does this carry any information about Go? | |
Sep 22, 2019 at 8:48 | history | edited | Sebastien Palcoux | CC BY-SA 4.0 |
minor edit: typos
|
Sep 22, 2019 at 6:30 | history | edited | Sebastien Palcoux | CC BY-SA 4.0 |
title/title edit + addition of links
|
Sep 22, 2019 at 6:18 | history | edited | Sebastien Palcoux | CC BY-SA 4.0 |
title/title edit + addition of links
|
Sep 22, 2019 at 2:04 | history | edited | Sebastien Palcoux | CC BY-SA 4.0 |
at most -> at least
|
Sep 22, 2019 at 2:03 | comment | added | Sebastien Palcoux | @WhatsUp: yes sure, thanks! | |
Sep 21, 2019 at 22:27 | comment | added | WhatsUp | ...admissible if all its connected components c have at most one liberty isn't it at least? | |
Sep 21, 2019 at 20:30 | history | asked | Sebastien Palcoux | CC BY-SA 4.0 |