User talk:Watchduck

From Wikipedia, the free encyclopedia
  (Redirected from User talk:Lipedia)
Jump to: navigation, search


Empty graphs.[edit]

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 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)

ArbCom elections are now open![edit]

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:38, 24 November 2015 (UTC)

ArbCom Elections 2016: Voting now open![edit]

Scale of justice 2.svg Hello, Watchduck. 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)

Your Wikiversity article Permutation notation[edit]

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 on a vector actually is ? 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 and the permutation .
Usually permuted by is , but with what I call passive permutations it would be .
Now I see what you mean. Thanks for explaining. Dratman (talk)
In Talk:Permutation#Major_Problem_with_Notation you wrote this as:
and
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 " permuted by " is. L/R is just about whether to write it as "" or "".
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)

ArbCom 2017 election voter message[edit]

Scale of justice 2.svg Hello, Watchduck. 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)