Timeline for Number of Hyper-cube cuts
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 24, 2015 at 16:26 | history | edited | user9072 |
edited tags; edited tags
|
|
| Mar 2, 2012 at 19:31 | answer | added | Carl Feynman | timeline score: 1 | |
| Feb 29, 2012 at 23:24 | vote | accept | Robert | ||
| Feb 29, 2012 at 22:06 | comment | added | Douglas Zare | This doesn't answer the question, but has some references and another term: oeis.org/A000609 | |
| Feb 29, 2012 at 19:18 | answer | added | Gerhard Paseman | timeline score: 3 | |
| Feb 29, 2012 at 18:43 | comment | added | Aaron Meyerowitz | It may be of order $2^{n^2}$ which would be $v^{\log{v}}$ | |
| Feb 29, 2012 at 18:36 | comment | added | Joseph O'Rourke | Oh, I see from Gerhard's comment that I misread: I meant the number grows exponentially with the dimension $d$. | |
| Feb 29, 2012 at 17:32 | answer | added | Aaron Meyerowitz | timeline score: 1 | |
| Feb 29, 2012 at 16:55 | comment | added | Joseph O'Rourke | Surely it grows exponentially: for $d=8$ it is already beyond $10^{12}$. The number of threshold functions is about twice the number of slicing hyperplanes, so you could look at that literature for a citation, e.g., S. Yajima, T. Ibaraki "A lower bound of the number of threshold functions" IEEE Trans. Comput., EC-14 (1965), pp. 926–929 (which I cannot access). | |
| Feb 29, 2012 at 16:11 | history | asked | Robert | CC BY-SA 3.0 |