User talk:Watchduck

Empty graphs.

Hi!

Here, you wrote a definition in a separate section of the graph connectivity article, in order to provide an adequate anchor for a redirect. This is well done, I think; but you (incidently, or after careful consideration?) also included examples, which include make the empty graph among the connected ones. (The graph with no vertex also has no edge.) This, I find unusual, and not so good.

Now, many authors tacitly or explicitly demand that graphs be non-empty; i. e., they do not allow an empty graph. (If my memory is correct, e. g. Diestl demands this explicitly.) Now, personnally, I prefer to consider also the empty graph $(\emptyset ,\emptyset )$ as a (simple) graph, since this on some points makes the graph theory smoother. However, then, I do not consider the empty graph as connected. If I did, I would either have to make a numerous amount of exceptions in other definitions and calculations, or run into rather weird changes of how graphs behave.

Here is an example: A tree commonly is defined as a connected acyclic graph. It also is said to have the property (order = size+1). However, with your definitions, the empty graph would be both connected and acyclic; but with both order and size equal to zero.

Another example: A connected component of a graph often is defined as a maximal connected subgraph. Thus, with your definitions, the empty graph should have one connected component, namely itself. As a consequence, the theorem, that the number of components in a disjoint union of graphs equals the sums of the component numbers of these graphs, would have be to be modified, by subtracting the number of components who are empty graphs, but adding one, if they all are.

There is also the connectivity and connectedness connection, which breaks down for the empty graph.

So, for these and similar reasons, when I allow the empty graph, I consider it as "not connected". In this way, a tree is demanded to be non-empty, while I allow the empty forest - a forest in my opinion is best defined as any acyclic graph, i. e., as the disjoint union of zero or more trees (whence it also is characterised by the equation "order = size+#(components)").

I therefore would like to remove your zero vertex example. However, if you added it on purpose, and especially if you have references where the empty graph both is allowed and considered to be connected, then we could retain it, but with the warning that only some authors considers the empty graph as a valid connected graph.

(Another, rather minor point: The rest of that article uses the term "vertex" instead of "node". This should be easy and uncontroversial to fix, though, I think.)

Best regards, JoergenB (talk) 01:25, 9 April 2015 (UTC)

Hi. To me it was only important to add a section with a clear definition. Feel free to modify the details as you like. Watchduck (quack) 18:02, 9 April 2015 (UTC)

 Done JoergenB (talk) 14:25, 12 April 2015 (UTC)

Your Wikiversity article Permutation notation

Dear Duck,

Thanks very much for your quackage to me back in November 2016. I regret that I missed it until Wikipedia recently notified me. It appears that you, like me, have been troubled by the many unstated assumptions underlying practically every discussion of permutations and the process of permutation. I am very glad you have written what appears to be an excellent article on the topic. Have you published that piece, or a variant, in some journal or on ArXiv?

Maybe someday the many disciplines that make use of permutations could employ your framework as a guide, announce in advance what kind of notation is to be used in a paper or presentation, and thereby restore some peace of mind to those of us who become confused and uncomfortable when concepts and notation are used inconsistently from one moment to the next.

Hi @Dratman:

Thanks for your reply. I don't intend to publish my stuff in a more classical format. I am way too addicted to nested collapsible boxes, and I would rather have more interactivity than less.

What do you think about the terminology I use in the article (active/passive)? It makes sense to me, and I think it helps to understand the problem and the article. (And I guess it harmonizes with active and passive transformations, but I did not verify that yet.) But it's not a terminology I have found anywhere else - except in this article without sources. The simple reason is, that no one seems to use what I call passive permutations. Therefore I had the following statement in the article: The active interpretation of a permutation should usually be seen as correct, and the passive one as a misunderstanding. But Wcherowi has removed it, calling it an egregious POV statement. I wonder if "passive permutation" meant the same to him as it means in that article. Do you know any sources where the result of applying $\pi$ on a vector $(x_{1},\dots ,x_{n})$ actually is $(x_{\pi (1)},\dots ,x_{\pi (n)})$? I would be happy to include them. Greetings, Watchduck (quack) 21:15, 29 July 2017 (UTC)

Dear Duck,

I find this discussion quite interesting, and I would like to respond to your question about sources that use a certain type of notation, but I do not understand your subscripts. Could you please explain the subscripts and/or describe in more detail what you are referring to? Thanks Dratman (talk) 06:28, 30 July 2017 (UTC)

I don't understand what you don't understand.

The vector $x=(x_{1},\dots ,x_{n})$ and the permutation $\pi ={\begin{pmatrix}1&\dots &n\\\pi (1)&\dots &\pi (n)\end{pmatrix}}$.

Usually $x$ permuted by $\pi$ is $(x_{\pi ^{-1}(1)},\dots ,x_{\pi ^{-1}(n)})$, but with what I call passive permutations it would be $(x_{\pi (1)},\dots ,x_{\pi (n)})$.

Now I see what you mean. Thanks for explaining. Dratman (talk)

In Talk:Permutation#Major_Problem_with_Notation you wrote this as:

$\sigma .(x_{1},x_{2},\ldots ,x_{n})=(x_{\sigma ^{-1}(1)},x_{\sigma ^{-1}(2)},\ldots ,x_{\sigma ^{-1}(n)})~~~$ and $~~~(x_{1},x_{2},\ldots ,x_{n}).\sigma =(x_{\sigma (1)},x_{\sigma (2)},\ldots ,x_{\sigma (n)})\,$

I did not write those lines! That is part of someone's reply to what I wrote. Dratman (talk)

OMG! That is a very confusing way to answer. Maybe one day we will see a decent forum format for Wikimedia discussion pages. Watchduck (quack) 13:44, 30 July 2017 (UTC)

It seems that in your terminology this difference is somehow about left vs. right, rather than active vs. passive - which I don't understand.

Looking at that today, I think the whole left/right thing is something irrelevant which I should have omitted. Dratman (talk)

To me L/R is only a superficial difference, corresponding to flipping a matrix multiplication along the main diagonal. A/P is about a different matrix multiplication, no matter how it is flipped.

In other terms: A/P is about what the result of "$x$ permuted by $\pi$" is. L/R is just about whether to write it as "$\pi .x$" or "$x.\pi$".

For A/P compare box 12 and box 16 in my article. For L/R compare left and right matrix multiplication in each box. Watchduck (quack) 09:38, 30 July 2017 (UTC)

Edge enumeration

About this: the edge of the 1-variable Hasse diagram is Ax -> Ex. The edges of the 2-variable Hasse diagram are all of the following form: "Ax ... -> Ex ..." (with the same "...") or "Ex Ay -> Ay Ex". What is perhaps more interesting is that (if my poking around your data tables linked from OEIS is accurate), these already capture all edges for the 3-variable version: they are all of the form "Ax ... -> Ex ..." or "... Ex Ay ... -> ... Ay Ex ...". If this is also true for the 4- and 5-varaible versions, that would be promising. --JBL (talk) 01:32, 14 April 2018 (UTC)

I don't really understand what you are trying to say. But it sounds like the answer should already be in the data on GitHub for n up to 5: The edges are here. (The coordinates are here.) And details for n=4 are here. Given that predicate logic is so old and so important, I suppose that there is nothing new to be found here. I was surprised that OEIS: A300693 and OEIS: A300694 did not already exist, but I suppose the number of edges in these Hasse diagrams is long known, hidden is some dusty books. Numbers of edges don't seem to be prominent in the OEIS. I was also surprised that no sequence counts the edges in weak order diagrams like this. (After division by 2 that sequence would start 0, 1, 9, 79, 765, 9121. If there is no error in my manual calculation that is.) Watchduck (quack) 11:37, 14 April 2018 (UTC)

Faceting

Hi, I think your addition of Jamnitzer to the article on faceting is likely misguided and should probably be reverted. I have explained why at Talk:Faceting#Jamnitzer. Your input there would be appreciated. — Cheers, Steelpillow (Talk) 17:01, 30 September 2018 (UTC)

I have sent you a note about a page you started

Thanks for creating COM:OVERWRITE.

User:Bishal Shrestha while examining this page as a part of our page curation process had the following comments:

Reviewed per discussion here

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

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

Bishal Shrestha (talk) 02:57, 17 September 2019 (UTC)

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:10, 19 November 2019 (UTC)

Compound of five cubes image

This might be not very important, but I find the style of the animation on the compound of five cubes infobox to clash with the Stella images that are used in pretty much almost every other uniform polyhedron article. I replaced it because of that, before you undid it. I have no intention of causing a dumb edit war, so feel free to take my advice or ignore it as you see fitting. – OfficialURL (talk) 06:37, 25 March 2020 (UTC)

@OfficialURL: Hi. Having the same image style across different articles is nice, but that does not mean that a Stella image should automatically be preferred. One in a different style can still be the better image for that particular solid. (In tables where the images are shown next to each other, I would give a stronger preference to consistency.) What I dislike about most of these Stella images is the random orientation of the solid. In my polyhedron images (e.g. this set) I chose a position that makes sense in respect to the usual orientation of the coordinate axes. I think it is better to show this compound in a way where one of the cubes has the "usual" orientation. And I think it makes sense to choose a "special" color for that cube. If you feel like creating a Stella image with less random orientation and colors, I would not mind if you replace my file. But in any case, there should be a link to an animation if there is one (unless the animation is prohibitively terrible, which I think is not the case here). Watchduck (quack) 07:32, 25 March 2020 (UTC)

I've edited "your" template

Hi, Watchduck!

I see that you are making some fairly 'mathematical' templates (which yield 'mathematical effects' rather than e. g. list some kind of mathematical concepts). I find them quite interesting. They are written in a style of their own - or, I should say, a personal style of yours, with unusual effects. (Are you trying to demonstrate that the wikipedia metalanguage is Turing complete?) Thus, and since you clearly make use of them for purposes you have thought out, I do consider these templates as 'de facto yours', even if technically you have declined all rights to any pages outside your own user page and any subpage thereof.

Nevertheless, we do prefer some organisation of the very large number of pages in the project. I therefore boldly add two categories to your {{SyllogismImages}}. I also add a </noinclude> to match your <noinclude>. (Our meta language largely is a markup language, where often we expect an end-of-something to follow any beginning-of-something we insert.) The categories of course are inserted within the noinclude part, and thus only should make your templates accessible also for others. In fact, we expect all templates to be found in some (sub)ⁿcategory of Category:Wikipedia templates; so I added one of these 'container categories' (in this instance with n = 3). I also added what I thought was a suitable category for any user who might have direct use for your template in article editing. (Such a categorisation of a template is not mandatory, since many templates are employed in manners not directly related to additions to articles. I hope and believe that these changes should not be to any problem for you; otherwise I would not have made them.

If I'm wrong, or you for any other reason dislike my edit, please just revert it (which, as you probably have discovered, you most easily do by going to the page Template:SyllogismImages, there press the button marked history (or, equivalently, write an Alt-H), there push the blue "undo" close to the end of the item corresponding to my edit (the only one marked JoergenB), and then write a return)!

I plan to make a re-alphabetisation of the categorisation of some permutation template I saw, too (sorting in the first place by the Greek letter Τ rather than by the template name). Again, if you dislike it, just revert!

Yours faithfully, JoergenB (talk) 12:26, 13 September 2020 (UTC)

I just saw that you've been around for a dozen more years than I thought. Thus, I guess I unnecessarily explained things a bit too much in deatail. Excuse me! JoergenB (talk) 12:41, 13 September 2020 (UTC)

Hi Joergen, I don't do much work in Wikipedia, and I have no opinion on the categorization of templates. Thanks for fixing it. A template that is indeed in my personal style is {{4-el perm inversions}} (and its twin {{3-el perm inversions}}) used in Inversion (discrete mathematics). But I think there is nothing unusual about {{SyllogismImages}} and {{SyllogismSentences}} used in Syllogism#Examples. The point of these templates is just to keep the source of the articles tidy. I don't remember that I ever created a complicated template on Wikipedia. (There are some on Commons and Wikiversity.) I don't like the template language, so this is not likely to change. Watchduck (quack) 13:58, 13 September 2020 (UTC)

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:43, 24 November 2020 (UTC)

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:24, 23 November 2021 (UTC)

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:42, 29 November 2022 (UTC)

A barnstar for you!

	The Original Barnstar
	Excellent page at http://en.wikiversity.org/wiki/Inversion_(discrete_mathematics) pony in a strange land (talk) 00:13, 5 November 2023 (UTC)

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:28, 28 November 2023 (UTC)

"COM:OVERWRITE" listed at Redirects for discussion

The redirect COM:OVERWRITE has been listed at redirects for discussion to determine whether its use and function meets the redirect guidelines. Anyone, including you, is welcome to comment on this redirect at Wikipedia:Redirects for discussion/Log/2024 January 20 § COM:OVERWRITE until a consensus is reached. * Pppery * _{it has begun...} 21:07, 20 January 2024 (UTC)

Nomination for deletion of Template:2-ary truth table

Template:2-ary truth table has been nominated for deletion. You are invited to comment on the discussion at the entry on the Templates for discussion page. – Jonesey95 (talk) 14:17, 1 March 2024 (UTC)

Nomination for deletion of Template:2-ary truth table; implications

Template:2-ary truth table; implications has been nominated for deletion. You are invited to comment on the discussion at the entry on the Templates for discussion page. Gonnym (talk) 15:46, 11 March 2024 (UTC)

Nomination for deletion of Template:2-ary truth table; disjunction with implication

Template:2-ary truth table; disjunction with implication has been nominated for deletion. You are invited to comment on the discussion at the entry on the Templates for discussion page. Gonnym (talk) 15:46, 11 March 2024 (UTC)

Nomination for deletion of Template:2-ary truth table; disjunction with implication and negation

Template:2-ary truth table; disjunction with implication and negation has been nominated for deletion. You are invited to comment on the discussion at the entry on the Templates for discussion page. Gonnym (talk) 15:46, 11 March 2024 (UTC)

Testing Lorem ipsum on Wikipedia.

Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.

---

Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.

Curabitur pretium tincidunt lacus. Nulla gravida orci a odio. Nullam varius, turpis et commodo pharetra, est eros bibendum elit, nec luctus magna felis sollicitudin mauris. Integer in mauris eu nibh euismod gravida. Duis ac tellus et risus vulputate vehicula. Donec lobortis risus a elit. Etiam tempor. Ut ullamcorper, ligula eu tempor congue, eros est euismod turpis, id tincidunt sapien risus a quam. Maecenas fermentum consequat mi. Donec fermentum. Pellentesque malesuada nulla a mi. Duis sapien sem, aliquet nec, commodo eget, consequat quis, neque. Aliquam faucibus, elit ut dictum aliquet, felis nisl adipiscing sapien, sed malesuada diam lacus eget erat. Cras mollis scelerisque nunc. Nullam arcu. Aliquam consequat. Curabitur augue lorem, dapibus quis, laoreet et, pretium ac, nisi. Aenean magna nisl, mollis quis, molestie eu, feugiat in, orci. In hac habitasse platea dictumst.

As you can see {{Lorem ipsum|2}} gives me two paragraphs of Latin gibberish, but only on Wikipedia.-- .... Back to v:Template talk:Lorem ipsum -- Guy vandegrift (talk) 02:39, 22 April 2024 (UTC)

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:16, 19 November 2024 (UTC)