User talk:Adamant.pwn/Archive 1

This is an archive of past discussions with User:Adamant.pwn. Do not edit the contents of this page. If you wish to start a new discussion or revive an old one, please do so on the current talk page.

Archive 1

Use Latex for your graphical diagram

Hello Adamant.pwn,

The graphic diagram you added to the Bernstein–Vazirani algorithm should be in latex. This makes it easier for the reader to parse it. Your diagram also goes off the page. Please fix that formatting error at least. Let me know what questions you have.

Thanks, Vtomole (talk) 14:30, 12 December 2019 (UTC)

Hi, Victory! I see the issue. The image actually has latex source, but it's written in tikz-cd. Do you have any suggestions on converting it into wiki-compatible one? ${\texttt {adamant}}$ ^{(talk/contribs)} 14:54, 12 December 2019 (UTC)

@Vtomole: can you help me here, please? ${\texttt {adamant}}$ ^{(talk/contribs)} 16:01, 14 December 2019 (UTC)

Looks like it only goes off the page on my mobile device but not on the desktop. Maybe turning your diagram to an image of a quantum circuit will make it compatible with all devices. We can emulate 'Figure 1' of http://people.cs.uchicago.edu/~ftchong/33001/lecture08.pdf Vtomole (talk)

@Vtomole: What exactly do you mean here? To reduce the width of the image? I actually wanted to emulate FIG.3 from [1], i.e. with transforms explicitly written on the diagram, but still not sure what's the best way to rewrite it in wikipedia-compatible latex... ${\texttt {adamant}}$ ^{(talk/contribs)} 17:08, 16 December 2019 (UTC)

Reducing the width is preferable. Maybe the same width as the quantum circuit image that is on the top right of the page? Vtomole (talk)

Welcome!

Hello, Adamant.pwn! Welcome to Wikipedia! Thank you for your contributions. You may benefit from following some of the links below, which will help you get the most out of Wikipedia. If you have any questions you can ask me on my talk page, or place {{helpme}} on your talk page and ask your question there. Please remember to sign your name on talk pages by clicking

or by typing four tildes "~~~~"; this will automatically produce your name and the date. If you are already excited about Wikipedia, you might want to consider being "adopted" by a more experienced editor or joining a WikiProject to collaborate with others in creating and improving articles of your interest. Click here for a directory of all the WikiProjects. Finally, please do your best to always fill in the edit summary field when making edits to pages. Happy editing! JACKINTHEBOX • ^TALK 05:13, 13 January 2019 (UTC)

Getting Started
Contributing to Wikipedia • Tutorial • Your first article The five pillars of Wikipedia • Simplified ruleset How to: edit a page • upload an image
Getting Help
Frequently Asked Questions Directories and indexes Where to: ask questions • make requests Tip of the day Request administrator attention
Policies and Guidelines
Neutral point of view • Reliable sources Verifiability • Citing sources • No original research What Wikipedia is not • Biographies of living persons Manual of Style (Simplified) • Three-revert rule Copyrights • Non-free content • Image use policy External links • Spam • Vandalism • Sock puppetry Deletion policy • Conflict of interest • Notability

The Community
Community Portal • Adopt-a-user program Assume good faith • Civility • Etiquette No personal attacks • Resolving disputes Build consensus • Village pump IRC channels • Mailing lists The Signpost (Wikipedia's newspaper)
Things to do
Be bold in editing • Help develop an article Maintenance • Peer review • Requested articles Join a WikiProject • Translating articles Cleaning up: General • Spam • Vandalism
Miscellaneous
Categories • Disambiguity • Stubs User pages • Talk pages Useful templates • Tools • User scripts

Adamant.pwn, you are invited to the Teahouse!

Hi Adamant.pwn! Thanks for contributing to Wikipedia.
Be our guest at the Teahouse! The Teahouse is a friendly space where new editors can ask questions about contributing to Wikipedia and get help from experienced editors like Nick Moyes (talk).

Visit the Teahouse

We hope to see you there!

Delivered by HostBot on behalf of the Teahouse hosts

16:05, 13 January 2019 (UTC)

January 2019

Hello, I'm Mahveotm. I wanted to let you know that I reverted one of your recent contributions —specifically this edit to Resultant— because it did not appear constructive. If you would like to experiment, please use the sandbox. If you have any questions, you can ask for assistance at the Help Desk. Thanks. Mahveotm (talk) 22:33, 13 January 2019 (UTC)

To editor Mahveotm: excuse me, but my edit was constructive. Current formula is wrong and I explained it in comment section in my edit. If $\deg C=\deg A-\deg B$ and $c_{0}=a_{0}/b_{0}$ then degree of $A-CB$ will be less than $d=\deg A$ and it will change the value of resultant. Adamant.pwn (talk) 22:39, 13 January 2019 (UTC)

Apologies. Welcome to Wikipedia! Mahveotm (talk) 22:52, 13 January 2019 (UTC)

Welcome!

Welcome to Wikipedia, Adamant.pwn! Thank you for your contributions. I am Mahveotm and I have been editing Wikipedia for some time, so if you have any questions, feel free to leave me a message on my talk page. You can also check out Wikipedia:Questions or type {{help me}} at the bottom of this page. Here are some pages that you might find helpful:

Also, when you post on talk pages you should sign your name using four tildes (~~~~); that will automatically produce your username and the date. I hope you enjoy editing here and being a Wikipedian! Mahveotm (talk) 22:52, 13 January 2019 (UTC)

DYK for Berlekamp's root finding algorithm

On 24 August 2019, Did you know was updated with a fact from the article Berlekamp's root finding algorithm, which you recently created, substantially expanded, or brought to good article status. The fact was ... that the original article describing Berlekamp's root finding algorithm did not contain a proof of correctness? The nomination discussion and review may be seen at Template:Did you know nominations/Berlekamp's root finding algorithm. You are welcome to check how many page hits the article got while on the front page (here's how, Berlekamp's root finding algorithm), 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.

Vanamonde (Talk) 00:01, 24 August 2019 (UTC)

Your GA nomination of Berlekamp's root finding algorithm

Hi there, I'm pleased to inform you that I've begun reviewing the article Berlekamp's root finding algorithm you nominated for GA-status according to the criteria. This process may take up to 7 days. Feel free to contact me with any questions or comments you might have during this period. Message delivered by Legobot, on behalf of Jakob.scholbach -- Jakob.scholbach (talk) 14:02, 17 September 2019 (UTC)

Hi again, I have reviewed the article, have a look! Best, Jakob.scholbach (talk) 19:06, 21 September 2019 (UTC)

Your GA nomination of Berlekamp's root finding algorithm

The article Berlekamp's root finding algorithm you nominated as a good article has been placed on hold . The article is close to meeting the good article criteria, but there are some minor changes or clarifications needing to be addressed. If these are fixed within 7 days, the article will pass; otherwise it may fail. See Talk:Berlekamp's root finding algorithm for issues which need to be addressed. Message delivered by Legobot, on behalf of Jakob.scholbach -- Jakob.scholbach (talk) 19:22, 21 September 2019 (UTC)

DYK nomination of Suffix automaton

Hello! Your submission of Suffix automaton at the Did You Know nominations page has been reviewed, and some issues with it may need to be clarified. Please review the comment(s) at your nomination's entry and respond there as soon as possible. Thank you for contributing to Did You Know! Yoninah (talk) 13:02, 13 September 2020 (UTC)

Your GA nomination of Berlekamp's root finding algorithm

The article Berlekamp's root finding algorithm you nominated as a good article has failed ; see Talk:Berlekamp's root finding algorithm for reasons why the nomination failed. If or when these points have been taken care of, you may apply for a new nomination of the article. Message delivered by Legobot, on behalf of Jakob.scholbach -- Jakob.scholbach (talk) 19:41, 22 September 2019 (UTC)

Hi adamant, I have failed your nomination per your request. If you don't actually plan to work on a nomination I would rather encourage you not to nominate it in the first place. After all I (as a reviewer) have spent quite some time reading and assessing your nominated article which is now of little effect. Best, Jakob.scholbach (talk) 19:50, 22 September 2019 (UTC)