TL;DR: The number of permutations with given cycle structure and descent set is shown to be equal to the scalar product of two special characters of the symmetric group.
TL;DR: In this paper, the action of permutation groups on sets associated with combinatorial structures is discussed, and a theory of maps on orientable surfaces is developed within a combinatorical framework.
Abstract: The subject of this book is the action of permutation groups on sets associated with combinatorial structures. Each chapter deals with a particular structure: groups, geometries, designs, graphs and maps respectively. A unifying theme for the first four chapters is the construction of finite simple groups. In the fifth chapter, a theory of maps on orientable surfaces is developed within a combinatorial framework. This simplifies and extends the existing literature in the field. The book is designed both as a course text and as a reference book for advanced undergraduate and graduate students. A feature is the set of carefully constructed projects, intended to give the reader a deeper understanding of the subject.
TL;DR: In this paper, Luby and Rackoff showed that two Feistel permutations are sufficient together with initial and final pair-wise independent permutations for constructing a pseudo-random permutation.
Abstract: Luby and Rackoff showed a method for constructing a pseudo-random permutation from a pseudo-random function. The method is based on composing four (or three for weakened security) so called Feistel permutations each of which requires the evaluation of a pseudo-random function. We reduce somewhat the complexity of the construction and simplify its proof of security by showing that two Feistel permutations are sufficient together with initial and final pair-wise independent permutations. The revised construction and proof provide a framework in which similar constructions may be brought up and their security can be easily proved. We demonstrate this by presenting some additional adjustments of the construction that achieve the following: Reduce the success probability of the adversary. Provide a construction of pseudo-random permutations with large input size using pseudo-random functions with small input size. Provide a construction of a pseudo-random permutation using a single pseudo-random function.
TL;DR: In this paper, the relation between the model of spatial permutations and the ideal and interacting quantum Bose gas has been discussed, where permutations are weighed according to the point locations.
Abstract: We consider systems of spatial random permutations, where permutations are weighed according to the point locations. Infinite cycles are present at high densities. The critical density is given by an exact expression. We discuss the relation between the model of spatial permutations and the ideal and interacting quantum Bose gas.