Hi David,
Thanks for the addition on the Foundations of geometry page - but I do have a question about it. Do you really know of any reference for "Pasch's theorem" independent of WP and the Mathworld page (neither of which has a reference)? I've been trying to track down a good reference for this for about a month now without success. Outside of our page and the Mathworld page (one of which was certainly copied from the other) almost all the Google scholar references confound Pasch's theorem with Pasch's axiom (which makes sense from a modern perspective ... if you don't start with Hilbert's axioms, Pasch's axiom becomes a theorem). Until quite recently, our page Hilbert's axioms implied that Pasch's theorem was an old axiom of Hilbert about the ordering of four points on a line which was shown to be provable by E.H. Moore and R.L. Moore (no relation) and removed by Hilbert. I find this explanation very plausible, but almost certainly OR by one of our editors. The only other reference that I have found is by Pambuccian (an expert on ordered geometry) who refers to the statement that a line cannot intersect all three sides of a triangle (internally) as Pasch's theorem. While there are still a couple of sources that I don't own which I need to look at, I am beginning to think that I won't be able to resolve this issue ... there may not be any statement which has a claim to be called "Pasch's theorem". Any light you can throw on this would be appreciated. Bill Cherowitzo (talk) 03:12, 3 October 2013 (UTC)
Oh well ;^(. I've thought of prodding it to scare up a reference, but as I said, I still need to try a couple of standard references before I'd be willing to go that far. The OR problem was on a different page, and I've taken care of that problem already. Thanks. Bill Cherowitzo (talk) 04:35, 3 October 2013 (UTC)
I have added 3 citations, each from a different country (one is a news citation from The Guardian newspaper). Wouldn't it be better to take it to the Talk page, rather than enacting a sweeping reversion in a proprietary manner?--Soulparadox (talk) 17:14, 5 October 2013 (UTC)
Might I just enquire how much of the literature on these topics you have actually read? The paragraph flagged conflates three literary traditions, plus etymology, that it is surely open to the challenge of original research, without more careful rewriting; it is a matter of presumption that the intent of authors in these different traditions that are by no means contemporary is the same and in Wikipedia we are not supposed to read into authors cited more than their texts sustain. Of course, we can cite translators or commentators who have done that, but without reading more into them than is there.
For instance, have you actually read the paper of Netz, Acerbi and Wilson of 2007 that is flagged on the talk page and has recently appeared in the references? In it we find the figure the Archimedes of the Stomachion fragment is investigating, as already given by Heiberg and Dijksterhuis, and about which there seems general agreement. As it is so generally agreed upon, and we can cite all these three sources, surely it is worthy of inclusion in the Wikipedia entry? The only problem for the article as it stands is that it does not immediately suggest a dissection problem.
Again, have you read the contributions of Richard Dixon Oldham, FRS, in 1926 to Nature, to The New York Times or to Popular Science Magazine? Surely, the caption the first figure shown to the left only makes sense if we have in mind Oldham's attempted reconciliation of Suter's German translation of the unpointed Arabic text and the Greek fragment in the Palimpsest?
Have you read H. J. Roses's Handbook of Greek Literature (1934), pp. 37--38 in which he alerts the classicists to Oldham's attempted reconciliation? Did you notice that Giovanni Vacca and Giuseppe Peano took note of Oldham's interpretation, too, as shown in the anniversary volume Lo spirito creativo e leggro: Giuseppe Peano (1858-1932), matematico e maestro (2008)? Staying with the Italian, have you seen Giuseppe Morelli's Lo Stomachion di Archimede nelle testimonianze antiche in Bollettino di storia scienze matematiche for 2007, which gives a comprehensive survey of the classical sources and allusions, although missing reference to Oldham?
Given your scholarship and learning, the presumption is that you have, although I freely admit that this is original research on my part. The mystery then is why you might think the article can stand as it does, without more careful delineation of what each tradition is about and without more detailed references.
There is no dispute that two of these traditions, the Greek and the Arabic, deal with mathematical problems. The large section that you have excised in toto seemed to me to have been written as a standing invitation for rewriting; and that seems (to me) to have arisen because of the divergence between Netz' popular writings and public promotional appearances and his more narrowly scholarly research with Acerbi and Wilson which has not been so easy to obtain. I put it to you that, to strip it out is not only original research by censorship, but also original research by default, in that it leaves what remains dangling.
Why would an experienced and sensitive editor of Wikipedia with your great scholarship and learning do that? — Preceding unsigned comment added by 129.180.1.224 (talk) 21:49, 5 October 2013 (UTC)
The UCR Libraries are hosting three edit-a-thons focusing on their great special collections (science fiction, water resources, the Inland Empire and more) on Oct. 12, 2013, Oct. 26, 2013, and Nov. 23, 2013. Please participate if you can! Details and signup here. All are welcome, new and experienced editors alike! -- phoebe / (talk to me) 04:10, 8 October 2013 (UTC)
Wait a few more days for others to reply. Some editors might be on a three day weekend. Some editors only edit from work. Lentower (talk) 22:38, 14 October 2013 (UTC)
Your suggestion to develop both a Lua version of {Jct} as well as writing a California variation, as Template:JctCA, was correct. In fact, the actual performance tests proved {JctCA} was 25x times faster than {Jct}, to reformat a large junction/exit table about twice(!) as fast. Only a few road pages would need a faster {JctXX} template. However, some other editors are threatening to oppose use of the 25x faster template, so actual progress will most likely grind to a halt. In cases like this, I typically focus on other activities which do not involve so many disputes. My general rule of thumb is: "Wikipedia is 10% information, and 90% deformation" as to expect a simple problem to become 10x harder when disputes occur. I think there would need to be template-improvement guideline to mandate the use of "quick templates" which improve performance in severe cases. For the past 4 years, I have met similar resistance to improved templates, and the result is often wp:TfD deletion of the faster templates, even with new features also discarded in the deleted variation. In fact, after I carefully converted the wp:CS1 cite templates to Lua (with hundreds of parameter options), then the no-progress nightmare began again, this time opposing major improvements to the Lua variation. Jimbo himself has advised people to allow faster experimental templates, and I think it would require a mandate from the WMF managers to require people to accept faster templates and not drag templates to deletion (in some cases, repeating the TfD 4 times until wp:forum-shopping finally reached a delete decision). I just mention this to warn of how progress is thwarted in Wikipedia. I really wish Jimbo would accept a one-year job as Director of the Foundation, and then set "90" new official rules for how wiki projects would allow innovation, accept faster templates, appoint temporary admins, and hide explicit content (image categories) for children of concerned parents, but unfortunately, he is too busy leading other companies and remains a mere "admin" and volunteer editor who refrains from using his powers to implement his dozens of clever ideas to improve WP. At least it is fascinating to see how solutions could have been used to solve many irritating problems. -Wikid77 (talk) 05:12, 15 October 2013 (UTC)
Thanks I'm sure that this edit was well-intentioned but I like to keep all comments on my talk page, including ones which are spam or outrageous (not that this one is.) —Justin (koavf)❤T☮C☺M☯ 17:41, 20 October 2013 (UTC)
Hi, could you perhaps have a look at this journal? It's been around for over 80 years, so I'm surprised that it doesn't seem to be indexed in any database that I have access to (and they don't mention any on their website either). However, I don't have access to mathematics/statistics-specific databases, so perhaps you can find something? Thanks. --Randykitty (talk) 13:13, 21 October 2013 (UTC)
Note at the end of the documentation for the {{Request edit}} template, there is a link to Template:Request edit/COIinstructions#Current requested edits, which looks like a bot-maintained list of pending requested edits. isaacl (talk) 01:10, 22 October 2013 (UTC)
A discussion you may be interested in is this RFC, a proposal to make the second comma in a date/place optional. United States Man (talk) 05:44, 27 October 2013 (UTC)
Volume 1, Issue 1, October 2013
by The Interior (talk · contribs), Ocaasi (talk · contribs)
Greetings Wikipedia Library members! Welcome to the inaugural edition of Books and Bytes, TWL’s monthly newsletter. We're sending you the first edition of this opt-in newsletter, because you signed up, or applied for a free research account: HighBeam, Credo, Questia, JSTOR, or Cochrane. To receive future updates of Books and Bytes, please add your name to the subscriber's list. There's lots of news this month for the Wikipedia Library, including new accounts, upcoming events, and new ways to get involved...
New positions: Sign up to be a Wikipedia Visiting Scholar, or a Volunteer Wikipedia Librarian
Wikipedia Loves Libraries: Off to a roaring start this fall in the United States: 29 events are planned or have been hosted.
New subscription donations: Cochrane round 2; HighBeam round 8; Questia round 4... Can we partner with NY Times and Lexis-Nexis??
New ideas: OCLC innovations in the works; VisualEditor Reference Dialog Workshop; a photo contest idea emerges
News from the library world: Wikipedian joins the National Archives full time; the Getty Museum releases 4,500 images; CERN goes CC-BY
Announcing WikiProject Open: WikiProject Open kicked off in October, with several brainstorming and co-working sessions
New ways to get involved: Visiting scholar requirements; subject guides; room for library expansion and exploration
Read the full newsletter
Thanks for reading! All future newsletters will be opt-in only. Have an item for the next issue? Leave a note for the editor on the Suggestions page. --The Interior 21:30, 27 October 2013 (UTC)
Northamerica1000(talk) 20:57, 30 October 2013 (UTC) Hello. You have a new message at User talk:Northamerica1000's talk page. Message added by Northamerica1000(talk) 23:38, 30 October 2013 (UTC).
Hi David, I saw you deleted this article for lack of sources. I just re-uploaded it with sources. Please contact me if there are any issues. Thanks and have a nice day, Happy138 (talk) 07:12, 5 November 2013 (UTC)
You recently contributed to a discussion at Wikipedia talk:Naming conventions (geographic names) § Commas in metro areas. Following a recent related RFC on the wording used at MOS:COMMA in relation to geographic names, a new wording has gathered some support and I have opened a new RFC at Wikipedia talk:Manual of Style § RFC: Proposed amendment to MOS:COMMA regarding geographical references and dates for further discussion of the proposal, which may interest you. —sroc 💬 08:43, 7 November 2013 (UTC)
The problem at the moment is that a week ago, User:Isheden redirected Constant (mathematics) to the disambiguation page, Constant, which has a dozen meanings ranging from math and physics to popular culture topics, with no clear means of determining which kind of constant is intended for any given link. Should that redirection be reversed? bd2412 T 17:25, 7 November 2013 (UTC)
The DYK project (nominate) 09:32, 9 November 2013 (UTC)
David Eppstein,
Hello! I'm a fairly new Wikipedia editor, and I've spent a lot of time working on Finite subdivision rule. I was wondering if you would mind looking it over briefly; it's an article on an area of math vaguely related to cellular automota and strongly related to hyperbolic geometry and circle packings. I've never created an article from scratch like this, so if you have the time, I'd really appreciate some feedback. Sorry if this is the wrong way to request help like this. Thanks!Brirush (talk) 02:49, 12 November 2013 (UTC)
I notice that you deprodded Natalie Holland. I didn't add the prod myself, but I do happen to agree with it, is it too late to endorse it or should I AfD it?--Launchballer 13:52, 13 November 2013 (UTC)
Hi David, you might like to contribute to the discussion at Talk:Polygon#Degeneracy_and_realization about some edits you made recently. — Cheers, Steelpillow (Talk) 09:04, 14 November 2013 (UTC)
Not that those articles are acceptable as they are written, but to pass BLPROD they just need the official CV or other sufficiently reliable source for verification, not a third party source.
The question is, how much rewriting should we be doing? I really don't have the time to do everything necessary, tho many would I think pass WP:PROF. See my edits on Chang Hee Nam (he's a fellow of the APS, and that has usually counted for notability ) and my comments at User talk:Kofst1254 DGG ( talk ) 04:35, 17 November 2013 (UTC)
Hi David, re this and this, I'm not sure, but perhaps it's worth checking whether user POLY1956 (talk · contribs) and user BOOLE1847 (talk · contribs) might be one and the same person? FWIW, I have asked both users on their talk pages. Cheers - DVdm (talk) 22:57, 23 November 2013 (UTC)
I guess it was as that sort of bigoty is always ugly, but that felt like a comment about me. Dougweller (talk) 06:12, 25 November 2013 (UTC)
Hello, I'm BracketBot. I have automatically detected that your edit to Barry Mazur may have broken the syntax by modifying 2 "{}"s. If you have, don't worry: just edit the page again to fix it. If I misunderstood what happened, or if you have any questions, you can leave a message on my operator's talk page.
Thanks, BracketBot (talk) 07:44, 25 November 2013 (UTC)
Hello, I am Raghavendra Lingayya. I given external link so that the readers can get detailed truth about the changes i made. If you remove it, there is no problem for me, but it is a problem for those who want to study Geometric Progression.
I teach numbers 1 2 3 4 and 1 3 5 7 using R-analysis and tell the students to derive the formula to find sum of GP, they automatically derive this formula using R-analysis (Raghavendra's Analysis). Means, there is no need to teach derivations for series if one just studied a number using R-analysis.
I did about ten years of research only on few numbers pattern.
My sir told that the truth there is no derivation for the series to find sum of first n natural numbers, squares, cubes, etc. This truth result in finding derivation for the series. But to understand the difference between automatic mathematics and answer getting mathematics, one has to to see the both.
Sir, you removed the truth about the method. Teachers will teach that trick as mathematics. This is nothing but cheating the students. What they understand in this derivation? How this method helps to solve other series? Is the contain any study on the given question? But if do not removed that truth, then there will help in starting discussion on the present method and real method, so that in feature it helps to get true mathematics for millions of students in their curriculum.
Do you find any wrong in telling the method as Trick? Why? Do you think the method given is the right algebraic derivation? Why? I am expecting your answers. I hope real mathematical derivation is not starting knowing the answer before or not starting using the external tricks. I am very happy about you on starting discussion on it. You can re-write my article or add my article again in wiki if you will find that it helps the feature generations to get real mathematics. — Preceding unsigned comment added by Rahaven (talk • contribs) 11:14, 28 November 2013 (UTC)
Hi David, Domotor Palvolgyi here. I am no expert in wiki, I am writing to you to report a mistake on the http://en.wikipedia.org/wiki/Sipser%E2%80%93Lautemann_theorem page which I saw you edited. The page gives two proofs for the theorem and claims the first is based on Sipser(-Gacs) and the second on Lautemann but in fact both proofs are the same (based on Lautemann), Sipser used hash functions. Hope you know how to deal with the problem...
Ps. I really don't think it's correct to call it Sipser-Lautemann theorem as the first person to prove the result was Gacs, see e.g. Trevision calls it Gács-Sipser-Lautemann: http://lucatrevisan.wordpress.com/2010/04/27/cs254-lecture-5-the-polynomial-hierarchy/ — Preceding unsigned comment added by 80.98.160.141 (talk) 12:19, 28 November 2013 (UTC)
I've been going through the material you added on Tsukiyama's algorithm for enumerating maximal cliques. I was a bit confused about the first part but have since realized my mistake, see Talk:Clique problem#Tsukiyama algorithm stated incorrectly, but I'm still not convinced that the algorithm as described is completely correct. The problem is the passage:
There doesn't seem to be any way to avoid the issue that C∩N(v)∪{v} is not necessarily maximal without specifically testing for it. The test is easy, namely that C∩N(v) must be a maximal clique in N(v). But the lexicographic maximum condition on C does not guarantee this will be true. For a counterexample, take G={1, 2, 3} with a single edge {23}, C={1} and v=3. C is the lex. maximum clique in G \ v but C∩N(v) is empty. With the additional test I was able to turn your description into Python code that produced a result matching the Bron–Kerbosch algorithm and my own crude methods.
The secondary sources I found on-line for the algorithm describe it very differently than the WP article, more of a tree traversal where the nodes of the tree are the maximal cliques and the condition defining an edge between nodes is rather complex. Given how much the algorithm has evolved and that (so I gather) it is the starting point of other output sensitive algorithms including that of Makino & Uno and of Johnson & Yannakakis, it seems like there is more than enough material for a separate article on the algorithm. --RDBury (talk) 07:53, 3 December 2013 (UTC)
As a subscriber to one of The Wikipedia Library's programs, we'd like to hear your thoughts about future donations and project activities in this brief survey. Thanks and cheers, Ocaasi t | c 15:40, 9 December 2013 (UTC)
You are invited to join the discussion at Wikipedia talk:Naming conventions (geographic names)#En dash vs. "and" for multi-state metro areas. Herostratus (talk) 18:32, 11 December 2013 (UTC)
What book is your reference for the usage of "best rational approximation" in the area of a disk page? The notion of "best rational approximation with denominator less than X" is clear and I understand the connection with continued fractions, but the usage here seems to me prone to misinterpretation. Ebony Jackson (talk) 19:42, 13 December 2013 (UTC)
Just wanted to say I agree with the redirect; somehow it didn't occur to me there might be an article called stable map. (In fact, I think it's a wrong title.) -- Taku (talk) 13:01, 17 December 2013 (UTC)
Hi, I saw your revert.
The antichain principle, every partially ordered set has a maximal antichain, is an equivalent of the axiom of choice and listed (and linked to Antichain) in that article. That's why I categorized it. YohanN7 (talk) 03:04, 20 December 2013 (UTC)
Hey, nice work on the diagram, and thanks for contributing it! Melchoir (talk) 02:10, 22 December 2013 (UTC)