Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: Card shuffling
Replies: 7   Last Post: Jul 31, 2012 10:33 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Mok-Kong Shen

Posts: 522
Registered: 12/8/04
Card shuffling
Posted: Jul 30, 2012 2:59 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply


For playing cards there are riffle shuffling etc., see e.g.
http://mathworld.wolfram.com/RiffleShuffle.html With computers
one is not dependent on constraints resulting from manual working
and consequently could specify more complex operations that may be
rather inconvenient to be performed manually with cards. I like to
pose a general question:

Given a list of n different elements, could one find a permutation
operation on them which can be characterized by the (variable)
numerical value of one single parameter (corresponding essentially
to the cutting point of a card deck into two parts in manual
shuffling) and which is likely to lead to the highest degree of
derangement (disorder) of the original list?

Thanks in advance.

M. K. Shen



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.