Timeline for Number of valid topologies on a finite set of n elements
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 11, 2020 at 17:10 | comment | added | SagarM | "given a description of a structure type and 𝑛, count the number of structures on an n-element set" : Recently people in AI figured out how to count the number of structures consistent with a formula in First Order Logic with two variables, does this have any impact on combinatorics ? arxiv.org/abs/1412.1505 | |
| Feb 21, 2010 at 6:39 | comment | added | Jonas Meyer | Awesome answer, by the way. The apology is gratuitous. | |
| Dec 15, 2009 at 22:59 | vote | accept | Harry Gindi | ||
| Dec 15, 2009 at 12:06 | comment | added | Harrison Brown | Oh, right! I meant to add that if you just want loose asymptotics, that's doable. There's a paper of Kleitman and Rothschild which is listed as a reference in OEIS. It doesn't seem to be online (it's kind of ancient), but I seem to recall skimming it once, and it looked... pleasurable. | |
| Dec 15, 2009 at 11:34 | history | answered | Harrison Brown | CC BY-SA 2.5 |