Not signed in (Sign In)

Vanilla 1.1.9 is a product of Lussumo. More Information: Documentation, Community Support.

  1.  

    The extant "answer" to this question: http://mathoverflow.net/questions/49244/give-an-example-of-monoid-with-property-m2-m3 seems to have troll-like characteristics. I got as far as writing a comment in reply (along the lines of mistaking cause with effect) and then decided not to.

    I've flagged the comment as spam, I urge others to do so.

    (Note that the question itself is highly likely to be closed, but that is independent of troll-like behaviour)

    • CommentAuthorWillieWong
    • CommentTimeDec 13th 2010 edited
     

    Hum, it is a bit strange, that user's answer to this and this, to my inexpert eyes, look somewhat, possibly, reasonable. And then there is this one here

  2.  

    Yes, after posting this comment I noticed that that user had a non-trivial positive reputation so I went on a little trip and found those answers. I can't make head nor tail of them, though, so don't know how to classify them.

    (The original answer that provoked this has now been deleted.)

    • CommentAuthorHarry Gindi
    • CommentTimeDec 13th 2010 edited
     

    It's either a troll or a bot. It sucks though, because I was really impressed. I thought that Cisinski came up with the generalized theory for anodyne morphisms (in an arbitrary topos with respect to a fixed cylinder functor ) in his thesis or a closely related paper around 2001-2002, but here was this guy telling me that such things were well-known to Laumon and Moret-Bailly 20 years ago, whence comes my comment that the answer is "bizarre".

  3.  

    I recognize the phrase "this is somewhere in Laumon Moret Bailly, I don't have it here" because Ben Webster recently noticed and commented "WTF?" on an answer (I can't find it at the moment, perhaps it was deleted as spam) that was essentially ripping off this answer, in a similarly nonsensical way. There is also this answer, another strange copy of the same text, but under the guise of a different user; however that user appears to have given two substantive answers as well.

    EDIT: I believe the answer Ben commented on was on this question, though it was deleted one way or another (could a 10k user or moderator confirm?)

  4.  
    @Zev: Regarding your edit: the following is a deleted answer to the question you're linking to.


    answered Oct 18 at 13:03 by ohai: "Yes. The criterion for a vector bundle on a connected paracompact space to be invertible is that it should have unramified diagonal (this is somewhere in Laumon Moret Bailly, I don't have it here). If the vector bundle has a total Stiefel-Whitney class invertible in its cohomology ring, the diagonal is a monomorphism, and a monomorphism is certainly unramified."

    locked by MathOverflow♦ 20 hours ago
    deleted by MathOverflow♦ 20 hours ago
  5.  

    Zev, you're right. Here's the text:

    Yes. The criterion for a vector bundle on a connected paracompact space to be invertible is that it should have unramified diagonal (this is somewhere in Laumon Moret Bailly, I don't have it here). If the vector bundle has a total Stiefel-Whitney class invertible in its cohomology ring, the diagonal is a monomorphism, and a monomorphism is certainly unramified.

    In the comments, someone remarks that this is plagiarised. The original is here and the text is:

    Yes. The criterion for an Artin stack to be Deligne-Mumford is that it should have unramified diagonal (this is somewhere in Laumon Moret Bailly, I don't have it here). If the stack is fibered in sets, the diagonal is a monomorphism, and a monomorphism is certainly unramified.

    For comparison, there's the "answer" to Harry's question:

    Yes. The criterion for f∧g to be in An is that it should have unramified diagonal (this is somewhere in Laumon Moret Bailly, I don't have it here). If An is a class of monomorphisms anodyne w.r.t. a separated segment on such a category of presheaves, the diagonal is a monomorphism, and a monomorphism is certainly unramified.

    Two further occurrences of this remark:

    1. http://mathoverflow.net/questions/42109/semicosimplicial-totalization
    2. http://mathoverflow.net/questions/43537/property-t-and-subgroups-of-finite-index

    (Apologies for cross-posting with Kevin - I got distracted by my hunt for further occurrences)

  6.  

    It seems kind of sophisticated to be a bot, but hey, maybe it is!

  7.  

    Interestingly, the accounts that left those remarks have other activity which does not appear to be trollish.

  8.  

    Dammit, those two answers have more votes than a lot of correct answers I've given. Woe is me.

    • CommentAuthorAlex Bartel
    • CommentTimeDec 13th 2010 edited
     

    The best explanation I can think of is that it's some student with some mathematical knowledge, who every now and then gets intrigued by people using so many words that he has never heard before. So he starts doubting whether these people are actually saying anything that makes sense to anyone but them and decides to conduct an experiment. He produces some Gibberish that is not immediately recognisable as such by people who are not familiar with the subject matter. Ironically, some of that Gibberish actually has - at the point of writing this - a positive vote count (whoever votes up answers that they don't understand?), so if my explanation is correct, then this student must be very content with the outcome of the experiment.

    Edit: Something I in turn find curious is that now, that these examples have surfaced, nobody seems to be flagging them as spam. Anyway, I am going to.

    • CommentAuthorHarry Gindi
    • CommentTimeDec 13th 2010 edited
     

    Is somebody trying to Sokal us?

    Anyway, it really annoys me that somebody voted up that completely nonsensical answer, when I had a correct answer already posted (that still has no votes). Come on, guys (by which I mean the people who voted up that garbage), at least give credit where credit is due, and all that.

  9.  

    I've flagged them as spam. However, given that this person has been posting these answers under multiple accounts, there exists the possibility that they voted themselves up, to lure more people into upvoting than otherwise would (I'm thinking along the lines of a panhandler putting some of their own coins in their cup).

  10.  
    Could someone be hacking into other people's accounts and posting this stuff? I suppose that by also asking reasonable questions with the same user account, it makes it harder for us to find things like this. I've flagged those all as spam, too. But I agree with Harry and the others: *never vote up something that you don't understand!* I pretty much only vote on questions in my field or on soft questions.
    • CommentAuthorWillieWong
    • CommentTimeDec 13th 2010
     

    @Spiro: now that's a thought. MO uses OpenID, which is, IIRC, susceptible to the FireSheep exploit of a month ago. So it is not completely inconceivable that someone was able to sniff log-in credentials over wireless and posting as random users. But I do find it slightly unlikely.

  11.  
    > whoever votes up answers that they don't understand?

    I'm convinced that the answer is "lots of people".
  12.  

    I vote up answers I don't understand when I have some other reason to believe that the answer is substantially correct (e.g. the answerer has given other correct answers in the past, the answer already has a high vote count) and when I think that the answer deserves more votes (e.g. clearly a lot of work has been put in but it is hard to check). Maybe this isn't a good idea.

  13.  
    Once upon a time, someone came to interview for a job in the department in which I was then employed, and gave a colloquium talk. One of my colleagues, whom I will call X, who worked in an area quite distant from the applicant, told me afterwards that the applicant couldn't be very good, since X understood the talk.

    Perhaps it is people like X who upvote answers if and only if they don't understand them.
    • CommentAuthorYemon Choi
    • CommentTimeDec 13th 2010
     

    Quoting Todd

    whoever votes up answers that they don't understand?

    I'm convinced that the answer is "lots of people".

    Amen. And I speak as someone whose fairly banal observation about expressing the trace of a matrix as a weighted average of its numerical range continues to get occasional upvotes ;-)

  14.  
    I certainly don't consider an upvote to mean I've necessarily checked everything in the answer.
  15.  
    @Noah: There is a big difference between "checking everything in the answer" and "understanding the answer". If you believe that you have the ability to check the details, then you probably understand it.
  16.  
    I consider upvoting to be a pretty mild endorsement. Lots of upvotes is good for the health of the site. It's bad for the site if technical things get too few upvotes, so I try to upvote technical but reasonable sounding questions and answers (well, especially questions, but sometimes answers) even if I don't understand them.
  17.  
    @WilliWong: logging it should not be susceptible to firebug (which only works in completely unencrypted wireless networks btw).

    Even though MO does not encrypt properly (forcing https gives me a warning since the certificate belongs to stackoverflow), it only redirects your account name to your openID provider where you then enter your password.

    Most OpenID-providers use encryption via https to actually log you after that redirect. So unless the openID provider is really bad and is not using https to log you in, firebug should not work.
  18.  

    Doesn't firebug work by stealing cookies? They are transmitted unencrypted, after all. And so long as you're logged in, someone else who got a copy of your MO cookies should be able to pose as you. It should be possible to thwart this attack by presenting the browser with a cookie that changes on each interaction with the site, though. Then the site could at least detect the fact that the login session is used by two computers and could terminate the session, forcing the legitimate user to login again while the impostor is left out in the cold. I don't know if this is actually done.

    • CommentAuthorWillieWong
    • CommentTimeDec 14th 2010
     

    @Peter: Harald's description is the one I understand to be the case. The authentication process is not the problem. The problem is that then you are granted a cookie stating that you've logged in, and shouldn't be checked again for your identity.

  19.  

    Extremely minor pedantic point: I don't think that Harald and Peter mean FireBug. Unless, that is, there's some hidden functionality that I've not yet found (entirely possible, I use it mainly for debugging CSS). At least, if there are two programs with the same name then some clarification should be made so that those of use with FireBug installed don't get all antsy and uninstall it for fear of being branded a cracker instead of merely a hacker.

  20.  

    I think Harald, at least, is talking about Firesheep. http://codebutler.github.com/firesheep/

  21.  

    +1 David. Baaaaaaahahaha!

    • CommentAuthorKevin Lin
    • CommentTimeDec 27th 2010
     

    optima says:

    Yes. The criterion for a symmetric monoidal functor I to be equivalent to the datum of such a fully dualized object is that it should have unramified diagonal (this is somewhere in Laumon Moret Bailly, I don't have it here). If I is from an n-cobordism to the n-category of n-families over a fixed symmetric n-category, the diagonal is a monomorphism, and a monomorphism is certainly unramified.

    Has the mystery been solved yet? What's up with these weird posts?

  22.  

    Comment deleted.

  23.  

    Has the mystery been solved yet? What's up with these weird posts?

    It's just some troll mimicking one of Angelo's answers. Is there something more mysterious about it?

  24.  

    As far as I can tell, the troll is running a Sokal-style experiment to determine if people can distinguish mathematics from strings of words which look like mathematics.

    • CommentAuthorarex
    • CommentTimeDec 28th 2010
     

    The current user optima (who I assume is the same as the former user?) requests (in the comments to this answer) that this answer be deleted.

    I think it would be great if a moderator could delete both answers, as one is being heavily downvoted due to apparent trolling and the other only exists because the first lowered the user's reputation below the commenting threshold. Thanks.

  25.  

    I deleted those two answers. I'm confused about this user. Some of his (now deleted) posts are blatant trolling, but some of them seem very reasonable (e.g. see his comment here ... I haven't read that question, but arex's response suggests that it's a meaningful comment)