Talk:Rearrangement inequality

Revision as of 23:05, 13 December 2007 by Temperal (talk | contribs) (aotd!)
AoPSWiki Article of the Day
Rearrangement inequality was the AoPSWiki Article of the Day for December 13th, 2007

The uses section should be partitioned into information for the greedy algorith, intermediate, and olympiad sections. A few examples will add worlds of clarity for readers.--MCrawford 01:24, 20 June 2006 (EDT)

I think that "similarly sorted" has not been defined very well here. For example, the sequences {1,1,1,1,1,1}; {1,2,3,4,5,6} are similarly sorted, but the fifth 1 in the first sequence is greater than or equal to five other terms, whereas the 5 in the second sequence is only greater than or equal to four other terms. At the moment, I can't think of a good definition for "similarly sorted" that doesn't take up a great deal of space. Perhaps we should create a page for similarly vs. opposite sorting, and link to that? After all, it's kind of easy to tell what it means, and an external link would not, I think, be a severe inconvenience. Or could someone else write a more precise (but still concise) definition?

Invalid username
Login to AoPS