Add to ORKGIn this thesis we solve an old problem, named after the magician and mathematician Alex Elmsley, of raising a card to the top of the deck using faro shuffles. Furthermore we examine the group structure generated by these shuffles on an arbitrarily large deck of cards. Upon generalizing the faro shuffle in the third chapter, we reach a promising conjecture about these faro shuffle permutation groups.
Abstract. Consider a permutation σ ∈ Sn as a deck of cards numbered from 1 to n and laid out in a ro...
We are all familiar with the riffle shuffle, one of the most popular ways to shuffle cards. To per...
Abstract. Consider a permutation σ ∈ Sn as a deck of cards num-bered from 1 to n and laid out in a r...
The crux of a card trick performed with a deck of cards usually depends on understanding how shuffle...
Abstract | In this article the shuffling of cards is studied by using the concept of a group action....
The mystery of magic and the artistry of juggling have surprising links to interesting ideas in math...
Abstract. We present simple proofs of transience/recurrence for certain card shuing models, that is,...
This paper provides a comprehensive introduction to groups of perfect shuffles. A perfect shuffle is...
AbstractThere are two ways to perfectly shuffle a deck of 2n cards. Both methods cut the deck in hal...
Abstract. For positive integers k and n the group of perfect k-shuffles with a deck of kn cards is a...
1. Introduction The most common method of mixing cards is the ordinary riffle shuffle, in which a de...
This thesis considers the effect of riffle shuffling on decks of cards, allowing for some cards to b...
In the top to random shuffle, the first a cards are removed from a deck of n cards 12 \cdot...
This thesis presents mixing of a deck of cards as a random walk on the group of permutations. Perfec...
In card games, in casino games with multiple decks of cards and in cryptography, one is sometimes fa...
Abstract. Consider a permutation σ ∈ Sn as a deck of cards numbered from 1 to n and laid out in a ro...
We are all familiar with the riffle shuffle, one of the most popular ways to shuffle cards. To per...
Abstract. Consider a permutation σ ∈ Sn as a deck of cards num-bered from 1 to n and laid out in a r...
The crux of a card trick performed with a deck of cards usually depends on understanding how shuffle...
Abstract | In this article the shuffling of cards is studied by using the concept of a group action....
The mystery of magic and the artistry of juggling have surprising links to interesting ideas in math...
Abstract. We present simple proofs of transience/recurrence for certain card shuing models, that is,...
This paper provides a comprehensive introduction to groups of perfect shuffles. A perfect shuffle is...
AbstractThere are two ways to perfectly shuffle a deck of 2n cards. Both methods cut the deck in hal...
Abstract. For positive integers k and n the group of perfect k-shuffles with a deck of kn cards is a...
1. Introduction The most common method of mixing cards is the ordinary riffle shuffle, in which a de...
This thesis considers the effect of riffle shuffling on decks of cards, allowing for some cards to b...
In the top to random shuffle, the first a cards are removed from a deck of n cards 12 \cdot...
This thesis presents mixing of a deck of cards as a random walk on the group of permutations. Perfec...
In card games, in casino games with multiple decks of cards and in cryptography, one is sometimes fa...
Abstract. Consider a permutation σ ∈ Sn as a deck of cards numbered from 1 to n and laid out in a ro...
We are all familiar with the riffle shuffle, one of the most popular ways to shuffle cards. To per...
Abstract. Consider a permutation σ ∈ Sn as a deck of cards num-bered from 1 to n and laid out in a r...