Advanced search

Browse by subject

Browse by provider

Browse by language

Content Details
Normal View
CIP View

Permutations rj such that ∑ni=1∏kj=1rj(i...

Wu, Chai Wah...

Free

Share this content

Permutations rj such that ∑ni=1∏kj=1rj(i) is maximized or minimized by Wu, Chai Wah ( Author )

Content Provider	Lemonjar Open Access
Publisher	N.A
Publication Date	12-08-2015
Summary	We consider the problem of finding the set of permutations rj of {1,⋯,n} such that ∑ni=1∏kj=1rj(i) is maximized or minimized. While the set of permutations maximizing this value are easily determined, finding the set of permutations minimizing this value appears to be an open problem. We show values of k and n for which an explicit solution exists and comment on computational issues in determining the general problem. We also look at the dual problem of finding the permutations such that ∏ni=1∑kj=1rj(i) is maximized or minimized. As part of this study we also look at a variant of a rearrangement inequality.
ISBN	-
Item Type	Article
File Type	pdf
File Size	36.88 KB
Language	English
Subjects	-
Unlimited	MYR 0.00
Total read	-
URL	http://arxiv.org/abs/1508.02934

Citation

Review the full bibliography data and make any necessary corrections before using. Always consult your library resources for the exact formatting and punctuation guidelines.

AMA 11th EditionReferences

Wu, Chai Wah. Permutations rj such that ∑ni=1∏kj=1rj(i) is maximized or minimized. N.A. August 12, 2015. Accessed August 18, 2025. https://online.provdatabase.com/cite/18876

APA 7th EditionReferences

Wu, Chai Wah. (2015). Permutations rj such that ∑ni=1∏kj=1rj(i) is maximized or minimized. N.A. https://online.provdatabase.com/cite/18876

Chicago 17th EditionReferences

Wu, Chai Wah. Permutations rj such that ∑ni=1∏kj=1rj(i) is maximized or minimized. N.A. 2015. https://online.provdatabase.com/cite/18876

HarvardReferences

Wu, Chai Wah. (2015). Permutations rj such that ∑ni=1∏kj=1rj(i) is maximized or minimized. [Online]. N.A. Available from: https://online.provdatabase.com/cite/18876. (Accessed 18 August 2025).

Harvard AustraliaReferences

Wu, Chai Wah, 2015, Permutations rj such that ∑ni=1∏kj=1rj(i) is maximized or minimized, N.A, viewed 18 August 2025, <https://online.provdatabase.com/cite/18876>

MLA 9th EditionWorks Cited

Wu, Chai Wah. Permutations rj such that ∑ni=1∏kj=1rj(i) is maximized or minimized. N.A, 2015. PROV Database, https://online.provdatabase.com/cite/18876.

Share this eBook