Generating a random cyclic permutation

Generating Transitive Permutation Groups

Integrated Strategy for Generating Permutation

An integrated strategy for generating permutation is presented in this paper. This strategy involves exchanging two consecutive elements to generate the starter sets and then applying circular and reversing operations to list all permutations. Some theoretical works are also presented. Mathematics Subject Classification: 05A05

Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points

Consider the holiday season, where there are n players who would like to exchange gifts. That is, we would like to generate a random permutation having no fixed point. It is known that such a random permutation can be obtained in a hidden form by using a number of physical cards of four colors with identical backs, guaranteeing that it has no fixed point (without revealing the permutation itsel...

Permutation Polytopes of Cyclic Groups

We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. In the situation that the generator of the group consists of at most two orbits, we can give a complete combinatorial description of the associated permutation polytope. In the case of three orbits the facet structure is...

Distinguishing a truncated random permutation from a random function

An oracle chooses a function f from the set of n bits strings to itself, which is either a randomly chosen permutation or a randomly chosen function. When queried by an n-bit string w, the oracle computes f(w), truncates the m last bits, and returns only the first n −m bits of f(w). How many queries does a querying adversary need to submit in order to distinguish the truncated permutation from ...