For a permutation pi = pi(1)pi(2)... pi(n) is an element of S-n and a positive integer i <= n, we can view pi(1)pi(2)... pi(i) as an element of S-i by order-preserving relabeling. The j-set of pi is the set of i's such that pi(1)pi(2)... pi(i) is an involution in S-i. We prove a characterization theorem for j-sets, give a generating function for the number of different j-sets of permutations in S-n. We also compute the numbers of permutations in S-n with a given j-set and prove some properties of them.

- Publisher
- ELECTRONIC JOURNAL OF COMBINATORICS

- Issue Date
- 2007-01

- Language
- English

- Article Type
- Article

- Description
http://www.combinatorics.org/Volume_14/Abstracts/v14i1r2.html

- Citation
ELECTRONIC JOURNAL OF COMBINATORICS, v.14, no.1, pp.S13 - S22

- ISSN
- 1077-8926

- Appears in Collection
- MA-Journal Papers(저널논문)

- Files in This Item
- 000243201600004.pdf
*(154.58 kB)*Download

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.