User talk:Will Orrick

Welcome

Welcome!

Hello, Will Orrick, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Here are some pages that you might find helpful:

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 ask your question and then place {{helpme}} before the question on your talk page. Again, welcome!

Hi, Will. Thanks for the new article. It's very nice. I did notice one little thing, which I'll fix up in just a minute here – in accordance with Wikipedia style conventions your first sentence really ought to read

In mathematics a regular Hadamard matrix is a Hadamard matrix whose row and column sums are all equal.

In other words, the article's title ought to appear as bold-faced type in the first sentence of the lead paragraph. Not a big deal, but good to know.

Have a great day! DavidCBryant 16:43, 22 May 2007 (UTC)[reply]

Line breaks

Hi, Will. I got your message.

In general, browsers won't break to a new line until they hit a space or a new-line character in the rendered text. So if you wrote the formula as E(H) with no intervening spaces you shouldn't get a break between the E and the left parenthesis. I'm not sure if your particular issue is browser specific, or not. With which article did you have the problem? Which browser and OS are you using? Or is the problem as simple as breaking at a space?

When I'm coding formulas in HTML I (usually) take some care to think about breaks at spaces. The non-breaking space character (coded  ) is useful for this purpose. For instance, there's a difference between coding

''a'' = ''b''

and coding

''a'' = ''b''

These should both render the same way (a = b, and a = b), but the second version should not break across two lines (if your browser's working correctly). Oh – there's also an HTML entity   which stands for a "thin space" and also comes in handy in some circumstances.

Sorry to be so long-winded. I hope I've answered your question. DavidCBryant 11:15, 23 May 2007 (UTC)[reply]

It must be a browser issue. I'm running Internet Explorer 6.0 on Microsoft Windows XP. Since I'm travelling, I don't have easy access to a variety of machines and browsers on which to test the rendering. The page in which the issue is occurring is regular Hadamard matrix. I typed E(H) as ‘‘E‘‘(‘‘H‘‘) without spaces. Moving or eliminating the quote marks doesn't alter the behavior. If I go to other pages that use function notation, such as function (mathematics), for example, I am able to produce the same phenomenon by resizing the browser window. --Will Orrick 15:05, 23 May 2007 (UTC)[reply]

Laurence Klauber

Hi Will. figured I'd just abuse your talk page on this. Margi Dykens at the San Diego Natural History Museum just contacted me and said she has the original diagram on her desk. Here's what she wrote me:

I am even more intrigued with finding out the bottom line about the Klauber mathematical mystery. I have his chart that I was telling you about before out on my desk now---we need to get a photo of it (it is large!) and then maybe send a copy to some math person who could tell us what if anything it signifies in regard to Ulam's spiral. I know it has to do with prime numbers for the simple reason that that is what he wrote on it, but otherwise I am in the dark. It does not show any spiral shapes that I are visible though….

I can meet up with her next week and get it digitized. In the meantime, if you want to chat via email (she's not on Wikipedia yet), you can contact me here. Isara (talk) 21:31, 15 July 2011 (UTC)[reply]

Hadamard code

Hi Will, Thanks for your recent edits in Hadamard code, they are very clarifying. Given your expertise in the area, I hope you can help me answer the following questions. It would be really helpful for me so I can clean up these articles (and learn something useful at the same time). I looked into the standard texts, but the answers were either not satisfying or contradicting, so really what I need are better references.

Why did Hadamard invent Hadamard matrices? Did he want to develop error-correcting codes? If not, who realized their applicability to error-correcting codes first? Do you know any specific references?
The Walsh–Hadamard code is the code that you get from the rows of Sylvester's Hadamard matrices (to be clear, as opposed to the Hadamard code, you just don't take the rows of $-H$ ). Is the name Walsh–Hadamard code standard (see bottom of that page for a source)? If not, what is the standard name? Do you have any references for the naming issue here?
What is the Walsh code?
Is there a connection between Hadamard codes and the Hadamard transform that is deeper than the mere fact that they both involve Hadamard matrices?
Do you have a reference on the relation between the Walsh function and the Hadamard matrix?
I suggest to merge Walsh–Hadamard code into Hadamard code. Do you agree?
Also, a Walsh matrix seems to be the same as Sylvester's constructions. Should Walsh matrix be merged into Hadamard matrix?

Thanks! ylloh (talk) 03:36, 30 September 2011 (UTC)[reply]

Unfortunately I probably cannot answer most of your questions, but I'll do my best.

My understanding is that coding theory got started with the work of Shannon, Hamming, and Golay around 1950 or so. Hadamard's work precedes this by half a century, and was motivated by the derivation of his upper bound on the magnitude of the determinant. He asked whether the bound could be attained by real matrices whose elements were themselves bounded in magnitude (by 1, say). Real ±1 matrices that attain Hadamard's bound are now called Hadamard matrices, although Sylvester had constructed examples 30 years earlier. According to the book Designs and their codes by Assmus and Key, the (non-linear) Hadamard codes described in Hadamard code were constructed by Bose and Shrikhande in 1959. The reference is: R.C. Bose and S.S. Shrikhande, "A note on a result in the theory of code construction" Information and Control Volume 2, Issue 2, June 1959, Pages 183-194. (doi:10.1016/S0019-9958(59)90376-6) An alternative link to the article is http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.154.2879&rep=rep1&type=pdf.
I am not familiar with Walsh–Hadamard codes.
Googling a bit turned up some sources that appear to use "Walsh code" interchangeably with "Walsh–Hadamard code", but again, I'm not familiar with this area.
The decoding scheme mentioned in Hadamard code could be described as "Take the Hadamard transform of the received vector and select the largest component." Like "Hadamard code", "Hadamard transform" can be defined for more general Hadamard matrices. But most people are thinking of the Sylvester matrix when they use the term. The Sylvester matrix allows for extra efficiencies in computing the transform, because of its recursive structure.
One reference is http://books.google.com/books?id=Vj6yS6PsAZYC&pg=PA431&dq=%22Hadamard+matrices,+sequences,+and+block+designs%22&hl=en&ei=5OqFToLVNKro0QGUo8X3Dw&sa=X&oi=book_result&ct=book-preview-link&resnum=1&ved=0CDEQuwUwAA#v=onepage&q=%22Hadamard%20matrices%2C%20sequences%2C%20and%20block%20designs%22&f=false, J. Seberry and M. Yamada, "Hadamard matrices, sequences, and block designs" in Contemporary Design Theory: A Collection of Surveys, J. H. Dinitz and D. R. Stinson eds. Wiley (1992).
Merging Walsh–Hadamard code into Hadamard code seems to make sense. It would be nice to find some good references for Walsh–Hadamard code.
My concern with merging Walsh matrix into Hadamard matrix is that the latter already focuses too much on Sylvester's construction at the expense of other methods for constructing Hadamard matrices. Adding the Walsh matrix material would only make this worse. Also, people interested in only Sylvester or Walsh matrices may not need or want to wade through the more general Hadamard matrix discussion. I think that the Sylvester matrix is a big enough topic that it deserves its own article. But it would be good to indicate clearly that Sylvester matrix and Walsh matrix are the same.

Part of the problem is that there is too little communication between the engineers and the mathematicians, with the result that the literature of each field has its own terminology. Now quantum computing theorists are working in this area, and are using the terminology differently as well. Now I have a question for you: At the top of the Hadamard transform article, one sees the line "Not to be confused with Walsh matrix." I think I must be one of the confused people the author of that line was trying to warn. The matrix used in the Hadamard transform article looks exactly like the Walsh matrix to me.

Will Orrick (talk) 16:41, 30 September 2011 (UTC)[reply]

Thanks for your answers! I'll soon start editing the articles in question appropriately. As for you question, yes, I was confused by "not to be confused with Walsh matrix" as well. I think someone just wanted to point out that Walsh/Hadamard matrices are different objects than the Hadamard transform. Anyway, this group of articles needs some streamlining. Since you feel that the Sylvester/Walsh-Matrix discussion in Hadamard matrix is already too large, why not move all but the essentials about this to Walsh matrix (maybe renamed to Sylvester's construction of Hadamard Matrices) and have only a relatively brief discussion in Hadamard matrix with a link to the main article. Also, the Sylvester matrix seems to be the different from Sylvester's construction of Hadamard Matrices, right? ylloh (talk) 19:08, 30 September 2011 (UTC)[reply]

Sorry for the belated reply. "Sylvester matrix" does indeed appear to be different from "Sylvester's construction of Hadamard matrices". I think that a separate article on Sylvester's construction (perhaps an expansion of the Walsh matrix article, as you suggest) would be a good idea. I'm still undecided about the naming of such an article. If "Walsh matrix" is the common name in the engineering literature, I wouldn't want to step on any toes by renaming it, despite the fact that Sylvester clearly had priority. I will try to do some searching around in the engineering literature to see what the conventions are.

I've just added a bit to the "Construction" section of Hadamard code. There was some incorrect information about parity-check matrices that you deleted in one of your edits; I was motivated to try to figure out what it was that the original author had in mind. Since the information I've added concerns the generating matrix rather than the parity-check matrix, that can't have been it, so I'm still in the dark. It may be that the statement "Alternative constructions for the Hadamard code use its parity-check matrix" should be deleted entirely, unless someone can make sense of it. Will Orrick (talk) 13:08, 6 October 2011 (UTC)[reply]

It's almost two years later now, but I finally got around to doing this merger of Hadamard code and Walsh-Hadamard code. See Talk:Hadamard_code. Thanks! ylloh (talk) 22:19, 21 February 2013 (UTC)[reply]

Cite journal and harvtxt

Re this edit summary: the way to make {{cite journal}} work with {{harvtxt}} is to add the |ref=harv parameter to the cite journal. But in that case it was better to use {{citation}} as you did: the formatting between cite journal and citation is different — mostly in that cite journal. uses. lots of extra. periods. in the middle of the citation. — and it's better to keep the formatting consistent. —David Eppstein (talk) 05:10, 18 September 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) 12:55, 23 November 2015 (UTC)[reply]

ArbCom Elections 2016: Voting now open!

Hello, Will Orrick. 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. Mdann52 (talk) 22:08, 21 November 2016 (UTC)[reply]

ArbCom 2017 election voter message

Hello, Will Orrick. 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]

ArbCom 2018 election voter message

Hello, Will Orrick. 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]

A page you started (Jens Høyrup) has been reviewed!

Thanks for creating Jens Høyrup.

I have just reviewed the page, as a part of our page curation process and note that:

Nice work!

To reply, leave a comment here and prepend it with {{Re|MainlyTwelve}}. And, don't forget to sign your reply with ~~~~ .

Message delivered via the Page Curation tool, on behalf of the reviewer.

MainlyTwelve (talk) 19:12, 26 March 2019 (UTC)[reply]

Disambiguation link notification for April 22

Hi. Thank you for your recent edits. An automated process has detected that when you recently edited Shulba Sutras, you added a link pointing to the disambiguation page Old Babylonian (check to confirm | fix with Dab solver). Such links are usually incorrect, since a disambiguation page is merely a list of unrelated topics with similar titles. (Read the FAQ • Join us at the DPL WikiProject.)

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 12:40, 22 April 2019 (UTC)[reply]

DYK for IM 67118

On 11 July 2019, Did you know was updated with a fact from the article IM 67118, which you recently created, substantially expanded, or brought to good article status. The fact was ... that a clay tablet at the National Museum of Iraq, dated to c. 1770 BCE, shows a calculation that uses the Pythagorean theorem—twelve centuries prior to the birth of Pythagoras? The nomination discussion and review may be seen at Template:Did you know nominations/IM 67118. You are welcome to check how many page hits the article got while on the front page (here's how, IM 67118), and it may be added to the statistics page if the total is over 5,000. Finally, if you know of an interesting fact from another recently created article, then please feel free to suggest it on the Did you know talk page.

valereee (talk) 00:02, 11 July 2019 (UTC)[reply]

ArbCom 2019 election voter message

Hello! Voting in the 2019 Arbitration Committee elections is now open until 23:59 on Monday, 2 December 2019. All eligible users are allowed 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 2019 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:04, 19 November 2019 (UTC)[reply]

ArbCom 2020 Elections voter message

Hello! Voting in the 2020 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 7 December 2020. All eligible users are allowed 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 2020 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 01:20, 24 November 2020 (UTC)[reply]

ArbCom 2021 Elections voter message

Hello! Voting in the 2021 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 6 December 2021. All eligible users are allowed 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 2021 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:07, 23 November 2021 (UTC)[reply]

ArbCom 2022 Elections voter message

Hello! Voting in the 2022 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 12 December 2022. All eligible users are allowed 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 2022 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:27, 29 November 2022 (UTC)[reply]

Thanks

Thank you for fixing the issue on the baudhyana sutras. But I have also noticed that the middle part is still uncited and the paragraphs which have citations cannot be entered. Please kindly fix the issue and make sure that the citations can be entered without issue. Xiwxopswwjdbb (talk) 15:37, 4 December 2022 (UTC)[reply]

Which paragraphs specifically lack citations? As far as I can tell most paragraphs have at least one citation and most have more than one. Also, what do you mean by "cannot be entered"? Will Orrick (talk) 17:35, 4 December 2022 (UTC)[reply]

Si.427

You said here "grandiose claims about the geometric significance of Si.427 were splashed all over the press, but appear to be greatly exaggerated". Just wanted to see what do scholars think. Beji, S. (2022) A Geometric Formulation and a Series Approach for Estimating π with Remarks on a Sumerian Tablet. Advances in Pure Mathematics, 12, 587-599. https://doi.org/10.4236/apm.2022.1211045 said "We consider Si.427 from a different viewpoint and examine its geometric properties rather than its contents by establishing definite ratios or non-dimensional numbers." 🤷 Infinity Knight (talk) 00:25, 12 December 2022 (UTC)[reply]

Serdar Beji does not appear to be a historian and his paper is not published in a history journal. Furthermore, the publisher, Scientific Research Publishing, has engaged in unethical practices numerous times in the past and is considered to be predatory. Beji refers to Plimpton 322 as a "Sumerian tablet", which indicates to me that he doesn't know much about the subject of ancient Mesopotamian mathematics. It also suggests that the paper was not properly refereed, if indeed it was refereed at all. I would not consider anything in this paper reliable as a reflection of the scholarly consensus on Mansfield's work or on the mathematical significance of Si.427. Will Orrick (talk) 00:54, 12 December 2022 (UTC)[reply]

Serdar Beji was published at the "Advances in Pure Mathematics (APM)", an international journal dedicated to the latest advancement of ordered algebraic structures. The goal of this journal is to provide a platform for scientists and academicians all over the world to promote, share, and discuss various new issues and developments in different areas of ordered algebraic structures. The specific paper is supported by 7 references and still you're saying it is not reliable for the Geometry claim? We're taliking mathematics here. One needs to be a historian for that? Any sources for your unethical practices claims? I am confused... 🤷 Infinity Knight (talk) 08:41, 12 December 2022 (UTC)[reply]

Ordered algebraic structures, seven references—all very impressive. I guess it's legit. Will Orrick (talk) 11:24, 12 December 2022 (UTC)[reply]

Crystal gazing is a popular pastime and works best when the Sun is at its northernmost declination. Immediately before the appearance of a vision, the ball is said to mist up from within. Common knowledge. Infinity Knight (talk) 20:10, 12 December 2022 (UTC)[reply]

Champernowne constant

The IP editor doing the revisions is an LTA account User:Xayahrainie43 -- if you look at the article history you'll see that they've been reverting to the same version since at least September 2021. I'll request page protection. JBL (talk) 18:03, 20 December 2022 (UTC)[reply]

Your submission at Articles for creation: Israel Edward Drabkin has been accepted

Israel Edward Drabkin, which you submitted to Articles for creation, has been created.

Congratulations, and thank you for helping expand the scope of Wikipedia! We hope you will continue making quality contributions.

The article has been assessed as C-Class, which is recorded on its talk page. This is a great rating for a new article, and places it among the top 21% of accepted submissions — kudos to you! You may like to take a look at the grading scheme to see how you can improve the article.

Since you have made at least 10 edits over more than four days, you can now create articles yourself without posting a request. However, you may continue submitting work to Articles for creation if you prefer.

If you have any questions, you are welcome to ask at the help desk. Once you have made at least 10 edits and had an account for at least four days, you will have the option to create articles yourself without posting a request to Articles for creation.

If you would like to help us improve this process, please consider leaving us some feedback.

Thanks again, and happy editing!

BuySomeApples (talk) 17:52, 25 July 2023 (UTC)[reply]

ArbCom 2023 Elections voter message

Hello! Voting in the 2023 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 11 December 2023. All eligible users are allowed 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 2023 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:22, 28 November 2023 (UTC)[reply]

ArbCom 2024 Elections voter message

Hello! Voting in the 2024 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 2 December 2024. All eligible users are allowed 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 2024 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:08, 19 November 2024 (UTC)[reply]