Timeline for The set of complements equal to the complement of set
Current License: CC BY-SA 3.0
24 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 18, 2017 at 12:57 | history | edited | Martin Sleziak |
changed (lattices) to (lattice-theory) (See the tag-info; the tag lattices is for lattices in number theory.)
|
|
| Dec 11, 2017 at 16:33 | history | edited | Martin Sleziak |
Removed deprecated (discrete-mathematics) tag - see the tag info: https://mathoverflow.net/tags/discrete-mathematics/info (if there are some other suitable tags, choose some of them instead)
|
|
| Dec 11, 2017 at 4:41 | history | edited | Michael Hardy | CC BY-SA 3.0 |
added 6 characters in body
|
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
| Feb 16, 2017 at 15:09 | history | edited | MR_BD | CC BY-SA 3.0 |
added 144 characters in body
|
| Feb 16, 2017 at 14:50 | comment | added | Asaf Karagila♦ | Mentioning that it was previously posted on math.SE, with links, is the least you can do if you choose to post on both sites. | |
| Feb 16, 2017 at 14:35 | history | edited | Andrés E. Caicedo |
edited tags
|
|
| Feb 16, 2017 at 3:03 | review | Close votes | |||
| Feb 16, 2017 at 8:20 | |||||
| Feb 15, 2017 at 21:32 | answer | added | მამუკა ჯიბლაძე | timeline score: 2 | |
| Feb 12, 2017 at 14:30 | comment | added | MR_BD | @EmilJeřábek Thanks to you, I've found it in Knuth's Art of computer programming. | |
| Feb 10, 2017 at 13:31 | comment | added | MR_BD | You said: "These functions have about as complicated structure as general monotone Boolean function" | |
| Feb 10, 2017 at 13:27 | comment | added | Emil Jeřábek | Yes, obviously. How is that supposed to help? | |
| Feb 10, 2017 at 13:23 | comment | added | MR_BD | @EmilJeřábek I thought that monotone functions are up closure of some generator set. Aren't they? | |
| Feb 10, 2017 at 13:21 | comment | added | Emil Jeřábek | I don’t know what kind of characterization are you looking for. For one, they are exactly the functions definable by terms using variables and the three-variable majority function (see e.g. en.wikipedia.org/wiki/Post%27s_lattice). These functions have about as complicated structure as general monotone Boolean function, so you shouldn’t expect a simple explicit description of all such functions, or anything like that. | |
| Feb 10, 2017 at 13:09 | comment | added | MR_BD | @Rahman.M This name arises from the origin of problem which is graph properties... | |
| Feb 10, 2017 at 13:08 | comment | added | MR_BD | @EmilJeřábek So, Is there any characterization of self-dual monotone boolean functions? | |
| Feb 10, 2017 at 13:07 | comment | added | Rahman. M | Where you are taking complement? note that the first condition in 1 is better to be called upward closed rather than increasing. | |
| Feb 10, 2017 at 13:02 | comment | added | Emil Jeřábek | Such sets are exactly the sets of the form $f^{-1}(1)$ for a self-dual monotone Boolean function $f$ of $n$ inputs. | |
| Feb 10, 2017 at 11:43 | answer | added | Ramiro de la Vega | timeline score: 7 | |
| Feb 10, 2017 at 10:13 | comment | added | MR_BD | @JonMarkPerry I supposed it as power set lattice | |
| Feb 10, 2017 at 8:40 | review | Close votes | |||
| Feb 10, 2017 at 10:03 | |||||
| Feb 10, 2017 at 8:18 | answer | added | Bjørn Kjos-Hanssen | timeline score: 4 | |
| Feb 10, 2017 at 8:15 | comment | added | JMP | what does $\subset$ mean in $A\subset\{0,1\}^n$? why do we need $A^c$? | |
| Feb 10, 2017 at 8:06 | history | asked | MR_BD | CC BY-SA 3.0 |