[[abstract]]Properties of some shuffle/exchange type permutation sets are studied from operational points of view. The permutation sets studied are Ω, Ω-1, Ψ, L, and U; Ω and Ω-1 are, respectively, the omega and inverse omega permutation sets, Ψ equivalent (Ω to the intersection of Ω-1); and L and U are, respectively, the admissible lower and upper triangular permutation sets. Several intuitive operations are introduced. Based on these operations, important known results relating to these sets are readdressed. The recursive nature of the sets is also discussed.[[fileno]]2030249010010[[department]]資訊工程學
AbstractA permutation with a signature Q=(q1,q2,…,qn−1) where qi is either 1 or −1, is a permutation...
Abstract. Rearrangeable networks can realize each and every permutation in one pass through the netw...
International audienceA permutation is said to be a square if it can be obtained by shuffling two or...
AbstractWe define a class of permutations called generalized shuffles and study their basic properti...
The set of input-output permutations that are routable through a multistage interconnection network ...
AbstractThere are two ways to perfectly shuffle a deck of 2n cards. Both methods cut the deck in hal...
This paper provides a comprehensive introduction to groups of perfect shuffles. A perfect shuffle is...
AbstractThis paper deals with the determination of subsets of permutations, which satisfy certain co...
Shuffle operads were introduced to make explicit the actions of symmetric groups on symmetric operad...
AbstractLet Sn denote the symmetric group of all permutations of {1,2,…,n} and let S=∪n≥0Sn. If Π⊆S ...
The crux of a card trick performed with a deck of cards usually depends on understanding how shuffle...
[[abstract]]In this paper, we present a new model, finite permutation machine (FPM), to describe the...
There are many analogies between subsets and permutations of a set, and in particular between sets o...
A large family of relations among multiple zeta values may be described using the combinatorics of s...
New automatic methods for enumerating permutation classes are introduced. The first is Struct, which...
AbstractA permutation with a signature Q=(q1,q2,…,qn−1) where qi is either 1 or −1, is a permutation...
Abstract. Rearrangeable networks can realize each and every permutation in one pass through the netw...
International audienceA permutation is said to be a square if it can be obtained by shuffling two or...
AbstractWe define a class of permutations called generalized shuffles and study their basic properti...
The set of input-output permutations that are routable through a multistage interconnection network ...
AbstractThere are two ways to perfectly shuffle a deck of 2n cards. Both methods cut the deck in hal...
This paper provides a comprehensive introduction to groups of perfect shuffles. A perfect shuffle is...
AbstractThis paper deals with the determination of subsets of permutations, which satisfy certain co...
Shuffle operads were introduced to make explicit the actions of symmetric groups on symmetric operad...
AbstractLet Sn denote the symmetric group of all permutations of {1,2,…,n} and let S=∪n≥0Sn. If Π⊆S ...
The crux of a card trick performed with a deck of cards usually depends on understanding how shuffle...
[[abstract]]In this paper, we present a new model, finite permutation machine (FPM), to describe the...
There are many analogies between subsets and permutations of a set, and in particular between sets o...
A large family of relations among multiple zeta values may be described using the combinatorics of s...
New automatic methods for enumerating permutation classes are introduced. The first is Struct, which...
AbstractA permutation with a signature Q=(q1,q2,…,qn−1) where qi is either 1 or −1, is a permutation...
Abstract. Rearrangeable networks can realize each and every permutation in one pass through the netw...
International audienceA permutation is said to be a square if it can be obtained by shuffling two or...