Moving Card i to Position j with Perfect Shuffles

DOI10.2307/2691282MaRDI QIDQ4340247zbMATH OpenOpenAlexFDO

Authors Sarnath Ramnath, Daniel J. Scully

Publication date 16 March 1998

Full work available at URL https://doi.org/10.2307/2691282

zbMATH Keywords

card decksperfect shuffle

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Review text

A perfect shuffle on a deck of \(2n\) cards is performed by cutting the deck into two stacks of \(n\) cards each and interlacing them perfectly. An algorithm is described for moving a card in the deck from position \(i\) to position \(j\) by using perfect shuffles.

Recommendations

• Moving cards arbitrarily with perfect k-shuffles
• Mélanges parfaits de cartes (I)
• Perfect shuffles of cards. II: Monge shuffles
• Shuffling cards by spatial motion
• Card shuffling and a transformation on \(S_ n\)
• Shuffling with ordered cards
• On Shuffling Cards
• Commutative permutations which occur during card shuffling
• Card-cyclic-to-random shuffling with relabeling
• A generalization of the perfect shuffle

Cited in

(7)

• A look at generalized perfect shuffles
• Moving cards arbitrarily with perfect k-shuffles
• Perfect Shuffles through Dynamical Systems
• The mathematics of the flip and horseshoe shuffles
• Juggling and card shuffling meet mathematical fonts
• The Word and Conjugacy Problem for Shuffle Groups
• Unshuffling a deck of cards

This page was built for publication: Moving Card i to Position j with Perfect Shuffles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340247)