Related papers: A Note on the Structure of Roller Coaster Permutat…
The subject of this paper is the cycle structure of the random permutation $\sigma$ of $[N]$, which is the product of $k$ independent random cycles of maximal length $N$. We use the character-based Fourier transform to study the number of…
This paper investigates the effect of permutations on blocks of a prime reciprocal sequence on its randomness. A relationship between the number of permutations used and the improvement of performance is presented. This can be used as a…
Permutations that avoid given patterns are among the most classical objects in combinatorics and have strong connections to many fields of mathematics, computer science and biology. In this paper we study the scaling limits of a random…
A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n+1…
We introduce and study the writhe of a permutation, a circular variant of the well-known inversion number. This simple permutation statistics has several interpretations, which lead to some interesting properties. For a permutation sampled…
The ``crumpling" transition, between rigid and crumpled surfaces, has been object of much discussion over the past years. The common lore is that such transition should be of second order. However, some lattice versions of the rigidity term…
Algorithms to generate various combinatorial structures find tremendous importance in computer science. In this paper, we begin by reviewing an algorithm proposed by Rohl that generates all unique permutations of a list of elements which…
We use the theory of symmetric functions to enumerate various classes of alternating permutations w of {1,2,...,n}. These classes include the following: (1) both w and w^{-1} are alternating, (2) w has certain special shapes, such as…
Mapping an atomistic configuration to an $N$-point correlation of a field associated with the atomic positions (e.g. an atomic density) has emerged as an elegant and effective solution to represent structures as the input of…
Signed shifts are generalizations of the shift map in which, interpreted as a map from the unit interval to itself sending x to the fractional part of Nx, some slopes are allowed to be negative. Permutations realized by the relative order…
Sequence rotation consists of a circular shift of the sequence's elements by a given number of positions. We present the four classic algorithms to rotate a sequence; the loop invariants underlying their correctness; detailed correctness…
In this paper, we count a dual set of Stirling permutations by the number of alternating runs. Properties of the generating functions, including recurrence relations, grammatical interpretations and convolution formulas are studied.
Using the recently developed notion of permutation limits this paper derives the limiting distribution of the number of fixed points and cycle structure for any convergent sequence of random permutations, under mild regularity conditions.…
The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…
We investigate pattern avoidance in alternating permutations and generalizations thereof. First, we study pattern avoidance in an alternating analogue of Young diagrams. In particular, we extend Babson-West's notion of shape-Wilf…
This article is about the mathematics of ringing the changes. We describe the mathematics which arises from a real-world activity, that of ringing the changes on bells. We present Rankin's solution of one of the famous old problems in the…
This is an investigation of the role of shuffling and concatenating in the theory of graph drawing. A simple syntactic description of these and related operations is proved complete in the context of finite partial orders, as general as…
Consider a permutation $\sigma\in S_n$ as a deck of cards numbered from 1 to $n$ and laid out in a row, where $\sigma_j$ denotes the number of the card that is in the $j$-th position from the left.\rm\ We define two cyclic to random…
Percolation has long served as a model for diverse phenomena and systems. The percolation transition, that is, the formation of a giant cluster on a macroscopic scale, is known as one of the most robust continuous transitions. Recently,…
A permutation array(or code) of length $n$ and distance $d$, denoted by $(n,d)$ PA, is a set of permutations $C$ from some fixed set of $n$ elements such that the Hamming distance between distinct members $\mathbf{x},\mathbf{y}\in C$ is at…