User talk:Molinari

Hi Molinari, welcome to Wikipedia! I hope you like the place and decide to stay. If you need any questions answered about the project then check out Wikipedia:Help or add a question to the Village pump. Looking forward to reading your contributions! --KF 12:02 25 Jun 2003 (UTC)

Discussion of proof of Erdős-Ko-Rado theorem

Hi Molinari, In case you're not "watching", I've added to the proof of the Erdös-Ko-Rado theorem, completing the second part. See the talk page for more info. Perhaps you could check what I've done? --Dbenbenn 00:44, 3 Dec 2004 (UTC)

Hi Dbenbenn.

Interesting approach. I am not yet convinced that your method is sound, but perhaps I am just missing something.

Given $a$ and $b$ you take arbitrary $c\in A$ and define $c_a$ and $c_b$ as the intersections of $c$ with $a$ and $b$ respectively. The claim is then made that $c_a$ and $c_b$ are disjoint. I don't see why. Indeed, if the proof is to work out we would expect both of them to contain $x$.

In the next step you start constructing a partial order containing $c$, $c_a$, and $c_b$ as intervals. This can clearly be done. However I don't see how we can (necessarily) extend this order so as to contain $a$ and $b$. I think we could if $c_a$ and $c_b$ were disjoint: we just put them at the "ends" of $c$ in the order and tack $a$ and $b$ on these ends, as appropriate. We would need to count carefully to make sure there was room, but that shouldn't be hard. However, without disjointness I think we are in trouble.

Indeed, without disjointness we would have to arrange $c$ like

$\dots (\dots c\dots )c_a{c}_b(\dots c\dots )\dots$

where $(\dots c\dots )$ represents the bits of $c$ not in $c_a$ or $c_b$. Now we cannot add $a$ and $b$ onto the ends.

I will give this some more thought after work this evening. It is entirely possible that your method works with a small adjustment.

Cheers! Molinari 01:06, 4 Dec 2004 (UTC)

Thanks for finding the flaw in what I added! It was blatent nonsense; I've taken it out. See Talk:Erdös-Ko-Rado theorem. --Dbenbenn 03:39, 4 Dec 2004 (UTC)

I (finally!) responded to your question on Talk:Erdös-Ko-Rado theorem. Dbenbenn 07:02, 3 Jan 2005 (UTC)

I just sent you the papers by email. Drop me a line if they didn't come through right. dbenbenn | talk 16:57, 21 Mar 2005 (UTC)

Wikipedia:U.S. Wikipedians' notice board/USCOTW

Hey there, I noticed that you had expressed interest in the article on the Potomac River on its talk page. Another contributor nominated the river for the US Collaboration of the Week and I would appreciate it if you would give the nomination your support. I feel with minimal effort, the article will reach featured status with the assistance of a team of editors. --Caponer 18:13, 2 March 2006 (UTC)

Third husband

I'm afraid you're wrong in your "correction" of the grammar on Bothwell's page. It was quite correct to place, after a comma, her third husband. At least it is correct in Britain and in countless genealogical books.David Lauder 09:15, 21 February 2007 (UTC)

Really? It sounds wrong to my Australian English. You can change it back if you like. Molinari 20:06, 21 February 2007 (UTC)

HELP

If there is a liberal party user please come to Nicola Roxon. We need an unbiased opinion as the labour members are constantly reverting her Jewish religion. They are stacking the discussion. —Preceding unsigned comment added by GaryGazza (talk • contribs) 11:42, 12 February 2008 (UTC)

You claim to want "unbiased" opinion, and then ask for a member of the "liberal party [sic]". What you should have asked for is a disinterested user. My guess is that you don't actually want an unbiased opinion, but rather the support of someone else with the same biases as you. Molinari (talk) 05:58, 17 February 2008 (UTC)

Thank you

Thanks for picking up the typos at 0.999.... I am embarrassed if it seems like I am displaying WP:OWN. I wanted to avoid pointing readers to a article that discusses the problem with a different set of terminology. You should always feel free to edit anything I have written. Perhaps I was a bit rash when Katzmik reverted my edits and I will try to stay a bit cooler. Thenub314 (talk) 23:20, 27 December 2008 (UTC)

Hi Thenub314. It is I who should be apologizing to you. Although I was right to mention the typos the tone of my note was far too hostile and unfriendly. Thanks for fixing the typos. (I'll add a note similar to this one on the 0.999... talk page.) Molinari (talk) 19:43, 29 December 2008 (UTC)

Genetic Programming

Hi Rory,

Found your comments on Talk:Genetic programming; yes, indeed, the added material seems to be plagiarized. It was added by one anonymous user, during two editing sessions in March/May 2011, presumably while taking a course on this topic. The article quadrupled in size, and most of this material is just not encyclopedic. No objections if you sharply trimmed it! linas (talk) 20:29, 14 December 2011 (UTC)

Did it myself, just now. Didn't realize at first that it was a 100% verbatim copy, and, on examination, clearly violated the copyright terms (attribution, no derivative works). linas (talk) 22:28, 14 December 2011 (UTC)

ArbCom elections are now open!

{{Wikipedia:Arbitration Committee Elections December 2015/MassMessage}} MediaWiki message delivery (talk) 08:52, 23 November 2015 (UTC)

ArbCom 2022 Elections voter message

File:Scale of justice 2.svg

Hello! Voting in the 2022 Arbitration Committee elections is now open until 23:59 (UTC) on . 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 [[Special:SecurePoll/vote/Template:Arbitration Committee candidate/data|voting page]]. If you no longer wish to receive these messages, you may add Template:Tlx to your user talk page. MediaWiki message delivery (talk) 00:24, 29 November 2022 (UTC)

ArbCom 2023 Elections voter message

File:Scale of justice 2.svg

Hello! Voting in the 2023 Arbitration Committee elections is now open until 23:59 (UTC) on . 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 [[Special:SecurePoll/vote/Template:Arbitration Committee candidate/data|voting page]]. If you no longer wish to receive these messages, you may add Template:Tlx to your user talk page. MediaWiki message delivery (talk) 00:20, 28 November 2023 (UTC)