User martin erickson - MathOverflowmost recent 30 from http://mathoverflow.net2013-05-19T16:27:38Zhttp://mathoverflow.net/feeds/user/30099http://www.creativecommons.org/licenses/by-nc/2.5/rdfhttp://mathoverflow.net/questions/116789/a-generalization-of-the-set-problem/116801#116801Answer by Martin Erickson for A generalization of the SET problemMartin Erickson2012-12-19T17:19:11Z2012-12-19T17:19:11Z<p>Quid, thank you. Yes, you explain clearly that $f(3,d)=2g(3,d)-1$. The function $g(n,d)$ is substantially different from $f(n,d)$ when $n>3$. Therefore I raise the question of the value of $g(4,3)$. Thanks for the reference to Yves Edel's webpage. </p>
http://mathoverflow.net/questions/116789/a-generalization-of-the-set-problem/116801#116801Comment by Martin EricksonMartin Erickson2012-12-19T17:26:25Z2012-12-19T17:26:25ZThanks for your valid technical point. I apologize for my question/answer infelicity. I don't understand how to navigate Math Overflow, but I will investigate it. If someone would like to make the technical edits, I would appreciate it. Thanks again.