A combinatorial approach to the power of 2 in the number of involutions
We provide a combinatorial approach to the largest power of p in the number of permutations pi with pi(p) = 1, for a fixed prime number p. With this approach, we find the largest power of 2 in the number of involutions, in the signed sum of involutions and in the numbers of even or odd involutions. (C) 2009 Elsevier Inc. All rights reserved.
- Publisher
- ACADEMIC PRESS INC ELSEVIER SCIENCE
- Issue Date
- 2010-11
- Language
- English
- Article Type
- Article
- Keywords
CATALAN; DIVIDES
- Citation
JOURNAL OF COMBINATORIAL THEORY SERIES A, v.117, no.8, pp.1082 - 1094
- ISSN
- 0097-3165
- Appears in Collection
- MA-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 6 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.