Timeline for The set of complements equal to the complement of set
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 17, 2017 at 18:32 | comment | added | მამუკა ჯიბლაძე | @TarasBanakh As already mentioned by the OP in a comment, one reference for that, with some more information, is in Volume 4a of Knuth's "The art of computer programming", exercise 65. There is some related material in subsequent exercises, as well as details about self-dual monotone Boolean functions in the main text (around Theorem P). | |
| Feb 16, 2017 at 6:58 | comment | added | Taras Banakh | Such families are usually called maximal linked families and there is an extensive literature in the context of the superextensions. The superextension $\lambda(X)$ is just the space of all maximal linked families over a set $X$. The superextension carries a natural Hausdorff topology turning it into a supercompact space. For a finite $X$ the superextension $\lambda(X)$ is finite (of course) and there exists some info on the cardinality of $\lambda(X)$. If $X$ is a semigroup, then $\lambda(X)$ has the natural semigroup structure, which was studied in (arxiv.org/abs/0811.0796). | |
| Feb 10, 2017 at 13:30 | history | edited | Ramiro de la Vega | CC BY-SA 3.0 |
added 187 characters in body
|
| Feb 10, 2017 at 13:19 | history | edited | Ramiro de la Vega | CC BY-SA 3.0 |
added 205 characters in body
|
| Feb 10, 2017 at 13:11 | history | edited | Ramiro de la Vega | CC BY-SA 3.0 |
added 205 characters in body
|
| Feb 10, 2017 at 13:10 | comment | added | MR_BD | Can you say some other example? How can I show that any example must be of this form? | |
| Feb 10, 2017 at 11:43 | history | answered | Ramiro de la Vega | CC BY-SA 3.0 |