𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Statistics on pairs of permutations

✍ Scribed by Jean-Marc Fedou; Don Rawlings

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
794 KB
Volume
143
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

were the first to consider statistics on pairs of permutations. Their primary achievement was to count permutation pairs (unrestricted) by common rises. We extend their work by giving recurrence relationships for permutation pairs (unrestricted and restricted) by common rises, inversion number of each, and a new statistic we call the common rise index. The generating functions that arise are expressed in terms of relatives of Jackson's basic Bessel functions. We also indicate how our results for permutation pairs extend to k-tuples of permutations.

πŸ“œ SIMILAR VOLUMES

Partition statistics on permutations
Partition statistics on permutations
✍ Paul H. Edelman; Rodica Simion; Dennis White πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 336 KB

Edelman, P.H., R. Simion and D. White, Partition statistics on permutations, Discrete Mathematics 99 (1992) 63-68. We describe some properties of a new statistic on permutations. This statistic is closely related to a well-known statistic on set partitions. In [7] four statistics on set partitions

Permutation Statistics of Indexed Permut
Permutation Statistics of Indexed Permutations
✍ Einar Steingrı́msson πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 648 KB

The definitions of descent, excedance, major index, inversion index and Denert's statistic for the elements of the symmetric group \(\mathscr{S}_{d}\) are generalized to indexed permutation, i.e. the elements of the group \(S_{d}^{n}:=\mathbf{Z}_{n} \backslash \mathscr{S}_{d}\), where \(\backslash\)

New Euler–Mahonian Statistics on Permuta
New Euler–Mahonian Statistics on Permutations and Words
✍ Robert J Clarke; Einar Steingrı́msson; Jiang Zeng πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 338 KB

We define new Mahonian statistics, called MAD, MAK, and ENV, on words. Of these, ENV is shown to equal the classical INV, that is, the number of inversions, while for permutations MAK has been already defined by Foata and Zeilberger. It Ε½ . Ε½ . is shown that the triple statistics des, MAK, MAD and e

Enumerating pairs of permutations with t
Enumerating pairs of permutations with the same up-down form
✍ C.L Mallows; L.A Shepp πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 482 KB

For each sequence q = {qi} = Β±1, i = 1 ..... n -1 let Nq = the number of permutations tr of 1, 2 ..... n with up-down sequence sgn(tri+x-tri) = th, i = 1 ..... n -1. Clearly Y.q (Nqln!) = 1 but what is the probability p, = Y.q (NJn!) 2 that two random permutations have the same up-down sequence? We