tea.mathoverflow.net - Discussion Feed (Another possible premature closure: "Probability calculation") Sun, 04 Nov 2018 12:58:47 -0800 http://mathoverflow.tqft.net/ Lussumo Vanilla 1.1.9 & Feed Publisher Henry Cohn comments on "Another possible premature closure: "Probability calculation"" (22095) http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22095#Comment_22095 http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22095#Comment_22095 Sun, 12 May 2013 11:37:08 -0700 Henry Cohn I wouldn't read too much significance into the case of the (2m)!(2n)!/(m!n!(m+n)!) problem, since this question has some unusual attributes. For one thing, it was clearly stated as a problem the OP had read somewhere, with a (presumably incorrect) memory that the source said there's a "simple counting argument". I have sympathy for the OP and am glad it was answered on MO, since it's incredibly frustrating when when you've been told there's a combinatorial proof but you just can't find one at all. However, I see the misinformation about a combinatorial proof as being the primary argument for why it's appropriate for MO. If you are satisfied with any proof of integrality, then this problem is a common and not too difficult exercise in discrete math or combinatorics courses, so if someone just posted "Show that (2m)!(2n)!/(m!n!(m+n)!) is an integer" I would vote to close. Furthermore, if there really were a simple counting argument that proved it, then that would presumably make it even less appropriate for MO. It's too bad the question got closed, but given that it basically stated "here's a problem I read somewhere that has a simple solution; how do I solve it?" I'm not surprised it got closed at first.

On the other hand, the probability calculation looks to me like a genuine mistake in closing, presumably because of assuming the problem was much simpler than it turns out to be. That's something we should be careful to avoid. I don't think the question is super deep or profound, and it feels like the sort of problem one ought to be able to say a lot about. However, profound depth is not necessary for a MO question, and there's a big difference between feeling like it ought to be possible to say a lot and actually being able to say it.

I would prefer if we were welcoming to researchers outside mathematics who have genuine mathematics questions, without necessarily bouncing them off M.SE first. Mathematics has a history of both renewal from other fields and fruitful interchange, but often the initial interactions are fraught with communication problems.

I agree.

There is a simple solution: MO ought to have a rule that you should not vote to close a question as too elementary unless you know what the answer is. This should be in the FAQ, IMHO.

I would actually be reluctant to put this in the FAQ: the prospect of challenges to "prove that you know how to solve this problem you voted to close" would in my view be more disruptive than occasionally having to vote to re-open a mistakenly closed question.

I certainly agree that if your reason for objecting to a question is that it's too straightforward or easy, then you ought to refrain from voting unless you are justifiably confident in your judgment, and if you make more than very rare mistakes you should reevaluate your standards. (But unless someone explicitly says straightforwardness is their reason, it's hard to deduce anything from the voting options.)

]]>
quid comments on "Another possible premature closure: "Probability calculation"" (22094) http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22094#Comment_22094 http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22094#Comment_22094 Sun, 12 May 2013 10:52:50 -0700 quid @alex: ad 6. and so you carefully tried to ignore what I said (twice, here and on main) namely that the question asked is not difficult, but explictly acknowledge the extrapolations of the question made in the answers are interesting.

ad 4. I think this has little to do with disdain (for me, if you check what I answer you will see most of it is quite close to combinatorics in some sense, elementary NT mainly), or say, Gerry Myerson, Qiaochu Yuan and Andreas Blass, who closed the question, should disdain combinatorics? Do you really want to maintain this?

But I agree(!) that in some parts of mathematics (including CO and 'my type' of NT) there is a higher risk of errors in judgement of the form you describe (due to honest errors). [IMO the current question is a non-example for this though.]

Therefore in my opinion it is paricullarly important if one cares about these areas (as I do) to fight for a culture of context and motivation. (This is not some type of argument I construe now, if you want I can search for me saying this already really long ago on meta. I think before closing my first question even, but not sure.)

]]>
alex comments on "Another possible premature closure: "Probability calculation"" (22093) http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22093#Comment_22093 http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22093#Comment_22093 Sun, 12 May 2013 09:57:50 -0700 alex
2. Yes, most likely a few counterexamples to 1) exist. I'm sure some members of this forum can dig them up.

Nevertheless, even a a cursory observations reveals a clear pattern: questions about abstract nonsense that clearly came from professional mathematicians are usually answered, context or not, but questions about easy-to-understand probabilistic and combinatorial questions are often closed as too elementary.

Once it is pointed out, usually here on meta, that no plausible solution to the closed elementary-looking is known, many members of the community fall back on the "lack of context" or "poorly motivated" justifications.

3. It is difficult for me to take these reasons at face value. For example, any professional mathematician should be able to appreciate the motivation in desiring to understand
why a ratio of two integers turns out to be integer (or, alternatively, to see a proof of this statement which finds a transparent `explanation' - something not based on induction, for example).

4. In the discussions that ensue after the closing, apparently difficult combinatorial questions are often characterized as mere "exercises" (this appears in this very thread, in fact) apparently not worthy of research.

In light of that, it is difficult to resist the conclusion that the closing of these questions is at least in part a manifestation of the disdain many in the mathematical community feel towards combinatorics (i.e., "slums of topology" and all that - see also http://mathoverflow.net/questions/17226/is-discrete-mathematics-mainstream for a discussion of more modern attitudes).

5. There is a simple solution: MO ought to have a rule that you should not vote to close a question as too elementary unless you know what the answer is. This should be in the FAQ, IMHO.

6. There are some users here which spend an inordinate amount of time arguing back and forth on this board, usually being very careful to misunderstand the arguments of their interlocuters. For this reason, I regret that I will not be able to participate in extended discussions here. ]]>
quid comments on "Another possible premature closure: "Probability calculation"" (22082) http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22082#Comment_22082 http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22082#Comment_22082 Sat, 11 May 2013 09:23:33 -0700 quid @Douglas Zare: While in fact I agree one might (now) have left the question open [and actually it is already reopened], I would still like to point out the follwing:

The question asked (in body and title) is that the quantity is an integer. Just this. And this is easy enough;
see Butch Malahide's answer. So it is a "simple excercise" (while the reason for thinking so was in error).

Now, that the question was motivated by a half-remembered (actually misrembered it seems) hint and some people followed up in the direction of this hint and provided interesting information is still something else and one thus might leave this open now.

But the question itself is really not a suiteable question. OP did not ask for a combinatorial interpretation/bijective proof or anything.

Please try to be more precise in your complaints. (My time and energy to point out such things are contrary to what you might think quite limited.)

Added: It might also be worth noting that Qiauchu Yuan actively questioned the comment criticised by you and still voted to close.

]]>
Douglas Zare comments on "Another possible premature closure: "Probability calculation"" (22081) http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22081#Comment_22081 http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22081#Comment_22081 Sat, 11 May 2013 08:56:19 -0700 Douglas Zare
Again, I'm not pretending that the question was perfect. It suggests that there is a simple counting argument, when no such argument is known. I think the problem is nevertheless on-topic, as shown by the related papers by Ira Gessel and others. ]]>
quid comments on "Another possible premature closure: "Probability calculation"" (22079) http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22079#Comment_22079 http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22079#Comment_22079 Sat, 11 May 2013 08:21:16 -0700 quid Perhaps I should just not pay attention to such things, but the fact that OP was on the site a day ago (after the answers and S. Carnahan's comment) and still did not provide (within a day) any context and also did not say anything regarding the aspects raised by the answers (range of parameters and so on) is quite up-setting.

What a 'reasonable' and 'nice' question(er)!

[Added a couple hours later: OP seems back with a comment.]

]]>
quid comments on "Another possible premature closure: "Probability calculation"" (22075) http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22075#Comment_22075 http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22075#Comment_22075 Fri, 10 May 2013 05:24:51 -0700 quid @Scott Carnahan: I am well aware of the in principle existing consensus (no close without comment) still it does not happen very infrequently (though not often) that questions (not actual spam) are closed without any comment. But yes the most likely thing should be the question being closed with a different comment, which could have been better or worse or about the same. (While initially not optimal, as acknowledged/clarified by abatkai, the one that was present is IMO rather to the good end since it is neutral to friendly. Unlike say "Do it yourself!", which one can also get on this site; seen various times, and just some 12 hours ago with 4 upvotes. [The question was addmittedly worse, still.])

A main problem I have with the current situation is that the user that made the effort to write a well-intentioned comment and willing to follow-up on the matter gets "all the blame" (in an IMO exaggerated way) [not by you, I find your contribution well-balanced] while those that did not, but actually closed the question, somehow are not even much addressed (not that IMO they are to be blamed for anything either but if somebody wants to blame somebody they should excercise at least a moderate amount of fairness in doing so). This is a recurring theme and in my opinion a problem.

]]>
Todd Trimble comments on "Another possible premature closure: "Probability calculation"" (22073) http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22073#Comment_22073 http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22073#Comment_22073 Thu, 09 May 2013 17:29:39 -0700 Todd Trimble I might be sticking my nose in where it doesn't belong, since I really haven't thought hard about this problem, but a personal rule of thumb I devised for myself is: before closing a problem because it looks like homework or at least homework-level, make sure you can do the homework yourself.

]]>
Scott Carnahan comments on "Another possible premature closure: "Probability calculation"" (22072) http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22072#Comment_22072 http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22072#Comment_22072 Thu, 09 May 2013 16:06:45 -0700 Scott Carnahan I'm pretty sure the consensus we established here is that questions (that aren't obviously spam) should not be closed without comment. In other words, without András Bátkai's comment, we should have expected another comment. In some alternate universe (perhaps with low probability), that other comment would address the lack of context instead of the level, e.g. "please edit your question to include some motivation". At this moment, there is nothing stopping him from adding a clarifying comment or a retraction.

I would prefer if we were welcoming to researchers outside mathematics who have genuine mathematics questions, without necessarily bouncing them off M.SE first. Mathematics has a history of both renewal from other fields and fruitful interchange, but often the initial interactions are fraught with communication problems. It is unfortunate that the question smells like homework, but that can be fixed with suitable effort by the poster.

(Incidentally, I have, in the past, wrongly voted to close interesting and nontrivial questions because I mistook them for elementary questions, so my hands are not particularly clean on this front.)

]]>
quid comments on "Another possible premature closure: "Probability calculation"" (22071) http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22071#Comment_22071 http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22071#Comment_22071 Thu, 09 May 2013 15:53:57 -0700 quid @Douglas Zare: the question looks like (and this was confirmed!) not like the question of a research mathematician (or equivalent or otherwise well-motivated question), so, it can be considered off-topic. If then it turns out it can be edited into something interesting or some are convinced it is still interesting it can be reopened. What is the problem? And why do you not just say you think it is interesting and would like to see it reopened? But instead search for some fight? Including already two (almost) ad hominems? Perhaps it is you that likes to argue?

]]>
Douglas Zare comments on "Another possible premature closure: "Probability calculation"" (22069) http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22069#Comment_22069 http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22069#Comment_22069 Thu, 09 May 2013 15:12:17 -0700 Douglas Zare
I think calling a reasonable question elementary without due consideration is unacceptable. I'm running out of polite ways to say it. ]]>
quid comments on "Another possible premature closure: "Probability calculation"" (22067) http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22067#Comment_22067 http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22067#Comment_22067 Thu, 09 May 2013 14:41:47 -0700 quid @Dougals Zare: OP then confirmed it is not a research mathematics question (but one that arose is some unspecified research that is not mathematics). In addition, abatkai made (then) quite clear that the problem is not (whether) the question is 'easy' but the lack of presentation.

To direct such an OP to math.SE seems apt. They still can come back if the questions turns out to be 'too hard' for math.SE; possibly with an improved version. If OP is sure it is good to avoid this, they should read 'How to ask?' and follow it.

Your ininuation that in the absence of abatkai's comment the question would not have been closed seems a bit unlikley; it seems at least as likely to me that if it were not for that comment the question would have been closed without comment.

I will refrain, for the moment, to pursue various aspects and ramifications of this in detail. But I consider your behavior as rude.

]]>
Douglas Zare comments on "Another possible premature closure: "Probability calculation"" (22063) http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22063#Comment_22063 http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22063#Comment_22063 Thu, 09 May 2013 13:14:45 -0700 Douglas Zare
As it stands, I can see a couple of awkward recurrence relations. I don't see how to get asymptotics or good estimates over the whole range of parameters, particularly where inclusion-exclusion leads to an alternating sum of large terms. If there really is an elementary solution, I would like to see it. However, the question is closed, so no one can post answers.

That a question is imperfect does not mean the question should be dismissed, that the author should be directed to leave the site, and that people should be blocked from answering it. Next time, how about asking for the context instead of declaring that the problem is off-topic? ]]>
abatkai comments on "Another possible premature closure: "Probability calculation"" (22062) http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22062#Comment_22062 http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22062#Comment_22062 Thu, 09 May 2013 12:23:59 -0700 abatkai abatkai comments on "Another possible premature closure: "Probability calculation"" (22061) http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22061#Comment_22061 http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22061#Comment_22061 Thu, 09 May 2013 12:22:33 -0700 abatkai Douglas Zare comments on "Another possible premature closure: "Probability calculation"" (22060) http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22060#Comment_22060 http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22060#Comment_22060 Thu, 09 May 2013 12:05:46 -0700 Douglas Zare abatkai comments on "Another possible premature closure: "Probability calculation"" (22059) http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22059#Comment_22059 http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22059#Comment_22059 Thu, 09 May 2013 12:00:55 -0700 abatkai Douglas Zare comments on "Another possible premature closure: "Probability calculation"" (22056) http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22056#Comment_22056 http://mathoverflow.tqft.net/discussion/1591/another-possible-premature-closure-probability-calculation/?Focus=22056#Comment_22056 Thu, 09 May 2013 10:50:39 -0700 Douglas Zare
I think there is a pattern of closing questions too rapidly. That something sounds like it might be an exercise, and was posted at about the same time as someone else posted a few exercises, doesn't mean it is one. Of course, maybe I'm just missing some trick for solving this type of problem... but then perhaps it's worth saying what that trick is. There is a recursion based on the number of bins. Inclusion-exclusion leads to a recursion, too. Neither of these recursions looks simple to analyze. I vote to reopen. ]]>