User talk:Zahlentheorie

Welcome!

Hello, Zahlentheorie, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Here are a few good links for newcomers:

I hope you enjoy editing here and being a Wikipedian! Please sign your name on talk pages using four tildes (~~~~); this will automatically produce your name and the date. If you need help, check out Wikipedia:Questions, ask me on my talk page, or place {{helpme}} on your talk page and someone will show up shortly to answer your questions. Again, welcome! --HappyCamper 12:32, 11 April 2006 (UTC)[reply]

Hi there! Nice name - "number theory" in German? Have fun on Wikipedia! --HappyCamper 12:32, 11 April 2006 (UTC)[reply]

Totient function

Er, on the Euler Totient page, you added a direction to go to a redlink. Is that what you meant to do? JoshuaZ 14:28, 10 April 2006 (UTC)[reply]

Adding a link to a non-existent article is perfectly OK if there's no existing article on the topic. We the public judge unless you tell us more about what the link was. Michael Hardy 19:11, 6 May 2006 (UTC)[reply]

Random Permutation Statistics

You are doing fine. The tags are there to encourage just the kind of expansion you are doing, not for mockery. You could also sign your messages with - ~~~~. Keep up the good work - Skysmith 11:42, 27 April 2006 (UTC)[reply]

I moved Random Permutation Statistics to random permutation statistics because the former is not consistent with standard Wikipedia conventions found in Wikipedia:Manual of Style. Then I fixed the links to that page in the articles that link to it.

It's a very intersting article. Michael Hardy 19:14, 6 May 2006 (UTC)[reply]

Hello there, I would like to add some more material to the page, but there seem to be two copies of it now that you renamed the page. I am not sure which one to edit; the two links (old and new) both still work. How do I tell Wikipedia that the old version should be re-directed to the new one and that the old one is definitely deprecated?

- Zahlentheorie 10:09, 8 May 2006 (UTC)[reply]

I don't understand: where are the two copies? I simply clicked on "move this page", and entered the new name. As usual, the old name became a redirect page, whose edit history identifies it as a new page created by me at that time, and the old page and its discussion page and their edit histories got move to the new title. Then I fixed the links to the old title. I can't find two copies. Michael Hardy 18:17, 8 May 2006 (UTC)[reply]

I read this thorugh and found the article unnecessary technical and lacking some structure. You might want to start with an introduction. What statistics are you considering? Why? Can your results be proved by other methods? Here are few more precise recommendations:

1) Give an outline of the article. Discuss the scope.

2) Move the "fundamental relation" to a separate WP page with this title. Refer to it if necessary. This part is about technique, not statistics and this should be understood by the reader.

3) In each paragraph start with the statement of the theorem. Include your proof at the end. Say what are other proofs.

Examples:

Derangement -- start with the formula upfront. Give the involution principle proof. Conclude with g.f. as a remark.

"Expected number of cycles" -- start with the formula. Give a proof using basic counting: expected numberof cycles of length m = {n \choose m} (m-1)! / n! = 1/m Only then g.f. proof can be used.

"Expected number of cycles of any length of a random permutation" -- from the previous result, obviously, it's the sum of 1/m for m=1..n. Only after you state and explain this you can incude you g.f. methods.

"Expected number of transpositions of a random permutation" -- misnamed. I have no idea what that means. Are you counting 2-cycles? Perhaps inversions? This is unclear.

"Expected cycle size of a random element" -- confusing. You really meant expected cycle size containing element 1, but wanted to emphasize the symmetry. Then SAY so! First state a theorem that the cycle containing 1 has uniform length. Prove it by simple counting. Conclude that the expected length in (n+1)/2. Only then you can enclose the g.f. proof.

"Expected number of inversions" -- this is unforgivingly complicated. A trivial bijective argument (a_1,a_2...,a_n) --> (a_n,...,a_2,a_1) gives the symmetry of the number of inversions around {n \choose 2}/2. The result follows. Same can be concluded from the explicit product formula. Are you sure you want to use g.f.?

Hope this is constructive enough not to be discouraging. But the article clearly needs work. Mhym 09:44, 4 December 2006 (UTC)[reply]

Request for edit summary

When editing an article on Wikipedia there is a small field labeled "Edit summary" under the main edit-box. It looks like this:

The text written here will appear on the Recent changes page, in the page revision history, on the diff page, and in the watchlists of users who are watching that article. See m:Help:Edit summary for full information on this feature.

Filling in the edit summary field greatly helps your fellow contributors in understanding what you changed, so please always fill in the edit summary field, especially for big edits or when you are making subtle but important changes, like changing dates or numbers. Thank you.

– Oleg Alexandrov (talk) 03:29, 17 May 2006 (UTC)[reply]

exporting article parse trees

Thanks for pointing me to m:Alternative parsers. I think what I want is a Flex/Bison combination (lexer and parser). It seems that flexbisonparse would do precisely what I need. The link is not working, however, and I could not find it by a manual search on sourceforge either. Where can I get a lexer/parser for Wikipedia markup? - Zahlentheorie 16:16, 1 June 2006 (UTC)[reply]

I have no idea where to find flexbisonparse, but I notice it is written by User:Timwi, so I'd suggest asking him. -- Jitse Niesen (talk) 04:48, 2 June 2006 (UTC)[reply]

Contact

Yes, I've tried, but to no avail. The e-mail just bounces. --HappyCamper 21:04, 23 August 2006 (UTC)[reply]

Nice job on Mellin transform

I noticed that you recently expanded Mellin transform. Nice job! linas 23:58, 16 October 2006 (UTC)[reply]

I answered your question on my talk page. linas 21:27, 29 December 2006 (UTC)[reply]

Re: Formal power series and residues

I replied on my talk page. Oleg Alexandrov (talk) 15:54, 20 February 2007 (UTC)[reply]

Stirling numbers

Hi,

I notice that you created the article Stirling numbers and exponential generating functions, which I presume is an angry reaction to the commentary I made on the Stirling numbers pages. I think its unfortunate to have two articles both presenting the same subject, yet doing so in slightly different ways. There is a reason I made the commentary that I did: it is widely accepted in Wikipedia mathematics circles (such as Wikipedia:WikiProject Mathematics) that articles should be structured so that the simplest material is at the beginning of the article, with more complex topics introduced later. The goal here is not to prove to the world how smart you are, but to explain a difficult subject so that many people can understand it. Forking a new article, and disregarding all style guidelines does not advance the WP cause. linas 04:51, 19 March 2007 (UTC)[reply]

Zahlentheorie, I am getting the impression (from the Stirling number articles and others) that you are writing or rewriting many articles to be based on the Flajolet-Sedgewick theory of "symbolic combinatorics". IMO, this is a poor choice of method. The reasons given by linas are accepted for exposition of all subjects. In addition, I do not see a good reason to have a treatment by the F-S theory except in the article on symbolic combinatorics. Therefore, I will recommend that Stirling numbers and exponential generating functions be merged into Symbolic combinatorics.

I am familiar with combinatorial enumeration and I know there are many approaches, some intended not so much to solve problems as to find a unifying method. F-S is of the latter kind. IMO, it is not suited to an introduction such as belongs in WP.

Thank you. Zaslav (talk) 22:57, 25 December 2011 (UTC)[reply]

Your Algorithmics of sudoku page was doomed from the start

Your Algorithmics of sudoku has been tagged to be merged with Mathematics of Sudoku. And the source code you put there has been removed, I think because it constitutes "original research". I predicted something like that would happen, but sat back and watched because I personally found those contributions very interesting. But at this point I don't think there's much you can or should do. Most people would probably agree your contributions were an example of "what Wikipedia is not". I'm just advising you, in case you hadn't noticed yourself. Perhaps get used to using your "watchlist" for things like this, if you don't already.--SportWagon 16:22, 22 May 2007 (UTC)[reply]

AfD nomination of Totient function/Proofs

An article that you have been involved in editing, Totient function/Proofs, has been listed for deletion. If you are interested in the deletion discussion, please participate by adding your comments at Wikipedia:Articles for deletion/Totient function/Proofs. Thank you. Ra2007 (talk) 21:52, 10 December 2007 (UTC)[reply]

root of unit example

Hi, see Talk:Example calculations with roots of unity. On Wikipedia, sources are required even for mathematical statements, both because Wikipedia is not in the business of judging the correctness of mathematical results (see WP:NOR and WP:V) and to establish that the results are notable enough to merit an encyclopedia article (see WP:N). —Steven G. Johnson (talk) 17:17, 21 April 2008 (UTC)[reply]

AfD nomination of Example calculations with roots of unity

An article that you have been involved in editing, Example calculations with roots of unity, has been listed for deletion. If you are interested in the deletion discussion, please participate by adding your comments at Wikipedia:Articles for deletion/Example calculations with roots of unity. Thank you. —Steven G. Johnson (talk) 17:28, 21 April 2008 (UTC)[reply]

I deleted the page Advanced examples of mathematical induction because you simply copied half of the page Example calculations with roots of unity which was deleted after the AfD discussion. Please do not work against the consensus, that just wastes everybody's time. -- Jitse Niesen (talk) 11:21, 10 May 2008 (UTC)[reply]

Edit war over totient proof

I followed up at Wikipedia talk:WikiProject Mathematics #Strangest edit war I've ever seen. At this point a sockpuppet investigation may be in order, listing the user name and IP addresses I mentioned there. If you create an entry at WP:SPI please let me know. Eubulides (talk) 17:31, 28 July 2009 (UTC)[reply]

I created a WP:SPI entry at Wikipedia:Sockpuppet investigations/Prmishra1. Eubulides (talk) 05:43, 29 July 2009 (UTC)[reply]

Coupon collector's problem (generating function approach)

A real maths theorem should never be sent to PROD. The community must discuss it in a more visible forum, such as WP:AfD. Bearian (talk) 19:36, 10 July 2010 (UTC)[reply]

Examples of proofs of convolution identities for multiplicative functions in Multiplicative function

Hi, you deleted the section in 2010, saying on talk that you didn't think it belonged on wikipedia. Why is that?(You are probably right, I just want to know.) Would it be acceptable as a separate article?I suppose that would look a little funny. By the why it looks like you were the main author of those examples, which was a lot of work.Best wishesRich (talk) 21:58, 20 January 2012 (UTC)[reply]

Hello there, I am still not sure whether it belongs or it doesn't, but there have been some developments. There is a wonderful survey paper on these identities by Richard Mathar at arxiv: http://arxiv.org/abs/1106.4038. It just needs someone to pick the most important ones and summarize them in a table, that is, assuming they do belong. Zahlentheorie (talk) 00:55, 21 January 2012 (UTC)[reply]

Notification of automated file description generation

Your upload of File:AllGraphsOnThreeVertices.png or contribution to its description is noted, and thanks (even if belatedly) for your contribution. In order to help make better use of the media, an attempt has been made by an automated process to identify and add certain information to the media's description page.

This notification is placed on your talk page because a bot has identified you either as the uploader of the file, or as a contributor to its metadata. It would be appreciated if you could carefully review the information the bot added. To opt out of these notifications, please follow the instructions here. Thanks! Message delivered by Theo's Little Bot (opt-out) 11:38, 19 December 2013 (UTC)[reply]

Another one of your uploads, File:ContourLogs.png, has also had some information automatically added. If you get a moment, please review the bot's contributions there as well. Thanks! Message delivered by Theo's Little Bot (opt-out) 15:10, 23 May 2014 (UTC)[reply]

ArbCom elections are now open!

Hi,
You appear to be eligible to vote in the current Arbitration Committee election. The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to enact binding solutions for disputes between editors, primarily related to serious behavioural issues that the community has been unable to resolve. This includes the ability to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail. If you wish to participate, you are welcome to review the candidates' statements and submit your choices on the voting page. For the Election committee, MediaWiki message delivery (talk) 13:52, 23 November 2015 (UTC)[reply]

ArbCom Elections 2016: Voting now open!

Hello, Zahlentheorie. Voting in the 2016 Arbitration Committee elections is open from Monday, 00:00, 21 November through Sunday, 23:59, 4 December to all unblocked users who have registered an account before Wednesday, 00:00, 28 October 2016 and have made at least 150 mainspace edits before Sunday, 00:00, 1 November 2016.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2016 election, please review the candidates' statements and submit your choices on the voting page. MediaWiki message delivery (talk) 22:08, 21 November 2016 (UTC)[reply]

A barnstar for you!

The Original Barnstar

I found your user account by searching through the revisions to the generating functions article, which my new article draft suggests as the main article for the topic in my page header.

Would you mind reviewing my related article located at https://en.wikipedia.org/wiki/Draft:Generating_function_transformation_(Mathematics)? It contains notes, listings, citations, and examples on transformations of generating functions, which is again related to the main article topic, but is of sufficient length and I think has broad enough topic coverage to have a separate article dedicated to it. I have been waiting for someone to review the article since I posted it as a draft 3-4 weeks ago. I guess math articles require special mathematician reviewers.

Good job on your contributions to the first generating functions article. Maxieds (talk) 19:35, 10 March 2017 (UTC)[reply]

Completely random paper

Greetings. Can you explain what you mean by "completely random" at this link here: [Coupon collector https://en.wikipedia.org/w/index.php?title=Coupon_collector%27s_problem&diff=778274187&oldid=778274122] That way I can improve the paper and better understand why the link was removed. -Zahlentheorie (talk) 23:07, 22 July 2017 (UTC)[reply]

I could not find the definition of "random link" on WP:NOT. Can you please post the definition? -Zahlentheorie (talk) 15:45, 28 July 2017 (UTC)[reply]

Fair enough. I meant specifically WP:LINKFARM and WP:INDISCRIMINATE. There is not reason to include a link to a non-notable paper by a non-notable author in the External links. For more what goes into external links, see WP:EXT. Mhym (talk) 22:34, 28 July 2017 (UTC)[reply]

ArbCom 2017 election voter message

Hello, Zahlentheorie. Voting in the 2017 Arbitration Committee elections is now open until 23.59 on Sunday, 10 December. All users who registered an account before Saturday, 28 October 2017, made at least 150 mainspace edits before Wednesday, 1 November 2017 and are not currently blocked are eligible to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2017 election, please review the candidates and submit your choices on the voting page. MediaWiki message delivery (talk) 18:42, 3 December 2017 (UTC)[reply]

Proposed deletion of File:MellinDomains.png

The file File:MellinDomains.png has been proposed for deletion because of the following concern:

Orphaned graph/chart/diagram.

While all constructive contributions to Wikipedia are appreciated, pages may be deleted for any of several reasons.

You may prevent the proposed deletion by removing the {{proposed deletion/dated files}} notice, but please explain why in your edit summary or on the file's talk page.

Please consider addressing the issues raised. Removing {{proposed deletion/dated files}} will stop the proposed deletion process, but other deletion processes exist. In particular, the speedy deletion process can result in deletion without discussion, and files for discussion allows discussion to reach consensus for deletion. ~ Rob₁₃^Talk 18:04, 21 October 2018 (UTC)[reply]

Proposed deletion of File:MellinStrip.png

The file File:MellinStrip.png has been proposed for deletion because of the following concern:

Orphaned graph/chart/diagram.

While all constructive contributions to Wikipedia are appreciated, pages may be deleted for any of several reasons.

You may prevent the proposed deletion by removing the {{proposed deletion/dated files}} notice, but please explain why in your edit summary or on the file's talk page.

Please consider addressing the issues raised. Removing {{proposed deletion/dated files}} will stop the proposed deletion process, but other deletion processes exist. In particular, the speedy deletion process can result in deletion without discussion, and files for discussion allows discussion to reach consensus for deletion. ~ Rob₁₃^Talk 18:04, 21 October 2018 (UTC)[reply]

ArbCom 2018 election voter message

Hello, Zahlentheorie. Voting in the 2018 Arbitration Committee elections is now open until 23.59 on Sunday, 3 December. All users who registered an account before Sunday, 28 October 2018, made at least 150 mainspace edits before Thursday, 1 November 2018 and are not currently blocked are eligible to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2018 election, please review the candidates and submit your choices on the voting page. MediaWiki message delivery (talk) 18:42, 19 November 2018 (UTC)[reply]

Proposed deletion of File:KnightsOfTheRoundTable.png

The file File:KnightsOfTheRoundTable.png has been proposed for deletion because of the following concern:

unused, low-res, no obvious use

While all constructive contributions to Wikipedia are appreciated, pages may be deleted for any of several reasons.

You may prevent the proposed deletion by removing the {{proposed deletion/dated files}} notice, but please explain why in your edit summary or on the file's talk page.

Please consider addressing the issues raised. Removing {{proposed deletion/dated files}} will stop the proposed deletion process, but other deletion processes exist. In particular, the speedy deletion process can result in deletion without discussion, and files for discussion allows discussion to reach consensus for deletion.

This bot DID NOT nominate any file(s) for deletion; please refer to the page history of each individual file for details. Thanks, FastilyBot (talk) 01:00, 8 May 2019 (UTC)[reply]

Proposed deletion of File:KeyholeForMellin.png

The file File:KeyholeForMellin.png has been proposed for deletion because of the following concern:

unused, low-res, no obvious use

While all constructive contributions to Wikipedia are appreciated, pages may be deleted for any of several reasons.

You may prevent the proposed deletion by removing the {{proposed deletion/dated files}} notice, but please explain why in your edit summary or on the file's talk page.

Please consider addressing the issues raised. Removing {{proposed deletion/dated files}} will stop the proposed deletion process, but other deletion processes exist. In particular, the speedy deletion process can result in deletion without discussion, and files for discussion allows discussion to reach consensus for deletion.

This bot DID NOT nominate any file(s) for deletion; please refer to the page history of each individual file for details. Thanks, FastilyBot (talk) 01:01, 21 March 2020 (UTC)[reply]